%%% -*-BibTeX-*- %%% ==================================================================== %%% BibTeX-file{ %%% author = "Nelson H. F. Beebe", %%% version = "1.464", %%% date = "18 February 2026", %%% time = "06:41:07 MDT", %%% filename = "virtual-machines.bib", %%% address = "University of Utah %%% Department of Mathematics, 110 LCB %%% 155 S 1400 E RM 233 %%% Salt Lake City, UT 84112-0090 %%% USA", %%% telephone = "+1 801 581 5254", %%% URL = "https://www.math.utah.edu/~beebe", %%% checksum = "29081 82381 384293 3974529", %%% email = "beebe at math.utah.edu, beebe at acm.org, %%% beebe at computer.org (Internet)", %%% codetable = "ISO/ASCII", %%% keywords = "bibliography; BibTeX; QEMU; virtual machines; %%% VMware; Xen", %%% license = "public domain", %%% supported = "yes", %%% docstring = "This is a bibliography of books and other %%% publications about virtual machines. However, %%% it specifically excludes publications about %%% the Parallel Virtual Machine (PVM), which %%% is covered in a separate bibliography, pvm.bib. %%% %%% The ECMA and ISO Standard virtual machine, %%% Common Language Infrastructure (CLI), is %%% available on Microsoft .NET Framework on %%% Microsoft Windows, GNU DotGNU's ilrun, and %%% the Mono Project's mono. These environments %%% may offer compilers for C#, Visual Basic, C, %%% C++, and possibly other languages. %%% %%% At version 1.464, the year coverage looked %%% like this: %%% %%% 1965 ( 2) 1986 ( 14) 2007 ( 55) %%% 1966 ( 2) 1987 ( 12) 2008 ( 72) %%% 1967 ( 1) 1988 ( 11) 2009 ( 54) %%% 1968 ( 4) 1989 ( 17) 2010 ( 60) %%% 1969 ( 4) 1990 ( 21) 2011 ( 55) %%% 1970 ( 3) 1991 ( 33) 2012 ( 98) %%% 1971 ( 5) 1992 ( 23) 2013 ( 118) %%% 1972 ( 9) 1993 ( 28) 2014 ( 114) %%% 1973 ( 26) 1994 ( 23) 2015 ( 122) %%% 1974 ( 6) 1995 ( 5) 2016 ( 140) %%% 1975 ( 16) 1996 ( 14) 2017 ( 169) %%% 1976 ( 11) 1997 ( 28) 2018 ( 157) %%% 1977 ( 7) 1998 ( 24) 2019 ( 127) %%% 1978 ( 9) 1999 ( 28) 2020 ( 89) %%% 1979 ( 12) 2000 ( 31) 2021 ( 65) %%% 1980 ( 8) 2001 ( 53) 2022 ( 65) %%% 1981 ( 4) 2002 ( 36) 2023 ( 68) %%% 1982 ( 6) 2003 ( 35) 2024 ( 79) %%% 1983 ( 12) 2004 ( 24) 2025 ( 47) %%% 1984 ( 10) 2005 ( 66) 2026 ( 9) %%% 1985 ( 10) 2006 ( 122) %%% 19xx ( 4) %%% %%% Article: 2057 %%% Book: 164 %%% InCollection: 6 %%% InProceedings: 148 %%% Manual: 19 %%% MastersThesis: 17 %%% Misc: 10 %%% PhdThesis: 11 %%% Proceedings: 85 %%% TechReport: 65 %%% %%% Total entries: 2582 %%% %%% The checksum field above contains a CRC-16 %%% checksum as the first value, followed by the %%% equivalent of the standard UNIX wc (word %%% count) utility output of lines, words, and %%% characters. This is produced by Robert %%% Solovay's checksum utility.", %%% } %%% ==================================================================== @Preamble{ "\ifx \undefined \booktitle \def \booktitle #1{{{\em #1}}} \fi" # "\ifx \undefined \circled \def \circled #1{(#1)} \fi" # "\ifx \undefined \ConTeXt \def \ConTeXt {Con{\TeX}t} \fi" # "\ifx \undefined \pkg \def \pkg #1{{{\tt #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" } %%% ==================================================================== %%% Acknowledgement abbreviations: @String{ack-nhfb = "Nelson H. F. Beebe, University of Utah, Department of Mathematics, 110 LCB, 155 S 1400 E RM 233, Salt Lake City, UT 84112-0090, USA, Tel: +1 801 581 5254, e-mail: \path|beebe@math.utah.edu|, \path|beebe@acm.org|, \path|beebe@computer.org| (Internet), URL: \path|https://www.math.utah.edu/~beebe/|"} %%% ==================================================================== %%% Institution abbreviations: @String{inst-SRC-IDA = "Supercomputing Research Center: IDA"} @String{inst-SRC-IDA:adr = "Lanham, MD, USA"} @String{inst-STAN-CS = "Stanford University, Department of Computer Science"} @String{inst-STAN-CS:adr = "Stanford, CA, USA"} %%% ==================================================================== %%% Journal abbreviations: @String{j-ADA-USER = "Ada User"} @String{j-ADA-USER-J = "Ada User Journal"} @String{j-ALGORITHMS-BASEL = "Algorithms ({Basel})"} @String{j-AUSTRALIAN-COMP-J = "Australian Computer Journal"} @String{j-BELL-LABS-TECH-J = "Bell Labs Technical Journal"} @String{j-BYTE = "Byte Magazine"} @String{j-CACM = "Communications of the ACM"} @String{j-CCCUJ = "C/C++ Users Journal"} @String{j-CCPE = "Concurrency and Computation: Prac\-tice and Experience"} @String{j-CGF = "Com{\-}pu{\-}ter Graphics Forum"} @String{j-COMP-ARCH-NEWS = "ACM SIGARCH Computer Architecture News"} @String{j-COMP-CONTROL-ENG-J = "Computing and Control Engineering Journal"} @String{j-COMP-J = "The Computer Journal"} @String{j-COMP-NET = "Computer Networks: The International Journal of Distributed Informatique"} @String{j-COMP-NET-AMSTERDAM = "Computer Networks (Amsterdam, Netherlands: 1999)"} @String{j-COMP-PHYS-COMM = "Computer Physics Communications"} @String{j-COMP-SURV = "ACM Computing Surveys"} @String{j-COMP-SYS = "Computing Systems"} @String{j-COMPUT-MATH-APPL = "Computers and Mathematics with Applications"} @String{j-COMPUT-PHYS = "Computers in Physics"} @String{j-COMPUT-SCI-ENG = "Computing in Science and Engineering"} @String{j-COMPUT-SECUR = "Computers \& Security"} @String{j-COMPUT-SOFTW-BIG-SCI = "Computing and Software for Big Science"} @String{j-COMPUTER = "Computer"} @String{j-COMPUTERWORLD = "ComputerWorld"} @String{j-COMPUTING = "Computing: Archiv f{\"u}r Informatik und Numerik"} @String{j-CPE = "Concurrency: Prac\-tice and Experience"} @String{j-DDJ = "Dr. Dobb's Journal of Software Tools"} @String{j-DEC-TECH-J = "Digital Technical Journal of Digital Equipment Corporation"} @String{j-DISTRIB-COMPUT = "Distributed Computing"} @String{j-EMBED-SYS-PROG = "Embedded Systems Programming"} @String{j-EMPIR-SOFTWARE-ENG = "Empirical Software Engineering"} @String{j-FUT-GEN-COMP-SYS = "Future Generation Computer Systems"} @String{j-FUTURE-INTERNET = "Future Internet"} @String{j-HEWLETT-PACKARD-J = "Hew\-lett-Pack\-ard Journal: technical information from the laboratories of Hew\-lett-Pack\-ard Company"} @String{j-HIGHER-ORDER-SYMB-COMPUT = "Higher-Order and Symbolic Computation"} @String{j-HONEYWELL-COMP-J = "Honeywell Computer Journal"} @String{j-IBM-JRD = "IBM Journal of Research and Development"} @String{j-IBM-SYS-J = "IBM Systems Journal"} @String{j-IEEE-ACCESS = "IEEE Access"} @String{j-IEEE-ANN-HIST-COMPUT = "IEEE Annals of the History of Computing"} @String{j-IEEE-CGA = "IEEE Computer Graphics and Applications"} @String{j-IEEE-COMPUT-ARCHIT-LETT = "IEEE Computer Architecture Letters"} @String{j-IEEE-CONCURR = "IEEE Concurrency"} @String{j-IEEE-DISTRIB-SYST-ONLINE = "IEEE Distributed Systems Online"} @String{j-IEEE-INT-SYMP-HIGH-PERF-DIST-COMP-PROC = "IEEE International Symposium on High Performance Distributed Computing, Proceedings"} @String{j-IEEE-MICRO = "IEEE Micro"} @String{j-IEEE-MULTIMEDIA = "IEEE MultiMedia"} @String{j-IEEE-PAR-DIST-TECH = "IEEE parallel and distributed technology: systems and applications"} @String{j-IEEE-SEC-PRIV = "IEEE Security \& Privacy"} @String{j-IEEE-SOFTWARE = "IEEE Software"} @String{j-IEEE-SPECTRUM = "IEEE Spectrum"} @String{j-IEEE-TRANS-BIG-DATA = "IEEE Transactions on Big Data"} @String{j-IEEE-TRANS-COMPUT = "IEEE Transactions on Computers"} @String{j-IEEE-TRANS-EMERG-TOP-COMPUT = "IEEE Transactions on Emerging Topics in Computing"} @String{j-IEEE-TRANS-NETWORKING = "IEEE\slash ACM Transactions on Networking"} @String{j-IEEE-TRANS-PAR-DIST-SYS = "IEEE Transactions on Parallel and Distributed Systems"} @String{j-IEEE-TRANS-SOFTW-ENG = "IEEE Transactions on Software Engineering"} @String{j-IEEE-TRANS-VLSI-SYST = "IEEE Transactions on Very Large Scale Integration (VLSI) Systems"} @String{j-IJHPCA = "The International Journal of High Performance Computing Applications"} @String{j-INFO-PROC-LETT = "Information Processing Letters"} @String{j-INFO-SEC-TECH-REP = "Information Security Technical Report"} @String{j-INT-J-COMP-APPL = "International Journal of Computer Applications"} @String{j-INT-J-COMPUT-APPL = "International Journal of Computers and Applications"} @String{j-INT-J-COMPUT-INF-SCI = "International Journal of Computer and Information Sciences"} @String{j-INT-J-COMPUT-SYST-SCI-ENG = "International Journal of Computer Systems Science and Engineering"} @String{j-INT-J-INFO-SEC = "International Journal of Information Security"} @String{j-INT-J-PAR-EMER-DIST-SYS = "International Journal of Parallel, Emergent and Distributed Systems: IJPEDS"} @String{j-INT-J-PARALLEL-PROG = "International Journal of Parallel Programming"} @String{j-INT-J-SOFTW-TOOLS-TECHNOL-TRANSFER = "International Journal on Software Tools for Technology Transfer: STTT"} @String{j-INTEL-TECH-J = "Intel Technology Journal"} @String{j-IT-PRO = "{IT} Professional"} @String{j-J-COMP-SECUR = "Journal of Computer Security"} @String{j-J-COMP-SYS-SCI = "Journal of Computer and System Sciences"} @String{j-J-COMPUT-LANG = "Journal of Computer Languages"} @String{j-J-COMPUT-SCI = "Journal of Computational Science"} @String{j-J-CRYPTO-ENG = "Journal of Cryptographic Engineering"} @String{j-J-CRYPTOLOGY = "Journal of Cryptology: the journal of the International Association for Cryptologic Research"} @String{j-J-DIGITAL-INFO = "Journal of Digital Information"} @String{j-J-FORTH-APPL-RES = "Journal of FORTH Application and Research"} @String{j-J-FORTH-APPLIC-RESEARCH = "Journal of Forth Applications and Research"} @String{j-J-FUNCT-PROGRAM = "Journal of Functional Programming"} @String{j-J-GRID-COMP = "Journal of Grid Computing"} @String{j-J-INFO-SEC-APPL = "Journal of Information Security and Applications (JISA)"} @String{j-J-LOGIC-ALG-PROG = "Journal of Logic and Algebraic Programming"} @String{j-J-NETW-COMPUT-APPL = "Journal of Network and Computer Applications"} @String{j-J-PAR-DIST-COMP = "Journal of Parallel and Distributed Computing"} @String{j-J-PHYS-IV-COLLOQUE = "Journal de physique. IV, Colloque"} @String{j-J-SOFTW-EVOL-PROC = "Journal of Software: Evolution and Process"} @String{j-J-SUPERCOMPUTING = "The Journal of Supercomputing"} @String{j-J-SYST-SOFTW = "The Journal of Systems and Software"} @String{j-JAVA-REPORT = "{Java} Report: The Source for {Java} Development"} @String{j-JAVAWORLD = "JavaWorld: IDG's magazine for the Java community"} @String{j-JERIC = "ACM Journal on Educational Resources in Computing (JERIC)"} @String{j-JETC = "ACM Journal on Emerging Technologies in Computing Systems (JETC)"} @String{j-JOCCH = "Journal on Computing and Cultural Heritage (JOCCH)"} @String{j-LECT-NOTES-COMP-SCI = "Lecture Notes in Computer Science"} @String{j-LINUX-J = "Linux Journal"} @String{j-LISP-SYMB-COMPUT = "Lisp and Symbolic Computation"} @String{j-LOGIN = ";login: the USENIX Association newsletter"} @String{j-MULTIMEDIA-TOOLS-APPLIC = "Multimedia Tools and Applications"} @String{j-NETWORK-SECURITY = "Network Security"} @String{j-OPER-SYS-REV = "Operating Systems Review"} @String{j-PACMHCI = "Proceedings of the ACM on Human-Computer Interaction (PACMHCI)"} @String{j-PACMPL = "Proceedings of the ACM on Programming Languages (PACMPL)"} @String{j-PARALLEL-COMPUTING = "Parallel Computing"} @String{j-PARALLEL-PROCESS-LETT = "Parallel Processing Letters"} @String{j-POMACS = "Proceedings of the ACM on Measurement and Analysis of Computing Systems (POMACS)"} @String{j-PROC-IEEE = "Proceedings of the IEEE"} @String{j-PROC-VLDB-ENDOWMENT = "Proceedings of the VLDB Endowment"} @String{j-PROGRAMMIROVANIE = "Programmirovanie"} @String{j-QUEUE = "ACM Queue: Tomorrow's Computing Today"} @String{j-SCI-COMPUT-PROGRAM = "Science of Computer Programming"} @String{j-SCI-PROG = "Scientific Programming"} @String{j-SCPE = "Scalable Computing: Practice and Experience"} @String{j-SIGADA-LETTERS = "ACM SIGADA Ada Letters"} @String{j-SIGAPP = "ACM SIGAPP Applied Computing Review"} @String{j-SIGCSE = "SIGCSE Bulletin (ACM Special Interest Group on Computer Science Education)"} @String{j-SIGMETRICS = "ACM SIGMETRICS Performance Evaluation Review"} @String{j-SIGMICRO = "ACM SIGMICRO Newsletter"} @String{j-SIGMOD = "SIGMOD Record (ACM Special Interest Group on Management of Data)"} @String{j-SIGPLAN = "ACM SIG{\-}PLAN Notices"} @String{j-SIGSOFT = "ACM SIGSOFT Software Engineering Notes"} @String{j-SPE = "Soft\-ware\emdash Prac\-tice and Experience"} @String{j-SYS-ADMIN = "Sys Admin: The Journal for UNIX Systems Administrators"} @String{j-TAAS = "ACM Transactions on Autonomous and Adaptive Systems (TAAS)"} @String{j-TACO = "ACM Transactions on Architecture and Code Optimization"} @String{j-TECS = "ACM Transactions on Embedded Computing Systems"} @String{j-TIOT = "ACM Transactions on Internet of Things (TIOT)"} @String{j-TISSEC = "ACM Transactions on Information and System Security"} @String{j-TIST = "ACM Transactions on Intelligent Systems and Technology (TIST)"} @String{j-TMIS = "ACM Transactions on Management Information Systems (TMIS)"} @String{j-TOCS = "ACM Transactions on Computer Systems"} @String{j-TODAES = "ACM Transactions on Design Automation of Electronic Systems."} @String{j-TODS = "ACM Transactions on Database Systems"} @String{j-TOIT = "ACM Transactions on Internet Technology (TOIT)"} @String{j-TOMACS = "ACM Transactions on Modeling and Computer Simulation"} @String{j-TOMM = "ACM Transactions on Multimedia Computing, Communications, and Applications"} @String{j-TOMPECS = "ACM Transactions on Modeling and Performance Evaluation of Computing Systems (TOMPECS)"} @String{j-TOPLAS = "ACM Transactions on Programming Languages and Systems"} @String{j-TOPS = "ACM Transactions on Privacy and Security (TOPS)"} @String{j-TOS = "ACM Transactions on Storage"} @String{j-TOSEM = "ACM Transactions on Software Engineering and Methodology"} @String{j-TOSN = "ACM Transactions on Sensor Networks"} @String{j-TQC = "ACM Transactions on Quantum Computing (TQC)"} @String{j-TRANS-AM-NUCL-SOC = "Transactions of the American Nuclear Society"} @String{j-TRETS = "ACM Transactions on Reconfigurable Technology and Systems (TRETS)"} @String{j-TUGboat = "TUGboat"} @String{j-UNIX-REVIEW = "UNIX Review"} @String{j-VLDB-J = "VLDB Journal: Very Large Data Bases"} %%% ==================================================================== %%% Publishers and their addresses: @String{pub-ACM = "ACM Press"} @String{pub-ACM:adr = "New York, NY 10036, USA"} @String{pub-APRESS = "Apress"} @String{pub-APRESS:adr = "Berkeley, CA, USA"} @String{pub-AUERBACH = "Auerbach"} @String{pub-AUERBACH:adr = "Princeton, NJ, USA"} @String{pub-AW = "Ad{\-d}i{\-s}on-Wes{\-l}ey"} @String{pub-AW:adr = "Reading, MA, USA"} @String{pub-CARL-HANSER = "Carl Hanser"} @String{pub-CARL-HANSER:adr = "M{\"{u}}nchen, Germany"} @String{pub-CRC = "CRC Press"} @String{pub-CRC:adr = "2000 N.W. Corporate Blvd., Boca Raton, FL 33431-9868, USA"} @String{pub-ECMA = "ECMA (European Association for Standardizing Information and Communication Systems)"} @String{pub-ECMA:adr = "Geneva, Switzerland"} @String{pub-GOTOP-INFORMATION = "GOTOP Information Inc."} @String{pub-GOTOP-INFORMATION:adr = "5F, No.7, Lane 50, Sec.3 Nan Kang Road Taipei, Taiwan; Unit 1905,Metro Plaza Tower 2, No.223 Hing Fong Road, Kwai Chung, N.T., Hong Kong"} @String{pub-IBM = "IBM Corporation"} @String{pub-IBM:adr = "San Jose, CA, USA"} @String{pub-IEEE = "IEEE Computer Society Press"} @String{pub-IEEE:adr = "1109 Spring Street, Suite 300, Silver Spring, MD 20910, USA"} @String{pub-IOS = "IOS Press"} @String{pub-IOS:adr = "Amsterdam, The Netherlands"} @String{pub-ISO = "International Organization for Standardization"} @String{pub-ISO:adr = "Geneva, Switzerland"} @String{pub-KLUWER = "Kluwer Academic Publishers Group"} @String{pub-KLUWER:adr = "Norwell, MA, USA, and Dordrecht, The Netherlands"} @String{pub-MANNING = "Manning Publications"} @String{pub-MANNING:adr = "Greenwich, CT, USA"} @String{pub-MCGRAW-HILL = "Mc{\-}Graw-Hill"} @String{pub-MCGRAW-HILL:adr = "New York, NY, USA"} @String{pub-MICROSOFT = "Microsoft Press"} @String{pub-MICROSOFT:adr = "Bellevue, WA, USA"} @String{pub-MORGAN-KAUFMANN = "Morgan Kaufmann Publishers"} @String{pub-MORGAN-KAUFMANN:adr = "Los Altos, CA 94022, USA"} @String{pub-MORGAN-KAUFMANN:adrsf = "San Francisco, CA, USA"} @String{pub-NO-STARCH = "No Starch Press"} @String{pub-NO-STARCH:adr = "San Francisco, CA, USA"} @String{pub-NORTH-HOLLAND = "North-Hol{\-}land"} @String{pub-NORTH-HOLLAND:adr = "Amsterdam, The Netherlands"} @String{pub-ORA = "O'Reilly \& Associates, Inc."} @String{pub-ORA:adr = "103a Morris Street, Sebastopol, CA 95472, USA, Tel: +1 707 829 0515, and 90 Sherman Street, Cambridge, MA 02140, USA, Tel: +1 617 354 5800"} @String{pub-ORA-MEDIA = "O'Reilly Media, Inc."} @String{pub-ORA-MEDIA:adr = "1005 Gravenstein Highway North, Sebastopol, CA 95472, USA"} @String{pub-PACKT = "Packt Publishing"} @String{pub-PACKT:adr = "Birmingham, UK"} @String{pub-PH = "Pren{\-}tice-Hall"} @String{pub-PH:adr = "Upper Saddle River, NJ 07458, USA"} @String{pub-QUE = "Que Corporation"} @String{pub-QUE:adr = "Indianapolis, IN, USA"} @String{pub-SAMS = "SAMS Publishing"} @String{pub-SAMS:adr = "Indianapolis, IN, USA"} @String{pub-SV = "Spring{\-}er-Ver{\-}lag"} @String{pub-SV:adr = "Berlin, Germany~/ Heidelberg, Germany~/ London, UK~/ etc."} @String{pub-SYBEX = "Sybex"} @String{pub-SYBEX:adr = "2021 Challenger Driver, Suite 100, Alameda, CA 94501, USA"} @String{pub-SYNGRESS = "Syngress Publishing, Inc."} @String{pub-SYNGRESS:adr = "Rockland, MA, USA"} @String{pub-USENIX = "USENIX"} @String{pub-USENIX:adr = "San Francisco, CA, USA"} @String{pub-USENIX-EL-CERRITO:adr = "P.O. Box 7, El Cerrito 94530, CA, USA"} @String{pub-WILEY = "Wiley"} @String{pub-WILEY:adr = "New York, NY, USA"} %%% ==================================================================== %%% Series abbreviations: @String{ser-LNCS = "Lecture Notes in Computer Science"} %%% ==================================================================== %%% Bibliography entries, sorted by ascending year and then by citation %%% label, with `bibsort -byyear': @TechReport{Comeau:1965:PLS, author = "Leslie W. Comeau", title = "The Philosophy and Logical Structure of the Control Program", type = "Memorandum", number = "2", institution = "IBM Cambridge SR\&D Center Research Time-Sharing Computer", address = "Cambridge, MA, USA", pages = "????", day = "15", month = apr, year = "1965", bibdate = "Sat May 07 13:24:22 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, remark = "See earlier companion \cite{Creasy:1965:GDR}.", } @TechReport{Creasy:1965:GDR, author = "Robert J. Creasy", title = "General Description of the Research Time-Sharing System with Special Emphasis on the Control Program", type = "Memorandum", number = "1", institution = "IBM Cambridge SR\&D Center Research Time-Sharing Computer", address = "Cambridge, MA, USA", pages = "????", day = "29", month = jan, year = "1965", bibdate = "Sat May 07 13:24:22 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "This appears to be the earliest work on virtual machines that is cited in the IBM VM history \cite{Varian:1991:VVC}. That history reports on page 28: ``Creasy and Comeau spent the last week of 1964 [36] joyfully brainstorming the design of CP-40, a new kind of operating system, a system that would provide not only virtual memory, but also virtual machines. [37] They had seen that the cleanest way to protect users from one another (and to preserve compatibility as the new System/360 design evolved) was to use the System/360 Principles of Operations manual to describe the user's interface to the Control Program. Each user would have a complete System/360 virtual machine (at first called a `pseudo-machine').'' Footnote 28 on page 28 says: ``For the first few weeks, the CSC people referred to their concept as a `pseudo-machine', but soon adopted the term `virtual machine' after hearing Dave Sayre at IBM Research use it to describe a system he had built for a modified 7044.''", acknowledgement = ack-nhfb, remark = "See later companion \cite{Comeau:1965:PLS}. I cannot find online copies of either of these reports.", } @TechReport{Adair:1966:VMS, author = "R. J. Adair and R. U. Bayles and L. W. Comeau and R. J. Creasy", title = "A Virtual Machine System for the 360\slash 40", number = "320-2007", institution = "International Business Machines (IBM), Data Processing Division", year = "1966", bibdate = "Sat May 7 15:04:11 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, annote = "ABEND module of OS at SSC", keywords = "IBM 360/40", remark = "[Written on 10-Apr-2006]: This is the earliest mention of virtual machines that I have found so far. From the early 1970s to date, IBM has made extensive use of virtualization in many of their mainframe systems. [See even earlier work \cite{Creasy:1965:GDR,Comeau:1965:PLS}.]", } @TechReport{Sayre:1966:VS, author = "D. Sayre", title = "On Virtual Systems", type = "Report", institution = "IBM Corporation T. J. Watson Research Laboratory", address = "Yorktown Heights, NY, USA", pages = "????", day = "15", month = apr, year = "1966", bibdate = "Sat May 07 14:54:28 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, } @Article{Sayre:1967:ACV, author = "D. Sayre", title = "Adding Computers Virtually", journal = "IBM Corporation Computer Report", volume = "3", number = "2", pages = "12--15", month = mar, year = "1967", bibdate = "Sat May 07 14:55:37 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, } @Article{Auroux:1968:CMV, author = "A. Auroux and C. Han", title = "Le Concept de Machines Virtuelles. ({French}) [{The} Concept of Virtual Machines]", journal = "Revue Fran{\c{c}}aise d'Informatique et de Recherche Op{\'e}rationelle, 2e ann{\'e}", volume = "15", pages = "45--51", year = "1968", bibdate = "Sat May 07 13:52:14 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, language = "French", } @TechReport{Field:1968:MAS, author = "M. S. Field", title = "Multi-Access Systems: The Virtual Machine Approach", type = "Report", number = "320-2033", institution = "IBM Cambridge Scientific Center", address = "Cambridge, MA, USA", month = sep, year = "1968", bibdate = "Sat May 07 11:52:42 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, } @Article{Keefe:1968:HCP, author = "D. D. Keefe", title = "Hierarchical control programs for systems evaluation", journal = j-IBM-SYS-J, volume = "7", number = "2", pages = "123--133", year = "1968", CODEN = "IBMSA7", ISSN = "0018-8670", bibdate = "Tue Mar 19 17:38:46 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/ibmsysj.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, } @Article{Thompson:1968:PTR, author = "Ken Thompson", title = "Programming Techniques: {Regular} expression search algorithm", journal = j-CACM, volume = "11", number = "6", pages = "419--422", month = jun, year = "1968", CODEN = "CACMA2", DOI = "https://doi.org/10.1145/363347.363387", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Fri Nov 25 18:20:20 MST 2005", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm11.html#Thompson68; http://www.acm.org/pubs/contents/journals/cacm/; https://www.math.utah.edu/pub/tex/bib/cacm1960.bib; https://www.math.utah.edu/pub/tex/bib/plan9.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "See also \cite{Kernighan:1999:REL,Cox:2007:REM,Cox:2009:REM,Cox:2010:REM,Cox:2012:REM}", URL = "http://patft.uspto.gov/", abstract = "A method for locating specific character strings embedded in character text is described and an implementation of this method in the form of a compiler is discussed. The compiler accepts a regular expression as source language and produces an IBM 7094 program as object language. The object program then accepts the text to be searched as input and produces a signal every time an embedded string in the text matches the given regular expression. Examples, problems, and solutions are also presented.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79", keywords = "match; regular expression; search", oldlabel = "Thompson68", remark = "The on-the-fly compilation of regular expressions to IBM 7094 machine code is part of US Patent \#3568156, awarded 9 August 1967 to Kenneth L. Thompson. This may be the first instance of the use of regular-expression pattern matching in text-editor software.", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Thompson68", } @InProceedings{Fuchi:1969:PSP, author = "K. Fuchi and H. Tanaka and Y. Namago and T. Yuba", editor = "????", booktitle = "{2nd Symposium on Operating Systems Principles, Princeton, NJ, October 1969}", title = "A Program Simulator by Partial Interpretation", publisher = "????", address = "????", pages = "97--104.", year = "1969", bibdate = "Sat May 07 14:10:16 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, } @TechReport{Goldberg:1969:VMS, author = "R. P. Goldberg", title = "Virtual Machine Systems", type = "Report", number = "MS-2687 (also 28L-0036)", institution = "MIT Lincoln Laboratory", address = "Lexington, MA, USA", month = sep, year = "1969", bibdate = "Sat May 07 14:14:30 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, } @Article{Madnick:1969:TSS, author = "S. E. Madnick", title = "Time-Sharing Systems: Virtual Machine Concept vs. Conventional Approach", journal = "Modern Data", volume = "2", number = "3", pages = "34--36", month = mar, year = "1969", bibdate = "Sat May 07 14:35:40 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, } @TechReport{Murphy:1969:TSU, author = "Daniel Murphy", title = "The {Ten-Sys} User Virtual Machine", type = "TEN-SYS Memorandum", number = "8", institution = "Digital Equipment Corporation", address = "Marlboro, MA, USA", pages = "6", day = "30", month = apr, year = "1969", bibdate = "Wed Jul 03 14:23:09 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://walden-family.com/bbn/10-SYS/TEN-SYS-8.pdf", abstract = "A user program running under Ten-Sys operates on a virtual machine which looks something like a PDP-10 arithmetic processor with 256k of attached memory. The virtual APR does not make available to the user program the direct I/O instructions (CONO, DATAI, etc.) but has a large class of instructions (JSYS's and SYSPOP's) which provide access to monitor routines performing user-oriented I/O and other operations. The Ten-Sys monitor and paging hardware create an illusion of memory (called the virtual memory) which can be treated as ordinary core, However, to make most effective use of the memory features of the Ten-Sys monitor. the user will need to understand the general nature of memory and files.", acknowledgement = ack-nhfb, } @Article{Bairstow:1970:MOV, author = "J. N. Bairstow", title = "Many From One: The Virtual Machine Arrives", journal = "Computer Decisions", volume = "??", number = "??", pages = "29--31", month = jan, year = "1970", bibdate = "Sat May 07 13:55:40 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, } @Article{Brawn:1970:SPE, author = "B. S. Brawn and F. G. Gustavson and E. S. Mankin", title = "Sorting in a Paging Environment", journal = j-CACM, volume = "13", number = "8", pages = "483--494", month = aug, year = "1970", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Tue Mar 25 13:26:09 MST 1997", bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "This sorting study was part of an extensive measurement project undertaken on the M44\slash 44X, an experimental paging system which was conceived and implemented at IBM Research in order to explore the virtual machine concept. The study was concerned with the implementation of sorting procedures in the context of the dynamic paging environment characteristic of virtual memory machines. Descriptions of the experimental sort programs and analysis of the performance measurement results obtained for them are presented. The insight gained from the experimental effort is used to arrive at a set of broad guidelines for writing sort programs for a paging environment.", acknowledgement = ack-nhfb, classcodes = "C6130 (Data handling techniques)", corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA", fjournal = "Communications of the ACM", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79", journalabr = "Commun ACM", keywords = "CACMA; computer, memories; computers; computers, programming; dynamic memory management; External sort virtual memory CACM; operating systems; sorting; virtual machines", } @Article{Meyer:1970:VMT, author = "Richard A. Meyer and Love H. Seawright", title = "A Virtual Machine Time-Sharing System", journal = j-IBM-SYS-J, volume = "9", number = "3", pages = "199--218", year = "1970", CODEN = "IBMSA7", ISSN = "0018-8670", bibdate = "Mon Jan 22 13:28:16 MST 2001", bibsource = "Compendex database; http://dblp.uni-trier.de/db/journals/ibmsj/ibmsj9.html#MeyerS70; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "The ControlProgram-67\slash Cambridge Monitor System (CP-67\slash CMS) is a multiaccess system that manages the resources of a computer set up for time-sharing such that each (remote) user appears to have a complete, dedicated computer at his disposal. This concept is known as a virtual machine and allows each user to select the operating system he wishes to run because concurrent operation of several operating systems is possible. The history and design objectives of the system are discussed as well as its present capabilities and some of the applications for its use.", acknowledgement = ack-nhfb, fjournal = "IBM Systems Journal", journalabr = "IBM Syst J", oldlabel = "MeyerS70", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/ibmsj/MeyerS70", } @Manual{Forum:1971:VMI, author = "IBM (Forum)", title = "On Virtual Machine Integrity", year = "1971", bibdate = "Mon Apr 10 21:54:48 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, } @InProceedings{Goldberg:1971:HRV, author = "R. P. Goldberg", editor = "????", booktitle = "HICSS-4, Hawaii International Conference on System Sciences, Honolulu, January 1971", title = "Hardware Requirements for Virtual Machine Systems", publisher = "????", address = "????", pages = "??--??", year = "1971", bibdate = "Sat May 07 14:18:30 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, } @InProceedings{Goldberg:1971:VMS, author = "R. P. Goldberg", editor = "????", booktitle = "{Proceedings IEEE Computer Society Conference, Boston, MA, September 1971}", title = "Virtual Machines: Semantics and Examples", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "141--142", year = "1971", bibdate = "Sat May 07 14:17:16 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, } @InProceedings{Parmelee:1971:VMS, author = "R. P. Parmelee", editor = "????", booktitle = "{Proceedings IEEE Computer Society Conference, Boston, MA, September 1971}", title = "Virtual Machines --- Some Unexpected Applications", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "??--??", year = "1971", bibdate = "Sat May 07 14:42:33 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, } @InProceedings{Winett:1971:VMD, author = "J. M. Winett", editor = "????", booktitle = "{Proceedings IEEE Computer Society Conference, Boston, MA, September 1971}", title = "Virtual Machines for Developing Systems Software", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "??--??", year = "1971", bibdate = "Sat May 07 14:59:42 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, } @InProceedings{Ancilotti:1972:VIO, author = "R. Ancilotti and R. Cavina and N. Lijtmaer", editor = "????", booktitle = "{ACM AICA International Computer Symposium Proceedings, Venice, Italy, April 12--14, 1972}", title = "Virtual Input-Output in a Virtual Environment", publisher = pub-ACM, address = pub-ACM:adr, pages = "302--312", year = "1972", bibdate = "Sat May 07 13:47:31 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, } @InProceedings{Gagliardi:1972:VA, author = "U. O. Gagliardi and R. P. Goldberg", editor = "????", booktitle = "{Proceedings of 1972 ACMAICA International Comp. Symposium, Venice, Italy, April 1972}", title = "Virtualizable Architectures", publisher = "????", address = "????", pages = "527--538", year = "1972", bibdate = "Sat May 07 14:11:47 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, } @Manual{IBM:1972:IVM, author = "{IBM}", title = "{IBM Virtual Machine Facility\slash 370} Planning Guide", organization = pub-IBM, address = pub-IBM:adr, pages = "????", year = "1972", bibdate = "Sat May 07 14:29:39 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "Publication No. GC20-1801-0.", acknowledgement = ack-nhfb, } @Article{Mallach:1972:ES, author = "E. G. Mallach", title = "Emulation --- a Survey", journal = j-HONEYWELL-COMP-J, volume = "6", number = "4", pages = "??--??", month = "????", year = "1972", CODEN = "HNCJA3", ISSN = "0046-7847", ISSN-L = "0046-7847", bibdate = "Sat May 07 14:37:38 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "Honeywell Comp. J.", fjournal = "Honeywell Computer Journal", } @Article{McGrath:1972:VMC, author = "Mark McGrath", title = "Virtual machine computing in an engineering environment", journal = j-IBM-SYS-J, volume = "11", number = "2", pages = "131--149", year = "1972", CODEN = "IBMSA7", ISSN = "0018-8670", bibdate = "Mon Jan 22 13:28:02 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/ibmsj/ibmsj11.html#McGrath72; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IBM Systems Journal", oldlabel = "McGrath72", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/ibmsj/McGrath72", } @Article{Morris:1972:SMO, author = "D. Morris and G. D. Detlefsen and G. R. Frank and T. J. Sweeney", title = "The structure of the {MU5} operating system", journal = j-COMP-J, volume = "15", number = "2", pages = "113--116", month = may, year = "1972", CODEN = "CMPJA6", ISSN = "0010-4620 (print), 1460-2067 (electronic)", ISSN-L = "0010-4620", bibdate = "Fri Sep 29 08:52:02 MDT 2000", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_02/", URL = "http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_02/150113.sgm.abs.html; http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_02/tiff/113.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_02/tiff/114.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_02/tiff/115.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_02/tiff/116.tif", acknowledgement = ack-nhfb, classcodes = "C6150J (Operating systems)", corpsource = "Univ. Manchester, UK", fjournal = "The Computer Journal", journal-URL = "http://comjnl.oxfordjournals.org/", keywords = "1905E; ICL; modular structure; MU5; multicomputer complex; operating system; operating systems (computers); structure; virtual machine", treatment = "P Practical", } @TechReport{Parmelee:1972:PVM, author = "R. P. Parmelee", title = "Preferred Virtual Machines for {CP-67}", type = "Report", number = "G320-2068", institution = "IBM Corporation, Cambridge Scientific Center", address = "Cambridge, MA, USA", month = "????", year = "1972", bibdate = "Sat May 07 14:50:12 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, xxnote = "Check uncertain year: 1972--1975??", } @Article{Parmelee:1972:VSV, author = "Richard P. Parmelee and Theodore I. Peterson and Coyt C. {Tillman, Jr.} and Donald J. Hatfield", title = "Virtual Storage and Virtual Machine Concepts", journal = j-IBM-SYS-J, volume = "11", number = "2", pages = "99--130", year = "1972", CODEN = "IBMSA7", ISSN = "0018-8670", bibdate = "Mon Jan 22 13:29:15 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/ibmsj/ibmsj11.html#ParmeleePTH72; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dlnext.acm.org/doi/10.1147/sj.112.0099", acknowledgement = ack-nhfb, fjournal = "IBM Systems Journal", oldlabel = "ParmeleePTH72", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/ibmsj/ParmeleePTH72", } @Article{Stoy:1972:OEOa, author = "J. E. Stoy and C. Strachey", title = "{OS6} --- an experimental operating system for a small computer. {Part} 1: general principles and structure", journal = j-COMP-J, volume = "15", number = "2", pages = "117--124", month = may, year = "1972", CODEN = "CMPJA6", ISSN = "0010-4620 (print), 1460-2067 (electronic)", ISSN-L = "0010-4620", bibdate = "Fri Sep 29 08:52:02 MDT 2000", bibsource = "https://www.math.utah.edu/pub/tex/bib/compj1970.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_02/", URL = "http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_02/150117.sgm.abs.html; http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_02/tiff/117.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_02/tiff/118.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_02/tiff/119.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_02/tiff/120.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_02/tiff/121.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_02/tiff/122.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_02/tiff/123.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_02/tiff/124.tif", acknowledgement = ack-nhfb, classcodes = "C6150J (Operating systems)", corpsource = "Oxford Univ. Computing Lab., UK", fjournal = "The Computer Journal", journal-URL = "http://comjnl.oxfordjournals.org/", keywords = "BCPL; control structure; hierarchical; minicomputers; operating system; operating systems (computers); principles; small computer; structure; virtual machine", treatment = "G General Review; X Experimental", } @InProceedings{Attansio:1973:VMD, author = "C. R. Attansio", editor = "????", booktitle = "{Proceedings ACM SIGARCH-SIGOPS Workshop on Virtual Computer Systems, Cambridge, MA, 1973}", title = "Virtual Machines and Data Security", publisher = pub-ACM, address = pub-ACM:adr, pages = "??--??", year = "1973", bibdate = "Sat May 07 13:50:44 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, } @InProceedings{Bard:1973:AMC, author = "Y. Bard", editor = "????", booktitle = "{Proceedings ACM SIGARCH-SIGOPS Workshop on Virtual Computer Systems, Cambridge, MA, 1973}", title = "An Analytic Model of {CP-67} --- {VM\slash 370}", publisher = pub-ACM, address = pub-ACM:adr, pages = "??--??", year = "1973", bibdate = "Sat May 07 13:54:18 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, } @InProceedings{Bellino:1973:VMV, author = "J. Bellino and C. Hans", editor = "????", booktitle = "{Proceedings ACM SIGARCH-SIGOPS Workshop on Virtual Computer Systems, Cambridge, MA, 1973}", title = "Virtual Machine or Virtual Operating System", publisher = pub-ACM, address = pub-ACM:adr, pages = "??--??", year = "1973", bibdate = "Sat May 07 13:58:19 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, } @InProceedings{Berthaud:1973:CVM, author = "M. Berthaud and M. Jacolin and Ph. Potin and H. Savary", editor = "????", booktitle = "{Proceedings ACM SIGARCH-SIGOPS Workshop on Virtual Computer Systems, Cambridge, MA, 1973}", title = "Coupling Virtual Machines and System Construction", publisher = pub-ACM, address = pub-ACM:adr, pages = "??--??", year = "1973", bibdate = "Sat May 07 14:00:40 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, } @InProceedings{Buzen:1973:EVM, author = "J. P. Buzen and U. O. Gagliardi", editor = "????", booktitle = "{AFIPS Conference Proceedings, 1973 NCC}", title = "The Evolution of Virtual Machine Architecture", publisher = "AFIPS Press", address = "Montvale, NJ, USA", pages = "290--299", year = "1973", DOI = "https://doi.org/10.1145/1499586.1499667", bibdate = "Sat May 07 14:02:06 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/pdf/10.1145/1499586.1499667", acknowledgement = ack-nhfb, } @Article{Buzen:1973:IVM, author = "J. P. Buzen and U. O. Gagliardi", title = "Introduction to Virtual Machines", journal = j-HONEYWELL-COMP-J, volume = "7", number = "4", pages = "??--??", month = "????", year = "1973", CODEN = "HNCJA3", ISSN = "0046-7847", bibdate = "Sat May 07 14:06:45 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "Honeywell Comp. J.", fjournal = "Honeywell Computer Journal", } @InProceedings{Buzen:1973:NVM, author = "J. P. Buzen and P. P. Chen and R. P. Goldberg", editor = "????", booktitle = "{Proceedings ACM SIGARCH-SIGOPS Workshop on Virtual Computer Systems, Cambridge, MA, 1973}", title = "A Note on Virtual Machines and Software Reliability", publisher = pub-ACM, address = pub-ACM:adr, pages = "??--??", year = "1973", bibdate = "Sat May 07 14:02:06 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, } @InProceedings{Buzen:1973:VMT, author = "J. P. Buzen and P. P. Chen and R. P. Goldberg", editor = "????", booktitle = "{Proceedings IEEE Symposium on Computer Software Reliability, New York, 1973}", title = "Virtual Machine Techniques for Improving Software Reliability", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "??--??", year = "1973", bibdate = "Sat May 07 14:02:06 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, } @InProceedings{Galley:1973:PVM, author = "S. W. Galley", editor = "????", booktitle = "Proceedings ACM SIGARCH-SIGOPS Workshop on Virtual Computer Systems, Cambridge, MA, 1973", title = "{PDP-10} Virtual Machines", publisher = pub-ACM, address = pub-ACM:adr, pages = "??--??", year = "1973", bibdate = "Sat May 07 14:13:03 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, } @PhdThesis{Goldberg:1973:APV, author = "Robert Philip Goldberg", title = "Architectural Principles for Virtual Computer Systems", type = "{Ph.D.} Thesis", school = "Division of Engineering and Applied Physics Harvard University", address = "Cambridge, MA, USA", year = "1973", ISBN-13 = "979-86-431-0520-6", bibdate = "Sat May 07 14:19:38 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.proquest.com/pqdtglobal/docview/302694242", acknowledgement = ack-nhfb, } @InProceedings{Goldberg:1973:AVM, author = "R. P. Goldberg", booktitle = "Proceedings of the {ACM} Workshop on Virtual Computer Systems", title = "Architecture of virtual machines", publisher = pub-ACM, address = pub-ACM:adr, pages = "74--112", year = "1973", bibdate = "Wed Apr 9 10:12:31 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://portal.acm.org/citation.cfm?id=803950&dl=ACM&coll=portal#", abstract = "In this paper we develop a model which represents the addressing of resources by processes executing on a virtual machine. The model distinguishes two maps: the $ \phi $-map which represents the map visible to the operating system software running on the virtual machine, and the $f$-map which is invisible to that software but which is manipulated by the virtual machine monitor running on the real machine. The $ \phi $-map maps process names into resource names and the $f$-map maps virtual resource names into real resource names. Thus, a process running on a virtual machine addresses its resources under the composed map $ f o \phi $. In recursive operation, $f$ maps from one virtual machine level to another and we have $ f o f o \ldots {} o f o \phi $. The model is used to describe and characterize previous virtual machine designs. We also introduce and illustrate a general approach for implementing virtual machines which follows directly from the model. This design, the Hardware Virtualizer, handles all process exceptions directly within the executing virtual machine without software intervention. All resource faults (VM-faults) generated by a virtual machine are directed to the appropriate virtual machine monitor without the knowledge of processes on the virtual machine (regardless of the level of recursion).", acknowledgement = ack-nhfb, added-at = "Wed Apr 9 10:12:31 2003", added-by = "msteiner", annote = "See also \cite{Goldbe72}", } @Article{Goldberg:1973:VMA, author = "R. P. Goldberg", title = "Virtual Machines Architecture", journal = j-HONEYWELL-COMP-J, volume = "7", number = "4", pages = "??--??", month = "????", year = "1973", CODEN = "HNCJA3", ISSN = "0046-7847", bibdate = "Sat May 07 14:24:49 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "Honeywell Comp. J.", fjournal = "Honeywell Computer Journal", } @PhdThesis{Hans:1973:CAM, author = "C. Hans", title = "Contribution a l'Architecture de M{\'e}canismes El{\'e}mentaires Pour Certains Syst{\`e}mes G{\'e}n{\'e}rateurs de Machines Virtuelles. ({French}) [{Contribution} to the Architecture of Elementary Mechanisms for Certain Virtual Machine Generator Systems]", type = "Th{\`e}se", school = "L'Universit{\'e} Scientifique et Medicale de Grenoble", address = "Grenoble, France", day = "24", month = nov, year = "1973", bibdate = "Sat May 07 14:25:56 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, language = "French", } @Misc{Horton:1973:VMA, author = "F. R. Horton", title = "Virtual Machine Assist: Performance", howpublished = "Guide 37, Boston, MA", year = "1973", bibdate = "Sat May 07 14:28:23 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, } @Manual{IBM:1973:IVM, author = "{IBM}", title = "{IBM Virtual Machine Facility\slash 370}: Release 2 Planning Guide", organization = pub-IBM, address = pub-IBM:adr, pages = "????", year = "1973", bibdate = "Sat May 07 14:29:39 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "Publication No. GC20-1814-0.", acknowledgement = ack-nhfb, } @InProceedings{Lauer:1973:RVM, author = "H. C. Lauer and D. Wyeth", editor = "????", booktitle = "{Proceedings ACM SIGARCH-SIGOPS Workshop on Virtual Computer Systems, Cambridge, MA, 1973}", title = "A Recursive Virtual Machine Architecture", publisher = pub-ACM, address = pub-ACM:adr, pages = "??--??", year = "1973", bibdate = "Sat May 07 14:33:40 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, } @InProceedings{Madnick:1973:AAV, author = "Stuart E. Madnick and John J. Donovan", booktitle = "Proceedings of the {ACM} Workshop on Virtual Computer Systems", title = "Application and analysis of the virtual machine approach to information system security and isolation", publisher = pub-ACM, address = pub-ACM:adr, pages = "210--224", year = "1973", bibdate = "Wed Apr 9 10:08:32 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://portal.acm.org/citation.cfm?id=803961&coll=portal&dl=ACM", abstract = "Security is an important factor if the programs of independent and possibly malicious users are to coexist on the same computer system. In this paper we show that a combined virtual machine monitor/operating system (VMM/OS) approach to information system isolation provides substantially better software security than a conventional multiprogramming operating system approach. This added protection is derived from redundant security using independent mechanisms that are inherent in the design of most VMM/OS systems.", acknowledgement = ack-nhfb, added-at = "Wed Apr 9 10:08:32 2003", added-by = "msteiner", } @InProceedings{Mallach:1973:RBE, author = "E. G. Mallach", editor = "????", booktitle = "{Proceedings ACM SIGOPS-SIGARCH Workshop on Virtual Computer Systems, Cambridge, MA, 1973}", title = "On the Relationship between Emulators and Virtual Machines", publisher = pub-ACM, address = pub-ACM:adr, pages = "??--??", year = "1973", bibdate = "Sat May 07 14:39:11 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, } @InProceedings{March:1973:DIV, author = "J. H. March", editor = "????", booktitle = "{Proceedings ACM SIGARCH-SIGOPS Workshop on Virtual Computer Systems, Cambridge, MA, 1973}", title = "The Design and Implementation of a Virtual Machine Operating System Using a Virtual Access Method", publisher = pub-ACM, address = pub-ACM:adr, pages = "??--??", year = "1973", bibdate = "Sat May 07 14:40:16 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, } @InProceedings{Parnas:1973:DVM, author = "D. L. Parnas and W. R. Price", editor = "????", booktitle = "{Proceedings ACM SIGARCH-SIGOPS Workshop on Virtual Computer Systems, Cambridge, MA, 1973}", title = "he Design of the Virtual Memory Aspects of a Virtual Machine", publisher = pub-ACM, address = pub-ACM:adr, pages = "??--??", year = "1973", bibdate = "Sat May 07 14:52:59 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, } @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 = "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", } @InProceedings{Schwenk:1973:VM, author = "H. Schwenk", editor = "????", booktitle = "{Proceedings ACM SIGARCH-SIGOPS Workshop on Virtual Computer Systems, Cambridge, MA, 1973}", title = "Virtual Micromachines", publisher = pub-ACM, address = pub-ACM:adr, pages = "??--??", year = "1973", bibdate = "Sat May 07 14:57:04 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, } @Article{Sitton:1973:PEL, author = "Gary A. Sitton and Thomas A. Kendrick and A. Gil Carrick", title = "The {PL\slash EXUS} language and virtual machine", journal = j-SIGPLAN, volume = "8", number = "11", pages = "124--130", month = nov, year = "1973", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:13:35 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @InProceedings{Srodawa:1973:EVM, author = "R. J. Srodawa and L. A. Bates", editor = "????", booktitle = "{Proceedings AFIPS National Computer Conference 1973}", title = "An Efficient Virtual Machine Implementation", publisher = "????", address = "????", year = "1973", bibdate = "Sat May 07 14:58:18 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, } @Article{Thomas:1973:COA, author = "Richard T. Thomas", title = "Computer organization for allowing dynamic user microprogramming", journal = j-SIGMICRO, volume = "4", number = "2", pages = "28--42", month = jul, year = "1973", CODEN = "SIGMDJ", DOI = "https://doi.org/10.1145/1217124.1217129", ISSN = "0163-5751, 1050-916X", ISSN-L = "0163-5751", bibdate = "Fri Apr 16 10:27:15 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigmicro.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1145/1217124.1217129", abstract = "The concept of allowing the computer user to modify the virtual machine being emulated by a microprogram controlled computer is not new. Schemes for implementing this typically include the definition of a standard virtual machine (the base machine. \ldots{})", acknowledgement = ack-nhfb, fjournal = "ACM SIGMICRO Newsletter", journal-URL = "https://dl.acm.org/loi/sigmicro", } @InProceedings{Young:1973:EAH, author = "C. J. Young", editor = "????", booktitle = "{Proceedings ACM SIGARCH-SIGOPS Workshop on Virtual Computer Systems, Cambridge, MA, 1973}", title = "Extended Architecture and Hypervisor Performance", publisher = pub-ACM, address = pub-ACM:adr, pages = "??--??", year = "1973", bibdate = "Sat May 07 15:01:30 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, } @InProceedings{Buzen:1974:VMT, author = "J. P. Buzen and R. P. Goldberg", editor = "????", booktitle = "{Computer Peripherals --- Benefactor or Bottleneck? Digest of Papers COMPCON 74, San Francisco, February 1974}", title = "Virtual Machine Techniques for Introducing Peripherals into Computer Systems", publisher = "????", address = "????", pages = "157--160", year = "1974", bibdate = "Sat May 07 14:08:23 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, } @Article{Goldberg:1974:SVM, author = "Robert P. Goldberg", title = "Survey of virtual machine research", journal = j-COMPUTER, volume = "7", number = "6", pages = "34--45", month = jun, year = "1974", CODEN = "CPTRB4", DOI = "https://doi.org/10.1109/MC.1974.6323581", ISSN = "0018-9162 (print), 1558-0814 (electronic)", ISSN-L = "0018-9162", bibdate = "Sat May 7 12:07:21 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/computer1970.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Computer", journal-URL = "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2", remark = "Includes a 72-item bibliography about earlier work on virtual machines.", } @Article{Lesser:1974:DEP, author = "Victor R. Lesser", title = "The design of an emulator for a parallel machine language", journal = j-SIGPLAN, volume = "9", number = "8", pages = "23--36", month = aug, year = "1974", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:13:40 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, classification = "C5220 (Computer architecture); C6140B (Machine-oriented languages); C7430 (Computer engineering)", conflocation = "Harriman, NY, USA; 30 May-1 June 1973", conftitle = "Proceedings of the ACM SIGPLAN-SIGMICRO interface meeting on programming languages-Microprogramming", corpsource = "Carnegie-Mellon Univ., Pittsburgh, PA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", keywords = "coded; complex emulator; control structure; coupled; dynamic execution characteristics; dynamically; emulator; machine oriented languages; microcomputer architecture; microprocesses; microprogramming; paradigm; parallel hardware environment; parallel machine language; parallel processing; structured; virtual machines; virtual machines processing", sponsororg = "ACM", treatment = "A Application; T Theoretical or Mathematical", } @TechReport{Madnick:1974:AAV, author = "Stuart E. Madnick and John J. Donovan", title = "Application and analysis of the virtual machine approach to information system security and reliability", number = "722--74(2)", institution = "MIT Center for Information Systems Research", address = "Cambridge, MA, USA", pages = "25", year = "1974", LCCN = "HD28 .M414 no.722, 74; HD28.M414", bibdate = "Mon Apr 10 10:43:19 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; library.mit.edu:9909/mit01", series = "Sloan School of Management. Working paper; Massachusetts Institute of Technology. Alfred P. Sloan School of Management. Center for Information Systems Research. Report", acknowledgement = ack-nhfb, } @Manual{McCullough:1974:VMF, author = "Barbara McCullough", title = "{Virtual Machine Facility\slash 370} Features Supplement", organization = "IBM Corporation", address = "????", pages = "????", month = jan, year = "1974", bibdate = "Sat May 07 17:07:47 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "Publication GC20-1757.", acknowledgement = ack-nhfb, remark = "Varian \cite[p. 62]{Varian:1991:VVC} says of this manual: ``[it] was, in my view, the best manual IBM ever published.'' I have not yet been able to find this document online.", } @Article{Popek:1974:FRV, author = "Gerald J. Popek and Robert P. Goldberg", title = "Formal Requirements for Virtualizable Third Generation Architectures", journal = j-CACM, volume = "17", number = "7", pages = "412--421", month = jul, year = "1974", CODEN = "CACMA2", DOI = "https://doi.org/10.1145/800009.808061", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", MRclass = "68A05", MRnumber = "49 10177", MRreviewer = "I. Kaufmann", bibdate = "Mon Jan 22 07:13:00 MST 2001", bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib; http://dblp.uni-trier.de/db/journals/cacm/cacm17.html#PopekG74; 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, classcodes = "C5220 (Computer architecture); C7430 (Computer engineering)", classification = "722", corpsource = "Univ. California, Los Angeles, CA, USA", fjournal = "Communications of the ACM", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79", journalabr = "Commun ACM", keywords = "abstract model; architectures; computer architecture; computer operating systems; formal requirements; generation architecture; hypervisor; operating system; sufficient conditions; systems; third; third generation computer; virtual machine; virtual machine monitor; virtual machines; virtual memory; virtualizable third generation", oldlabel = "PopekG74", treatment = "A Application; P Practical", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/PopekG74", } @InCollection{Anonymous:1975:VM, author = "Anonymous", booktitle = "{KB11-C Processor Manual (PDP-11/70)}", title = "Virtual Machines", publisher = "Digital Equipment Corporation", address = "Maynard, MA, USA", pages = "I.2.4--I.2.10 (24--30)", year = "1975", LCCN = "????", bibdate = "Tue Jun 06 06:41:05 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://bitsavers.trailing-edge.com/pdf/dec/pdp11/1170/EK-KB11C-TM-001_1170procMan.pdf", acknowledgement = ack-nhfb, } @InProceedings{Bagley:1975:SDS, author = "John D. Bagley and E. R. Floto and S. C. Hsieh and V. Watson", title = "Sharing Data and Services in a Virtual Machine System", crossref = "ACM:1975:PFS", pages = "82--88", year = "1975", bibdate = "Sat Jan 27 15:11:04 MST 2001", bibsource = "http://dblp.uni-trier.de/db/conf/sosp/sosp75.html#BagleyFHW75; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", oldlabel = "BagleyFHW75", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#conf/sosp/BagleyFHW75", } @InProceedings{Belpaire:1975:FPR, author = "Gerald Belpaire and Nai-Ting Nsu", title = "Formal Properties of Recursive Virtual Machine Architectures", crossref = "ACM:1975:PFS", pages = "89--96", year = "1975", bibdate = "Sat Jan 27 15:11:08 MST 2001", bibsource = "http://dblp.uni-trier.de/db/conf/sosp/sosp75.html#BelpaireN75; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", oldlabel = "BelpaireN75", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#conf/sosp/BelpaireN75", } @Article{Callaway:1975:PMT, author = "Peter H. Callaway", title = "Performance Measurement Tools for {VM\slash 370}", journal = j-IBM-SYS-J, volume = "14", number = "2", pages = "134--160", year = "1975", CODEN = "IBMSA7", ISSN = "0018-8670", bibdate = "Wed Jan 08 16:35:07 1997", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "To support the smooth running of a Virtual Machine Facility\slash 370 (VM\slash 370) installation, performance measurements of various types are desirable. This paper describes a range of measurement facilities that have been developed for VM\slash 370 for use both on-line and off-line at the level of the users (general user, operator, and system analyst) and the installation management.", acknowledgement = ack-nhfb, classification = "723", fjournal = "IBM Systems Journal", journalabr = "IBM Syst J", keywords = "computer operating systems", } @Article{DeRemer:1975:PLV, author = "Frank DeRemer and Hans Kron", title = "Programming-in-the large versus programming-in-the-small", journal = j-SIGPLAN, volume = "10", number = "6", pages = "114--121", month = jun, year = "1975", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:13:49 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, classification = "C6110 (Systems analysis and programming); C6140 (Programming languages); C7430 (Computer engineering)", conflocation = "Los Angeles, CA, USA; 21--23 April 1975", conftitle = "International Conference on Reliable Software", corpsource = "Univ. of California, Santa Cruz, CA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", keywords = "compiler; fault tolerant computing; information hiding; large programs; module interconnection language; modules; programming; programming languages; small programs; software reliability; virtual machines; virtual machines languages", sponsororg = "IEEE; ACM; et al", treatment = "A Application; P Practical", } @Article{Donovan:1975:HAC, author = "John J. Donovan and S. E. Madnick", title = "Hierarchical Approach to Computer System Integrity", journal = j-IBM-SYS-J, volume = "14", number = "2", pages = "188--202", year = "1975", CODEN = "IBMSA7", ISSN = "0018-8670", bibdate = "Wed Jan 08 16:35:07 1997", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "See letters \cite{Chandersekaran:1976:FVM,Donovan:1976:FAR}.", abstract = "Security is an important factor if the programs of independent and possibly error-prone or malicious users are to coexist on the same computer system. In this paper, it is shown that a hierarchically structured operating system, such as produced by a virtual machine system, that combines a virtual machine monitor with several independent operating systems (VMM\slash OS), provides substantially better software security than a conventional two-level multiprogramming operating system approach. This added protection is derived from redundant security using independent mechanisms that are inherent in the design of most VMM\slash OS systems. Such a system can be obtained by exploiting existing software resources.", acknowledgement = ack-nhfb, classification = "723", fjournal = "IBM Systems Journal", journalabr = "IBM Syst J", keywords = "computer operating systems; computer systems programming --- Time Sharing Programs", } @InProceedings{Gaines:1975:ACV, author = "Brian R. Gaines", title = "Analogy Categories, Virtual Machines, and Structured Programming", crossref = "Muhlbacher:1975:GIF", pages = "691--699", year = "1975", bibdate = "Tue Jan 23 23:24:01 MST 2001", bibsource = "http://dblp.uni-trier.de/db/conf/gi/gi75.html#Gaines75; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", oldlabel = "Gaines75", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#conf/gi/Gaines75", } @Article{Infante:1975:PSP, author = "R. Infante and U. Montanari", title = "Proving structured programs correct, level by level", journal = j-SIGPLAN, volume = "10", number = "6", pages = "427--436", month = jun, year = "1975", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:13:49 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, classification = "C6110 (Systems analysis and programming)", conflocation = "Los Angeles, CA, USA; 21--23 April 1975", conftitle = "International Conference on Reliable Software", corpsource = "Olivetti, Ivrea, Italy", fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", keywords = "assertions; fault tolerant computing; level axioms; predicates; problem oriented data structures; problem oriented predicates; programming; structured programs correctness proof; theorem prover; virtual machines", sponsororg = "IEEE; ACM; et al", treatment = "A Application; P Practical", } @Article{Kamnitzer:1975:BXI, author = "Stephen H. Kamnitzer", title = "Bootstrapping {XPL} from {IBM\slash 360} to {UNIVAC 1100}", journal = j-SIGPLAN, volume = "10", number = "5", pages = "14--20", month = may, year = "1975", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:13:47 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, classification = "C6150C (Compilers, interpreters and other processors); C7430 (Computer engineering)", corpsource = "Sperry Univac, Cape Town, South Africa", fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", keywords = "compiler; IBM/360 to UNIVAC 1100 bootstrapping; program compilers; UNIVAC 1100 series computers; virtual machines; XPL Compiler Generator System", treatment = "A Application; P Practical", } @TechReport{Lamming:1975:LVM, author = "M. Lamming", title = "{LITL} Virtual machine. Fixed or Variable Size Blocks", number = "QMW-DCS-1975-085; QMW-DCS-1975-091", institution = "Queen Mary College, Department of Computer Science", month = jun, year = "1975", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract-URL = "http://www.dcs.qmw.ac.uk/publications/report_abstracts/1975/091; http://www.dcs.qmw.ac.uk/publications/report_abstracts/1975/085", scope = "misc", xxnote = "Check: Two reports or one??", } @InProceedings{Popek:1975:PVM, author = "Gerald J. Popek and Charles S. Kline", title = "The {PDP-11} Virtual Machine Architecture: a Case Study", crossref = "ACM:1975:PFS", pages = "97--105", year = "1975", bibdate = "Sat Jan 27 15:12:53 MST 2001", bibsource = "http://dblp.uni-trier.de/db/conf/sosp/sosp75.html#PopekK75; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", oldlabel = "PopekK75", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#conf/sosp/PopekK75", } @Article{Popek:1975:VPS, author = "Gerald J. Popek and Charles S. Kline", title = "A verifiable protection system", journal = j-SIGPLAN, volume = "10", number = "6", pages = "294--304", month = jun, year = "1975", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:13:49 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, classification = "C6110 (Systems analysis and programming); C6150J (Operating systems); C7430 (Computer engineering)", conflocation = "Los Angeles, CA, USA; 21--23 April 1975", conftitle = "International Conference on Reliable Software", corpsource = "Univ. of California, Los Angeles, CA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", keywords = "capability faulting; fault tolerant computing; fault tolerant computing faulting; flexible information sharing facilities; levels of kernels; multiuser operating system; operating systems (computers); program verification; programming; security kernels; security of data; systems analysis; UCLA Virtual Machine System; ultra high reliability protection; verifiable protection system; virtual machines; virtual memory", sponsororg = "IEEE; ACM; et al", treatment = "A Application; P Practical", } @Article{Saltzer:1975:PIC, author = "Jerome H. Saltzer and Michael D. Schroeder", title = "The Protection of Information in Computer Systems", journal = j-PROC-IEEE, volume = "63", number = "9", pages = "1278--1308", month = sep, year = "1975", CODEN = "IEEPAD", ISSN = "0018-9219 (print), 1558-2256 (electronic)", ISSN-L = "0018-9219", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.mediacity.com/~norm/CapTheory/ProtInf/", abstract = "This tutorial paper explores the mechanics of protecting computer-stored information from unauthorized use or modification. It concentrates on those architectural structures--whether hardware or software--that are necessary to support information protection. The paper develops in three main sections. Section I describes desired functions, design principles, and examples of elementary protection and authentication mechanisms. Any reader familiar with computers should find the first section to be reasonably accessible. Section II requires some familiarity with descriptor-based computer architecture. It examines in depth the principles of modern protection architectures and the relation between capability systems and access control list systems, and ends with a brief analysis of protected subsystems and protected objects. The reader who is dismayed by either the prerequisites or the level of detail in the second section may wish to skip to Section III, which reviews the state of the art and current research projects and provides suggestions for further reading.", added-by = "rah,sti", annote = "Part I: --- Basics --- Design Principles: economy of mechanism, fail-safe defaults, complete mediation, open design, separation of privilege, least privilege, least common mechanism, psychological acceptability. --- separate virtual machines with controlled communication Part II: --- Separation of addressing and protection --- capabilities --- access control lists", fjournal = "Proceedings of the IEEE", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5", } @Article{Williams:1975:CMI, author = "M. H. Williams and H. L. Ossher", title = "A computer model for instructional purposes", journal = j-COMP-J, volume = "18", number = "4", pages = "333--341", month = nov, year = "1975", CODEN = "CMPJA6", ISSN = "0010-4620 (print), 1460-2067 (electronic)", ISSN-L = "0010-4620", bibdate = "Tue Mar 25 13:51:56 MST 1997", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_04/", URL = "http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_04/tiff/333.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_04/tiff/334.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_04/tiff/335.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_04/tiff/336.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_04/tiff/337.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_04/tiff/338.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_04/tiff/339.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_04/tiff/340.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_04/tiff/341.tif", acknowledgement = ack-nhfb, classcodes = "C0220 (Computing education and training); C7810C (Computer-aided instruction)", classification = "721; 723; 901", corpsource = "Department of Computer Sci., Rhodes Univ., Rhodes, Grahamstown, South Africa", fjournal = "The Computer Journal", journal-URL = "http://comjnl.oxfordjournals.org/", keywords = "computer aided instruction; computer model; computer programming languages; computer science; computer simulator; computers; engineering education; instructional purposes; machine architecture; teaching; virtual machines", treatment = "A Application; P Practical", } @Article{Adix:1976:IER, author = "Mary S. Adix and Henrik A. Schutz", title = "Interpretive execution of real-time control applications", journal = j-SIGPLAN, volume = "11", number = "4", pages = "78--87", day = "1", month = apr, year = "1976", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:13:54 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, classification = "C6140D (High level languages); C6150C (Compilers, interpreters and other processors); C7430 (Computer engineering)", conflocation = "New Orleans, LA, USA; 4--6 March 1976", conftitle = "ACM SIGMIN/SIGPLAN Interface Meeting on Programming Systems in the Small Processor Environment", corpsource = "General Motors Res. Labs., Warren, MI, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", keywords = "interpretive execution; problem oriented languages; program interpreters; real time control application; space compaction; virtual machine language; virtual machines", sponsororg = "ACM", treatment = "A Application; P Practical", xxpages = "78--86", } @Article{Bagley:1976:SFM, author = "John D. Bagley", title = "Special feature: microprogrammable virtual machines", journal = j-COMPUTER, volume = "9", number = "2", pages = "38--42", month = feb, year = "1976", CODEN = "CPTRB4", ISSN = "0018-9162 (print), 1558-0814 (electronic)", ISSN-L = "0018-9162", bibdate = "Thu Dec 12 07:20:54 MST 1996", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "User alterable microprograms make it possible to tailor the architecture of the computer to the application domain but raises the problem of microprogram development and testing. The technique outlined provides a tool which furnishes the microprogrammer with a virtual machine which is microprogrammable. The function provided is similar to that provided by a simulator, but the technique is more efficient and allows multiple microprograms to be executed concurrently with regular programs on a single real machine.", acknowledgement = ack-nhfb, classification = "722; 723", fjournal = "Computer", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2", journalabr = "Computer", keywords = "computer architecture; computer simulation; computer systems programming --- testing", } @Article{Chandersekaran:1976:FVM, author = "C. S. Chandersekaran and K. S. Shankar", title = "Forum: On virtual machine integrity", journal = j-IBM-SYS-J, volume = "15", number = "3", pages = "264--269", year = "1976", CODEN = "IBMSA7", ISSN = "0018-8670", bibdate = "Tue Mar 19 17:38:46 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "See \cite{Donovan:1975:HAC,Donovan:1976:FAR}.", acknowledgement = ack-nhfb, fjournal = "IBM Systems Journal", } @Article{Donovan:1976:FAR, author = "J. J. Donovan and S. E. Madnick", title = "Forum: Authors' reply", journal = j-IBM-SYS-J, volume = "15", number = "3", pages = "270--278", year = "1976", CODEN = "IBMSA7", ISSN = "0018-8670", bibdate = "Tue Mar 19 17:38:46 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/ibmsysj.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "See \cite{Donovan:1975:HAC,Chandersekaran:1976:FVM}.", acknowledgement = ack-nhfb, fjournal = "IBM Systems Journal", } @TechReport{Donovan:1976:VMC, author = "John J. Donovan and Henry D. Jacoby", title = "Virtual machine communication for the implementation of decision support systems", number = "884--76(28)", institution = "MIT Center for Information Systems Research", address = "Cambridge, MA, USA", pages = "3 + 29", year = "1976", LCCN = "HD28 .M414 no.884-76; HD28.M414", bibdate = "Mon Apr 10 10:43:19 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; library.mit.edu:9909/mit01", acknowledgement = ack-nhfb, } @Article{Hamlet:1976:PBT, author = "Richard Hamlet", title = "The {PDP-11} as {B5500} in teaching systems programming", journal = j-SIGPLAN, volume = "11", number = "5", pages = "47--52", month = may, year = "1976", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:13:56 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, classification = "C0220 (Computing education and training); C6110 (Systems analysis and programming); C7430 (Computer engineering)", corpsource = "Department of Computer Sci., Univ. of Maryland, College Park, MD, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", keywords = "B5500; computer aided instruction; PDP 11; programming; SIMPL XI; systems programming; teaching; virtual machines", treatment = "P Practical", } @Manual{IBM:1976:GIS, author = "{IBM}", title = "A Guide to the {IBM System\slash 370 Model 168} for {System\slash 370 Model 165} Users", organization = pub-IBM, address = pub-IBM:adr, edition = "Fourth", month = sep, year = "1976", bibdate = "Sat Jan 09 06:36:39 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "Publication GC20-1755-3. See Section 40, Virtual Machines, pages 86--95.", URL = "http://www.bitsavers.org/pdf/ibm/370/model168/GC20-1755-3_A_Guide_to_the_IBM_System_370_Model_168_for_Model_165_Users_Sep76.pdf", acknowledgement = ack-nhfb, } @Manual{IBM:1976:IVM, author = "{IBM}", title = "{IBM Virtual Machine Facility\slash 370}: Introduction", organization = "IBM Corporation", address = "Poughkeepsie, NY, USA", edition = "Seventh", pages = "54", month = oct, year = "1976", bibdate = "Sat May 07 17:19:26 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "Order Number GC20-1800-6", URL = "http://bitsavers.trailing-edge.com/pdf/ibm/370/VM_370/Release_3/GC20-1800-6_VM370_Introduction_Rel_3_Oct76.pdf", acknowledgement = ack-nhfb, } @Article{Suski:1976:AGC, author = "Gregory J. Suski", title = "Automatic generation of computer graphics languages", journal = j-SIGPLAN, volume = "11", number = "6", pages = "113--122", month = jun, year = "1976", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:13:57 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, classification = "C5540 (Terminals and graphic displays); C6140D (High level languages); C7430 (Computer engineering)", conflocation = "Miami Beach, FL, USA; 26--27 April 1976", conftitle = "Symposium on Graphic Languages", corpsource = "Northwestern Univ., Evanston, IL, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", keywords = "computer graphics; computer graphics languages; language generation system; LGS; mechanical language generation; programming languages; virtual machines", sponsororg = "ACM", treatment = "P Practical", } @TechReport{Taylor:1976:RRH, author = "John McMay Taylor", title = "Redundancy and recovery in the {HIVE} virtual machine", type = "Report", number = "76010", institution = "Procurement executive, Ministry of Defence, Royal Signals and Radar Establishment", address = "London, UK", year = "1976", LCCN = "1966", bibdate = "Mon Apr 10 10:43:15 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; library.ox.ac.uk:210/ADVANCE", acknowledgement = ack-nhfb, } @Article{Wallace:1976:SGI, author = "Victor L. Wallace", title = "The semantics of graphic input devices", journal = j-SIGPLAN, volume = "11", number = "6", pages = "61--65", month = jun, year = "1976", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:13:57 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, classification = "C5540 (Terminals and graphic displays); C7430 (Computer engineering)", conflocation = "Miami Beach, FL, USA; 26--27 April 1976", conftitle = "Symposium on Graphic Languages", corpsource = "Department of Computer Sci., Univ. of North Carolina, Chapel Hill, NC, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", keywords = "computer graphics; graphic input devices; interactive input; interactive terminals; primitive, nonprimitives; semantics; virtual devices; virtual machines", sponsororg = "ACM", treatment = "P Practical", } @Article{Chow:1977:ASP, author = "We-Min Chow and W. W. Chiu", title = "An Analysis of Swapping Policies in Virtual Storage Systems", journal = j-IEEE-TRANS-SOFTW-ENG, volume = "SE-3", number = "2", pages = "150--156", month = mar # "\slash " # apr, year = "1977", CODEN = "IESEDJ", DOI = "https://doi.org/10.1109/TSE.1977.229906", ISSN = "0098-5589 (print), 1939-3520 (electronic)", ISSN-L = "0098-5589", bibdate = "Thu Feb 1 08:07:37 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranssoftweng1970.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=1702417", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Software Engineering", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=32", } @Article{Donovan:1977:VMC, author = "John J. Donovan and Henry D. Jacoby", title = "Virtual Machine Communication for the Implementation of Decision Support Systems", journal = j-IEEE-TRANS-SOFTW-ENG, volume = "SE-3", number = "5", pages = "333--342", month = sep, year = "1977", CODEN = "IESEDJ", DOI = "https://doi.org/10.1109/TSE.1977.231158", ISSN = "0098-5589 (print), 1939-3520 (electronic)", ISSN-L = "0098-5589", bibdate = "Tue Jan 23 05:54:52 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/tse/tse3.html#DonovanJ77; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", annote = "incomplete", fjournal = "IEEE Transactions on Software Engineering", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=32", oldlabel = "DonovanJ77", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/tse/DonovanJ77", } @Article{Flink:1977:EOS, author = "Charles W. Flink", title = "{EASY} --- an operating system for the {QM-1}", journal = j-SIGMICRO, volume = "8", number = "3", pages = "7--14", month = sep, year = "1977", CODEN = "SIGMDJ", DOI = "https://doi.org/10.1145/1014196.803310", ISSN = "0163-5751, 1050-916X", ISSN-L = "0163-5751", bibdate = "Fri Apr 16 10:27:21 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigmicro.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1145/1014196.803310", abstract = "The Emulation Aid SYstem is a virtual machine monitor for the Nanodata QM-1 microprogrammable computer. The system is designed to provide the user with an interactive interface for the development and subsequent use of emulations on the QM-1. EASY provides integrated support for: (1) interactive control of multiple, concurrently resident, virtual computers implemented via emulation, (2) input/output from emulations (virtual I/O) to the various real peripherals of the QM-1, and (3) diagnostic displays for debugging of both the emulations and the software running on the emulated computers. EASY is implemented at three distinct levels: the majority of the system software is programmed in a high-level language (SIMPL-Q); this (service) software, in turn, executes on an emulated intermediate language machine (also called EASY); the EASY machine executes as the highest priority task under a microprogrammed operating system kernel (called TASK). Via EASY the user currently has access to several previously developed emulations. EASY is the host system for ongoing emulator development at the Navy's Dahlgren Laboratory.", acknowledgement = ack-nhfb, fjournal = "ACM SIGMICRO Newsletter", journal-URL = "https://dl.acm.org/loi/sigmicro", } @Book{Hartmann:1977:CPC, author = "A. C. Hartmann", key = "Hartmann", title = "A Concurrent Pascal Compiler for MiniComputers", publisher = pub-SV, address = pub-SV:adr, year = "1977", bibdate = "Fri Jul 27 13:37:33 1984", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", annote = "This book describes a seven pass compiler for Per Brinch Hansen's Concurrent Pascal programming language. It requires 16,500 16-bit words of storage on a PDP-11/45 computer, and compiles source text at the rate of 240 characters per second (about 9--10 lines per second). It generates code for an ideal virtual machine that is simulated by a real machine. The compiler is written in sequential Pascal and is easily transported to other machines. [from the preface] The compiler comprises seven passes: lexical analysis, syntax analysis, name analysis, declaration analysis, body analysis, code selection, and code assembly. After an introduction and a chapter on each of the passes, there are chapters on interpass topics, the virtual machine, and implementation details. An appendix provides syntax graphs for all the intermediate languages, as well as the input and final code languages. The seven-pass compiler has been running on a PDP-ll/45 at CalTech since Jan 1975. Each pass is described along with the virtual code that is output by the last pass. The syntax graphs for each of the passes is also given.", keywords = "Concurrent Pascal", } @Article{Huxtable:1977:HSI, author = "D. H. R. Huxtable and J. M. M. Pinkerton", title = "The hardware\slash software interface of the {ICL} 2900 range of computers", journal = j-COMP-J, volume = "20", number = "4", pages = "290--295", month = nov, year = "1977", CODEN = "CMPJA6", ISSN = "0010-4620 (print), 1460-2067 (electronic)", ISSN-L = "0010-4620", bibdate = "Tue Mar 25 13:51:56 MST 1997", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www3.oup.co.uk/computer_journal/hdb/Volume_20/Issue_04/", URL = "http://www3.oup.co.uk/computer_journal/hdb/Volume_20/Issue_04/tiff/290.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_20/Issue_04/tiff/291.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_20/Issue_04/tiff/292.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_20/Issue_04/tiff/293.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_20/Issue_04/tiff/294.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_20/Issue_04/tiff/295.tif", acknowledgement = ack-nhfb, classcodes = "C5220 (Computer architecture); C6150 (Systems software)", classification = "722; 723", corpsource = "International Computers Ltd., Bracknell, UK", fjournal = "The Computer Journal", journal-URL = "http://comjnl.oxfordjournals.org/", keywords = "architecture; computer architecture; computer software; computer systems, digital; concurrent execution; hardware features; ICL 2900; independent processes; instruction set; interference; mutual; protection arrangements; support system software; virtual machines", treatment = "P Practical", } @Article{Keedy:1977:OIS, author = "J. L. Keedy", title = "An Outline of the {ICL} 2900 Series System Architecture", journal = j-AUSTRALIAN-COMP-J, volume = "9", number = "2", pages = "53--62", year = "1977", CODEN = "ACMJB2", ISSN = "0004-8917", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "The system architecture of the ICL 2900 Series is outlined informally. Its central feature, the virtual machine concept, is described and related to virtual storage, segmentation and paging. The procedural approach is then discussed and its implementation by a stack mechanism is described. Further sections outline the protection mechanisms, and the instruction set and related features. Finally the virtual machine approach is related to global system activities. This paper has been written such that it may be of interest to readers without a specialist knowledge of computer archi tecture.", fjournal = "Australian Computer Journal", keywords = "Computer Architecture, ICL 2900 series, Virtual memory, descriptors, segmentation, Paging, Procedural stacks, Protection. 6.21, 4.32.", } @MastersThesis{Wilding-White:1977:MBI, author = "Arthur Llewellyn Wilding-White", title = "A microprocessor {BCPL} implementation based on a virtual stack machine", type = "Thesis ({B.S.})", school = "Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology", address = "Cambridge, MA, USA", pages = "143", year = "1977", bibdate = "Mon Apr 10 10:43:19 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; library.mit.edu:9909/mit01", note = "Supervised by Stephen A. Ward.", acknowledgement = ack-nhfb, subject = "Microprocessors; BCPL (Computer program language); Virtual computer systems", } @Article{Armstrong:1978:PPC, author = "J. L. Armstrong", title = "Programming a Parallel Computer for Robot Vision", journal = j-COMP-J, volume = "21", number = "3", pages = "215--218", month = aug, year = "1978", CODEN = "CMPJA6", ISSN = "0010-4620 (print), 1460-2067 (electronic)", ISSN-L = "0010-4620", bibdate = "Tue Mar 25 13:51:56 MST 1997", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_03/", URL = "http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_03/tiff/215.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_03/tiff/216.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_03/tiff/217.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_21/Issue_03/tiff/218.tif", abstract = "Work a Edinburgh has directed itself towards the automatic recognition and inspection of objects in an industrial environment using a television camera. A particular need for such systems arises in the context of numerically controlled machine tools. FORTRAN emulators of the CLIP array processor have enabled preliminary tests to be made of a parallel approach to removing noise and extracting primitive features from digitized pictures.", acknowledgement = ack-nhfb, classcodes = "C3355C (Control applications in machining processes and machine tools); C3355 (Control applications in manufacturing processes); C6110 (Systems analysis and programming); C7420 (Control engineering computing)", classification = "721; 723; 731; 741", corpsource = "Machine Intelligence Res. Unit, Univ. of Edinburgh, Edinburgh, UK", fjournal = "The Computer Journal", journal-URL = "http://comjnl.oxfordjournals.org/", keywords = "automatic recognition; camera; CLIP array processor; computer programming; computerised pattern recognition; computerised picture; emulators; FORTRAN; industrial environment; industrial robots; inspection of objects; numerical control; numerically controlled machine tools; parallel approach; parallel computer; parallel processing; processing; programming; robot vision; robots; television; virtual machines; vision --- Computer Applications", treatment = "T Theoretical or Mathematical", } @Article{Bard:1978:AMV, author = "Y. Bard", title = "An analytic model of the {VM\slash 370} system", journal = j-IBM-JRD, volume = "22", number = "5", pages = "498--508", month = sep, year = "1978", CODEN = "IBMJAE", ISSN = "0018-8646 (print), 2151-8556 (electronic)", ISSN-L = "0018-8646", bibdate = "Mon Feb 12 09:58:53 MST 2001", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", ZMnumber = "382.68033", abstract = "An Analytic model is described of an interactive multiprogrammed computer system. The model accepts a multiple-user-class, transaction-oriented workload description and a system configuration description, and it produces predictions of resource utilizations, transaction rates, and average transaction response times. The solution method involves nearly complete decomposition, with a closed queuing network representing the multiprogrammed set. Asymptotic formulas are used to generate good initial guesses for an overall iterative scheme. Extensive validation results are presented.", acknowledgement = ack-nhfb, classcodes = "C6150J (Operating systems)", classification = "722; 723", corpsource = "Cambridge Sci. Center, IBM, Cambridge, MA, USA", fjournal = "IBM Journal of Research and Development", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520", journalabr = "IBM J Res Dev", keywords = "analytic model; average; closed queuing network; computer performance prediction; computer selection and evaluation; computer systems programming --- Multiprogramming; computer systems, digital; interactive multiprogrammed computer; interactive systems; iterative scheme; multiprogrammed set model; multiprogramming; resource utilizations; system; transaction rates; transaction response times; validation; virtual machines; virtual storage; VM/370", treatment = "A Application", } @Article{Comaa:1978:SGP, author = "H. Comaa and J. Kramer and B. K. Penney", title = "A student group project in operating system implementation", journal = j-SIGCSE, volume = "10", number = "1", pages = "197--202", month = feb, year = "1978", CODEN = "SIGSD3", DOI = "https://doi.org/10.1145/990654.990624", ISSN = "0097-8418 (print), 2331-3927 (electronic)", ISSN-L = "0097-8418", bibdate = "Sun Nov 18 07:38:04 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigcse1970.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "Papers of the SIGCSE\slash CSA Technical Symposium on Computer Science Education.", abstract = "A student operating system project is described. It provides students, working in groups of 4 or 5, with some insight into the design and organisation problems of constructing a fairly large and complex piece of software. The students design and implement the Nucleus of a multiprogramming system which runs under the control of a VM/CMS virtual machine. Aspects of the project structure and its organisation are discussed.", acknowledgement = ack-nhfb, fjournal = "SIGCSE Bulletin (ACM Special Interest Group on Computer Science Education)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J688", } @Article{Cremers:1978:FMV, author = "Armin B. Cremers and Thomas N. Hibbard", title = "Formal Modeling of Virtual Machines", journal = j-IEEE-TRANS-SOFTW-ENG, volume = "SE-4", number = "5", pages = "426--436", month = sep, year = "1978", CODEN = "IESEDJ", DOI = "https://doi.org/10.1109/TSE.1978.233862", ISSN = "0098-5589 (print), 1939-3520 (electronic)", ISSN-L = "0098-5589", bibdate = "Tue Jan 23 05:53:37 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/tse/tse4.html#CremersH78; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", annote = "incomplete", fjournal = "IEEE Transactions on Software Engineering", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=32", oldlabel = "CremersH78", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/tse/CremersH78", } @Manual{Forum:1978:VMI, author = "IBM (Forum)", title = "On Virtual Machine Integrity", year = "1978", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", } @Article{Kumar:1978:PEH, author = "B. Kumar and Edward S. Davidson", title = "Performance Evaluation of Highly Concurrent Computers by Deterministic Simulation", journal = j-CACM, volume = "21", number = "11", pages = "904--913", month = nov, year = "1978", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:56:38 MST 2001", bibsource = "Compendex database; http://dblp.uni-trier.de/db/journals/cacm/cacm21.html#KumarD78; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Simulation is presented as a practical technique for performance evaluation of alternative configurations of highly concurrent computers. A technique is described for constructing a detailed deterministic simulation model of a system. In the model a control stream replaces the instruction and data streams of the real system. Simulation of the system model yields the timing resource usage statistics needed for performance evaluation, without the necessity of emulating the system. As a case study, the implementation of a simulation of a model of the CPU-memory subsystem of the IBM 360\slash 191 is described. The results of evaluating some alternative system designs are discussed. The experiments reveal that, for the case study, the major bottlenecks in the system are the memory unit and the fixed point unit. Further, it appears that many of the sophisticated pipelining and buffering techniques implemented in the architecture of the IBM 360\slash 91 are of little value when high-speed (cache) memory is used, as in the IBM 360\slash 195.", acknowledgement = ack-nhfb, classcodes = "C5220 (Computer architecture); C6150G (Diagnostic, testing, debugging and evaluating systems); C7430 (Computer engineering)", classification = "722; 723", corpsource = "Univ. of Illinois, Urbana, IL, USA", fjournal = "Communications of the ACM", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79", journalabr = "Commun ACM", keywords = "computer selection and evaluation; computer systems, digital; CPU memory subsystem; deterministic simulation; highly concurrent computers; IBM 360/91; multiprocessing systems; performance evaluation; virtual machines", oldlabel = "KumarD78", treatment = "P Practical", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/KumarD78", } @Article{Malik:1978:DOH, author = "Kamran Malik and Ted Lewis", title = "Design objectives for high level microprogramming languages", journal = j-SIGMICRO, volume = "9", number = "4", pages = "154--160", month = dec, year = "1978", CODEN = "SIGMDJ", DOI = "https://doi.org/10.1145/1014198.804325", ISSN = "0163-5751, 1050-916X", ISSN-L = "0163-5751", bibdate = "Fri Apr 16 10:27:23 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigmicro.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1145/1014198.804325", abstract = "The primitive operations of a high level language for producing emulators is shown to include special purpose features specific to virtual machine implementation. A Hierarchy of data types, short reliable language constructs, and control structures that \ldots{}", acknowledgement = ack-nhfb, fjournal = "ACM SIGMICRO Newsletter", journal-URL = "https://dl.acm.org/loi/sigmicro", } @Article{Olbert:1978:ECP, author = "Arthur G. Olbert", title = "Extended control program support: {VM\slash 370}: a hardware assist for the {IBM Virtual Machine Facility\slash 370}", journal = j-SIGMICRO, volume = "9", number = "3", pages = "8--25", month = sep, year = "1978", CODEN = "SIGMDJ", DOI = "https://doi.org/10.1145/1096532.1096534", ISSN = "0163-5751, 1050-916X", ISSN-L = "0163-5751", bibdate = "Fri Apr 16 10:27:23 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigmicro.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1145/1096532.1096534", abstract = "ECPS:VM/370 is a hardware assist of the VM/370 software control program. ECPS:VM/370 provides improved performance for the software system through a combination of hardware assist technologies. The assist provides hardware support for virtual machine \ldots{}", acknowledgement = ack-nhfb, fjournal = "ACM SIGMICRO Newsletter", journal-URL = "https://dl.acm.org/loi/sigmicro", } @TechReport{Renaud:1978:UVM, author = "D. J. Renaud", title = "The {UT} Virtual Machine Monitor", type = "Technical Report", number = "CS-TR-78-78", institution = "University of Texas at Austin, Department of Computer Sciences", address = "Austin, TX, USA", day = "1", month = may, year = "1978", bibdate = "November 24, 98", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "Wed, 23 Jun 104 21:38:33 GMT", URL = "ftp://ftp.cs.utexas.edu/pub/techreports/tr78-78a.pdf; ftp://ftp.cs.utexas.edu/pub/techreports/tr78-78b.pdf", } @Article{Attanasio:1979:VCS, author = "C. R. Attanasio", title = "Virtual Control Storage --- Security Measures in {VM\slash 370}", journal = j-IBM-SYS-J, volume = "18", number = "1", pages = "93--110", year = "1979", CODEN = "IBMSA7", ISSN = "0018-8670", bibdate = "Wed Jan 08 16:35:07 1997", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "An experimental extension to VM\slash 370 is described whereby a distinct execution and data domain (Virtual Control Storage) is made available to virtual machines that require access to a resource manager, without requiring a change in the scheduling unit. Thus scheduling overhead and delays are avoided when transition is made between user program and resource manager. A mechanism is described for exchanging data between execution domains by means of address-space mapping.", acknowledgement = ack-nhfb, classification = "722; 723", fjournal = "IBM Systems Journal", journalabr = "IBM Syst J", keywords = "computer systems, digital", } @InProceedings{Canon:1979:VME, author = "M. D. Canon and D. H. Fritz and John H. Howard and T. D. Howell and Michael F. Mitoma and Juan Rodriguez-Rossel", booktitle = "Proceedings of the 7th ACM Symposium on Operating Systems Principles (SOSP)", title = "A Virtual Machine Emulator for Performance Evaluation (Summary)", publisher = pub-ACM, address = pub-ACM:adr, pages = "1--??", year = "1979", CODEN = "OSRED8", ISSN = "0163-5980 (print), 1943-586X (electronic)", bibdate = "Sat Jan 27 15:11:21 MST 2001", bibsource = "http://dblp.uni-trier.de/db/conf/sosp/sosp79.html#CanonFHHMR79; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", series = j-OPER-SYS-REV, oldlabel = "CanonFHHMR79", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#conf/sosp/CanonFHHMR79", } @PhdThesis{Halstead:1979:RTN, author = "R. H. Halstead", key = "Halstead", title = "Reference Tree Networks: Virtual Machine and Implementation", type = "Thesis ({Ph.D.})", school = "Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology", address = "Cambridge, MA, USA", pages = "252", year = "1979", bibdate = "Wed Nov 5 09:49:44 1986", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "Also issued as Technical Report MIT/LCS/TR-222.", abstract = "A current-technology computing machine may be roughly decomposed into a processor, a memory, and a data path connecting them. The interposition of this data path between processing and storage elements creates a bottleneck, which inhibits progress at the high-performance end of the technological spectrum. Additionally, the monolithic nature of present-day processors resists incremental addition or removal of processing power. The research described here attacks the problem of constructing more powerful and more flexible computer systems along three fronts: the definition of a virtual machine providing for parallel computation using objects and object references, the development of a distributed implementation mechanism ({"reference} {trees"}) supporting object management functions including garbage collection, and the reinvestigation of scheduling algorithms and collection performance results. A reference tree network using these concepts is composed of a multitude of independent small processors, yet operates as a coherent programming system. Programs and data spread automatically and transparently through the network to occupy underused resources. The modular structure of the network provides many parallel data paths as well as allowing for easy addition or removal of modules, thus addressing some of the problems discussed above. A prototype reference tree network, the MuNet, is currently in operation. {AD A076-570}", notes = "Cost is \$26. Keywords: message passing, distributed computing, multiprocessor systems, distributed object management, networks", owner = "seufert", } @Article{Hartung:1979:VE, author = "R. L. Hartung and A. Ammerman", title = "Virtual {I/O}, an experiment", journal = j-SIGMICRO, volume = "10", number = "4", pages = "109--113", month = dec, year = "1979", CODEN = "SIGMDJ", DOI = "https://doi.org/10.1145/1014188.803019", ISSN = "0163-5751, 1050-916X", ISSN-L = "0163-5751", bibdate = "Fri Apr 16 10:27:25 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigmicro.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1145/1014188.803019", abstract = "This paper describes an experiment in virtualizing Input/Output (I/O) for allowing new I/O technologies, such as ARPANET, to replace old hardwired interface disciplines. This was accomplished using micro-programmable host machines, emulation, and \ldots{}", acknowledgement = ack-nhfb, fjournal = "ACM SIGMICRO Newsletter", journal-URL = "https://dl.acm.org/loi/sigmicro", } @Article{Hendricks:1979:EVM, author = "Edson C. Hendricks and Timothy C. Hartmann", title = "Evolution of a Virtual Machine Subsystem", journal = j-IBM-SYS-J, volume = "18", number = "1", pages = "111--142", year = "1979", CODEN = "IBMSA7", ISSN = "0018-8670", bibdate = "Mon Jan 22 13:25:19 MST 2001", bibsource = "Compendex database; http://dblp.uni-trier.de/db/journals/ibmsj/ibmsj18.html#HendricksH79; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Early investigation of virtual machine subsystem flexibility centered on telecommunications support and intercomputer networking and proceeded in two phases. The first phase focused on an experimental program for the virtual machine control program CP-67 that supported remote work stations and pioneered intercomputer spool communications. The results of that effort inspired a second effort in the same area with some significant redirection. This second phase ultimately led to the remote spooling communications subsystem component of VM\slash 370, the VM\slash 370 networking package (VNET), and a large network of interactive computer systems within IBM. These phases are discussed along with suggestions for several continuing lines of work based on current results.", acknowledgement = ack-nhfb, classification = "722; 723", fjournal = "IBM Systems Journal", journalabr = "IBM Syst J", keywords = "computer systems, digital", oldlabel = "HendricksH79", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/ibmsj/HendricksH79", } @Article{Jensen:1979:FAC, author = "Richard M. Jensen", title = "A Formal Approach for Communication Between Logically Isolated Virtual Machines", journal = j-IBM-SYS-J, volume = "18", number = "1", pages = "71--92", year = "1979", CODEN = "IBMSA7", ISSN = "0018-8670", bibdate = "Mon Jan 22 13:25:57 MST 2001", bibsource = "Compendex database; http://dblp.uni-trier.de/db/journals/ibmsj/ibmsj18.html#Jensen79; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "The growing use of the virtual machine concept has resulted in the necessity for communication between the virtual machines. The design and operation of the Virtual Machine Communication Facility is discussed as an approach to offering such communication. The facility is an interface allowing a logical connection between two or more virtual machines. Potential applications for this facility conclude the discussion.", acknowledgement = ack-nhfb, classification = "723", fjournal = "IBM Systems Journal", journalabr = "IBM Syst J", keywords = "computers, digital", oldlabel = "Jensen79", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/ibmsj/Jensen79", } @Article{Kobayashi:1979:SMC, author = "Y. Kobayashi and T. L. Kunii", title = "A simulation of a minicomputer controlled system and its use as a debugging tool", journal = j-COMP-J, volume = "22", number = "1", pages = "41--49", month = feb, year = "1979", CODEN = "CMPJA6", ISSN = "0010-4620 (print), 1460-2067 (electronic)", ISSN-L = "0010-4620", bibdate = "Tue Mar 25 13:51:56 MST 1997", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www3.oup.co.uk/computer_journal/hdb/Volume_22/Issue_01/", URL = "http://www3.oup.co.uk/computer_journal/hdb/Volume_22/Issue_01/tiff/41.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_22/Issue_01/tiff/42.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_22/Issue_01/tiff/43.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_22/Issue_01/tiff/44.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_22/Issue_01/tiff/45.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_22/Issue_01/tiff/46.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_22/Issue_01/tiff/47.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_22/Issue_01/tiff/48.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_22/Issue_01/tiff/49.tif", acknowledgement = ack-nhfb, classcodes = "C6150G (Diagnostic, testing, debugging and evaluating systems)", classification = "722; 723", corpsource = "Univ. of Tokyo, Tokyo, Japan", fjournal = "The Computer Journal", journal-URL = "http://comjnl.oxfordjournals.org/", keywords = "computer programming languages --- Program Debugging; computer simulation; computerised control; computers, miniature; debugging real programs; mechanism; minicomputer controlled system; program debugging; simulation; time flow; virtual machines", treatment = "P Practical", } @Article{MacKinnon:1979:CVM, author = "Richard A. MacKinnon", title = "The Changing Virtual Machine Environment: Interfaces to Real Hardware, Virtual Hardware, and Other Virtual Machines", journal = j-IBM-SYS-J, volume = "18", number = "1", pages = "18--46", year = "1979", CODEN = "IBMSA7", ISSN = "0018-8670", bibdate = "Mon Jan 22 13:27:26 MST 2001", bibsource = "Compendex database; http://dblp.uni-trier.de/db/journals/ibmsj/ibmsj18.html#MacKinnon79; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "A survey is presented of changes to virtual machine interfaces, implementation, architecture, and simulation techniques as they affect IBM System\slash 370 and 303X (3031, 3032, 3033) processors, the system control program to which virtual machines interface, and other virtual machines executing on the same real computing system or elsewhere. New uses of virtual machine subsystems are discussed as they relate to inter-virtual-machine communication.", acknowledgement = ack-nhfb, classification = "722; 723", fjournal = "IBM Systems Journal", journalabr = "IBM Syst J", keywords = "computer systems, digital", oldlabel = "MacKinnon79", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/ibmsj/MacKinnon79", } @TechReport{Moore:1979:IVM, author = "J. S. Moore II", title = "The {InterLISP} Virtual Machine Specification", type = "Report", number = "CSL 76-5", institution = "Xerox, Palo Alto Research Center (PARC)", address = "Palo Alto, CA, USA", year = "1979", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "Sep. 1976, Rvsd. March 1979", keywords = "LISP", } @Article{Parnas:1979:DSE, author = "D. L. Parnas", key = "Parnas", title = "Designing Software for Ease of Expansion and Contraction", journal = j-IEEE-TRANS-SOFTW-ENG, volume = "SE-5", number = "2", pages = "128--138", month = mar, year = "1979", CODEN = "IESEDJ", DOI = "https://doi.org/10.1109/TSE.1979.234169", ISSN = "0098-5589 (print), 1939-3520 (electronic)", ISSN-L = "0098-5589", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", annote = "Focuses on design of software that can be subseted and expanded. Families of programs sharing subsets of modules. Loops in the 'uses' relation should be avoided. Minimal program subset and minimal increments. Virtual machines, modules, uses relation. Criteria for letting a module use another module. Example. 21 references.", fjournal = "IEEE Transactions on Software Engineering", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=32", } @Article{Rajaraman:1979:PPV, author = "M. K. Rajaraman", title = "Performance prediction of a virtual machine", journal = j-SIGMETRICS, volume = "8", number = "1--2", pages = "57--62", month = "Spring-Summer", year = "1979", CODEN = "????", DOI = "https://doi.org/10.1145/1041853.1041858", ISSN = "0163-5999 (print), 1557-9484 (electronic)", ISSN-L = "0163-5999", bibdate = "Thu Jun 26 10:53:30 MDT 2008", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Modeling and simulation of computer systems have two main objectives. First, to evaluate the performance of a given configuration of a machine and second, to derive a mechanism for prediction of performance when configuration parameters change. This paper addresses the second issue and reports the result of a recent investigation of a Virtual Memory Computer. The results indicate which variables or combination of variables have significant effect on the performance and which do not.", acknowledgement = ack-nhfb, fjournal = "ACM SIGMETRICS Performance Evaluation Review", journal-URL = "http://portal.acm.org/toc.cfm?id=J618", } @TechReport{Abramson:1980:WGL, author = "Harvey Abramson", title = "Why Is a Goto Like a Dynamic Vector in the {BCPL-Slim} Computing System", type = "Technical Report", number = "TR-80-09", institution = "Department of Computer Science, University of British Columbia", month = nov, year = "1980", bibdate = "July 21, 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "Mon, 21 Jul 1997 19:29:13 GMT", abstract = "The Slim computer is a new virtual machine which can be used in the translation and porting of the BCPL compiler, and eventually, in the porting of an operating system written in BCPL. For the purposes of this paper, the Slim computer is a stack machine with a single accumulator and a register which points to the top of the stack. The procedures LEVEL and LONGJUMP, traditionally used to implement transfers of control across BCPL procedures, and which are usually written in the assembler language of a host machine, cannot be used with this architecture. In developing procedures to implement \underline{all} transfers of control, we show how these essential procedures --- though highly dependent on the Slim architecture --- can be written portably in BCPL, and discover an interesting connection between implementing jumps and dynamic vectors (by means of Aptovec) in the BCPL-Slim computing system. Some parameters of portability in rapping an abstract machine to host machines are identified, and it is shown how to maintain the portability of the above mentioned procedures in the face of various mapping problems. Finally, we are led to a comment on the design of BCPL to the effect that \underline{goto}'s are an unnecessary feature of the language.", } @Article{Canon:1980:VME, author = "M. D. Canon and D. H. Fritz and John H. Howard and T. D. Howell and Michael F. Mitoma and Juan Rodriguez-Rossel", title = "A Virtual Machine Emulator for Performance Evaluation", journal = j-CACM, volume = "23", number = "2", pages = "71--80", year = "1980", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:29:30 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm23.html#CanonFHHMR80; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79", oldlabel = "CanonFHHMR80", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/CanonFHHMR80", } @InCollection{Dommergaard:1980:DVM, author = "O. Dommergaard", key = "Dommergaard80", booktitle = "Abstract Software Specifications", title = "The Design of a Virtual Machine for {Ada}", publisher = pub-SV, address = pub-SV:adr, pages = "463--605", year = "1980", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", annote = "Derives the design and formalizes the architecture of a virtual machine for efficient execution of Ada programs. This, the so-called A-code machine, is then the basis for a compiling algorithm specification.", } @TechReport{Dommergaard:1980:FDP, author = "S. Bodilsen O. Dommergaard", key = "Dommergaard\&80", title = "A Formal Definition of {P}-Code", institution = "Department of Comp. Sci.", address = "Techn. Univ. of Denmark", year = "1980", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", annote = "Like \cite{Dommergaard80a} this formalizes a(nother) virtual machine, that of P-Code, for efficient execution of Pascal programs.", } @Article{Groves:1980:DVM, author = "L. J. Groves and W. J. Rogers", title = "The design of a virtual machine for {Ada}", journal = j-SIGPLAN, volume = "15", number = "11", pages = "223--234", month = nov, year = "1980", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:14:31 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, classification = "C6130 (Data handling techniques); C6140D (High level languages); C6150C (Compilers, interpreters and other processors); C6150J (Operating systems)", conflocation = "Boston, MA, USA; 9--11 Dec. 1980", conftitle = "Proceedings of the ACM-SIGPLAN Symposium on the Ada Programming Language", corpsource = "Univ. of Waikato, Hamilton, New Zealand", fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", keywords = "Ada; addressing; blocks; compiler portability; control flow; data handling; data storage; exceptions; generating code; machine-independent translator; manipulation; program compilers; program interpreters; storage allocation; storage structure; subprograms; task handling; virtual machine; virtual machines", treatment = "A Application", } @Article{Kent:1980:PNV, author = "S. A. Kent", title = "A Programmable Network Virtual Machine", journal = j-COMP-NET, volume = "4", number = "3", pages = "125--137", month = jun, year = "1980", CODEN = "CNETDP", ISSN = "0376-5075 (print), 1878-3120 (electronic)", ISSN-L = "0376-5075", bibdate = "Tue Jan 23 07:26:10 MST 2001", bibsource = "Compendex database; http://dblp.uni-trier.de/db/journals/cn/cn4.html#Kent80; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, affiliation = "Univ Coll, London, Engl", annote = "The increasing diversity of resources which is becoming available to users through the introduction of computer networks has opened up new areas of investigation. One of the problems encountered is that of providing uniform and common access procedures where functionally similar facilities exist on different systems. \ldots{} One approach to solving these problems is to create an agent that is able both to automate remote access procedures on the \ldots{}", classification = "722; 723", descriptors = "Computer network; design; access control; network management", enum = "1638", fjournal = "Computer Networks", journalabr = "Comput Networks", keywords = "computer networks; computers, digital", location = "RWTH-AC-DFV: Bibl.", oldlabel = "Kent80", references = "36", revision = "14/01/92", WARNING = "Additional, or modified, lettercase-preserving braces are likely to be required in title and booktitle fields.", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cn/Kent80", } @Article{Kerridge:1980:STC, author = "J. M. Kerridge and N. Willis", title = "A simulator for teaching computer architecture", journal = j-SIGCSE, volume = "12", number = "2", pages = "65--71", month = jul, year = "1980", CODEN = "SIGSD3", DOI = "https://doi.org/10.1145/989253.989264", ISSN = "0097-8418 (print), 2331-3927 (electronic)", bibdate = "Sat Nov 17 08:07:49 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "This paper describes the specification, implementation and use of a computer system simulator. The simulator project was begun as a result of teaching a second year undergraduate course in computer systems.It became apparent that students only fully appreciate the differences in computer architecture when they are able to have ``hands on'' experience. This simulator, which operates at the register transfer level, allows students to gain experience of many different architectures without recourse to many different computers. This experience, in the first instance, is gained by the students being able to run programs on the simulated computers and then investigating the state of the computer after each machine or micro instruction. The design of these teaching computers is chosen so that they demonstrate a particular architectural detail. Subsequently students can design their own computer systems and compare them with simulations of commercially available computers.", acknowledgement = ack-nhfb, fjournal = "SIGCSE Bulletin (ACM Special Interest Group on Computer Science Education)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J688", keywords = "STARTLE simulator", } @Article{Seawright:1979:VSM, author = "L. H. Seawright and R. A. MacKinnon", title = "{VM\slash 370} --- a study of multiplicity and usefulness", journal = j-IBM-SYS-J, volume = "18", number = "1", pages = "4--17", year = "1979", CODEN = "IBMSA7", ISSN = "0018-8670", bibdate = "Tue Mar 19 17:38:46 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/ibmsysj.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://pages.cs.wisc.edu/~stjones/proj/vm_reading/ibmsj1801C.pdf", abstract = "This paper is an overview of IBM's Virtual Machine Facility/370. It describes the virtual machine concept and its capabilities and implementation in VM/370. Two components of VM/370 are discussed --- the control program and the Conversational Monitor System. The usefulness of VM/370 in multiple and diverse environments is covered. New developments in VM/370 from hardware assists to system extensions, networking, and handshaking are briefly described as an introduction to the rest of the papers in this issue.", acknowledgement = ack-nhfb, } @TechReport{Warren:1980:IPI, author = "D. H. D. Warren", key = "Warren", title = "An Improved {Prolog} Implementation Which Optimises Tail Recursion", type = "Research Paper", number = "156", institution = "Department of AI, Univeristy of Edinburgh", year = "1980", bibdate = "Wed Jul 13 12:29:53 1983", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", keywords = "compiler; Implementation; tail recursion; virtual machine", } @Article{Sarda:1981:CAD, author = "N. L. Sarda and J. R. Isaac", title = "Computer aided design of database internal schema", journal = j-INT-J-COMPUT-INF-SCI, volume = "10", number = "4", pages = "219--234", month = aug, year = "1981", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, classification = "C6110 (Systems analysis and programming); C6120 (File organisation); C6160 (Database management systems (DBMS)); C7430 (Computer engineering)", corpsource = "Computer Centre, Indian Inst. of Technol., Bombay, India", fjournal = "International Journal of Computer and Information Sciences", keywords = "computer aided design; data structures; database internal schema; database management systems; database systems; design; systems analysis; virtual machines", treatment = "P Practical", } @InProceedings{Wang:1981:VMB, author = "Richard T. Wang and James C. Browne", title = "Virtual Machine-Based Simulation of Distributed Computing and Network Computing", crossref = "ACM:1981:ASC", pages = "154--156", year = "1981", bibdate = "Tue Jan 23 15:38:35 MST 2001", bibsource = "http://dblp.uni-trier.de/db/conf/sigmetrics/sigmetrics81.html#WangB81; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", oldlabel = "WangB81", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#conf/sigmetrics/WangB81", } @TechReport{Abramsky:1982:SMV, author = "S. Abramsky", title = "{SECD-M}: a virtual machine for applicative multiprogramming", number = "QMW-DCS-1982-322; QMW-DCS-1982-339", institution = "Department of Computer Science, Queen Mary College", month = nov, year = "1982", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "(LA has)", abstract-URL = "http://www.dcs.qmw.ac.uk/publications/report_abstracts/1982/322; http://www.dcs.qmw.ac.uk/publications/report_abstracts/1982/339", keywords = "Applicative programming , functional programming, SECD machines multiprogramming, non-determinism, operating systems.", scope = "theory", } @TechReport{Baden:1982:HPS, author = "Scott B. Baden", title = "High Performance Storage Reclamation in an Object-Based Memory System", type = "Technical Report", number = "CSD-84-167", institution = "University of California, Berkeley", pages = "52", month = jun, year = "1982", bibdate = "June 22, 1993", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Measurements of the Smalltalk Virtual Machine indicate that 20\%-30\% of the time is spent reclaiming disused storage. Following the work of Deutsch, Bobrow, and Snyder [Deutsch and Bobrow 76] [Deutsch 82a] [Deutsch 82b] [Snyder 79] we introduce a strategy that reduces the overhead of storage reclamation by more than 80\%. We discuss the design of hardware to support this strategy, and compare the hardware to a traditional software implementation. We conclude by suggesting directions for future research.", } @InProceedings{Comeau:1982:COV, author = "Leslie W. Comeau", editor = "????", booktitle = "Proceedings of {SEAS AM82, September, 1982}", title = "{CP-40}, the Origin of {VM\slash 370}", publisher = "????", address = "????", year = "1982", bibdate = "Sat May 07 13:35:24 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, remark = "See \cite{Creasy:1965:GDR,Comeau:1965:PLS} for the genesis of this work.", } @Article{Ganapathi:1982:RCC, author = "Mahadevan Ganapathi and Charles N. Fischer and John L. Hennessy", key = "Ganapathi et al.", title = "Retargetable Compiler Code Generation", journal = j-COMP-SURV, volume = "14", number = "4", pages = "573--592", month = dec, year = "1982", CODEN = "CMSVAN", ISSN = "0010-4892", ISSN-L = "0360-0300", bibdate = "Wed Dec 18 07:42:17 MST 1996", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "See also \cite{Wulf:1983:SFR,Ganapathi:1983:SFRa,Fraser:1983:SFR,Ganapathi:1983:SFRb}.", abstract = "A classification of automated retargetable code generation techniques and a survey of the work on these techniques is presented. Retargetable code generation research is classified into three categories: interpretive code generation, pattern-matched code generation, and table-driven code generation. Interpretive code generation approaches generate code for a virtual machine and then expand into real target code. Pattern-matched code generation approaches separate the machine description from the code generation algorithm. Table-driven code generation approaches employ a formal machine description and use a code-generator generator to produce code generators automatically. An analysis of these techniques and a critique of automatic code generation algorithms are presented.", acknowledgement = ack-nhfb, classification = "723", fjournal = "ACM Computing Surveys", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204", keywords = "Code-generator generator; compiler compiler; computer programming languages; intermediate representation; machine description; machine-dependent optimization", owner = "manning", } @Article{Thanh:1982:ITC, author = "Nguyen the Thanh and E. Walter Raschner", title = "Indirect threaded code used to emulate a virtual machine", journal = j-SIGPLAN, volume = "17", number = "5", pages = "80--89", month = may, year = "1982", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Oct 28 16:17:03 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, classification = "C6130 (Data handling techniques); C6150C (Compilers, interpreters and other processors); C6150J (Operating systems)", corpsource = "E. Walter Raschner, Nixdorf Computer AG, Paderborn, West Germany", fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", keywords = "assembler programs; codes; Indirect Threaded Code; Pascal compiler; program assemblers; program interpreters; Threaded Code; virtual machine; virtual machines", treatment = "P Practical", } @Article{Unger:1982:OSZ, author = "B. Unger and D. Bidulock and G. Lomow and P. Belanger and C. Hankins and N. Jain", title = "An {OASIS} simulation of the {ZNET} microcomputer network", journal = j-IEEE-MICRO, volume = "2", number = "3", pages = "70--84", month = jul # "\slash " # sep, year = "1982", CODEN = "IEMIDZ", DOI = "https://doi.org/10.1109/MM.1982.291024", ISSN = "0272-1732 (print), 1937-4143 (electronic)", ISSN-L = "0272-1732", bibdate = "Thu Dec 14 06:08:58 MST 2000", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; Science Citation Index database (1980--2000)", acknowledgement = ack-nhfb, classcodes = "C5620 (Computer networks and techniques); C7430 (Computer engineering)", corpsource = "Univ. of Calgary, Alta., Canada", fjournal = "IEEE Micro", journal-URL = "http://www.computer.org/csdl/mags/mi/index.html", keywords = "architecture; communication protocols; computer networks; distributed programs; hardware; local; MCZ-2; microcomputer network; multicomputer; network; OASIS; prototype software; Prototyping System; simulation; software; Software; systems; virtual machines; Zilog; ZNET", treatment = "P Practical", xxauthor = "B. Unger and P. Belanger and D. Bidulock and C. Hankins and N. Jain and G. Lomow", } @TechReport{Baker:1983:MAS, author = "T. P. Baker", title = "Mapping {Ada} onto a Simple Virtual Machine", number = "ADA-83-02", institution = "Florida State University", year = "1983", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", } @TechReport{Cohen:1983:PSR, author = "Shismon Cohen and Roni Rosner and Ari Zidon", title = "{PARALISP Simulator (Reference Manual)}", type = "Research Report", number = "83-2", institution = "Computer Science Department, Hebrew University", address = "Jerusalem, Israel", month = jan, year = "1983", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "PLISP (``Parallel Lisp'') is the current implementation of ``Senile Parallel Execution of Lisp Programs'' (Lehmann and Cohen). PLISP may be thought of as a virtual machine designed to evaluate LISP expressions in a parallel fashion. The language of this virtual machine is PARALISP. This means, for example, that when a function application contains several formal arguments, these arguments may be evaluated in parallel, under the assumption that there are no dependencies, or side effects. Therefore, PARALISP is a version of LISP designed to enable parallel evaluation to occur without side effects.", keywords = "functional parallel; Lisp", } @Article{Fraser:1983:SFR, author = "Christopher W. Fraser", title = "Surveyor's Forum: {Retargetable} Code Generators", journal = j-COMP-SURV, volume = "15", number = "3", pages = "281--283", month = sep, year = "1983", CODEN = "CMSVAN", DOI = "https://doi.org/10.1145/356914.356922", ISSN = "0360-0300 (print), 1557-7341 (electronic)", ISSN-L = "0360-0300", bibdate = "Thu Jun 19 09:32:37 MDT 2008", bibsource = "http://www.acm.org/pubs/contents/journals/surveys/; https://www.math.utah.edu/pub/tex/bib/compsurv.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "See \cite{Ganapathi:1982:RCC,Wulf:1983:SFR,Ganapathi:1983:SFRa,Ganapathi:1983:SFRb}.", acknowledgement = ack-nhfb, fjournal = "ACM Computing Surveys", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204", } @Article{Ganapathi:1983:SFRa, author = "M. Ganapathi and J. L. Hennessy and C. N. Fischer", title = "Surveyor's Forum: {Retargetable} Code Generators", journal = j-COMP-SURV, volume = "15", number = "3", pages = "280--281", month = sep, year = "1983", CODEN = "CMSVAN", DOI = "https://doi.org/10.1145/356914.356921", ISSN = "0360-0300 (print), 1557-7341 (electronic)", ISSN-L = "0360-0300", bibdate = "Thu Jun 19 09:32:37 MDT 2008", bibsource = "http://www.acm.org/pubs/contents/journals/surveys/; https://www.math.utah.edu/pub/tex/bib/compsurv.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "See \cite{Ganapathi:1982:RCC,Wulf:1983:SFR,Fraser:1983:SFR,Ganapathi:1983:SFRb}.", acknowledgement = ack-nhfb, fjournal = "ACM Computing Surveys", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204", } @Article{Ganapathi:1983:SFRb, author = "M. Ganapathi and J. L. Hennessy and C. N. Fischer", title = "Surveyor's Forum: {Retargetable} Code Generators", journal = j-COMP-SURV, volume = "15", number = "3", pages = "283--284", month = sep, year = "1983", CODEN = "CMSVAN", DOI = "https://doi.org/10.1145/356914.356923", ISSN = "0360-0300 (print), 1557-7341 (electronic)", ISSN-L = "0360-0300", bibdate = "Thu Jun 19 09:32:37 MDT 2008", bibsource = "http://www.acm.org/pubs/contents/journals/surveys/; https://www.math.utah.edu/pub/tex/bib/compsurv.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "See \cite{Ganapathi:1982:RCC,Wulf:1983:SFR,Ganapathi:1983:SFRa,Fraser:1983:SFR}.", acknowledgement = ack-nhfb, fjournal = "ACM Computing Surveys", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204", } @Article{Gum:1983:SEA, author = "Peter H. Gum", title = "{System\slash 370} Extended Architecture: Facilities for Virtual Machines", journal = j-IBM-JRD, volume = "27", number = "6", pages = "530--544", month = nov, year = "1983", CODEN = "IBMJAE", ISSN = "0018-8646 (print), 2151-8556 (electronic)", ISSN-L = "0018-8646", bibdate = "Mon Jan 22 13:12:28 MST 2001", bibsource = "Compendex database; http://dblp.uni-trier.de/db/journals/ibmrd/ibmrd27.html#Gum83; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "This paper describes the evolution of facilities for virtual machines on IBM System\slash 370 computers, and presents the elements of a new architectural facility designed for the virtual-machine environment. Assists that have been added to various System\slash 370 models to support the use of virtual machines are summarized, and a general facility for this purpose which was introduced with the System\slash 370 Extended Architecture (370-XA) is described.", acknowledgement = ack-nhfb, classcodes = "C5220 (Computer architecture); C7430 (Computer engineering)", classification = "723", corpsource = "IBM Information Systems and Technol. Group, Poughkeepsie, NY, USA", fjournal = "IBM Journal of Research and Development", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520", journalabr = "IBM J Res Dev", keywords = "370-XA architecture; computer architecture; computers; data storage, digital; dynamic address translation; Extended Architecture; IBM System/370; privileged instructions; virtual machines", oldlabel = "Gum83", treatment = "P Practical", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/ibmrd/Gum83", } @Article{Kamrad:1983:ROA, author = "J. M. {Kamrad III}", key = "Kamrad", title = "Runtime Organization for the {Ada} Language System Programs", journal = j-SIGADA-LETTERS, volume = "III", number = "3", pages = "58--68", month = nov, year = "1983", CODEN = "AALEE5", ISSN = "1094-3641 (print), 1557-9476 (electronic)", ISSN-L = "1094-3641", bibdate = "Wed Mar 6 10:04:32 1985", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "The runtime organization provides the execution environment for generated code of a source program. The runtime organization includes the primitive data elements, such as scalar and composite data objects; system data elements, such as stack and heaps; and a runtime system to provide functionality not supported in the target computer. In effect the runtime organization provides an abstract or virtual machine. This paper is a brief overview of the runtime organization that is the execution environment for the code generated by the Ada compiler in the Army Ada Language System. Since this compiler translates the full Ada language, the runtime organization must provide support not normally found in other languages, such as exception handling and tasking. As retargetability is a major goal of the Ada Language System, The runtime organization must also exist on many targets, both with or without an operating system support. While this paper specifically describes the runtime organization for the VAX/VMS 11/780, it does explore the design flexibility that enables the design to support generated code over a variety of targets.", fjournal = "ACM SIGADA Ada Letters", } @InProceedings{Kojima:1983:AMI, author = "Tomihiko Kojima and Hidehiko Akita and Hisashi Hashimoto", title = "An Approach to a Machine Independent {UNIX} --- {UNIX} on {HITAC M-series} Virtual Machines", crossref = "STUG:1983:PUA", pages = "363--369", month = "Summer", year = "1983", bibdate = "Fri Oct 18 07:24:24 MDT 1996", bibsource = "ftp://ftp.uu.net/library/bibliography; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, affiliation = "Hitachi Ltd.", } @Article{Mendelsohn:1983:RVF, author = "Noah Mendelsohn and Mark H. Linehan and William J. Anzick", title = "Reflections on {VM\slash Pass-Through}: a Facility for Interactive Networking", journal = j-IBM-SYS-J, volume = "23", number = "1-2", pages = "63--79", year = "1983", CODEN = "IBMSA7", ISSN = "0018-8670", bibdate = "Wed Jan 08 16:35:07 1997", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "An introduction to Pass-Through networking describes features of the system, supported configurations, and use of Pass-Through within the IBM Corporation. A brief history of Pass-Through's development is also provided. Pass-Through is then used to motivate a technical discussion of interactive network technology and virtual machine subsystems. Topics covered include appropriate use of the virtual machine environment, choice of routing strategy, and performance considerations.", acknowledgement = ack-nhfb, classification = "723", fjournal = "IBM Systems Journal", journalabr = "IBM Syst J", keywords = "computer networks", } @Article{Schaefer:1983:IPU, author = "Mark T. Schaefer and Yale N. Patt", title = "Improving the performance of {UCSD Pascal} via microprogramming on the {PDP-11\slash 60}", journal = j-SIGMICRO, volume = "14", number = "4", pages = "140--148", month = dec, year = "1983", CODEN = "SIGMDJ", DOI = "https://doi.org/10.1145/1096419.1096440", ISSN = "0163-5751, 1050-916X", ISSN-L = "0163-5751", bibdate = "Fri Apr 16 10:27:31 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigmicro.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1145/1096419.1096440", abstract = "UCSD Pascal is implemented as a machine-independent virtual machine. This virtual machine is usually interpreted on a host computer by machine language instructions, which, in turn, are often interpreted by microcode. Performance of a virtual machine is \ldots{}", acknowledgement = ack-nhfb, fjournal = "ACM SIGMICRO Newsletter", journal-URL = "https://dl.acm.org/loi/sigmicro", } @Article{Wulf:1983:SFR, author = "William A. Wulf and Joe Newcomer and Bruce Leverett and Rick Cattell and Paul Knueven", title = "Surveyor's Forum: {Retargetable} Code Generators", journal = j-COMP-SURV, volume = "15", number = "3", pages = "279--280", month = sep, year = "1983", CODEN = "CMSVAN", DOI = "https://doi.org/10.1145/356914.356920", ISSN = "0360-0300 (print), 1557-7341 (electronic)", ISSN-L = "0360-0300", bibdate = "Thu Jun 19 09:32:37 MDT 2008", bibsource = "http://www.acm.org/pubs/contents/journals/surveys/; https://www.math.utah.edu/pub/tex/bib/compsurv.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "See \cite{Ganapathi:1982:RCC,Ganapathi:1983:SFRa,Fraser:1983:SFR,Ganapathi:1983:SFRb}.", acknowledgement = ack-nhfb, fjournal = "ACM Computing Surveys", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204", } @InProceedings{Gold:1984:KR, author = "B. D. Gold and R. R. Linde and P. F. Cudney", title = "{KVM\slash 370} In Retrospect", crossref = "IEEE:1984:PSS", pages = "13--23", year = "1984", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", annote = "KVM/370 (Kernelized Virtual Machine System 370) is based on IBM's Virtual Machine operating system, VM/370. KVM/370 is a general purpose operating system that enforces DoD military security policy using kernel technology. Funded as a small research project in 1976, the system has undergone continuous development since 1978 when implementation was begun by System Development Corporation. This paper describes KVM/370's architecture, security controls and performance. Based on insights gained during the retrofit, recommendations are made as to how a more efficient system might be designed.", } @Article{Ibsen:1984:PVM, author = "Leif Ibsen", title = "A Portable Virtual Machine for {Ada}", journal = j-SPE, volume = "14", number = "1", pages = "17--29", month = jan, year = "1984", CODEN = "SPEXBL", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Sat May 31 13:36:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Software---Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", } @InProceedings{Kim:1984:EVM, author = "K. H. Kim", title = "Evolution of a Virtual Machine Supporting Fault-Tolerant Distributed Processes at a Research Laboratory", crossref = "IEEE:1984:DE", bookpages = "????", pages = "620--628", month = apr, year = "1984", bibdate = "Sat Jan 27 14:07:28 MST 2001", bibsource = "http://dblp.uni-trier.de/db/conf/icde/icde84.html#Kim84; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://dblp.uni-trier.de/db/conf/icde/Kim84.html", cdrom = "ICDE84/P620.pdf", cites-label = "B1 (\ldots{}); C1 (\ldots{}); H1 (books/sp/Hartmann77); H2 (\ldots{}); K1 (\ldots{}); K2 (\ldots{}); V1 (\ldots{})", oldlabel = "conf/icde/Kim84", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#conf/icde/Kim84", } @Article{MacGregor:1984:MM, author = "Doug MacGregor and Dave Mothersole and Bill Moyer", title = "The {Motorola MC68020}", journal = j-IEEE-MICRO, volume = "4", number = "4", pages = "101--118", month = jul # "\slash " # aug, year = "1984", CODEN = "IEMIDZ", DOI = "https://doi.org/10.1109/MM.1984.291226", ISSN = "0272-1732 (print), 1937-4143 (electronic)", ISSN-L = "0272-1732", bibdate = "Thu Dec 14 06:08:58 MST 2000", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; Science Citation Index database (1980--2000)", acknowledgement = ack-nhfb, classcodes = "B1265F (Microprocessors and microcomputers); C5130 (Microprocessor chips)", classification = "722; 723; 902", corpsource = "Motorola Inc., Austin, TX, USA", fjournal = "IEEE Micro", journal-URL = "http://www.computer.org/csdl/mags/mi/index.html", keywords = "32-bit microprocessor; cache; compatibility; computer interfaces; computer programming --- Modular Construction; computers, microprocessor; coprocessor interface; high-speed asynchronous bus; instruction; instruction set; microprocessor chips; Motorola MC 6802; Motorola MC68020; performance; programmer's model; system enhancements; testability; virtual memory/virtual machine", treatment = "P Practical", } @Article{SPE::Ibsen1984, author = "Leif Ibsen", title = "A Portable Virtual Machine for {Ada}", journal = j-SPE, volume = "14", number = "1", pages = "17--29", month = jan, year = "1984", CODEN = "SPEXBL", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", fjournal = "Software---Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", } @Article{Steensgaard-Madsen:1984:DPL, author = "J. Steensgaard-Madsen and L. M. Olsen", title = "Definition of the programming language {MODEF}", journal = j-SIGPLAN, volume = "19", number = "2", pages = "92--110", month = feb, year = "1984", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat Apr 25 11:46:37 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, classification = "C6110 (Systems analysis and programming); C6140D (High level languages)", fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", keywords = "application programs; data abstraction; discrete events; high level languages; MODEF; programming; programming language; semantics; sequential process; statement-oriented approach; user defined operators; virtual machine virtual machine", treatment = "A Application; P Practical", } @MastersThesis{Turek:1984:IDV, author = "John Joseph E. Turek", title = "Issues in the design of a virtual network for the connection machine", type = "Thesis ({B.S.})", school = "Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology", address = "Cambridge, MA, USA", pages = "67", year = "1984", bibdate = "Mon Apr 10 10:56:30 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "Supervised by Thomas Knight.", acknowledgement = ack-nhfb, } @InCollection{Uehara:1984:BPB, author = "K. Uehara and R. Ochitani and O. Kakusho and J. Toyoda", booktitle = "1984 International Symposium on Logic Programming", title = "A Bottom-up Parser Base on Predicate Logic: a Survey of the Formalism and its Implementation Techniques", publisher = pub-IEEE, address = pub-IEEE:adr, year = "1984", ISBN = "0-8186-0522-7", ISBN-13 = "978-0-8186-0522-2", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "CH2007-3/84/0000-0220\$01.00", abstract = "The authors present a grammar formalism for natural language analysis based on the subset of predictive logic, called PAMPS, and its implementation technique. PAMPS has a bottom-up, left-to-right, parallel parser, augmented by topdown filtering and a look-ahead facility. Rules of a PAMPS grammar can have procedures included in their right-hand sides, defined as Horn clauses. These procedures are executed in a to-down, depth-first manner. PAMPS can thus be seen to be an elaborate mixture of an efficient bottom-up parser and the programming language PROLOG. The authors have developed two versions of PAMPS implementation. One is an interpreter, and the other is a virtual machine and its compiler. The technique for the virtual machine is based on that of the DEC-10 PROLOG. Some modifications are added so that the technique for the virtual machine does not depend on any particular searching strategy. It runs faster than the interpreter by a factor of 20 to 76. The technique is also useful in implementing pseudo or-parallelism of PROLOG on a sequential machine.", keywords = "Program Compilers; Programming Theory; Software Engineering", } @InProceedings{Abramski:1985:SMV, author = "S. Abramski and R. Sykes", editor = "Jean-Pierre Jouannaud", booktitle = "{FPCA '85, Functional Programming Languages and Computer Architecture}", title = "{Secd-m: A Virtual Machine for Applicative Programming}", volume = "201", publisher = pub-SV, address = pub-SV:adr, pages = "81--98", year = "1985", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", series = "Lecture Notes in Computer Science", abstract = "We present a virtual machine to support {\em applicative multiprogramming\/} --- the description of concurrent, asynchronous systems such as operating systems in a functional style. The machine extend's Landin's secd machine to support multiple concurrent expression evaluation, non-determinism in the form of the fair merge, and a full range of input and output devices. This allows system programs to be written in a functional style. The secd-m machine has been implemented and a number of functional concurrent programs demonstrated.", keywords = "SECD, Abstract Machine, Operating System", } @InCollection{Abramsky:1985:SMV, author = "Samson Abramsky and R. Sykes", title = "{{\sc SECD-M}}: a virtual machine for applicative programming", crossref = "Jouannaud:1985:FPL", pages = "81--98", month = sep, year = "1985", bibdate = "Tue Jan 23 22:52:55 MST 2001", bibsource = "http://dblp.uni-trier.de/db/conf/fpca/fpca85.html#AbramskyS85; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "We present a virtual machine to support applicative multiprogramming - the description of concurrent, asynchronous systems such as operating systems in a functional style. The machine extend's Landin's secd machine to support multiple concurrent expression evaluation, non-determinism in the form of the fair merge, and a full range of input and output devices. This allows system programs to be written in a functional style. The secd-m machine has been implemented and a number of functional concurrent programs demonstrated.", keywords = "functional nancy symposium parallel non-determinism", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#conf/fpca/AbramskyS85", } @InProceedings{Bachrach:1985:XVM, author = "Jonathan Bachrach and John Wallerius and Jehan-Fran{\c{c}}ois Paris", title = "A {XINU} Virtual Machine", crossref = "USENIX:1985:SCP", pages = "348--355", month = "Summer", year = "1985", bibdate = "Fri Oct 18 07:24:24 MDT 1996", bibsource = "ftp://ftp.uu.net/library/bibliography; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, affiliation = "University of California, San Diego", } @Article{Clocksin:1985:DSS, author = "W. F. Clocksin", title = "Design and simulation of a sequential {PROLOG} machine", journal = "New Generation Comput.", volume = "3", number = "1", address = "Japan", pages = "101--20", year = "1985", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "PROLOG-X is an implemented portable interactive sequential prolog system in which clauses are incrementally compiled for a virtual machine called the ZIP machine. At present, the ZIP machine is emulated by software, but it has been designed to permit easy implementation in microcode or hardware. PROLOG-X running on the software-based emulator provides performance comparable with existing prolog interpreters. To demonstrate its efficiency, compatibility, and comprehensiveness of implementation, PROLOG-X has been used to compile and run several large applications programs. Several novel techniques are used in the implementation, particularly in the areas of the representation of the record database, the selection of clauses, and the compilation of arithmetic expressions.", keywords = "program compilers; program interpreters; PROLOG; virtual machines", } @Article{Gaudiot:1985:PES, author = "J. L. Gaudiot and M. D. Ercegovac", title = "Performance evaluation of a simulated data-flow computer with low-resolution actors", journal = j-J-PAR-DIST-COMP, volume = "2", number = "4", pages = "321--351", month = nov, year = "1985", CODEN = "JPDCER", ISSN = "0743-7315 (print), 1096-0848 (electronic)", ISSN-L = "0743-7315", bibdate = "Mon Apr 14 07:47:33 1997", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Southern California, Los Angeles, CA, USA", classification = "713; 723; 921; C5220 (Computer architecture); C5440 (Multiprocessing systems); C5470 (Performance evaluation and testing); C7430 (Computer engineering)", corpsource = "Comput. Res. Inst., Univ. of Southern California, Los Angeles, CA, USA", fjournal = "Journal of Parallel and Distributed Computing", journal-URL = "http://www.sciencedirect.com/science/journal/07437315", journalabr = "J Parallel Distrib Comput", keywords = "array handling; associative memory cycle time; chain; communication costs; communication issues; computer; computer architecture; computer programming languages; computer simulation; computer systems, digital --- Performance; computers --- Data Communication Systems; daisy; deterministic simulation; directed acyclic graphs; dual counter-rotating rings; evaluation; integrated circuits, VLSI; interconnection networks; low-resolution actors; Mathematical Models; operations; optimal double loop network; parallel processing; parallelism limitation; performance; performance degradation; performance evaluation; program structures; simulated data-flow; simulated data-flow computer; size actors; variable-; variable-resolution scheme; vector; virtual machines", treatment = "X Experimental", } @Manual{IBM:1985:VM, author = "{IBM}", title = "Virtual machine", organization = "IBM Corporation", address = "Endicott, NY, USA", edition = "Fourth", pages = "282", year = "1985", LCCN = "QA76.9.V5 V451 1985", bibdate = "Mon Apr 10 10:43:28 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; melvyl.cdlib.org:210/CDL90", acknowledgement = ack-nhfb, remark = "Publication number SX20-4400-3.", subject = "Virtual computer systems; IBM 370 (Computer)", } @Article{Nanba:1985:VAV, author = "S. Nanba and N. Ohno and H. Kubo and H. Morisue and T. Ohshima and H. Yamagishi", title = "{VM\slash 4}: {ACOS-4} virtual machine architecture", journal = j-COMP-ARCH-NEWS, volume = "13", number = "3", pages = "171--178", month = jun, year = "1985", CODEN = "CANED2", ISSN = "0163-5964 (ACM), 0884-7495 (IEEE)", ISSN-L = "0163-5964", bibdate = "Fri May 12 09:40:54 MDT 2006", bibsource = "http://dblp.uni-trier.de/db/conf/isca/isca85.html#NanbaOKMOY85; http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGARCH Computer Architecture News", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89", oldlabel = "NanbaOKMOY85", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#conf/isca/NanbaOKMOY85", } @Article{Ballard:1986:QSD, author = "M. B. Ballard and D. Maier and A. Wirfs-Brock", title = "{QUICKTALK}: a {Smalltalk-80} dialect for defining primitive methods", journal = j-SIGPLAN, volume = "21", number = "11", pages = "140--140", month = nov, year = "1986", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat Apr 25 11:46:37 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "QUICKTALK is a dialect of Smalltalk-80 that can be compiled directly into native machine code, instead of virtual machine bytecodes. The dialect includes ``hints'' on the class of method arguments, instance variables, and class variables. We designed the dialect to describe primitive Smalltalk methods. QUICKTALK achieves improved performance over bytecodes by eliminating the interpreter loop on bytecode execution, by reducing the number of message send/returns via binding some target methods at compilation, and by eliminating redundant class checking. We identify changes to the Smalltalk-80 system and compiler to support the dialect, and give performance measurements.", acknowledgement = ack-nhfb, classification = "C6140D (High level languages)", conflocation = "Portland, OR, USA; 29 Sept.-2 Oct. 1986", conftitle = "OOPSLA '86. Object-Oriented Programming Systems, Languages and Applications. Conference Proceedings", corpsource = "Oregon Graduate Center, Beaverton, OR, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", keywords = "bytecode execution; bytecodes; high level languages; interpreter loop; machine code; performance measurements; primitive methods; QUICKTALK; redundant class checking; Smalltalk-80; virtual machine bytecodes", owner = "manning", pubcountry = "USA A14", sponsororg = "ACM", treatment = "P Practical", } @Article{Bernat:1986:IIG, author = "Andrew P. Bernat", title = "An interactive interpreter\slash graphic-simulator for {IBM S\slash 370} architecture assembly language", journal = j-SIGCSE, volume = "18", number = "2", pages = "13--16", month = jun, year = "1986", CODEN = "SIGSD3", DOI = "https://doi.org/10.1145/15075.15078", ISSN = "0097-8418 (print), 2331-3927 (electronic)", ISSN-L = "0097-8418", bibdate = "Sun Nov 18 07:38:26 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigcse1980.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "SIGCSE Bulletin (ACM Special Interest Group on Computer Science Education)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J688", } @Article{Bhaskar:1986:VIO, author = "K. S. Bhaskar and J. K. Peckol and J. L. Beug", title = "{Virtual Instruments}: object-oriented program synthesis", journal = j-SIGPLAN, volume = "21", number = "11", pages = "303--303", month = nov, year = "1986", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat Apr 25 11:46:37 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, classification = "C6115 (Programming support); C7410D (Electronic engineering)", conflocation = "Portland, OR, USA; 29 Sept.-2 Oct. 1986", conftitle = "OOPSLA '86. Object-Oriented Programming Systems, Languages and Applications. Conference Proceedings", fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", keywords = "automatic test equipment; Berkeley Smalltalk; bottom-up synthesis; human interface models; interface models; object-oriented program synthesis; programming environment; programming environments; programming paradigm; software development; SUN workstation; test engineers; user interfaces; Virtual Instruments; virtual machines", pubcountry = "USA B05", sponsororg = "ACM", treatment = "P Practical", } @TechReport{Danvy:1986:LVM, author = "Olivier Danvy", title = "{LILA}: a Virtual Machine for Functional and Declarative Languages", number = "86--38", institution = "LITP, France", month = may, year = "1986", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "Workshop on Future Directions in Computer Science and Software", } @TechReport{Dunigan:1986:DHM, author = "T. W. Dunigan", title = "{Denelcor HEP} Multiprocessor Simulator", type = "Report", number = "ORNL/TM-9971", institution = "Engineering Physics and Mathematics Division, Mathematical Sciences Section, Oak Ridge National Laboratory", address = "Oak Ridge, TN 37831, USA", pages = "iv + 22", month = jun, year = "1986", bibdate = "Tue Oct 28 08:11:58 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/fortran2.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://web.ornl.gov/info/reports/1986/3445600639931.pdf", abstract = "The structure and use of a simulator for the Denelcor HEP multiprocessor are described. The simulator provides a multitasking environment for the development of parallel programs in C or FORTRAN using a library of subroutines that simulate the parallel programming constructs available on the HEP, a shared-memory multiprocessor. The simulator also provides a trace file that can be used for debugging, performance analysis, or graphical display.", acknowledgement = ack-nhfb, tableofcontents = "Abstract / 1 \\ 1. Overview / 1 \\ 1.1 Introduction / 1 \\ 1.2 Simulator structure / 1 \\ 1.3 HEP architecture / 2 \\ 2. User's Guide / 3 \\ 2.1 Simulator subroutines / 3 \\ 2.2 Trace file and post-processors / \\ 2.3 Sample session / \\ 2.4 FORTRAN interface / \\ 2.5 Debugging / 11 \\ Acknowledgements / 13 \\ References / 14 \\ Appendix A: Simulator Manual Pages / 15", } @InProceedings{Genter:1986:UVM, author = "Robert E. (Rick) Genter", title = "{Unix} as a Virtual Machine Environment", crossref = "USENIX:1986:SCP", pages = "475--485", month = "Summer", year = "1986", bibdate = "Fri Oct 18 07:24:24 MDT 1996", bibsource = "ftp://ftp.uu.net/library/bibliography; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, affiliation = "BBN Laboratories Inc.", } @Article{Ishikawa:1986:COO, author = "Y. Ishikawa and M. Tokoro", title = "A concurrent object-oriented knowledge representation language {Orient 84\slash K}: its features and implementation", journal = j-SIGPLAN, volume = "21", number = "11", pages = "232--232", month = nov, year = "1986", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat Apr 25 11:46:37 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, classification = "C6140D (High level languages); C6150J (Operating systems)", conflocation = "Portland, OR, USA; 29 Sept.-2 Oct. 1986", conftitle = "OOPSLA '86. Object-Oriented Programming Systems, Languages and Applications. Conference Proceedings", corpsource = "Department of Electr. Eng., Keio Univ., Yokohama, Japan", fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", keywords = "behavior part; concurrent object oriented language; concurrent object-oriented knowledge representation language; high level languages; implementation issues; knowledge systems; knowledge-base part; monitor part; multiprocessing programs; object framework; Orient 84/K; virtual machine", pubcountry = "USA A23", sponsororg = "ACM", treatment = "P Practical", } @TechReport{Lee:1986:DSE, author = "Joon Sup Lee", title = "{Dartmouth-Smalltalk: An Exercise in Implementation}", type = "Technical Report", number = "PCS-TR86-108", institution = "Dartmouth College, Computer Science", address = "Hanover, NH, USA", month = jan, year = "1986", bibdate = "January 20, 1995", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "This report discusses a preliminary implementation of the Smalltalk-80 virtual machine for VAX/Unix.", } @TechReport{McDonald:1986:TND, author = "D. McDonald and J. Brooks and B. Woolf and P. Werner", title = "Transition Networks for Discourse Management", type = "Technical Report", number = "UM-CS-1986-034", institution = "University of Massachusetts, Amherst, Computer Science", day = "31", month = dec, year = "1986", bibdate = "April 3, 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Transition networks are a natural notation for formalizing the space of actions and interpretations through which a program must navigate when holding a conversation with a human user [7], [19]. However, dissatisfaction with the augmented transition network formalism that we used in earlier work on tutoring dialogs [28] has led us to develop the new formalism that we present in this paper. We have implemented a program framework --- a virtual machine --- that defines a node and arc notation interpreted semantically in terms of situations (arcs) that dictate the actions (nodes) that the system is to take. Our work is based on analyses of recorded conversations and grounded in an experimental man-machine interface by which a human lawyer would get advice from a legal reasoning program. We present the motivations behind a discourse manager and its place within a man-machine interface, a definition of our formalism, and illustrations of its use in two different domains.", notes = "This report is only available in hardcopy form. For ordering hard copies of reports which are currently unavailable via ftp, please send email to: techrept@cs.umass.edu U.S. mail to: Librarian Computer Science Department Lederle Graduate Research Center University of Massachusetts Amherst, Ma. 01003", retrieval = "Send email to techrept@cs.umass.edu", revision = "April 3, 1996", } @Article{Samples:1986:SSB, author = "A. Dain Samples and David Ungar and Paul Hilfinger", key = "Samples \& Ungar \& Hilfinger", title = "{SOAR}: {Smalltalk} without bytecodes", journal = j-SIGPLAN, volume = "21", number = "11", pages = "107--118", month = nov, year = "1986", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat Apr 25 11:46:37 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "OOPSLA '86 Conference Proceedings, Norman Meyrowitz (editor), September 1986, Portland, Oregon.", abstract = "We have implemented Smalltalk-80 on an instruction-level simulator for a RISC microcomputer called SOAR. Measurements suggest that even a conventional computer can provide high performance for Smalltalk-80 by abandoning the `Smalltalk Virtual Machine' in favor of compiling Smalltalk directly to SOAR machine code, linearizing the object table, and replacing reference counting with a new technique called Generation Scavenging. In order to implement these techniques, we had to find new ways of hashing objects, accessing often-used objects, invoking blocks, referencing activation records, managing activation record stacks, and converting the virtual machine images.", acknowledgement = ack-nhfb, annote = "High performance for Smalltalk-80 results from abandoning the Smalltalk Virtual Machine, compiling directly into machine code, linearizing the activation records on the stack, eliminating the object table, and replacing reference counting with generation scavenging. 22 references.", classification = "C6140 (Programming languages); C6150 (Systems software)", conflocation = "Portland, OR, USA; 29 Sept.-2 Oct. 1986", conftitle = "OOPSLA '86. Object-Oriented Programming Systems, Languages and Applications. Conference Proceedings", corpsource = "Department of Electr. Eng. and Comput. Sci., California Univ., Berkeley, CA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", keywords = "activation records; bytecodes; Generation Scavenging; hashing objects; instruction level simulator; invoking blocks; microcomputers; often-used objects; programming languages; reference counting; RISC microcomputer; SOAR; SOAR machine code; virtual machine images; virtual machine images invoking blocks; virtual machines", owner = "manning", pubcountry = "USA A11", sponsororg = "ACM", treatment = "P Practical", } @TechReport{Schoen:1986:CS, author = "Eric Schoen", title = "The {CAOS} System", type = "Technical Report", number = "CS-TR-86-1125", institution = "Stanford University, Department of Computer Science", pages = "76", month = mar, year = "1986", bibdate = "May 01, 1995", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "The CAOS system is a framework designed to facilitate the development of highly concurrent real-time signal interpretation applications. It explores the potential of multiprocessor architectures to improve the performance of expert systems in the domain of signal interpretation. CAOS is implemented in Lisp on a (simulated) collection of processor-memory sites, linked by a high-speed communications subsystem. The {"virtual} {machine"} on which it depends provides remote evaluation and packet-based message exchange between processes, using virtual circuits known as streams. To this presentation layer, CAOS adds (1) a flexible process scheduler, and (2) an object-centered notion of agents, dynamically-instantiable entities which model interpreted signal features. This report documents the principal ideas, programming model, and implementation of CAOS. A model of real-time signal interpretation, based on replicated {"abstraction"} pipelines, is presented. For some applications, this model offers a means by which large numbers of processors may be utilized without introducing synchronization-necessitated software bottlenecks. The report concludes with a description of the performance of a large CAOS application over various sizes of multiprocessor configurations. Lessons about problem decomposition grain size, global problem solving control strategy, and appropriate service provided to CAOS by the underlying architecture are discussed.", notes = "[Adminitrivia V1/Prg/19950501]", } @Article{Voelcker:1986:MYP, author = "J. Voelcker", title = "Making your {PC} behave like another", journal = j-IEEE-SPECTRUM, volume = "23", number = "10", pages = "61--67", month = oct, year = "1986", CODEN = "IEESAM", DOI = "https://doi.org/10.1109/MSPEC.1986.6371117", ISSN = "0018-9235 (print), 1939-9340 (electronic)", ISSN-L = "0018-9235", bibdate = "Mon Jan 20 06:41:24 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeespectrum1970.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Spectrum", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6", keywords = "emulation; Emulation; emulators; microcomputers; Microcomputers; Microprocessors; PC; personal computer; Read only memory; Registers; Software; specifications; virtual machines", } @PhdThesis{Watson:1986:PRL, author = "Paul Watson", title = "The Parallel Reduction of Lambda Calculus Expression", school = "University of Manchester", pages = "133", month = jul, year = "1986", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "Also available as UMCS-87-2-1", abstract = "Models of computation for the evaluation of Functional Programs are based on the rules for reducing Lambda Calculus expressions. Reduction is achieved by the application of the b-conversion rule to suitable redexes, but few models of computation provide a full implementation of this rule because of the complexity of avoiding variable name clashes. Consequently, evaluation orders are restricted to those in which name clashes cannot occur. This thesis develops a model of computation for the parallel reduction of Lambda Calculus expressions, represented in De Bruijn's name-free notation, which does provide a full implementation of b-conversion, allowing expression to be reduced by any evaluation order. The model is designed to allow reduction to be performed on a parallel machine comprised of a set of processor/store pairs connected by a communications network. A data- driven, graph reduction execution mechanism is used to exploit the parallel hardware efficiently. A language for specifying graph reduction models of computation is proposed, and is used to give full specification of the Lambda Calculus reduction model. Specifications in the language can be compiled to the instruction set of a virtual machine. The code produced can then be executed by a virtual machine emulator, or could be recompiled to the order code of a physical processor to allow the high performance simulation of models of computation. The virtual machine is used as the foundation for the design of a physical machine which would support the parallel reduction of lambda calculus expressions. One of the major issues in the design of graph reduction models of computation is the removal of redundant parts of the expression graph. Neither of the two standard Garbage Collection schemes: Reference Count, or Mark-Scan is entirely suitable for a distributed machine, mainly because of the synchronisation they require. A modified Reference Garbage Collection scheme is described which removes the need for synchronisation, and enhances some of the attractive properties of Reference Count Garbage Collection.", } @TechReport{Baden:1987:RTP, author = "Scott B. Baden", title = "Run-Time Partitioning of Scientific Continuum Calculations Running on Multiprocessors", type = "Technical Report", number = "CSD-87-366", institution = "University of California, Berkeley", pages = "154", month = jun, year = "1987", bibdate = "June 10, 1993", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "A wide range of scientific continuum calculations typically concentrate computational effort non-uniformly over localized regions of physical space. We present a run-time partitioning strategy, intended for such methods, that distributes work evenly across a team of processors and that can exploit the spatial localization present in the original computation in order to avoid high overhead costs. We tried out our strategy on Anderson's Methods of Local Corrections, a type of vortex method for computational fluid dynamics. Because computational effort follows particles that congregate and disperse irregularly about the domain, this problem is hard to partition in a way that distributes the work evenly among the processors. We ran experiments on 32 processors of an Intel Personal Scientific Computer-- a message-passing hypercube multiprocessor--and on 4 processors of a Cray X-MP--a shared-memory vector architecture--and achieved good parallel speedups of 22 and 3.6, respectively. The partitioner may be implemented as a virtual machine (VM) and made available to the programmer as a library of run-time utilities. The semantics of the VM are insensitive to the application and to the computer architecture on which the VM are insensitive to the application and to the computer architecture on which the VM is implemented. The VM works with ordinary programming languages, incurs modest overhead costs, and requires no special hardware support. It should apply to diverse applications, including finite difference methods, and to diverse architectures without requiring that the application be reprogrammed extensively for each new architecture.", retrieval = "tiff (in {001-154}.tif)", } @Article{Bergh:1987:HEH, author = "Arndt B. Bergh and Keith Keilman and Daniel J. Magenheimer and James A. Miller", title = "{HP} 3000 Emulation on {HP} Precision Architecture Computers", journal = j-HEWLETT-PACKARD-J, volume = "38", number = "11", pages = "87--89", month = dec, year = "1987", CODEN = "HPJOAX", ISSN = "0018-1153", bibdate = "Tue Mar 25 14:12:15 MST 1997", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Two software subsystems for HP Precision Architecture machines provide program execution that duplicates that of HP 3000s running the MPE V operating system. The HP 3000 Emulator and the HP 3000 Object Code Translator (OCT), provide program execution that duplicates that of MPE V on the non-HP-Precision-Architecture HP 3000s. The Emulator enables a user program to be loaded and run without preparation or modification on an HP Precision Architecture computer with the normal MPE commands. In the case of the OCT, specific action by the user is required to produce a translated program before it can be run in the improved-performance translated mode. This involves no code modification but only a compiler-like invocation of the OCT for translation, after which the target program will automatically execute translated.", acknowledgement = ack-nhfb, classcodes = "C6150J (Operating systems)", classification = "722; 723", fjournal = "Hewlett-Packard Journal: technical information from the laboratories of Hewlett-Packard Company", journalabr = "Hewlett Packard J", keywords = "3000 Object Code Translator; commercial operating system; compatibility mode; computer architecture; computer operating systems --- Program Compilers; computers; environment; Hewlett Packard computers; HP; HP 3000 emulator; HP 3000 Emulator; HP 3000 object code translator (oct); HP 3000 Series 930; HP Precision Architecture; MPE V; MPE XL operating system; operating systems (computers); program execution; program translation; software portability; virtual machines", treatment = "P Practical; R Product Review", } @InProceedings{Bush:1987:CSR, author = "W. R. Bush and A. D. Samples and D. Ungar and P. N. Hilfinger", key = "Bush et al.", booktitle = "Proceedings of the Second International Conference on Architectural Support for Programming Languages and Operating Systems-ASPLOSII", title = "Compiling {Smalltalk-80} to a {RISC}", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "112--116", month = oct, year = "1987", bibdate = "Mon Nov 16 15:42:30 1987", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "The Smalltalk On A RISC project at U.C. Berkeley proves that a high-level object-oriented language can attain high performance on a modified reduced instruction set architecture. The single most important optimization is the removal of a layer of interpretation, compiling the bytecoded virtual machine instructions into low-level, register-based, hardware instructions. This paper describes the compiler and how it was affected by SOAR architectural features. The compiler generates code of reasonable density and speed. Because of Smalltalk-80's semantics, relatively few optimizations are possible, but hardware and software mechanisms at runtime offset these limitations. Register allocation for an architecture with register windows comprises the major task of the compiler. Performance analysis suggests that SOAR is not simple enough; several hardware features could be efficiently replaced by instruction sequences constructed by the compiler.", owner = "manning", } @Article{Carr:1987:EUC, author = "Harold Carr and Robert R. Kessler", title = "Emulator for {Utah Common Lisp}'s {Abstract Virtual Register Machine}", journal = j-J-FORTH-APPL-RES, volume = "5", number = "1", year = "1987", CODEN = "JFAREL", ISSN = "0738-2022", bibdate = "Wed Aug 6 19:54:46 MDT 1997", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Utah, Salt Lake City, UT, USA", classification = "723", fjournal = "Journal of FORTH Application and Research", journalabr = "J Forth Appl Res", keywords = "abstract virtual register machine; computer operating systems; computer programming languages --- Lisp; forth; Utah Common Lisp; virtual machine emulator", pagecount = "1987", } @Article{Donaldson:1987:TOS, author = "John L. Donaldson", title = "Teaching operating systems in a virtual machine environment", journal = j-SIGCSE, volume = "19", number = "1", pages = "206--211", month = feb, year = "1987", CODEN = "SIGSD3", DOI = "https://doi.org/10.1145/31726.31759", ISSN = "0097-8418 (print), 2331-3927 (electronic)", ISSN-L = "0097-8418", bibdate = "Sun Nov 18 07:38:27 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigcse1980.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "SIGCSE Bulletin (ACM Special Interest Group on Computer Science Education)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J688", } @Article{Gayer:1987:CPA, author = "Richard Gayer and Catherine M. Beise and G. Scott Owen", title = "Conversion of a {PDP-11\slash 40} assembler and simulator from mainframe {Pascal} to {Ada} on {IBM PC} microcomputers", journal = j-SIGCSE, volume = "19", number = "1", pages = "378--381", month = feb, year = "1987", CODEN = "SIGSD3", DOI = "https://doi.org/10.1145/31726.31790", ISSN = "0097-8418 (print), 2331-3927 (electronic)", ISSN-L = "0097-8418", bibdate = "Sun Nov 18 07:38:27 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigcse1980.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "The assembly language course at Georgia State University is taught using a PDP-11/40 Assembler and Simulator, written in Pascal, running on a Sperry UNIVAC mainframe. In the past two years most of the computer science program has been switched to IBM PC compatible microcomputers. This, coupled with the fact that the UNIVAC system is about to be retired, motivated us to translate the PDP-11/40 system to the microcomputers. The translation is from the mainframe Pascal version to Ada for the PC's. The use of the assembler and simulator, the rationale for the use of Ada, and the problems encountered in the translation are all discussed.", acknowledgement = ack-nhfb, fjournal = "SIGCSE Bulletin (ACM Special Interest Group on Computer Science Education)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J688", } @Article{Iacobovici:1987:VSP, author = "S. Iacobovici and C. C. Ng", title = "{VLSI} and System Performance Modeling", journal = j-IEEE-MICRO, volume = "7", number = "4", pages = "59--72", month = jul # "\slash " # aug, year = "1987", CODEN = "IEMIDZ", DOI = "https://doi.org/10.1109/MM.1987.304883", ISSN = "0272-1732 (print), 1937-4143 (electronic)", ISSN-L = "0272-1732", bibdate = "Thu Dec 14 06:08:58 MST 2000", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; Science Citation Index database (1980--2000)", acknowledgement = ack-nhfb, classcodes = "B1130B (Computer-aided circuit analysis and design); B2570 (Semiconductor integrated circuits); C7410D (Electronic engineering); C7430 (Computer engineering)", corpsource = "Nat. Semicond., Santa Clara, CA, USA", fjournal = "IEEE Micro", journal-URL = "http://www.computer.org/csdl/mags/mi/index.html", keywords = "circuit analysis computing; CPU; digital simulation; evaluation; high-level; high-level simulation environment; PAWS; performance; Performance Analysis Workbench; performance-evaluation; simulation language; simulation languages; System; system performance modeling; virtual machines; VLSI; VLSI chips", treatment = "P Practical", xxpages = "59--71", } @TechReport{Lau:1987:OCV, author = "A. S. K. Lau", title = "Overview of the {CLIP7} Virtual Machine", type = "Report", number = "87/6", institution = "Department of Physics and Astronomy, University College London", address = "London, UK", year = "1987", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", keywords = "multiprocessors, architecture, CLIP7", } @Article{Maxim:1987:TPA, author = "Bruce R. Maxim and Bruce S. Elenbogen", title = "Teaching programming algorithms aided by computer graphics", journal = j-SIGCSE, volume = "19", number = "1", pages = "297--301", month = feb, year = "1987", CODEN = "SIGSD3", DOI = "https://doi.org/10.1145/31726.31775", ISSN = "0097-8418 (print), 2331-3927 (electronic)", ISSN-L = "0097-8418", bibdate = "Sun Nov 18 07:38:27 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigcse1980.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Effects of operations on abstract data objects are often difficult for students to comprehend. Visual models can be helpful to students, when the connections among the data object models, virtual machine representations of data objects, and algorithms operating on the data objects are made clear to the students. This paper discusses the design criteria used to develop a series of Pascal programs, implemented on widely used microcomputers, which make use of graphics to illustrate the effects of programming algorithms on common data structures. These programs were designed to be used in classroom demonstrations and by individual students working in the computing laboratory. A non-machine specific design of an algorithm teacher is proposed. It is a programmed environment to help students in a beginning computer science course learn problem solving skills. This paper provides an overview of the problem, a motivation and justification, followed by a brief description of what the program should provide the student.", acknowledgement = ack-nhfb, fjournal = "SIGCSE Bulletin (ACM Special Interest Group on Computer Science Education)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J688", } @Article{Odette:1987:CPF, author = "L. L. Odette", title = "Compiling {Prolog} to {Forth}", journal = j-J-FORTH-APPLIC-RESEARCH, volume = "4", number = "4", pages = "487--534", year = "1987", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "The fact that the focus of a Prolog computation is the structure of the program leads directly to a view of a Prolog compiler as a procedure that takes a collection of Prolog clauses and produces a description of their structure that just happens to be executable. Forth lends itself naturally to the description of both structures and processes. In fact, some hold that Forth programming involves creating the parts of speech required to describe an application. This article proposes that for this reason, Forth is a very good language for prototyping Prolog compilers. A simple object language for a Prolog to Forth compiler is presented and discussed.", checked = "19940317", keywords = "source", sjb = "Ignore all but the last sentence of the abstract, the last sentence is what this paper is all about. It describes a virtual machine for executing Prolog, how this virtual machine can be implemented in Forth and how the virtual machine instructions can be created from Prolog source. Appendices contain the code to implement the virtual machine and Prolog to virtual machine mapping. The compiled code is over ten times quicker than the interpreter described in~cite{Odette:Paloski:jfar:1987}. An optimised version has been ported to the NC4000P where it runs the naive reverse benchmark at 6K LIPS at a clock rate of 4MHz. Does {\em not} do garbage collection.", } @Article{Umeno:1987:NMR, author = "Hidenori Umeno and Shunji Tanaka", title = "New Methods for Realizing Plural Near-Native Performance Virtual Machines", journal = j-IEEE-TRANS-COMPUT, volume = "C-36", number = "9", pages = "1076--1087", month = sep, year = "1987", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.1987.5009538", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Sat Jul 9 09:28:55 MDT 2011", bibsource = "http://dblp.uni-trier.de/db/journals/tc/tc36.html#UmenoT87; https://www.math.utah.edu/pub/tex/bib/ieeetranscomput1980.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5009538", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Computers", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", oldlabel = "UmenoT87", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/tc/UmenoT87", } @PhdThesis{Watson:1987:PRL, author = "Paul Watson", title = "The Parallel Reduction of Lambda Calculus Expression", type = "Ph.{D}. Thesis", number = "UMCS-87-2-1", school = "University of Manchester, Computer Science Department", month = feb, year = "1987", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.cs.man.ac.uk/csonly/cstechrep/Abstracts/UMCS-87-2-1.html; mailto:techreports@cs.man.ac.uk", abstract = "Models of computation for the evaluation of Functional Programs are based on the rules for reducing Lambda Calculus expressions. Reduction is achieved by the application of the b-conversion rule to suitable redexes, but few models of computation provide a full implementation of this rule because of the complexity of avoiding variable name clashes. Consequently, evaluation orders are restricted to those in which name clashes cannot occur. \_ This thesis develops a model of computation for the parallel reduction of Lambda Calculus expressions, represented in De Bruijn's name-free notation, which does provide a full implementation of b-conversion, allowing expression to be reduced by any evaluation order. The model is designed to allow reduction to be performed on a parallel machine comprised of a set of processor/store pairs connected by a communications network. A data- driven, graph reduction execution mechanism is used to exploit the parallel hardware efficiently. \_ A language for specifying graph reduction models of computation is proposed, and is used to give full specification of the Lambda Calculus reduction model. Specifications in the language can be compiled to the instruction set of a virtual machine. The code produced can then be executed by a virtual machine emulator, or could be recompiled to the order code of a physical processor to allow the high performance simulation of models of computation. The virtual machine is used as the foundation for the design of a physical machine which would support the parallel reduction of lambda calculus expressions. \_ One of the major issues in the design of graph reduction models of computation is the removal of redundant parts of the expression graph. Neither of the two standard Garbage Collection schemes: Reference Count, or Mark-Scan is entirely suitable for a distributed machine, mainly because of the synchronisation they require. A modified Reference Garbage Collection scheme is described which removes the need for synchronisation, and enhances some of the attractive properties of Reference Count Garbage Collection.", } @Article{Bodlaender:1988:CFU, author = "Hans L. Bodlaender", title = "The complexity of finding uniform emulations on fixed graphs", journal = j-INFO-PROC-LETT, volume = "29", number = "3", pages = "137--141", day = "26", month = oct, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (05C99 68R10)", MRnumber = "90e:68044", MRreviewer = "Pavel Tomasta", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, affiliationaddress = "Utrecht, Neth", classification = "722; 723; 921; C4240 (Programming and algorithm theory)", corpsource = "Department of Comput. Sci., Utrecht Univ., Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "complexity; computational complexity; Computer Simulation; Computer Systems, Digital; directed graphs; Fixed Graphs; fixed graphs; graph theory; Mathematical Techniques--Graph Theory; NP-complete; NP-completeness; parallel algorithms; Parallel Processing; Processor Networks; structure-preserving simulations; theory; Uniform Emulations; uniform emulations; verification; virtual machines", subject = "F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism \\ F.1.3 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Reducibility and completeness \\ G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous \\ G.1.0 Mathematics of Computing, NUMERICAL ANALYSIS, General, Parallel algorithms", treatment = "T Theoretical or Mathematical", } @Article{Donahue:1988:UAL, author = "Barry Donahue", title = "Using assembly language to teach concepts in the introductory course", journal = j-SIGCSE, volume = "20", number = "1", pages = "158--162", month = feb, year = "1988", CODEN = "SIGSD3", DOI = "https://doi.org/10.1145/52965.53003", ISSN = "0097-8418 (print), 2331-3927 (electronic)", ISSN-L = "0097-8418", bibdate = "Sat Nov 17 18:57:05 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigcse1980.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "While current trends in the teaching of the introductory course are very positive, several problems still remain to be faced. Among these are: A basic understanding of the operation of a computer. An emphasis on concept development rather than skill development. A proper historical perspective of computer science. To help remove these deficiencies, a very simple virtual machine is introduced. Beginning students learn to program on this machine with a very limited instruction set. Many topics related to software engineering, data structures, algorithm design, etc. are introduced in a top down fashion with details being developed with the aid of the virtual machine. When a high level language is introduced, students progress more rapidly and with a greater understanding of what is taking place in the machine. Students also develop a feel for computer science as a dynamic field and tend not to think of a particular language as being what computer science is.", acknowledgement = ack-nhfb, fjournal = "SIGCSE Bulletin (ACM Special Interest Group on Computer Science Education)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J688", } @TechReport{Gilbert:1988:TSW, author = "P. (Paul) Gilbert and others", title = "Typed {Smalltalk} working papers, 1988", volume = "UIUCDCS-R-88-1457; UILU-ENG-88-1762", type = "Report", institution = "Department of Computer Science, University of Illinois at Urbana-Champaign", address = "1304 W. Springfield Ave., Urbana 61801, IL, USA", pages = "118", month = sep, year = "1988", LCCN = "QA76 .I4 no. 1457; QA76.73.S59", bibdate = "Mon Apr 10 10:43:48 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.loc.gov:7090/Voyager", acknowledgement = ack-nhfb, remark = "A user's guide to Typed Smalltalk / Ralph E. Johnson and Justin O. Graver -- High level optimization in a Typed Smalltalk compiler / by Joseph Patrick Loyall (iii, 44 p.) -- The virtual machine architecture of Typed Smalltalk / Ralph E. Johnson, Lawrence W. Zurawski -- An implementation-independent definition of Smalltalk execution contexts / Lawrence W. Zurawski -- Creating stand-alone Smalltalk applications / Paul D. Gilbert.", subject = "Smalltalk (Computer program language); Object-oriented programming (Computer science)", } @Manual{IBM:1988:VMSa, author = "{IBM Corporation}", title = "Virtual machine \slash{} extended architecture system product: application development guide for {FORTRAN} and {COBOL}", organization = pub-IBM, address = pub-IBM:adr, pages = "iii--x + 263", year = "1988", bibdate = "Sat Jan 27 13:40:57 MST 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, annote = "Index. ``SC23-0369-0.'' ``Licensed program 5664-308''.", keywords = "IBM Manuals.", } @Manual{IBM:1988:VMSb, author = "{International Business Machines Corporation}", title = "Virtual machine \slash{} system product: application development guide for {FORTRAN} and {COBOL}", organization = pub-IBM, address = pub-IBM:adr, edition = "Fourth", pages = "x + 280", year = "1988", bibdate = "Sat Jan 27 13:40:57 MST 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, annote = "Spine title: VM/SP Application Development Guide for FORTRAN and COBOL. ``SC24-5247-03.'' ``July 1988'' ``File number S370/4300-50.'' Includes index. Bibliography: p.263-266.", keywords = "Virtual computer systems.", } @Article{Janakiram:1988:RPB, author = "V. K. Janakiram and E. F. Gehringer and D. P. Agrawal and Mehrotra and R.", title = "A randomized parallel branch-and-bound algorithm", journal = j-INT-J-PARALLEL-PROG, volume = "17", number = "3", pages = "277--301", month = jun, year = "1988", CODEN = "IJPPE5", ISSN = "0885-7458 (print), 1573-7640 (electronic)", ISSN-L = "0885-7458", bibdate = "Sat Apr 26 11:04:14 MDT 1997", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=17&issue=3; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C5470 (Performance evaluation and testing); C7430 (Computer engineering)", corpsource = "AT and T Bell Labs, Holmdel, NJ, USA", fjournal = "International Journal of Parallel Programming", journal-URL = "http://link.springer.com/journal/10766", keywords = "computational complexity; knapsack problem; multiprocessor simulator; parallel algorithms; parallel branch-and-bound algorithm; parallel deterministic algorithms; performance evaluation; randomized algorithms; reliability; software reliability; speedup bounds; virtual machines", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Kermarrec:1988:SEA, author = "Y. Kermarrec", title = "Some experiments with {Ada}", journal = j-ADA-USER, volume = "9", number = "2", pages = "79--82", month = "????", year = "1988", CODEN = "ADUSEB", ISSN = "0268-652X", bibdate = "Mon Sep 8 18:43:50 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, classification = "C6110 (Systems analysis and programming); C7430 (Computer engineering)", corpsource = "Department Inf. et Reseaux, Ecole Nat. Sup{\'e}rieure des Telecommun. de Bretagne, Brest, France", fjournal = "Ada User", keywords = "Ada; Ada programming language; computer networks; distributed algorithms; Occam; Occam debugging; parallel programming; program debugging; transputer network simulator; transputers; virtual machines", pubcountry = "UK", treatment = "P Practical", } @InCollection{Low:1988:SPO, author = "C. Low", editor = "S. Gjessing and K. Nygaard", booktitle = "ECOOP '88 European Conference on Object-Oriented Programming", title = "A Shared, Persistent Object Store", publisher = pub-SV, address = pub-SV:adr, pages = "390--410", month = aug, year = "1988", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Smalltalk-80 is presented as a useful testbed for prototyping applications involving shared, persistent objects, and a detailed design of a shared persistent object store is discussed. The store is a set of named containers for object state, and it provides low-cost atomic transactions using an optimistic synchronization technique. The standard Smalltalk-80 virtual machine is modified to support a new object class, the Transaction,and an example of a Smalltalk program using nested sub-transactions is given. Immutability of object state is identified both as an important property of objects, and a basis for producing an efficient implementation within a distributed system environment.", keywords = "Persistent Objects", } @Article{Sandberg:1988:EOO, author = "David W. Sandberg", title = "Experience With an Object-oriented Virtual Machine", journal = j-SPE, volume = "18", number = "5", pages = "415--426 (or 415--425??)", month = may, year = "1988", CODEN = "SPEXBL", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Sat May 31 13:36:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Software---Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", } @Article{So:1988:PLV, author = "K. So and V. Zecca", title = "Program locality of vectorized applications running on the {IBM} 3090 with {Vector Facility}", journal = j-IBM-SYS-J, volume = "27", number = "4", pages = "436--452", month = nov, year = "1988", CODEN = "IBMSA7", ISSN = "0018-8670", bibdate = "Tue Mar 19 17:38:46 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "An Instruction-level simulator is used to study the program locality of large scientific applications. The simulator, which models an IBM 3090 processor with Vector Facility and a cache, was developed to help a programmer improve the performance of an application through better understanding and use of the Vector Facility and the memory hierarchy of the IBM 3090 system. The main observations on a set of scientific applications are as follows: although the applications have different characteristics of memory accesses and vectorization, their program locality is high enough to take advantage of conventional cache structures; the cache hit ratio of the vector execution can be quite different from (but not significantly lower than) that of the scalar execution of the same application; and the application programs that are written to optimize the use of the memory hierarchy in the system generally result in higher cache hit ratios than the others. The cache performance of these applications with respect to various cache parameters is also presented. In particular, the study finds that the cache structure of the IBM 3090 is well suited for large scientific applications.", acknowledgement = ack-nhfb, affiliation = "IBM Res. Div., Yorktown Heights, NY, USA", classification = "C5440 (Multiprocessor systems and techniques); C5470 (Performance evaluation and testing); C7430 (Computer engineering)", fjournal = "IBM Systems Journal", keywords = "Cache performance; Conventional cache structures; design, Instruction-level simulator; IBM 3090; measurement; performance; Scientific applications; Vector Facility", pubcountry = "USA", subject = "C.4 Computer Systems Organization, PERFORMANCE OF SYSTEMS \\ C.5.3 Computer Systems Organization, COMPUTER SYSTEM IMPLEMENTATION, Microcomputers \\ B.3.2 Hardware, MEMORY STRUCTURES, Design Styles, Cache memories", thesaurus = "Buffer storage; IBM computers; Parallel machines; Performance evaluation; Virtual machines", } @Article{Tucker:1988:AAC, author = "Lewis W. Tucker and George G. Robertson", title = "Architecture and Applications of the {Connection Machine}", journal = j-COMPUTER, volume = "21", number = "8", institution = "TMC", pages = "26--38", month = aug, year = "1988", CODEN = "CPTRB4", ISSN = "0018-9162 (print), 1558-0814 (electronic)", ISSN-L = "0018-9162", bibdate = "Sat Aug 17 16:07:35 1996", bibsource = "Database/Graefe.bib; Graphics/rosenfeld/1988.bib; Graphics/vision.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; Misc/IMMD_IV.bib; Parallel/par.misc.bib", annote = "I think this is a better article than the Scientific American or other papers I've seen on this. --enm There is some salesmanship.", fjournal = "Computer", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2", keywords = "CM, CM-2, data vault, virtual machines, nexus, *LISP, C*, SIMD, image analysis example,, Thinking Machines, image processing, digital", } @Article{Birmingham:1989:MSC, author = "William P. Birmingham and Anurag P. Gupta and Daniel P. Siewiorek", title = "The {Micon} System for Computer Design", journal = j-IEEE-MICRO, volume = "9", number = "5", pages = "61--67", month = sep # "\slash " # oct, year = "1989", CODEN = "IEMIDZ", DOI = "https://doi.org/10.1109/40.45823", ISSN = "0272-1732 (print), 1937-4143 (electronic)", ISSN-L = "0272-1732", bibdate = "Thu Dec 14 06:08:58 MST 2000", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; Science Citation Index database (1980--2000)", acknowledgement = ack-nhfb, affiliation = "Univ of Michigan, Ann Arbor, MI, USA", classcodes = "C7430 (Computer engineering)", classification = "722; 723", corpsource = "Michigan Univ., Ann Arbor, MI, USA", fjournal = "IEEE Micro", journal-URL = "http://www.computer.org/csdl/mags/mi/index.html", keywords = "artificial intelligence; computer; Computer Hardware; Computers, Microcomputer--Design; databases; Design; design; Design Automation; design synthesis; Micon system; microprocessor configurer system; tool environment; virtual machines", treatment = "P Practical; R Product Review", xxauthor = "W. P. Birmingham and D. P. Siewiorek and A. P. Gupta", } @Article{Blandy:1989:VSM, author = "G. O. Blandy and S. R. Newson", title = "{VM\slash XA} storage management", journal = j-IBM-SYS-J, volume = "28", number = "1", pages = "175--191", year = "1989", CODEN = "IBMSA7", ISSN = "0018-8670", bibdate = "Tue Mar 19 17:38:46 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "The VM/XA System Product manages the vast amounts of real and expanded storage available on the new Enterprise Systems Architecture/370 processors for both guest use and support of internal operating system functions. The management algorithms are examined, and the rationale for their selection is presented.", acknowledgement = ack-nhfb, affiliation = "IBM Data Syst. Div., Kingston, NY, USA", classification = "C5220 (Computer architecture); C5420 (Mainframes and minicomputers); C6120 (File organisation); C6150J (Operating systems)", fjournal = "IBM Systems Journal", keywords = "Enterprise Systems Architecture/370; Expanded storage; Guest use; IBM; Internal operating system functions; Mainframes; Storage management; Virtual machines; VM/XA", pubcountry = "USA", thesaurus = "Computer architecture; IBM computers; Mainframes; Storage allocation; Storage management; Virtual machines; Virtual storage", } @TechReport{Blelloch:1989:SPP, author = "G. E. Blelloch", title = "{SCAN} {PRIMITIVES} {AND} {PARALLEL} {VECTOR} {MODELS}", type = "Technical Report", number = "MIT/LCS/TR-463", institution = "Massachusetts Institute of Technology, Laboratory for Computer Science", pages = "256", month = jul, year = "1989", bibdate = "February 25, 1995", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "Cost is \$26. Date: Oct. 1989 Keywords: parallel algorithms, parallel computing, P-RAM, parallel compilers, data-parallel, scan operation, vector models", abstract = "This thesis defines a class of machine models called parallel vector models and demonstrates that these models are excellent both as algorithmic models on which the complexity of algorithms can be analyzed, and as instruction sets for virtual machines to which very high-level programming languages can be compiled. As algorithmic models, the thesis argues that the parallel vector models permit a simpler and more concise description and complexity analysis of algorithms than the Parallel-RAM models. The thesis describes and analyzes a broad variety of parallel algorithms in the parallel vector models ranging from graph algorithms to numerical algorithms. The thesis also describes a compiler that compiles a high-level language, PARALATION LISP, into the models and describes how the models can be implemented on an actual parallel machine, the Connection Machine. A set of scan primitives and a set of segmented primitives play a crucial role in the algorithms and the algorithms and the compiler described in the thesis. The scan primitives can be used for a huge variety of tasks and improve the asymptotic complexity of many algorithms by an O (lg n) factor. The segmented instructions can be used to execute a vector routine over many sets of values in parallel. They form the foundation of a technique for flattening nested parallelism used by the compiler.", notes = "Cost is \$26. Date: Oct. 1989 Keywords: parallel algorithms, parallel computing, P-RAM, parallel compilers, data-parallel, scan operation, vector models", } @Article{Bozman:1989:VSM, author = "G. P. Bozman", title = "{VM\slash XA SP2} minidisk cache", journal = j-IBM-SYS-J, volume = "28", number = "1", pages = "165--174", year = "1989", CODEN = "IBMSA7", ISSN = "0018-8670", bibdate = "Tue Mar 19 17:38:46 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Given the growing disparity between CPU power and the speed of secondary storage, a data cache exploiting large processor storage has the potential to improve response time dramatically in many situations. The VM/XA SP2 minidisk cache facility, the result of research activity on the characteristics of interactive file-system activity, uses expanded storage to cache input/output to minidisks on the Conversational Monitor System. The size of the cache is dynamically adjusted by an arbitration process to optimize system performance. Several other functions improve the performance of the cache during periods of unusual I/O loads.", acknowledgement = ack-nhfb, affiliation = "IBM Res. Div., T. J. Watson Res. Center, Yorktown Heights, NY, USA", classification = "C5320C (Storage on moving magnetic media); C5320G (Semiconductor storage); C6150J (Operating systems)", fjournal = "IBM Systems Journal", keywords = "Conversational Monitor System; CPU power; Data cache; Expanded storage; I/O loads; IBM; Input/output; Interactive file-system activity; Large processor storage; Response time; Secondary storage; System performance; Virtual Machine/Extended Architecture; VM/XA SP2 minidisk cache", pubcountry = "USA", thesaurus = "Buffer storage; IBM computers; Magnetic disc storage; Storage allocation; Storage management", } @TechReport{Brorsson:1989:ESV, author = "Mats Brorsson", key = "198910", title = "{Emulation of Shared Virtual Memory on an Experimental Multiprocessor}", institution = "Department of Computer Engineering, Lund University", address = "P.O. Box 118, S-221~00 Lund, Sweden", month = oct, year = "1989", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", annote = "The performance of a paged virtual memory system is relative to program behaviour, which makes it important to use realistic workloads in the evaluation. Memory traces are often used to drive simulation models of paging performance. In the case of multiprocessors, however, the complex interactions between parallel processes cannot be captured by static traces. An experimental environment for performance evaluation of shared virtual memory systems on a class of multiprocessors has been developed. It is based on emulation of memory structures in software, which combines the flexibility of simulation with the efficiency of dedicated hardware. Each memory reference is handled by software executed on special purpose emulation hardware, which makes it possible to implement a wide range of memory management mechanisms. By combining hardware (containing 38 processing elements) with emulation software, virtual machines capable of executing real life parallel programs are created. Non-invasive run-time measurements targeted for each particular experiment can be done by means of 'software probes' integrated in the emulation software. In order to show how the experimental system can be used, a particular decentralized virtual memory management scheme has been implemented. It is based on a generalized version of the Denning working set policy also handling shared pages. As part of the example, facilities for automatic experimental control and graphical result presentation are demonstrated.", ftp = "dit.lth.se:/pub/techreports/complete-papers/Dt-070.ps.Z", location = "070", } @TechReport{Demillo:1989:DSC, author = "Richard A. Demillo and Richard J. Lipton", title = "Defining Software by Continuous, Smooth Functions", number = "SERC-TR-49-P", institution = "Software Engineering Research Centre", month = aug, year = "1989", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "A simple proof is given that for every operational description of a software system expressed as a discrete state transition function on a virtual machine there is a continuous smooth function on the reals that agrees with the state transition function on all legal states and has exactly the same complexity. An implication of this result is that there is no reason in principle that the methods of classical analysis cannot be used in software engineering.", } @Article{Farrow:1989:VCB, author = "Rodney Farrow and Alec G. Stanculescu", title = "A {VHDL} compiler based on attribute grammar methodology", journal = j-SIGPLAN, volume = "24", number = "7", pages = "120--130", month = jul, year = "1989", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:41 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/73141/index.html; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/73141/p120-farrow/", abstract = "This paper presents aspects of a compiler for a new hardware description language (VHDL) written using attribute grammar techniques. VHDL is introduced, along with the new compiler challenges brought by a language that extends an Ada subset for the purpose of describing hardware. Attribute grammar programming solutions are presented for some of the language challenges. The organization of the compiler and of the target virtual machine represented by the simulation kernel are discussed, and performance and code-size figures are presented. The paper concludes that attribute grammars can be used for large commercial compilers with excellent results in terms of rapid development time and enhanced maintainability, and without paying any substantial penalty in terms of either the complexity of the language that can be handled or the resulting compilation speed.", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'89.", classification = "722; 723", conference = "Proceedings of the SIGPLAN '89 Conference on Programming Language Design and Implementation", fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", journalabr = "SIGPLAN Not", keywords = "Attribute Grammar Methodology; Computer Hardware Description Languages; Computer Operating Systems--Program Compilers; Computer Programming Languages--Ada; Design; design; languages", meetingaddress = "Portland, OR, USA", meetingdate = "Jun 21--23 1989", meetingdate2 = "06/21--23/89", sponsor = "ACM, Special Interest Group on Programming Languages, New York; SS NY, USA", subject = "{\bf B.6.3} Hardware, LOGIC DESIGN, Design Aids, Hardware description languages. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.2.10} Software, SOFTWARE ENGINEERING, Design**, Methodologies**.", } @Article{Giacalone:1989:FSI, author = "Alessandro Giacalone and Prateek Mishra and Sanjiva Prasad", title = "{FACILE}: a Symmetric Integration of Concurrent and Functional Programming", journal = j-INT-J-PARALLEL-PROG, volume = "18", number = "2", pages = "121--160", month = apr, year = "1989", CODEN = "IJPPE5", DOI = "https://doi.org/10.1007/BF01491213", ISSN = "0885-7458 (print), 1573-7640 (electronic)", ISSN-L = "0885-7458", bibdate = "Wed Jul 6 16:39:43 MDT 2005", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=18&issue=2; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; Misc/Functional.bib; Parallel/Pfpbib.bib", note = "Also in TAPSOFT '89, ed. J. Diaz and F. Orejas, pp. 184-209, Springer-Verlag, Lecture Notes in Computer Science 352 (1989).", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=18&issue=2&spage=121", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory); C6110 (Systems analysis and programming); C6140D (High level languages); C7430 (Computer engineering)", corpsource = "Department of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA", fjournal = "International Journal of Parallel Programming", journal-URL = "http://link.springer.com/journal/10766", keywords = "abstract model; automata theory; C-FAM; compilation rules; Concurrent and Functional Abstract Machine; concurrent processes; execution rules; expression evaluation; Facile; functional programming; high level languages; labeled transition system; multi-paradigm languages; operational behavior; operational semantics; parallel programming; structural operational semantics; virtual machines", treatment = "B Bibliography; P Practical", } @Article{Perez-Cazares:1989:DAL, author = "J.-R. Perez-Cazares and R. Rannou", title = "Developing an Animated Local Network Simulator", journal = j-CGF, volume = "8", number = "2", pages = "139--142", month = jun, year = "1989", CODEN = "CGFODY", ISSN = "0167-7055 (print), 1467-8659 (electronic)", ISSN-L = "0167-7055", bibdate = "Mon Apr 14 10:23:20 MDT 1997", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, affiliation = "Ecole Natl Sup{\'e}rieure des Telecommunications de Bretagne", affiliationaddress = "Brest, Fr", classification = "718; 723; C5620L (Local area networks); C6110 (Systems analysis and programming); C6130B (Graphics techniques); C7430 (Computer engineering); C7810C (Computer-aided instruction)", conference = "7th Annual Eurographic (UK) Conference", conflocation = "Manchester, UK; 29--31 March 1989", conftitle = "7th EUROGRAPHICS UK Conference", corpsource = "Lab. Infor. de Brest Ecole Nat. Sup{\'e}rieure des Telecommun. de Bretagne, Brest, France", fjournal = "Com{\-}pu{\-}ter Graphics Forum", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1467-8659/", keywords = "Ada; Ada code; animated; Animated environment; animated local network; Animated local network simulator; Animation; computer aided instruction; computer animation; Computer Graphics; Computer Networks--Local Networks; Computer Programming Languages--Ada; Computer Simulation--Applications; Design methodology; design methodology; design process; Design process; designer; digital; distributed systems research group; Distributed systems research group; environment; graphical; Graphical representation; IEEE animated network simulator; internal behaviour; Internal behaviour; languages, IEEE animated network simulator; local area networks; methods; network; Network designer; Object-Oriented Development, design; parallelism; Parallelism; pictorial; Pictorial methods; representation; simulation; simulator; Software engineering; software engineering; teaching support; Teaching support; teaching support; virtual machines", meetingaddress = "Manchester, Engl", meetingdate = "Mar 29--31 1989", meetingdate2 = "03/29--31/89", subject = "I.3.5 Computing Methodologies, COMPUTER GRAPHICS, Computational Geometry and Object Modeling, Modeling packages \\ C.2.5 Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Local Networks \\ I.3.7 Computing Methodologies, COMPUTER GRAPHICS, Three-Dimensional Graphics and Realism, Animation", thesaurus = "Ada; Computer aided instruction; Computer animation; Digital simulation; Local area networks; Software engineering; Virtual machines", treatment = "P Practical", } @TechReport{Scott:1989:EOS, author = "M. L. Scott and T. J. LeBlanc and B. D. Marsh", title = "Evolution of an Operating System for Large-Scale Shared-Memory Multiprocessors", type = "TR", number = "TR309", institution = "University of Rochester, Computer Science Department", month = mar, year = "1989", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "Thu, 17 Jul 97 09:00:00 GMT", URL = "ftp://ftp.cs.rochester.edu/pub/papers/systems/89.TR309.Psyche_Evolution.ps.Z", abstract = "Scalable shared-memory multiprocessors (those with non-uniform memory access times) are among the most flexible architectures for high-performance parallel computing, admitting efficient implementations of a wide range of process models, communication mechanisms, and granularities of parallelism. Such machines present opportunities for general-purpose parallel computing that cannot be exploited by existing operating systems, because the traditional approach to operating system design presents a virtual machine in which the definition of processes, communication, and grain size are outside the control of the user. Psyche is an operating system designed to enable the most effective use possible of large-scale shared memory multiprocessors. The Psyche project is characterized by (1) a design that permits the implementation of multiple models of parallelism, both within and among applications, (2) the ability to trade protection for performance, with information sharings as the default, rather than the exception, (3) explicit, user-level control of process structure and scheduling, and (4) a kernel implementation that uses shared memory itself, and that provides users with the illusion of uniform memory access times.\par The postscript here was reconstructed from old troff source, and does not match the formatting of the hard-copy TR. In particular, the bibliography has re-built from a newer database, and in several cases cites newer versions of papers -- versions that postdate the TR.", annote = "Scalable shared-memory multiprocessors (those with non-uniform memory access times) are among the most flexible architectures for high-performance parallel computing, admitting efficient implementations of a wide range of process models, communication mechanisms, and granularities of parallelism. Such machines present opportunities for general-purpose parallel computing that cannot be exploited by existing operating systems, because the traditional approach to operating system design presents a virtual machine in which the definition of processes, communication, and grain size are outside the control of the user. Psyche is an operating system designed to enable the most effective use possible of large-scale shared memory multiprocessors. The Psyche project is characterized by (1) a design that permits the implementation of multiple models of parallelism, both within and among applications, (2) the ability to trade protection for performance, with information sharing as the default, rather than the exception, (3) explicit, user-level control of process structure and scheduling, and (4) a kernel implementation that uses shared memory itself, and that provides users with the illusion of uniform memory access times. The postscript here was reconstructed from old troff source, and does not match the formatting of the hard-copy TR. In particular, the bibliography has re-built from a newer database, and in several cases cites newer versions of papers -- versions that postdate the TR. 89.TR309.Psyche_Evolution.ps.Z", keywords = "psyche tr309", } @InProceedings{Signorini:1989:HSM, author = "J. Signorini", title = "How a {SIMD} machine can implement a complex cellular automaton? {A} case study: {von Neumann}'s 29-state cellular automaton", crossref = "ACM:1989:PSN", pages = "175--186", year = "1989", bibdate = "Wed Apr 15 19:32:44 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory); C5220 (Computer architecture); C7430 (Computer engineering)", corpsource = "Department d'Inf., Paris 8 Univ., St. Denis, France", keywords = "14 bit per processing element; 29-state cellular automaton; complex cellular automaton; decoder; finite automata; parallel architectures; periodic pulser; SIMD machine; transition rule; virtual machines", sponsororg = "ACM; IEEE", treatment = "X Experimental", } @Article{Tetzlaff:1989:ABS, author = "William H. Tetzlaff and Martin G. Kienzle and Juan A. Garay", title = "Analysis of block-paging strategies", journal = j-IBM-JRD, volume = "33", number = "1", pages = "51--59", month = jan, year = "1989", CODEN = "IBMJAE", ISSN = "0018-8646 (print), 2151-8556 (electronic)", ISSN-L = "0018-8646", bibdate = "Tue Mar 25 14:26:59 MST 1997", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "The performance of interactive paging systems in general and Virtual Machine/System Product (VM/SP) systems with the High Performance Option (HPO) in particular depends upon locality of reference. This storage-management dependency, often considered in the context of individual programs, extends in fact to a significant degree across most virtual-machine transactions. This paper investigates strategies to exploit locality of reference at the system level by analyzing page-reference strings gathered from live systems. Alternative strategies are evaluated using trace-driven simulations.", acknowledgement = ack-nhfb, affiliation = "IBM Res. Div., Thomas J. Watson Res. Center", affiliationaddress = "Yorktown Heights, NY, USA", classcodes = "C6120 (File organisation)", classification = "721; 722; 723; C6120 (File organisation)", corpsource = "IBM Res. Div., Thomas J. Watson Res. Center, Yorktown Heights, NY, USA", fjournal = "IBM Journal of Research and Development", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520", journalabr = "IBM J Res Dev", keywords = "Block-Paging Strategies; Block-paging strategies; block-paging strategies; Computer Programming; Data Processing; Data Storage, Digital; High Performance Option; Interactive Paging; interactive paging systems; Interactive paging systems; Live systems; live systems; Machine/System Product; management dependency; page-; Page-Reference Strings; Page-reference strings; reference strings; storage management; storage-; Storage-Management Dependency; Storage-management dependency; Trace-Driven Simulations; Trace-driven simulations; trace-driven simulations; Virtual; Virtual Machine/System Product; virtual storage; Virtual-machine transactions; virtual-machine transactions; Virtual-Machine Transactions", thesaurus = "Storage management; Virtual storage", treatment = "P Practical", } @Article{Thomas:1989:AMM, author = "David A. Thomas and Wilf R. LaLonde and John Duimovich and Michael Wilson and Jeff McAffer and Brian Barry", title = "{Actra} --- a multitasking\slash multiprocessing {Smalltalk}", journal = j-SIGPLAN, volume = "24", number = "4", pages = "87--90", month = apr, year = "1989", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:37 MST 2003", bibsource = "Compendex database; http://portal.acm.org/; http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/67386/p87-thomas/", abstract = "The Actra project is investigating future generation industrial computer systems based on the actor or object-oriented metaphor. It is designed to provide an integrated, multi-user, multi-processor object-oriented program development environment for use in medium and high performance industrial applications dealing with complex man-machine systems. Typical areas include command and control systems, manufacturing systems, simulation and intelligent assistants. In this paper we have presented concurrent programming features of Actra a multiprocessor Smalltalk. The design builds on existing message passing primitives and requires minimal changes to the Smalltalk virtual machine and applications programs. We have introduced operations for creating and communicating between active objects(actors) which are consistent with the object-oriented viewpoint. The resulting system provides a powerful facility for performing anthropomorphic programming in a multitasking\slash multiprocessor environment.", acknowledgement = ack-nhfb, affiliation = "Carleton Univ", affiliationaddress = "Ottawa, Ont, Can", classification = "723", conference = "Proceedings of the ACM SIGPLAN Workshop on Object-Based Concurrent Programming", confname = "Proceedings of the ACM SIGPLAN workshop on Object-based concurrent programming, September 26--27 1988, San Diego, CA", fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", journalabr = "SIGPLAN Not", keywords = "Actor Based Systems; Computer Programming Languages; Computer Systems Programming--Multiprocessing Programs; Concurrent Programming; design; languages; Object-Based Programming; Programming Language Actra", meetingaddress = "San Diego, CA, USA", meetingdate = "Sep 26--27 1988", meetingdate2 = "09/26--27/88", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Smalltalk-80.", } @InProceedings{Wang:1989:NNS, author = "C.-J. Wang and C.-H. Wu and S. Sivasundaram", title = "Neural network simulation on shared-memory vector multiprocessors", crossref = "ACM:1989:PSN", pages = "197--204", year = "1989", bibdate = "Wed Apr 15 19:32:44 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, classification = "C1230 (Artificial intelligence)C4240 (Programming and algorithm theory); C7430 (Computer engineering)", corpsource = "Department of Electr. and Comput. Eng., Colorado Univ., Colorado Springs, CO, USA", keywords = "Alliant FX/80; concurrent operations; delay differential equation; feedforward network; Fourier transform; Hopfield network; learning systems; neural computing; neural nets; neural network simulation; parallel algorithms; parallel architectures; parallel machine; parallel machines; parallel training algorithm; recurrent network; shared-memory vector multiprocessors; training algorithms; training data size; training time; travelling salesman problem; vector multiprocessor; virtual machines", sponsororg = "ACM; IEEE", treatment = "P Practical; X Experimental", } @InProceedings{Wendorf:1989:SOS, author = "J. W. Wendorf and R. G. Wendorf and H. Tokuda", title = "Scheduling operating system processing on small-scale multiprocessors", crossref = "Shriver:1989:PTA", pages = "904--913 (vol. 2)", year = "1989", bibdate = "Sun Sep 29 06:28:50 MDT 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, affiliation = "North American Philips Corp., Briarcliff Manor, NY, USA", classification = "C6150J (Operating systems); C7430 (Computer engineering)", keywords = "Assignment policies; Asymmetric handling; Discrete event simulator; Load conditions; Mach; Operating system processing; Performance; Preemptive priority; Scheduling policies; Small-scale multiprocessors; Symmetric scheduling; System configurations; VAX-11/784", thesaurus = "DEC computers; Multiprocessing programs; Operating systems [computers]; Performance evaluation; Scheduling; Virtual machines", } @InProceedings{Bessiere:1990:VMM, author = "P. Bessiere and A. Chams and T. Muntean", booktitle = "Proceedings of the International Neural Network Conference Paris", title = "A virtual machine model for artificial neural network programming", publisher = pub-KLUWER, address = pub-KLUWER:adr, pages = "689--692", year = "1990", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", ref = "INNC", } @Article{Blelloch:1990:CCO, author = "G. E. Blelloch and G. W. Sabot", title = "Compiling Collection-Oriented Languages onto Massively Parallel Computers", journal = j-J-PAR-DIST-COMP, volume = "8", number = "2", pages = "119--134", month = feb, year = "1990", CODEN = "JPDCER", ISSN = "0743-7315 (print), 1096-0848 (electronic)", ISSN-L = "0743-7315", bibdate = "Sat Apr 12 17:13:17 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, classification = "C5440 (Multiprocessor systems and techniques); C6110 (Systems analysis and programming); C6150C (Compilers, interpreters and other processors)", corpsource = "Carnegie Mellon Univ., Sch. of Comput. Sci., Pittsburgh, PA, USA", fjournal = "Journal of Parallel and Distributed Computing", journal-URL = "http://www.sciencedirect.com/science/journal/07437315", keywords = "collection oriented languages compilation; compiler; descriptions; flat virtual machine; high-level; massively; nested collections; nested parallelism; PARALATION LISP; parallel computers; parallel processing; parallel programming; program compilers", treatment = "P Practical", } @InProceedings{Board:1990:PPN, author = "J. A. {Board, Jr.} and J. Shue-Jen Lu", title = "Performance of parallel neural network simulations", crossref = "Board:1990:TRA", pages = "185--200", year = "1990", bibdate = "Sat Sep 28 20:21:01 MDT 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, affiliation = "Department of Electr. Eng., Duke Univ., Durham, NC, USA", classification = "C1230 (Artificial intelligence); C5440 (Multiprocessor systems and techniques); C5470 (Performance evaluation and testing); C7430 (Computer engineering)", keywords = "BBN Butterfly; C language; Communication overhead; Constraint satisfaction; INMOS Transputer; MACH operating system; Network size; Occam 2; Parallel neural network simulations; Partitioned algorithm; Performance evaluation; Speedup limit; T800 Transputer; Transputer Development System programming environment; Uniform System programming environment", thesaurus = "Neural nets; Parallel algorithms; Performance evaluation; Programming environments; Transputers; Virtual machines", } @InProceedings{Feeley:1990:PVM, author = "Marc Feeley and James S. Miller", booktitle = "Proceedings of the 1990 ACM Conference on LISP and Functional Programming, Nice", title = "A parallel virtual machine for efficient {Scheme} compilation", crossref = "ACM:1990:PAC", publisher = pub-ACM, address = pub-ACM:adr, bookpages = "????", pages = "119--130", month = jun, year = "1990", bibdate = "Wed Jan 24 04:51:56 MST 2001", bibsource = "http://dblp.uni-trier.de/db/conf/lfp/lfp1990.html#FeeleyM90; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.acm.org/pubs/citations/proceedings/lfp/91556/p119-feeley/", abstract = "Programs compiled by Gambit, our Scheme compiler, achieve performance as much as twice that of the fastest available Scheme compilers. Gambit is easily ported, while retaining its high performance, through the use of a simple virtual machine (PVM). PVM allows a wide variety of machine-independent optimizations and it supports parallel computation based on the future construct. PVM conveys high-level information bidirectionally between the machine-independent front end of the compiler and the machine-dependent back end, making it easy to implement a number of common back end optimizations that are difficult to achieve for other virtual machines. PVM is similar to many real computer architectures and has an option to efficiently gather dynamic measurements of virtual machine usage. These measurements can be used in performance prediction for ports to other architectures as well as design decisions related to proposed optimizations and object representations.", acknowledgement = ack-nhfb, affiliation = "Brandeis Univ., Waltham, MA, USA", classification = "C6150C (Compilers, interpreters and other processors)", conflocation = "Nice, France; 27--29 June 1990", corpsource = "Brandeis Univ., Waltham, MA, USA", keywords = "Gambit; Lisp; machine-independent; Machine-independent front end; machine-independent front end; Machine-independent optimizations; object; Object representations; optimizations; parallel processing; Parallel virtual machine; parallel virtual machine; portability; program compilers; PVM portability; representations; Scheme compiler; simple virtual machine; Simple virtual machine; software; virtual machines", oldlabel = "FeeleyM90", sponsororg = "ACM", thesaurus = "Parallel processing; Program compilers; Software portability; Virtual machines", treatment = "P Practical", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#conf/lfp/FeeleyM90", } @InProceedings{Hu:1990:RTC, author = "W. Hu", title = "Reducing Timing Channels with Fuzzy Time", crossref = "IEEE:1990:PIC", pages = "8--20", year = "1990", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", annote = "This paper describes fuzzy time. This is a collection of techniques that reduces the bandwidths of covert timing channels by making all clocks available to a process noisy. Developed in response to the problems posed by high-speed hardware timing channels, fuzzy time has been implemented in the VAX security kernel. The VAX security kernel is a virtual-machine monitor security kernel for the VAX architecture designed to meet the requirements of the A1 rating from the National Computer Security Center.", } @InProceedings{Karger:1990:VSK, author = "P. A. Karger and M. E. Zurko and D. W. Bonin and A. H. Mason and C. E. Kahn", title = "A {VMM} Security Kernel for the {VAX} Architecture", crossref = "IEEE:1990:PIC", pages = "2--19", year = "1990", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", annote = "This paper describes the development of a virtual-machine monitor (VMM) security kernel for the VAX architecture. The paper particularly focuses on how the systems hardware, microcode, and software are aimed at meeting A1-level security requirements while maintaining the standard interfaces and applications of the VMS and ULTRIX-32 operating systems. The VAX security kernel supports multiple concurrent virtual machines on a single VAX system, providing isolation and controlled sharing of sensitive data. Rigorous engineering standards were applied during development to comply with the assurance requirements for verification and configuration management. The VAX security kernel has been developed with a heavy emphasis on performance and on system management tools. The kernel performs sufficiently well that all of its development is now carried out in virtual machines running on the kernel itself, rather than in a conventional time-sharing system.", } @TechReport{Kratzer:1990:MPS, author = "Steven G. Kratzer", title = "Massively parallel sparse-matrix computations", type = "Technical report", number = "SRC-TR-90-008", institution = inst-SRC-IDA, address = inst-SRC-IDA:adr, pages = "14", day = "1", month = feb, year = "1990", bibdate = "Fri Aug 30 08:01:51 MDT 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "This paper shows that QR factorization of large, sparse matrices can be performed efficiently on massively-parallel SIMD (Single Instruction stream, Multiple Data stream) computers such as the Connection Machine CM-2. The problem is cast as a dataflow graph, using existing techniques for symbolic manipulation of the structure of the matrix. Then the nodes in the graph, which represent units of computational work, are mapped to a `virtual dataflow machine' in such a way that only nearest-neighbor communication is required. This virtual machine is implemented by programming the CM-2 processors to support the static dataflow protocol. Execution results for standard test matrices show that good performance is obtained even for `unstructured' sparsity patterns that are not amenable to nested dissection techniques.", acknowledgement = ack-nhfb, keywords = "Connection machines; Matrices; Parallel processing (Electronic computers)", } @InProceedings{Ozgur:1990:SON, author = "A. Ozgur and O. Kaynak", booktitle = "INNC 90 Paris. International Neural Network Conference", title = "A self organizing neural network for pattern recognition", volume = "1", institution = "Atakoy 5 Kisim B-1/17, Istanbul, Turkey", publisher = pub-KLUWER, address = pub-KLUWER:adr, pages = "107", year = "1990", ISBN = "0-7923-0831-X", ISBN-13 = "978-0-7923-0831-7", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Summary form only given, as follows. The authors simulate and test a neural network which can recognize patterns and which possesses abilities such as selective attention, segmentation, and associative recall. The network consists of several types of neurons of which some can learn and extract features, and others generate gain or threshold control signals. The backward propagation channels are responsible for selective attention and associative recall. The neural cells in the simulated network are organized in three layers and they total 16630 in number. The simulation program is written in C-language and run on an Apple Macintosh computer. This self-organizing network is able to repair a deformed pattern in a deformed manner, even if, during the training period, only undeformed and noise free patterns are presented to it.", city = "Paris, France", classification = "C1250 (Pattern recognition), C5260B (Computer vision and picture processing), C5320 (Digital storage), C1240 (Adaptive system theory), C1230 (Artificial intelligence), C7430 (Computer engineering)", days = "9-13 July 1990", file = "nn/attention/selective", index = "Layered", indexnumber = "3800010 C91007802", keywords = "Feature learning, Feature extraction, Deformed pattern repair, Self organizing neural network, Pattern recognition, Selective attention, Segmentation, Associative recall, Threshold control signals, Backward propagation channels, C-language, Apple Macintosh computer", refs = "0", sponsor = "Thomson", thesaurus = "Apple computers, Content-addressable storage, Neural nets, Pattern recognition, Picture processing, Self-organising storage, Virtual machines", treatment = "Theoretical/Mathematical", } @Article{Plata:1990:ASP, author = "O. G. Plata and J. D. Bruguera and F. F. Rivera and R. Doallo and E. L. Zapata", title = "{ACLE}: a Software Package for {SIMD} Computer Simulation", journal = j-COMP-J, volume = "33", number = "3", pages = "194--203", month = jun, year = "1990", CODEN = "CMPJA6", ISSN = "0010-4620 (print), 1460-2067 (electronic)", ISSN-L = "0010-4620", bibdate = "Tue Mar 25 13:51:56 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_03/", URL = "http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_03/tiff/194.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_03/tiff/195.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_03/tiff/196.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_03/tiff/197.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_03/tiff/198.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_03/tiff/199.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_03/tiff/200.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_03/tiff/201.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_03/tiff/202.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_03/tiff/203.tif", acknowledgement = ack-nhfb, affiliation = "Department of Electron., Univ. of Santiago de Compostela, Spain", classcodes = "C7430 (Computer engineering); C5440 (Multiprocessor systems and techniques); C6140D (High level languages); C6150C (Compilers, interpreters and other processors)", classification = "C5440 (Multiprocessor systems and techniques); C6140D (High level languages); C6150C (Compilers, interpreters and other processors); C7430 (Computer engineering)", corpsource = "Department of Electron., Univ. of Santiago de Compostela, Spain", fjournal = "The Computer Journal", journal-URL = "http://comjnl.oxfordjournals.org/", keywords = "ACLAN-to-C translator; ACLE; algorithm mapping; Algorithm mapping; algorithmic solution; Algorithmic solution; array; Array C Language Emulator; Array processor programming; C language; computer simulation; computers; hypercube; Hypercube computers; machine-independent; Machine-independent programming language; package; parallel algorithms; Parallel algorithms; processor programming; program execution; Program execution; program processors; programming language; SIMD; SIMD computer simulation; simulation routines library; Simulation routines library; software; Software package; software packages; subroutines; virtual machines", thesaurus = "C language; Parallel algorithms; Program processors; Software packages; Subroutines; Virtual machines", treatment = "P Practical", } @Article{Pountain:1990:SPP, author = "D. Pountain", title = "Simulating a primitive parallel computer", journal = j-BYTE, volume = "15", number = "13", pages = "72IS/25--26, 28, 30, 32, 34, 36--37", month = dec, year = "1990", CODEN = "BYTEDJ", ISSN = "0360-5280 (print), 1082-7838 (electronic)", ISSN-L = "0360-5280", bibdate = "Thu Sep 12 18:39:30 MDT 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, classification = "C7430 (Computer engineering)", fjournal = "BYTE Magazine", keywords = "Computer simulation; Parallel architectures; Parallel computers; Primitive parallel computer; Primitive Parallel Computers; PriPar; Turing machine", thesaurus = "Parallel machines; Virtual machines", } @Article{Rounce:1990:AWE, author = "Peter A. Rounce and Jose Delgado", title = "Architectures Within the {ESPRIT SPAN Project}", journal = j-IEEE-MICRO, volume = "10", number = "6", pages = "24--27, 88--97", month = nov # "\slash " # dec, year = "1990", CODEN = "IEMIDZ", DOI = "https://doi.org/10.1109/40.62727", ISSN = "0272-1732 (print), 1937-4143 (electronic)", ISSN-L = "0272-1732", bibdate = "Thu Dec 14 06:08:58 MST 2000", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; Science Citation Index database (1980--2000)", abstract = "To integrate symbolic and numeric computing on parallel systems, project participants developed a target architecture that resulted in a number of significant advancements in programming languages and architecture.", acknowledgement = ack-nhfb, affiliation = "Dept of Comput Sci, Univ Coll, London, UK", classcodes = "C5220 (Computer architecture); C7310 (Mathematics)", classification = "722; 723", corpsource = "Department of comput. Sci., Univ. Coll., London, UK", fjournal = "IEEE Micro", journal-URL = "http://www.computer.org/csdl/mags/mi/index.html", keywords = "Computational Models; Computer Architecture; Computer Programming Languages; Computer Systems, Digital--Parallel Processing; DICE; distributed memory architecture; esprit span Project; ESPRIT SPAN project; Kernel System architectures; parallel architectures; parallel systems; parallel-; Parle high-level procedural language; Research; Sprint processor architecture; symbol manipulation; symbolic and numeric computing; system architectures; Virtual Machine Code", treatment = "P Practical", } @TechReport{Schuh:1990:PRI, author = "Daniel T. Schuh and Michael J. Carey and David J. DeWitt", title = "Persistence in {E} Revisited---Implementation Experiences", type = "Technical Report", number = "CS-TR-1990-957", institution = "University of Wisconsin, Madison", month = aug, year = "1990", bibdate = "November 22, 1994", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "This paper discusses the design and implementation of the E Persistent Virtual Machine (EPVM), an interpreter that provides support for persistent data access in the current version of the E programming language. Included are descriptions of both the EPVM interface and the major implementation tactics employed within EPVM. A novel pointer swizzling scheme that has been investigated in the context of E and EPVM is also described. Finally, a performance analysis of the key EPVM primitives is presented.", } @InProceedings{Seiden:1990:AFV, author = "K. F. Seiden and J. P. Melanson", title = "The Auditing Facility for a {VMM} Security Kernel", crossref = "IEEE:1990:PIC", pages = "262--277", year = "1990", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", annote = "The VAX security kernel is a prototype security kernel implemented as a virtual machine monitor (VMM) for the VAX architecture. The VAX security kernel is capable of emulating one or more virtual machines (VMs) on a single physical machine allowing multiple copies of virtual machine operating systems to execute concurrently. The system presently supports both VMS and ULTRIX as virtual machine operating systems A fundamental component of any security kernel is the ability to produce an audit trail of security relevant events. While there are numerous examples of auditing subsystems at the DoD Trusted Computer System Evaluation Criteria (TCSEC) [5] C2 or B1 level, there is much less experience with the requirements at the B2 level and above. This paper describes the design and implementation of the VAX security kernel auditing facility, built to satisfy the requirements at the A1 level.", } @TechReport{Smith:1990:PTL, author = "Robert Smith and Aaron Sloman and John Gibson", title = "{POPLOG}'s Two-level Virtual Machine Support for Interactive Languages", type = "Cognitive Science Research Report", number = "153", institution = "University-of-Sussex", address = "Brighton", month = jan, year = "1990", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "To appear (1991?) in a volume edited by D.Sleeman and N.O.Bernson Price: 1.00 (Actually it appeared as Research Directions in Cognitive Science Volume 5: Artificial Intelligence, eds D. Sleeman and N. Bernsen, Lawrence Earlbaum Associates, 1992)", keywords = "Pop, Pop-11", } @Article{Volz:1990:VNU, author = "Richard A. Volz", title = "Virtual Nodes and Units of Distribution for Distributed {Ada}", journal = j-SIGADA-LETTERS, volume = "10", number = "4", pages = "85--96", month = "Spring", year = "1990", CODEN = "AALEE5", ISSN = "1094-3641 (print), 1557-9476 (electronic)", ISSN-L = "1094-3641", bibdate = "Sat Aug 9 09:05:36 MDT 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, classcodes = "C6140D (High level languages); C6110 (Systems analysis and programming); C6150J (Operating systems)", conflocation = "Framington, PA, USA; 26--29 June 1989", conftitle = "Third International Workshop on Real-Time Ada Issues", corpsource = "Department of Comput. Sci., Texas A and M Univ., College Station, TX, USA", fjournal = "ACM SIGADA Ada Letters", keywords = "Ada; Ada program; additional study; architecture characterizations; architecture dependence choice; complex task; dependency; distributed Ada; distributed processing; embedded real-time systems; memory systems; processing elements; programming; real-time systems; shared; system architecture; UoD; virtual machines; virtual node", sponsororg = "Software Eng. Inst.; U.S. Office of Naval Res.; Ada UK; ACM", treatment = "P Practical", } @Article{Whang:1990:QOM, author = "Kyu-Young Y. Whang and Ravi Krishnamurthy", title = "Query Optimization in a Memory-Resident Domain Relational Calculus Database System", journal = j-TODS, volume = "15", number = "1", pages = "67--95", month = mar, year = "1990", CODEN = "ATDSD3", ISSN = "0362-5915 (print), 1557-4644 (electronic)", ISSN-L = "0362-5915", bibdate = "Sat Apr 14 10:34:48 MDT 2001", bibsource = "Database/Graefe.bib; Database/Wiederhold.bib; http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.acm.org/pubs/articles/journals/tods/1990-15-1/p67-whang/p67-whang.pdf; http://www.acm.org/pubs/citations/journals/tods/1990-15-1/p67-whang/; http://www.acm.org/pubs/toc/Abstracts/tods/77646.html", abstract = "We present techniques for optimizing queries in memory-resident database systems. Optimization techniques in memory-resident database systems differ significantly from those in conventional disk-resident database systems. In this paper we address the following aspects of query optimization in such systems and present specific solutions for them: (1) a new approach to developing a CPU-intensive cost model; (2) new optimization strategies for main-memory query processing; (3) new insight into join algorithms and access structures that take advantage of memory residency of data; and (4) the effect of the operating system's scheduling algorithm on the memory-residency assumption. We present an interesting result that a major cost of processing queries in memory-resident database systems is incurred by evaluation of predicates. We discuss optimization techniques using the Office-by-Example (OBE) that has been under development at IBM Research. We also present the results of performance measurements, which prove to be excellent in the current state of the art. Despite recent work on memory-resident database systems, query optimization aspects in these systems have not been well studied. We believe this paper opens the issues of query optimization in memory-resident database systems and presents practical solutions to them.", acknowledgement = ack-nhfb, affiliation = "IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA", annote = "Office-by-example extends the concept of query-by-example (QBE); disks are used only for permanent storage of data and backup; The technique is not a heuristic since it employs a systematic search, but uses the branch-and-bound algorithm. Uses the nested-loop join with use of indexes. An index is an array of tuple identifiers. Assess uses binary search. When an index entry is inserted, the upper half of the index is block-copied. In a 3081 processor copying 1 MB of memory takes less than 0.1 second. Queries in OBE are in the canonical form, have no substructures. Pure demand paging is not suitable, the system has a global goal for paging activities. The set of virtual machines on the dispatch list is determined.", fjournal = "ACM Transactions on Database Systems", generalterms = "Algorithms; Experimentation; Languages; Performance", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J777", keywords = "experimentation; languages; Large Main Memory TODS, algorithms; performance", subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT, Systems, Query processing. {\bf H.2.3}: Information Systems, DATABASE MANAGEMENT, Languages, Query languages. {\bf H.2.2}: Information Systems, DATABASE MANAGEMENT, Physical Design, Access methods.", } @InProceedings{Xu:1990:HMD, author = "J. Xu and K. Hwang", title = "Heuristic methods for dynamic load balancing in a message-passing supercomputer", crossref = "IEEE:1990:PSN", pages = "888--897", year = "1990", bibdate = "Wed Apr 15 18:34:48 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, classification = "C5440 (Multiprocessor systems and techniques); C6150J (Operating systems)", corpsource = "IBM Corp., San Jose, CA, USA", keywords = "distributed control; distributed load balancers; distributed processing; dynamic load balancing; iPSC/2 hypercube; load imbalances; message passing multicomputer; message-passing supercomputer; migration overheads; parallel event drives simulator; parallel processing; parallel simulator; performance evaluation; process migration; PSIM; resource allocation; scheduling; system utilizations; threshold update; variable threshold; virtual machines", sponsororg = "IEEE; ACM; Lawrence Livermore Nat. Lab.; Los Alamos Nat. Lab.; NASA Ames Res. Center; Nat. Center Atmos. Res.; NSF; SIAM; Supercomput. Res. Center", treatment = "P Practical; X Experimental", } @Article{Aharon:1991:VIR, author = "A. Aharon and A. Bar-David and B. Dorfman and E. Gofman and M. Leibowitz and V. Schwartzburd", title = "Verification of the {IBM RISC System\slash 6000} by a dynamic biased pseudo-random test program generator", journal = j-IBM-SYS-J, volume = "30", number = "4", pages = "527--538", year = "1991", CODEN = "IBMSA7", ISSN = "0018-8670", bibdate = "Tue Mar 19 17:38:46 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Verification of a computer that implements a new architecture is especially difficult since no approved functional test cases are available. The logic design of the IBM RISC system/6000 was verified mainly by a specially developed random test program generator (RTPG), which was used from the early stages of the design until its successful completion. APL was chosen for the RISC System/6000 RTPG implementation after considering the suitability of this programming language for modeling computer architectures, the very tight schedule, and the highly changeable environment in which RTPG would operate.", acknowledgement = ack-nhfb, affiliation = "IBM Israel Sci. and Technol. Ltd., Haifa, Israel", classification = "C4240 (Programming and algorithm theory); C5470 (Performance evaluation and testing); C6140D (High level languages); C6150G (Diagnostic, testing, debugging and evaluating systems); C7430 (Computer engineering)", fjournal = "IBM Systems Journal", keywords = "Computer architectures; Functional test cases; IBM RISC system/6000; Logic design; Programming language; Pseudo-random test program generator; RTPG implementation; Specially developed random test program generator; Tight schedule", pubcountry = "USA", thesaurus = "APL; IBM computers; Performance evaluation; Program verification; Virtual machines", } @Article{Alfonseca:1991:AAA, author = "M. Alfonseca", title = "Advanced applications of {APL}: logic programming, neural networks, and hypertext", journal = j-IBM-SYS-J, volume = "30", number = "4", pages = "543--553", year = "1991", CODEN = "IBMSA7", ISSN = "0018-8670", bibdate = "Tue Mar 19 17:38:46 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "A review is given of the work of the author on the application of the APL and APL2 programming languages to logic programming, emulation of neural networks, and the programming of hypertext applications.", acknowledgement = ack-nhfb, affiliation = "IBM Software Technol. Lab., Madrid, Spain", classification = "C5290 (Neural computing techniques); C6110L (Logic programming); C6140D (High level languages); C6160Z (Other DBMS); C6170 (Expert systems); C7430 (Computer engineering)", fjournal = "IBM Systems Journal", keywords = "APL2 programming languages; Hypertext applications; Logic programming; Neural networks", pubcountry = "USA", thesaurus = "APL; Hypermedia; Logic programming; Neural nets; Virtual machines", } @InProceedings{Aral:1991:PCS, author = "Ziya Aral and Ilya Gertner and Alan Langerman and Dave Mitchell", title = "Process Control Structures for Multiprocessor", crossref = "Milutinovic:1991:PTA", volume = "1", pages = "49--58", year = "1991", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Describes a new approach to implementing and using a 'process' abstraction in multiprocessors. A new paradigm is described for virtual machines which are built out of finer granularity units called Resource Control Blocks (RCB). A collection of RCBs define a virtual machine. Each RCB is independently sharable. A user has the freedom to define a set of virtual machines each spanning a different collection of resources. Although the new paradigm offers additional flexibility, it carries no additional overhead when compared to previous implementations. Backwards compatible processes are scheduled and created with the same efficiency. New processes that carry less weight are created much more efficiently. A production system has been implemented and measured on Multimax, a shared-memory multiprocessor.", } @Article{Balter:1991:AIG, author = "R. Balter and J. Bernadat and D. Decouchant and A. Duda and A. Freyssinet and S. Krakowiak and M. Meysembourg and P. Le Dot and H. Nguyen Van and E. Paire and M. Riveill and C. Roison and X. Rousset de Pina and R. Scioville and G. Vand{\^o}me", title = "Architecture and Implementation of Guide, an Object-Oriented Distributed System", journal = j-COMP-SYS, volume = "4", number = "1", pages = "31--67", month = "Winter", year = "1991", CODEN = "CMSYE2", ISSN = "0895-6340", bibdate = "Fri Sep 13 08:51:08 MDT 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, classification = "C6110 (Systems analysis and programming); C6150J (Operating systems)", fjournal = "Computing Systems", keywords = "Class; Distributed object memory; Dynamic links; Execution structures; Execution units; Grenoble Universities integrated distributed environment; Guide; Job sharing; Language; Multi-threaded virtual machines; Nodes; Object model; Object-oriented distributed operating system; Persistent objects storage; Single inheritance; Synchronized objects; Synchronized transactions; Type; UNIX", thesaurus = "Distributed processing; Object-oriented programming; Operating systems [computers]", } @InProceedings{Balzer:1991:PVM, author = "Robert Balzer", title = "Process Virtual Machine", crossref = "Thomas:1993:PIS", pages = "37--40", year = "1991", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", } @Article{Bennett:1991:SMC, author = "R. B. Bennett and W. J. Bitner and M. A. Musa and M. K. Ainsworth", title = "Systems management for {Coordinated Resource Recovery}", journal = j-IBM-SYS-J, volume = "30", number = "1", pages = "90--106", year = "1991", CODEN = "IBMSA7", ISSN = "0018-8670", bibdate = "Tue Mar 19 17:38:46 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Coordinated Resource Recovery is a Virtual Machine/Enterprise Systems Architecture (VM/ESA) function for providing consistency of changes to multiple resources in environments that include distributed applications. It provides a uniform solution for applications to the problem of resource consistency. Systems management of Coordinated Resource Recovery in VM/ESA (CRR) is the set of system services and interfaces that support both automatic and manual procedures for managing CRR installation, performance, and recovery, as well as resource manager and application participation. Much of systems management is focused on application recovery from occasional failures of the procedures for coordinating consistent resource changes. The paper describes several key aspects of CRR systems management, including the CRR recovery log, facilities for minimizing manual intervention when failures occur, performance considerations, and application participation in recovery.", acknowledgement = ack-nhfb, affiliation = "IBM Data Syst. Div., Endicott, NY, USA", classification = "C6150J (Operating systems)", fjournal = "IBM Systems Journal", keywords = "Application recovery; Coordinated Resource Recovery; CRR recovery log; CRR systems management; Interfaces; Multiple resources; Resource consistency; System services; Virtual Machine/Enterprise Systems Architecture; VM/ESA", pubcountry = "USA", thesaurus = "IBM computers; Operating systems [computers]; Virtual machines", } @Article{Christodoulakis:1991:OOA, author = "Stavros Christodoulakis and Natassa Ailamaki and Manolis Fragonikolakis and Yorgos Kapetanakis and Leonidas Koveos", title = "An Object Oriented Architecture For Multimedia Information Systems", journal = "Data Engineering", volume = "14", number = "3", pages = "4--15", month = sep, year = "1991", bibdate = "Wed Dec 11 11:19:22 1991", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "we present aspects of the design and implementation of a Multimedia Object Server. We first present the design and implementation of the Object Virtual Machine (OVM), a multimedia object manager. OVM considers environments with large main memories that can comtain a large number of objects. However, multimedia objects ahvae to reside in secondary and tertiary storage due to their size. Multimedia objects are treated as first class objects, and methods and acces structures for them are supported by the system. The secondary storage information is modeled in three layers: logical files, physical files and devices; thus allowing flexibility, clustering and parallelism in the multimedia database design. Next, we describe experimental and analytical performance studies for a server environment for multimedia data. We outline results on optimal data placement on optical disks, buffering for delay-sensitive multimedia data environments and scheduling aspects in a server based on secondary and tertiary optical storage(jukeboxes).", owner = "suchen", } @Article{Daszczuk:1991:SSD, author = "W. B. Daszczuk", title = "A Structured Semantic Design of Distributed Operating Systems", journal = j-COMP-J, volume = "34", number = "6", pages = "482--492", month = dec, year = "1991", CODEN = "CMPJA6", ISSN = "0010-4620 (print), 1460-2067 (electronic)", ISSN-L = "0010-4620", bibdate = "Tue Mar 25 13:51:56 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www3.oup.co.uk/computer_journal/hdb/Volume_34/Issue_06/", URL = "http://www3.oup.co.uk/computer_journal/hdb/Volume_34/Issue_06/tiff/482.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_34/Issue_06/tiff/483.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_34/Issue_06/tiff/484.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_34/Issue_06/tiff/485.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_34/Issue_06/tiff/486.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_34/Issue_06/tiff/487.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_34/Issue_06/tiff/488.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_34/Issue_06/tiff/489.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_34/Issue_06/tiff/490.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_34/Issue_06/tiff/491.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_34/Issue_06/tiff/492.tif", acknowledgement = ack-nhfb, affiliation = "Inst. of Comput. Sci., Warsaw Univ. of Technol., Poland", classcodes = "C6150N (Distributed systems); C6150J (Operating systems)", classification = "C6150J (Operating systems); C6150N (Distributed systems)", corpsource = "Inst. of Comput. Sci., Warsaw Univ. of Technol., Poland", fjournal = "The Computer Journal", journal-URL = "http://comjnl.oxfordjournals.org/", keywords = "distributed; Distributed hardware environment; Distributed operating systems; hardware environment; multi-microprocessor systems; Multi-microprocessor systems; network operating systems; operating systems; structured semantic design; Structured semantic design; UNIX-like systems; virtual machines; Virtual machines", thesaurus = "Network operating systems; Virtual machines", treatment = "P Practical", } @InProceedings{Fertig:1991:FVM, author = "Scott Fertig and David Gelernter", title = "{FGP}: a Virtual Machine for Acquiring Knowledge from Cases", crossref = "Mylopoulos:1991:IPT", pages = "796--802", year = "1991", bibdate = "Wed Jan 24 02:56:32 MST 2001", bibsource = "http://dblp.uni-trier.de/db/conf/ijcai/ijcai91.html#FertigG91; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", oldlabel = "FertigG91", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#conf/ijcai/FertigG91", } @Article{Fischofer:1991:VSS, author = "W. T. Fischofer", title = "{VM\slash ESA}: a single system for centralized and distributed computing", journal = j-IBM-SYS-J, volume = "30", number = "1", pages = "4--13", year = "1991", CODEN = "IBMSA7", ISSN = "0018-8670", bibdate = "Tue Mar 19 17:38:46 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "The rapid evolution of distributed and personal systems in recent years has not diminished the importance of centralized computing. Today, systems at all levels need to operate in networked configurations to allow users and applications to access and manipulate data from anywhere with full integrity and optimal performance. Virtual Machine/Enterprise Systems Architecture (VM/ESA) satisfies this requirement as a single VM product that has been designed for both centralized and distributed computing. The author describes how VM/ESA builds on IBM's reputation for virtual machine performance, function, and flexibility to form an ideal solution base for the 1990s.", acknowledgement = ack-nhfb, affiliation = "IBM Endicott Programming Lab., NY, USA", classification = "C6150J (Operating systems)", fjournal = "IBM Systems Journal", keywords = "Centralized computing; Distributed computing; IBM; Networked configurations; Virtual machine performance; Virtual Machine/Enterprise Systems Architecture; VM/ESA", pubcountry = "USA", thesaurus = "IBM computers; Network operating systems; Virtual machines", } @Article{Fujimoto:1991:VTM, author = "Richard M. Fujimoto", title = "The {Virtual Time Machine}", journal = j-COMP-ARCH-NEWS, volume = "19", number = "1", pages = "35--44", month = mar, year = "1991", CODEN = "CANED2", ISSN = "0163-5964 (ACM), 0884-7495 (IEEE)", ISSN-L = "0163-5964", bibdate = "Fri May 12 09:40:33 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGARCH Computer Architecture News", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89", } @Article{Gdaniec:1991:VDS, author = "J. M. Gdaniec and J. P. Hennessy", title = "{VM} data spaces and {ESA\slash XC} facilities", journal = j-IBM-SYS-J, volume = "30", number = "1", pages = "14--33", year = "1991", CODEN = "IBMSA7", ISSN = "0018-8670", bibdate = "Sun Sep 15 05:47:47 MDT 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Release 1.1 of the Virtual Machine/Enterprise Systems Architecture (VM/ESA) operating system introduces a new function called VM Data Spaces, provided through a new virtual-machine architecture called Enterprise Systems Architecture/Extended Configuration (ESA/XC). ESA/XC is the strategic VM/ESA virtual-machine environment for Conversational Monitor System (CMS) users and services virtual machines requiring large amounts of storage or advanced data-sharing capabilities. ESA/XC includes all of the facilities of System/370 Extended Architecture (370-XA) that are used by CMS or server programs and is therefore upward compatible for CMS or server programs currently running in 370-XA virtual machines. As an introduction to the VM Data Spaces function, the paper describes the ESA/XC virtual-machine architecture and presents an overview of the VM/ESA services provided in support of the ESA/XC architecture.", acknowledgement = ack-nhfb, affiliation = "IBM Data Syst. Div., Endicott, NY, USA", classification = "C6150J (Operating systems)", fjournal = "IBM Systems Journal", keywords = "Conversational Monitor System; Enterprise Systems Architecture/Extended Configuration; ESA/XC; Operating system; System/370 Extended Architecture; Virtual Machine/Enterprise Systems Architecture; Virtual-machine architecture; Virtual-machine environment; VM data spaces; VM/ESA", pubcountry = "USA", thesaurus = "IBM computers; Operating systems [computers]; Virtual machines", } @TechReport{Greenfield:1991:PIT, author = "P. G. Greenfield and R. J. Hendley", title = "A proposed Intelligent Tutoring System Framework Incorporating Persistent Logic Programming", number = "CSR-91-1", institution = "University of Birmingham, School of Computer Science", month = feb, year = "1991", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "This paper proposes a virtual machine architectural approach to the construction of a generic Intelligent System (ITS) in which the components of the system are organised as a community of co-operating processes each of which has a substantial portion that can be specified in a declarative manner using Horn clause Logic.", } @Article{Jolitz:1991:PUS, author = "William Frederick Jolitz and Lynne Greer Jolitz", title = "Porting {UNIX} to the 386: a Stripped-Down Kernel", journal = j-DDJ, volume = "16", number = "7", pages = "32, 34--36, 38, 40, 84--88, 88, 90", month = jul, year = "1991", CODEN = "DDJOEB", ISSN = "1044-789X", bibdate = "Tue Sep 10 09:11:02 MDT 1996", bibsource = "http://www.ddj.com/index/author/index.htm; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; UnCover database", abstract = "386BSD's basic kernel incorporates a unique ``recursive'' paging feature that leverages resources and reduces complexity.", acknowledgement = ack-nhfb, classification = "C6150E (General utility programs); C6150J (Operating systems); C7430 (Computer engineering)", fjournal = "Dr. Dobb's Journal of Software Tools", keywords = "386BSD; Bootstrap procedure; Initialization; Machine-dependent portions; Machine-independent portions; Operating system porting; Recursive paging; Stripped-down kernel; UNIX kernel; Virtual machine", thesaurus = "Assembly language listings; C listings; Computer bootstrapping; Microprocessor chips; Software portability; Unix; Utility programs; Virtual machines", } @InProceedings{Kelem:1991:SMV, author = "N. L. Kelem and R. J. Feiertag", title = "A Separation Model for Virtual Machine Monitors", crossref = "IEEE:1991:PIC", pages = "78--87 (or 78--86??)", year = "1991", bibdate = "Tue Jan 23 16:47:31 MST 2001", bibsource = "http://dblp.uni-trier.de/db/conf/sp/sp1991.html#KelemF91; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", annote = "This paper presents a security policy for separation Virtual Machine Monitors (SVMMs) and interprets Rushby's Separation Model [RUSH81] for SVMMs. Applying the technique of [RUSH81] yields a practical method for demonstrating that an implementation of an SVMM adheres to the abstract Isolation Axiom of the Separation Model, thus providing relatively strong assurance for a low level of effort. First we describe the relevant characteristics of SVMMs, and note the applicable formal modeling requirements. Next we present a summary of the SVMM Separation Model, a modification of the original model presented in [RUSH81]. The Separation Model technique permits a proof of separability among the operating systems under control of the kernel of an SVMM. We supply an interpretation of the elements of the Separation Model using concepts from SVMMs. Finally, we relate this work to similar Applications of the Separation Model.", oldlabel = "KelemF91", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#conf/sp/KelemF91", } @MastersThesis{Lott:1991:DVM, author = "Christopher M. Lott", title = "Defining a virtual machine for executing {MVP--L} project plans", school = "Department of Computer Science, The University of Maryland", address = "College Park, MD 20742", month = aug, year = "1991", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", } @InProceedings{Malan:1991:MA, author = "G. Malan and R. Rashid and D. Golub and R. Baron", title = "{DOS} as a {Mach 3.0} application", crossref = "USENIX:1991:PUM", pages = "27--40", year = "1991", bibdate = "Sat Sep 28 19:47:51 MDT 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, affiliation = "Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA", classification = "C6150J (Operating systems); C7430 (Computer engineering)", keywords = "Common DOS functions; Common DOS software; DOS functionality; DOS operating system; Frequently loaded DOS drivers; High memory area; High-speed space combat simulation system; I/O devices; I386/i486 architecture; Latency demands; Mach features; Machine-dependent kernel modifications; Multiple virtual DOS environments; Multithreaded emulation; PC architecture; Performance sensitive PC entertainment software; Timing; Unix emulation; Unix Server; VGA display; Virtual 8086 mode; Virtual machine environment; Wing Commander", thesaurus = "IBM computers; Microcomputer applications; Supervisory programs; Unix; Virtual machines", } @InProceedings{Manas:1991:VLM, author = "J. A. Manas and J. Salvachua", editor = "Kenneth R. Parker and Gordon A. Rose", booktitle = "Proceedings of {Formal Description Techniques IV}", title = "A Virtual {LOTOS} Machine", publisher = pub-NORTH-HOLLAND, address = pub-NORTH-HOLLAND:adr, pages = "441--456", year = "1991", bibdate = "Mon May 24 07:35:14 2010", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "LOTOS behaviour semantics are usually presented in a declarative style that permits to evaluate which events are possible at each stage, and which is the behaviour after an event occurs. In order to generate code that implements these operational semantics an imperative model is very convenient for efficiency. A virtual machine (machine for LOTOS Behaviour Machine) is presented in this paper that provides such an imperative point of view, but still keeps independent of implementation details, effectively providing an intermediate representation for either interpretation or generation of code for any systems programming language. An abstract model of execution is presented, and then the virtual machine is presented by describing its instructions, the relationship to LOTOS constructs, and its dynamic semantics. C code generation is briefly commented too.", acknowledgement = ack-nhfb, } @Article{Maslak:1991:CRR, author = "B. A. Maslak and J. M. Showalter and T. J. Szczygielski", title = "{Coordinated Resource Recovery} in {VM\slash ESA}", journal = j-IBM-SYS-J, volume = "30", number = "1", pages = "72--89", year = "1991", CODEN = "IBMSA7", ISSN = "0018-8670", bibdate = "Tue Mar 19 17:38:46 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "A system service for coordinated recovery of resources is a critical function needed for distributed processing environments because applications need to provide for data integrity while the location of the data and processes are transparent to the application. VM is the first IBM operating system to provide Coordinated Resource Recovery as a system service rather than as a service provided by unique environments running on the operating system, and the VM Common Programming Interface-Communications and Shared File System are the first subsystems to utilize the service. The paper is an overview of why and how VM provided Coordinated Resource Recovery (CRR). CRR is the implementation of the Systems Application Architecture (SAA) resource recovery interface within Virtual Machine/Enterprise Systems Architecture (VM/ESA). This coordinated sync point system service allows one or more applications or subsystems to update multiple resources and to request that all updates be committed or backed out together.", acknowledgement = ack-nhfb, affiliation = "IBM Data Syst. Div., Endicott, NY, USA", classification = "C6150J (Operating systems)", fjournal = "IBM Systems Journal", keywords = "Coordinated Resource Recovery; Data integrity; Distributed processing environments; IBM operating system; Resource recovery interface; Shared File System; Sync point system service; System service; Systems Application Architecture; Virtual Machine/Enterprise Systems Architecture; VM Common Programming Interface-Communications", pubcountry = "USA", thesaurus = "IBM computers; Operating systems [computers]; Virtual machines", } @Article{Meleshchuk:1991:IPP, author = "S. B. Meleshchuk and A. N. Nedumov", title = "Implementation of a protocol for parallel database access with virtual machine communications facilities", journal = j-PROGRAMMIROVANIE, volume = "17", number = "1", pages = "35--42", month = jan # "\slash " # feb, year = "1991", CODEN = "PCSODA", ISSN = "0132-3474, 0361-7688", bibdate = "Wed Apr 16 06:39:19 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "English translation in Programming and Computer Software, vol. 17, no. 1, pp. 27--32, November 1991.", acknowledgement = ack-nhfb, classification = "C6150J (Operating systems)", corpsource = "Leningrad Techn. State Univ., USSR", fjournal = "Programmirovanie", keywords = "COMMIT protocol; concurrency control; deadlock; electronic mail; interrupts; IUCV mail facility; machines; parallel; parallel database access; processing; protocol; protocols; virtual; virtual machines", pubcountry = "USSR", treatment = "P Practical", } @Article{Osisek:1991:EIA, author = "D. L. Osisek and K. M. Jackson and P. H. Gum", title = "{ESA}\slash 390 interpretive-execution architecture, foundation for {VM\slash ESA}", journal = j-IBM-SYS-J, volume = "30", number = "1", pages = "34--51", year = "1991", CODEN = "IBMSA7", ISSN = "0018-8670", bibdate = "Sun Sep 15 05:47:47 MDT 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "The interpretive-execution facility of Enterprise Systems Architecture/390 (ESA/390) provides an instruction for the execution of virtual machines. This instruction, called Start interpretive execution (SIE), was initially created, for virtualizing either System/370 or 370-XA architectures, and was used later for virtualizing ESA/370 and ESA/390 architectures. SIE has evolved to provide capabilities for a number of specialized performance environments. Most recently it provides for the unique requirements of Enterprise Systems Architecture/Extended Configuration (ESA/XC) virtual-machine architecture. This comprehensive set of capabilities in the architecture serves as the platform for the ability of VM/ESA to provide functions in virtual machines for end users and system servers. The paper describes the evolution of SIE and outlines use of the various capabilities in VM/ESA.", acknowledgement = ack-nhfb, affiliation = "IBM Data Syst. Div., Endicott, NY, USA", classification = "C6150J (Operating systems)", fjournal = "IBM Systems Journal", keywords = "Enterprise Systems Architecture/390; Enterprise Systems Architecture/Extended Configuration; ESA/390 interpretive-execution architecture; SIE; Start interpretive execution; Virtual-machine architecture; VM/ESA", pubcountry = "USA", thesaurus = "IBM computers; Operating systems [computers]; Virtual machines", } @Book{Pulman:1991:EER, editor = "Stephen G. Pulman", title = "{EUROTRA ET6/1}: rule formalism and virtual machine design study -- final report", publisher = "Commission of the European Communities", address = "Luxembourg, Luxembourg", year = "1991", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "Contributors: H. Alshawi, D.J. Arnold, R. Backofen, D.M. Carter, J. Lindop, K. Netter, S.G. Pulman, J. Tsujii and H. Uszkoreit.", } @Article{Rosing:1991:DPP, author = "Matthew Rosing and Robert B. Schnabel and Robert P. Weaver", title = "The {DINO} parallel programming language", journal = j-J-PAR-DIST-COMP, volume = "13", number = "1", pages = "30--42", day = "1", month = sep, year = "1991", CODEN = "JPDCER", ISSN = "0743-7315 (print), 1096-0848 (electronic)", ISSN-L = "0743-7315", bibdate = "Sat Apr 12 19:06:31 MDT 1997", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, affiliation = "Univ of Colorado", affiliationaddress = "Boulder, CO, USA", classification = "721; 722; 723; C6140D (High level languages)", corpsource = "Department of Comput. Sci., Colorado Univ., Boulder, CO, USA", fjournal = "Journal of Parallel and Distributed Computing", journal-URL = "http://www.sciencedirect.com/science/journal/07437315", journalabr = "J Parallel Distrib Comput", keywords = "compiler; Computer Operating Systems; Computer Programming Languages--C; Computer Programming--Algorithms; Computer Systems, Digital; constructs; data; DINO parallel programming language; distributed data; Distributed memory multiprocessors; distributed memory multiprocessors; distributed numerically; high-level parallel; MIMD; oriented language; Parallel algorithms; parallel algorithms; parallel languages; Parallel Processing; Parallel programs; semantics; Software package DINO; standard C; structures; syntax; virtual machine; virtual parallel computer", treatment = "P Practical", } @PhdThesis{Shen:1991:VTD, author = "Shioupyn Shen", title = "The virtual-time data-parallel machine", type = "Thesis ({Ph.D.})", school = "Department of Computer Science, University of California, Los Angeles", address = "Los Angeles, CA, USA", pages = "xi + 115", year = "1991", LCCN = "LD791.9.C6 S548 1991", bibdate = "Mon Apr 10 11:00:44 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, } @Article{Stone:1991:VCS, author = "R. L. Stone and T. S. Nettleship and J. Curtiss", title = "{VM\slash ESA CMS Shared File System}", journal = j-IBM-SYS-J, volume = "30", number = "1", pages = "52--71", year = "1991", CODEN = "IBMSA7", ISSN = "0018-8670", bibdate = "Sun Sep 15 05:47:47 MDT 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Discussed is work toward satisfying requirements on the Conversational Monitor System (CMS) in the areas of data sharing and physical DASD space sharing. This work advances the present CMS file system design. Described is the CMS Shared File System (SFS), which was designed to satisfy the data sharing and physical DASD space sharing requirements by providing a pool of DASD space that is shared among multiple users. DASD space assigned to the pool is easily extended, and read/write sharing of individual files is allowed. Also discussed is SFS security, usage of Virtual Machine/Enterprise Systems Architecture (VM/ESA) data spaces for single system performance, and coordinated resource recovery to provide file data integrity in the distributed environment.", acknowledgement = ack-nhfb, affiliation = "IBM Data Syst. Div., Endicott, NY, USA", classification = "C6120 (File organisation); C6150J (Operating systems)", fjournal = "IBM Systems Journal", keywords = "Conversational Monitor System; Data sharing; Data spaces; File data integrity; Multiple users; Physical DASD space sharing; Resource recovery; SFS security; Virtual Machine/Enterprise Systems Architecture; VM/ESA CMS Shared File System", pubcountry = "USA", thesaurus = "File organisation; IBM computers; Operating systems [computers]; Virtual machines", } @Article{Tollenaere:1991:SMN, author = "T. Tollenaere and G. A. Orban", title = "Simulating modular neural networks on message-passing multiprocessors", journal = j-PARALLEL-COMPUTING, volume = "17", number = "4--5", pages = "361--379", month = jul, year = "1991", CODEN = "PACOEJ", ISSN = "0167-8191 (print), 1872-7336 (electronic)", ISSN-L = "0167-8191", bibdate = "Mon Apr 14 11:08:33 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, classification = "C1230 (Artificial intelligence); C7430 (Computer engineering)", corpsource = "Lab. for Neuro- and Psychophysiol., Katholieke Univ., Leuven, Belgium", fjournal = "Parallel Computing", journal-URL = "http://www.sciencedirect.com/science/journal/01678191", keywords = "compiler; data structure; decomposition; entropy-driven artificial neural network; Hopfield network; image restoration; independent simulation environment; machine-; mapping; message-passing multiprocessors; modular neural networks; neural nets; parallel machines; parallel processing; simulation programs; simulator program; splitter program; transputer system; virtual machines", treatment = "P Practical; T Theoretical or Mathematical", } @TechReport{Varian:1991:VVC, author = "Melinda Varian", title = "{VM} and the {VM} Community: Past, Present, and Future", institution = "Office of Computing and Information Technology, Princeton University", address = "Princeton, NJ 08544, USA", pages = "168", month = apr, year = "1991", bibdate = "Fri May 06 15:23:37 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/rexx.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "Original presented at Australasian SHARE\slash GUIDE in Melbourne, Victoria, Australia in 1989. This is a detailed history of the development of virtual machine technology on IBM System\slash 360 and later mainframes, and of the opposition by much of IBM to that technology until it was demonstrated that their performance could equal, or even exceed, that of an operating system running on bare hardware, and also allow a single physical host to support multiple operating systems, and software development, simultaneously. There are also several comments about the development of the REXX language, and about the influence of Unix on IBM's software development.", URL = "http://www.leeandmelindavarian.com/Melinda/neuvm.pdf", acknowledgement = ack-nhfb, keywords = "IBM mainframes; REXX; virtual machine (VM)", } @Article{Wejchert:1991:VPN, author = "J. Wejchert and G. Tesauro", title = "Visualizing processes in neural networks", journal = j-IBM-JRD, volume = "35", number = "1/2", pages = "244--253", month = jan # "\slash " # mar, year = "1991", CODEN = "IBMJAE", ISSN = "0018-8646 (print), 2151-8556 (electronic)", ISSN-L = "0018-8646", bibdate = "Tue Mar 25 14:26:59 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "A real-time visualization toolkit has been designed to study processes in neural network learning. To date, relatively little attention has been given to visualizing these complex, nonlinear systems. Two new visualization methods are introduced and then applied. One represents synaptic weight data as `bonds' of varying length embedded in the geometrical structure of a network. The other maps the temporal trajectory of the system in a multidimensional configuration space as a two-dimensional diagram. Two-dimensional graphics were found to be sufficient for representing dynamic neural processes. As an application, the visualization tools are linked to simulations of networks learning various Boolean functions. A multiwindow environment allows different aspects of the simulation to be viewed simultaneously using real-time animations. The visualization toolkit can be used in a number of ways: to see how solutions to a particular problem are obtained; to observe how different parameters affect learning dynamics; and to identify the decision stages of learning.", acknowledgement = ack-nhfb, affiliation = "IBM Sci. Centre, Winchester, UK", classcodes = "C7430 (Computer engineering); C1230D (Neural nets); C6130B (Graphics techniques); C1240 (Adaptive system theory)", classification = "C1230D (Neural nets); C1240 (Adaptive system theory); C6130B (Graphics techniques); C7430 (Computer engineering)", corpsource = "IBM Sci. Centre, Winchester, UK", fjournal = "IBM Journal of Research and Development", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520", keywords = "2D diagram; Boolean; Boolean functions; configuration space; Dynamic neural processes; dynamic neural processes; engineering graphics; functions; learning systems; multidimensional; Multidimensional configuration space; Multiwindow environment; multiwindow environment; neural nets; Neural network learning; neural network learning; Neural networks; neural networks; Nonlinear systems; nonlinear systems; real-; Real-time animations; real-time animations; real-time visualization; Real-time visualization toolkit; Synaptic weight data; synaptic weight data; Temporal trajectory; temporal trajectory; time systems; toolkit; virtual machines", thesaurus = "Engineering graphics; Learning systems; Neural nets; Real-time systems; Virtual machines", treatment = "P Practical", } @Article{Wu:1991:NNS, author = "J.-. L. Wu and S.-T. Cheng", title = "A neural network simulating system", journal = j-COMP-J, volume = "34", number = "1", pages = "92--93", month = feb, year = "1991", CODEN = "CMPJA6", ISSN = "0010-4620 (print), 1460-2067 (electronic)", ISSN-L = "0010-4620", bibdate = "Tue Mar 25 13:51:56 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www3.oup.co.uk/computer_journal/hdb/Volume_34/Issue_01/", URL = "http://www3.oup.co.uk/computer_journal/hdb/Volume_34/Issue_01/tiff/92.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_34/Issue_01/tiff/93.tif", acknowledgement = ack-nhfb, affiliation = "Department of Comput. Sci. and Inf. Eng., Nat. Taiwan Univ., Taipei, Taiwan", classcodes = "C7430 (Computer engineering); C6140D (High level languages); C6110B (Software engineering techniques); C1230 (Artificial intelligence)", classification = "C1230 (Artificial intelligence); C6110B (Software engineering techniques); C6140D (High level languages); C7430 (Computer engineering)", corpsource = "Department of Comput. Sci. and Inf. Eng., Nat. Taiwan Univ., Taipei, Taiwan", fjournal = "The Computer Journal", journal-URL = "http://comjnl.oxfordjournals.org/", keywords = "experimental neural network description language; Experimental neural network description language; models; network simulation system; neural; neural nets; neural network; Neural network models; Neural network simulation system; specification languages; unifying way; Unifying way; virtual machines", thesaurus = "Neural nets; Specification languages; Virtual machines", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Ackerman:1992:SIE, author = "D. F. Ackerman and M. H. Decker and J. J. Gosselin and K. M. Lasko and M. P. Mullen and R. E. Rosa and E. V. Valera and B. Wile", title = "Simulation of {IBM Enterprise System\slash 9000} models 820 and 900", journal = j-IBM-JRD, volume = "36", number = "4", pages = "751--764", month = jul, year = "1992", CODEN = "IBMJAE", ISSN = "0018-8646 (print), 2151-8556 (electronic)", ISSN-L = "0018-8646", bibdate = "Tue Mar 25 14:26:59 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "The discovery and removal of logic design errors early in the development cycle is critical to timely availability of market-driven processor products. The paper describes the part played by simulation in the verification of the high-end models of the IBM Enterprise System/9000 (ES/9000) processor family, and how that effort advanced the state of the art of logic design simulation. The increased complexity of the ES/9000 design over that of the IBM Enterprise System/3090 (ES/3090) necessitated a larger simulation effort. New tools and methods were developed. Two simulation missions were established. Element simulation addressed ES/9000 functional elements (e.g. the storage controller) individually using the Compiled Enhanced Functional Simulator (CEFS), a software tool. System simulation tested two or more functional elements together using the Engineering Verification Engine (EVE), a special-purpose hardware parallel processor, and an attached IBM 3092 Processor Controller (PCE). The results achieved by simulation are discussed, together with the methods used and the impact these results had on the overall verification of the ES/9000 Models 820 and 900.", acknowledgement = ack-nhfb, affiliation = "IBM Enterprise Syst., Poughkeepsie, NY, USA", classcodes = "C5470 (Performance evaluation and testing); C7430 (Computer engineering); C5210 (Logic design methods); C5420 (Mainframes and minicomputers)", classification = "C5210 (Logic design methods); C5420 (Mainframes and minicomputers); C5470 (Performance evaluation and testing); C7430 (Computer engineering)", corpsource = "IBM Enterprise Syst., Poughkeepsie, NY, USA", fjournal = "IBM Journal of Research and Development", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520", keywords = "Compiled Enhanced Functional Simulator; computer testing; development cycle; Development cycle; Engineering Verification Engine; formal verification; high-end models; High-end models; IBM computers; logic; logic design errors; Logic design errors; logic design simulation; Logic design simulation; mainframes; simulation; Simulation; software tool; Software tool; storage controller; Storage controller; testing; verification; Verification; virtual machines", thesaurus = "Computer testing; Formal verification; IBM computers; Logic testing; Mainframes; Virtual machines", treatment = "P Practical", } @Article{Darcy:1992:USD, author = "George A. {Darcy III} and Ronald F. Brender and Stephen J. Morris and Michael V. Iles", title = "Using Simulation to Develop and Port Software", journal = j-DEC-TECH-J, volume = "4", number = "4", pages = "181--192", month = "Fall", year = "1992", CODEN = "DTJOEL", ISSN = "0898-901X", bibdate = "Thu Mar 20 18:15:43 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "ftp://ftp.digital.com/pub/Digital/info/DTJ/v4n4/Using_Simulation_to_Develop_an_01apr1993DTJ812P8.ps; http://www.digital.com:80/info/DTJ812/DTJ812SC.TXT", abstract = "Among the tools developed to support Digital's Alpha AXP program were four software simulators. The Mannequin and ISP instruction set simulators were used to port the OpenVMS and OSF/1 operating systems to the Alpha AXP platform. The Alpha User-mode Debugging Environment (AUD) allowed Alpha AXP user-mode code to be debugged with support from the OpenVMS VAX run-time environment on VAX hardware. AUD was built from a combination of new and existing Digital software components. The Alpha User-mode Debugging Environment for Translated Images (AUDI) allowed translated images to be debugged on a simulator running on a VAX computer. With these debugging environments, user-mode applications and code components could be tested before Alpha AXP hardware and operating system software were available.", acknowledgement = ack-nhfb, classcodes = "C7430 (Computer engineering); C6150J (Operating systems); C5440 (Multiprocessor systems and techniques); C6150G (Diagnostic, testing, debugging and evaluating systems)", classification = "C5440 (Multiprocessor systems and techniques); C6150G (Diagnostic, testing, debugging and evaluating systems); C6150J (Operating systems); C7430 (Computer engineering)", fjournal = "Digital Technical Journal", keywords = "(computers); Alpha; Alpha AXP platform; Alpha AXP program; Alpha AXP user-mode code; Alpha User-Mode Debugging Environment; AUDI; AXP platform; AXP user-mode code; Code components; code components; computer; debugged; Debugged; debugging environments; Debugging environments; DEC computers; environment; instruction set simulators; ISP; ISP instruction set simulators; Mannequin; multiprocessing systems; OpenVMS VAX run-time; OpenVMS VAX run-time environment; operating systems; OSF/1 operating systems; program debugging; software portability; Software simulators; software simulators; translated images; Translated images; VAX; VAX computer; VAX hardware; virtual machines", thesaurus = "DEC computers; Multiprocessing systems; Operating systems [computers]; Program debugging; Software portability; Virtual machines", treatment = "P Practical", } @Article{Garzon:1992:DTG, author = "Max H. Garzon and Stanley P. Franklin and William Baggett and William S. {Boyd, Jr.} and Dinah Dickerson", title = "Design and Testing of a General-Purpose Neurocomputer", journal = j-J-PAR-DIST-COMP, volume = "14", number = "3", pages = "203--220", month = mar, year = "1992", CODEN = "JPDCER", ISSN = "0743-7315 (print), 1096-0848 (electronic)", ISSN-L = "0743-7315", bibdate = "Sat Apr 12 19:06:31 MDT 1997", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, affiliation = "Memphis State Univ", affiliationaddress = "Memphis, TN, USA", classification = "721; 722; 723; C5220P (Parallel architecture); C5290 (Neural computing techniques); C7430 (Computer engineering)", corpsource = "Inst. of Intelligent Syst., Memphis State Univ., TN, USA", fjournal = "Journal of Parallel and Distributed Computing", journal-URL = "http://www.sciencedirect.com/science/journal/07437315", journalabr = "J Parallel Distrib Comput", keywords = "AMNIAC; amniac Neurocomputer; Computer Systems, Digital --- Parallel Processing; Computers --- General Purpose Application; Design; Logic Design --- Testing; Logical Design; massively parallel; Massively Parallel Simulations; MIMD; neural nets; Neural Networks; Neural Networks --- Stability; neurocomputer; parallel architectures; Programmable Neural Network; programmable neural network; SIMD; Software Serial; Stability Problem for Networks; virtual machines", treatment = "P Practical", } @Article{Gjessing:1992:MRL, author = "S. Gjessing and D. B. Gustavson and D. V. James and G. Stone and H. Wiggers", title = "Memory --- a {RAM} link for high speed", journal = j-IEEE-SPECTRUM, volume = "29", number = "10", pages = "52--53", month = oct, year = "1992", CODEN = "IEESAM", DOI = "https://doi.org/10.1109/6.158638", ISSN = "0018-9235 (print), 1939-9340 (electronic)", ISSN-L = "0018-9235", bibdate = "Thu Jan 16 07:37:23 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeespectrum1990.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Spectrum", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6", keywords = "Bandwidth; buffer storage; collision avoidance; Delay; digital simulation; DRAM chips; DRAMs; dynamic RAMs; Encoding; fast memories; fast processors; flash nonvolatile memory; HDTV; interface; internal caching mechanisms; Joining processes; memory-mapped disks; mismatching; model; object-oriented language; object-oriented programming; open standard; open systems; Packaging; performance; RAM link; RamLink; Random access memory; Read-write memory; Registers; ROM; Simula; Standards development; system buses; virtual machines", } @Article{Hamilton:1992:SHU, author = "Jeffrey W. Hamilton and Eileen M. Ornsby", title = "Simulating Hypercubes In {Unix}. Part {I}", journal = j-DDJ, volume = "17", number = "12", pages = "72, 74, 76, 108--110, 112--113", month = dec, year = "1992", CODEN = "DDJOEB", ISSN = "1044-789X", bibdate = "Tue Sep 03 09:15:37 1996", bibsource = "http://www.ddj.com/index/author/index.htm; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; UnCover database", abstract = "In this two-part article, our authors describe how you can simulate the execution of a hypercube program on a standard UNIX system. This month, they focus on partitions, the basic building blocks of a hypercube system. Next month, they present the source code for the simulator and discuss how to use the system.", acknowledgement = ack-nhfb, classification = "C5220P (Parallel architecture); C6110P (Parallel programming); C7430 (Computer engineering)", fjournal = "Dr. Dobb's Journal of Software Tools", keywords = "Hypercube program; Intel iPSC/2 hypercube; UNIX system", thesaurus = "C listings; Hypercube networks; Parallel programming; Unix; Virtual machines", } @Article{Hirschsohn:1992:PSS, author = "Ian Hirschsohn", title = "Personal Supercomputing: Seamless Portability", journal = j-DDJ, volume = "17", number = "7", pages = "40, 42--44, 46, 48", month = jul, year = "1992", CODEN = "DDJOEB", ISSN = "1044-789X", bibdate = "Tue Sep 10 10:06:23 MDT 1996", bibsource = "http://www.ddj.com/index/author/index.htm; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, classification = "C6110B (Software engineering techniques); C6115 (Programming support); C7430 (Computer engineering)", fjournal = "Dr. Dobb's Journal of Software Tools", keywords = "386SX; Code transfer; Hardware independent virtual computer; Personal supercomputing; PORT software environment; RISC; Seamless portability", thesaurus = "Programming environments; Reduced instruction set computing; Software portability; Virtual machines", } @Article{Jim-Min:1992:IES, author = "Lin Jim-Min and Rong Tsai Shang and Tseng Li-Ming", title = "Integrating Existing Software Packages Using the Virtual Machine Technique", journal = j-J-SYST-SOFTW, volume = "18", number = "3", pages = "207--??", month = jul, year = "1992", CODEN = "JSSODM", ISSN = "0164-1212 (print), 1873-1228 (electronic)", ISSN-L = "0164-1212", bibdate = "Wed Dec 16 08:24:49 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, annote = "incomplete", fjournal = "The Journal of systems and software", journal-URL = "http://www.sciencedirect.com/science/journal/01641212", } @Article{Kutter:1992:STE, author = "Michael Kutter", title = "Simulation And Testboard For Embedded-System Design", journal = j-DDJ, volume = "17", number = "12", pages = "62, 66--68", month = dec, year = "1992", CODEN = "DDJOEB", ISSN = "1044-789X", bibdate = "Tue Sep 03 09:15:37 1996", bibsource = "http://www.ddj.com/index/author/index.htm; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; UnCover database", abstract = "With software simulation and hardware testboards, you can debug and test code in parallel with hardware development. Michael explains how these techniques were applied to the software-development cycle of an embedded controller.", acknowledgement = ack-nhfb, affiliation = "Advanced NMR Systems Inc., Wilmington, MA, USA", classification = "C6110B (Software engineering techniques); C7430 (Computer engineering)", fjournal = "Dr. Dobb's Journal of Software Tools", keywords = "Advanced NMR Systems; Embedded controller; Embedded system design; Hardware-testboard techniques; Software simulation; Software-development cycle", thesaurus = "Development systems; Real-time systems; Software engineering; Virtual machines", } @Article{Lin:1992:IES, author = "Jim-Min Lin and Shang Rong Tsai and Li-Ming Tseng", title = "Integrating Existing Software Packages Using the Virtual Machine Technique", journal = j-J-SYST-SOFTW, volume = "18", number = "3", pages = "207--218", month = jul, year = "1992", CODEN = "JSSODM", ISSN = "0164-1212 (print), 1873-1228 (electronic)", ISSN-L = "0164-1212", bibdate = "Wed Sep 8 09:22:28 MDT 2010", bibsource = "https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www.sciencedirect.com/science/journal/01641212", acknowledgement = ack-nhfb, fjournal = "The Journal of systems and software", journal-URL = "http://www.sciencedirect.com/science/journal/01641212", } @TechReport{Loyot:1992:VVM, author = "Edmond C. {Loyot, Jr.}", title = "{VMPP}: a Virtual Machine for Parallel Processing", type = "Technical Report", number = "CS-92-30", institution = "University of Virginia", day = "29", month = sep, year = "1992", bibdate = "August 28, 1995", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "ftp://ftp.cs.virginia.edu/pub/techreports/CS-92-30.ps.Z", } @Article{Majumdar:1992:PPC, author = "A. Majumdar and W. R. Martin", title = "Parallel preconditioned conjugate gradient algorithm applied to neutron diffusion problem", journal = j-TRANS-AM-NUCL-SOC, volume = "65", pages = "209--210", year = "1992", CODEN = "TANSAO", ISSN = "0003-018X", bibdate = "Sun Dec 22 10:17:16 MST 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, affiliation = "Michigan Univ., Ann Arbor, MI, USA", classification = "A0260 (Numerical approximation and analysis); A2820H (Neutron diffusion); A2841C (Computer codes); C4130 (Interpolation and function approximation); C4240P (Parallel programming and algorithm theory); C7470 (Nuclear engineering)", fjournal = "Transactions of the American Nuclear Society", keywords = "BBN TC2000; Distributed workstation; IBM RS6000; Iterative method; Linear system; Neutron diffusion; Parallel PCG algorithm; Parallel virtual machine; Parallelization software; Preconditioned conjugate gradient; Shared memory machine", thesaurus = "Iterative methods; Neutron diffusion; Nuclear engineering computing; Parallel algorithms", } @Article{Mebane:1992:EFD, author = "Alfred Holt {Mebane, IV} and James R. Schmedake and Iue-Shuenn Chen and Anne P. Kadonaga", title = "Electronic and firmware design of the {HP DesignJet} drafting plotter", journal = j-HEWLETT-PACKARD-J, volume = "43", number = "6", pages = "16--23", month = dec, year = "1992", CODEN = "HPJOAX", ISSN = "0018-1153", bibdate = "Tue Mar 25 14:12:15 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "High-performance vector-to-raster conversion and print engine control are provided by a RISC processor, two single-chip processors, and three custom integrated circuits. Development of the electronics and firmware made extensive use of emulation and simulation.", acknowledgement = ack-nhfb, affiliation = "Hewlett Packard Co., Palo Alto, CA, USA", classcodes = "C5550 (Printers, plotters and other hard-copy output devices)C7430 (Computer engineering)", classification = "C5550 (Printers, plotters and other hard-copy output devices); C7430 (Computer engineering)", corpsource = "Hewlett Packard Co., Palo Alto, CA, USA", fjournal = "Hewlett-Packard Journal: technical information from the laboratories of Hewlett-Packard Company", keywords = "application specific integrated circuits; computing; Custom integrated circuits; custom integrated circuits; Emulation; emulation; firmware; Firmware design; firmware design; Hewlett; HP DesignJet drafting plotter; Packard computers; plotters; Print engine control; print engine control; raster conversion; reduced instruction set; RISC processor; Simulation; simulation; Single-chip processors; single-chip processors; vector-to-; Vector-to-raster conversion; virtual machines", thesaurus = "Application specific integrated circuits; Firmware; Hewlett Packard computers; Plotters; Reduced instruction set computing; Virtual machines", treatment = "P Practical", } @Article{Muller:1992:ASP, author = "Urs A. Muller and Bernhard Baumle and Peter Kohler and Anton Gunzinger and Walter Guggenbuhl", title = "Achieving Supercomputer Performance for Neural Net Simulation with an Array of Digital Signal Processors", journal = j-IEEE-MICRO, volume = "12", number = "5", pages = "55--65", day = "1", month = sep # "\slash " # oct, year = "1992", CODEN = "IEMIDZ", DOI = "https://doi.org/10.1109/40.166714", ISSN = "0272-1732 (print), 1937-4143 (electronic)", ISSN-L = "0272-1732", bibdate = "Thu Dec 14 06:08:58 MST 2000", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; Science Citation Index database (1980--2000); UnCover library database", abstract = "High-power computing for neural network simulation.", acknowledgement = ack-nhfb, classcodes = "C5440 (Multiprocessor systems and techniques); C5220P (Parallel architecture); C7430 (Computer engineering); C6110P (Parallel programming); C5290 (Neural computing techniques); C5135 (Digital signal processing chips)", corpsource = "Electron. Lab., Swiss Federal Inst. of Technol., Zurich, Switzerland", fjournal = "IEEE Micro", journal-URL = "http://www.computer.org/csdl/mags/mi/index.html", keywords = "2.7 GFLOPS; architecture; architectures; backpropagation; digital signal processing chips; digital signal processors array; interconnection networks; multiprocessor; Music; neural net simulation; neural nets; parallel; parallel distributed-memory; parallel programming; programming; supercomputer performance; virtual machines", treatment = "P Practical", } @InProceedings{Nakanishi:1992:SSP, author = "H. Nakanishi and V. Rego and V. Sunderam", title = "Superconcurrent simulation of polymer chains on heterogeneous networks", crossref = "IEEE:1992:PSM", pages = "561--569", year = "1992", bibdate = "Wed Apr 15 15:37:20 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, classification = "A6140K (Polymers, elastomers, and plastics); C1140Z (Other and miscellaneous); C7320 (Physics and Chemistry); C7430 (Computer engineering)", corpsource = "Department of Phys. and CS, Purdue Univ., West Lafayette, IN, USA", keywords = "EcliPSe toolkit; heterogeneous computing nodes; heterogeneous networks; massively parallel stochastic simulation; physics computing; polymer chains; polymer structure; price-performance ratios; scale-invariant phenomena; stochastic processes; superconcurrent simulation; toolkit-based parallelization; tree- structure; tree-structured virtual machine; virtual machines", sponsororg = "IEEE; ACM", treatment = "A Application; P Practical", } @Article{Neuman:COMPSYS-5-4-407, author = "B. Clifford Neuman", title = "The {Prospero} File System: a Global File System Based on the Virtual System Model", journal = j-COMP-SYS, volume = "5", number = "4", pages = "407--432", month = "Fall", year = "1992", CODEN = "CMSYE2", ISSN = "0895-6340", bibdate = "Fri Sep 13 07:44:41 MDT 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/compsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, affiliation = "Inf. Sci. Inst., Univ. of Southern California, Los Angeles, SC, USA", classification = "B6210L (Computer communications); C5620 (Computer networks and techniques); C6120 (File organisation)", keywords = "Computer systems; Customized view; Global environment; Global file system; Large geographic areas; Organizational boundaries; Prospero File System; Virtual system model", thesaurus = "Distributed processing; File organisation; Virtual storage", } @Article{Nourse:1992:MWN, author = "Andrew W. Nourse", title = "{Microsoft Windows} Network Virtual Device Drivers in {PATHWORKS} for {DOS}", journal = j-DEC-TECH-J, volume = "4", number = "1", pages = "47--55 (or 47--56??)", month = "Winter", year = "1992", CODEN = "DTJOEL", ISSN = "0898-901X", bibdate = "Thu Mar 20 18:15:43 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "ftp://ftp.digital.com/pub/Digital/info/DTJ/v4n1/Microsoft_Windows_Network_Virt_01oct1992DTJ506P8.ps; http://www.digital.com:80/info/DTJ506/DTJ506SC.TXT", abstract = "Digital's PATHWORKS for DOS version 4.1 personal computer integration software includes two network virtual device drivers for the Microsoft Windows environment. These drivers allow Windows applications operating in a protected processor mode and standard DOS applications in a virtual machine to concurrently access services designed to run in real mode under the DOS operating system. The network virtual device drivers, available only in Microsoft Windows enhanced mode, manage DECnet and NetBIOS operations and permit the full use of these interfaces.", acknowledgement = ack-nhfb, classcodes = "C6150N (Distributed systems)", classification = "C6150N (Distributed systems)", fjournal = "Digital Technical Journal", keywords = "DECnet; device drivers; graphical user interfaces; Microsoft Windows; NetBIOS; network operating systems; network virtual; Network virtual device drivers; personal computer integration software; Personal computer integration software", thesaurus = "Graphical user interfaces; Network operating systems", treatment = "P Practical", } @Article{Saeed:1992:ICM, author = "Faisel Saeed and K. M. George and M. H. Samadzadeh", title = "Implementation of classical mutual exclusion algorithms in {Ada}", journal = j-SIGADA-LETTERS, volume = "12", number = "1", pages = "73--84", month = jan # "\slash " # feb, year = "1992", CODEN = "AALEE5", ISSN = "1094-3641 (print), 1557-9476 (electronic)", ISSN-L = "1094-3641", bibdate = "Sat Aug 9 09:05:44 MDT 2003", bibsource = "Compendex database; http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "This paper presents a scheme for defining a simulation environment for n-process mutual exclusion algorithms based on an Ada virtual machine. Several algorithms have been implemented and tested in this simulation environment.", acknowledgement = ack-nhfb, affiliation = "Oklahoma State Univ", affiliationaddress = "Stillwater, OK, USA", classcodes = "C6110P (Parallel programming); C6150J (Operating systems); C6140D (High level languages); C7430 (Computer engineering); C6185 (Simulation techniques)", classification = "723", corpsource = "Department of Comput. Sci., Oklahoma State Univ., Stillwater, OK, USA", fjournal = "ACM SIGADA Ada Letters", journalabr = "Ada Lett", keywords = "Ada; Ada listings; Ada Virtual Machine; Ada virtual machine; classical mutual; Computer Programming --- Algorithms; Computer Programming Languages --- Ada; Computer Simulation; concurrency control; DELAY statements; digital simulation; exclusion algorithms; implementation template; Mutual Exclusion Algorithms; n-process mutual exclusion algorithms; parallel programming; Simulation Environment; simulation environment; virtual machines", treatment = "P Practical", } @Article{Salter:1992:EHW, author = "Brett Salter", title = "An exception handler for {Windows} 3", journal = j-DDJ, volume = "17", number = "9", pages = "32, 34, 36, 102, 104--107", month = sep, year = "1992", CODEN = "DDJOEB", ISSN = "1044-789X", bibdate = "Tue Sep 10 10:06:23 MDT 1996", bibsource = "http://www.ddj.com/index/author/index.htm; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; UnCover database", abstract = "When writing Periscope/32 for Windows, a system-level debugger for Windows 3, Brett needed to debug the debugger so he developed WINX.386. This Windows exception handler is implemented as an Enhanced Mode Windows virtual device driver that oversees what's happening with other VxDs, normal Windows applications and drivers, and the DOS box --- including TSRs and DOS device drivers.", acknowledgement = ack-nhfb, affiliation = "The Periscope Co., Atlanta, GA, USA", classification = "C6150G (Diagnostic, testing, debugging and evaluating systems); C6150N (Distributed systems); C6180G (Graphical user interfaces)", fjournal = "Dr. Dobb's Journal of Software Tools", keywords = "DOS device drivers; Enhanced mode Windows virtual device driver; Exception handler; Periscope/32; System-level debugger; Windows 3; WINX.386", thesaurus = "Assembly language listings; Error handling; Graphical user interfaces; Input-output programs; Multiprogramming; Program debugging; Virtual machines", } @TechReport{Simpkins:1992:AVP, author = "N. K. Simpkins", title = "{ALEP-0 Version 2.2: Prototype Virtual Machine}", institution = "CEC", publisher = "Commission of the European Communities", address = "Luxembourg, Luxembourg", year = "1992", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "(User guide for the Advanced Language Engineering Platform). BIM", } @Article{Sterrett:1992:PMA, author = "Anthony Sterrett and Marvin Minei", title = "Performance measures of the {Ada Rendezvous}", journal = j-SIGADA-LETTERS, volume = "12", number = "2", pages = "97--101", month = mar # "\slash " # apr, year = "1992", CODEN = "AALEE5", ISSN = "1094-3641 (print), 1557-9476 (electronic)", ISSN-L = "1094-3641", bibdate = "Sat Aug 9 09:05:44 MDT 2003", bibsource = "Compendex database; http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "A discussion is presented of the average rendezvous response time (RRT) for a transaction-based two-processor system. RRT is discussed from the point of view of a sensitivity study. Generalized performance curves for the rendezvous are shown, along with commentary on their performance elbows (bottlenecks).", acknowledgement = ack-nhfb, affiliation = "Naval Ocean Systems Cent", affiliationaddress = "San Diego, CA, USA", classcodes = "C6150N (Distributed systems); C6140D (High level languages)", classification = "723", corpsource = "Naval Ocean Systems Center, San Diego, CA, USA", fjournal = "ACM SIGADA Ada Letters", journalabr = "Ada Lett", keywords = "Ada; Ada rendezvous; asynchronous tasks; communication; Computer Programming Languages; computer simulations; Computer Systems, Digital --- Multiprocessing; Computer Systems, Digital --- Performance; curves; multiprocessing programs; performance; performance behavior; performance evaluation; Rendezvous Response Time; rendezvous response time; sensitivity studies; synchronized; two-processor system; virtual machines", treatment = "P Practical", } @Article{Tollenaere:1992:PIC, author = "Tom Tollenaere and Marc M. {Van Hulle} and Guy A. Orban", title = "Parallel Implementation and Capabilities of Entropy-Driven Artificial Neural Networks", journal = j-J-PAR-DIST-COMP, volume = "14", number = "3", pages = "286--305", month = mar, year = "1992", CODEN = "JPDCER", ISSN = "0743-7315 (print), 1096-0848 (electronic)", ISSN-L = "0743-7315", bibdate = "Sat Apr 12 19:06:31 MDT 1997", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, affiliation = "Katholieke Universiteit te Leuven", affiliationaddress = "Leuven, Belgium", classification = "723; 741; C5290 (Neural computing techniques)", corpsource = "Katholieke Univ., Leuven, Belgium", fjournal = "Journal of Parallel and Distributed Computing", journal-URL = "http://www.sciencedirect.com/science/journal/07437315", journalabr = "J Parallel Distrib Comput", keywords = "Applications; EDANN; Entropy Driven Artificial Neural Networks (EDANN); entropy-driven artificial neural networks; Local Line Detection Operators; Network Topology; neural nets; Neural Networks; parallel; parallel simulator; Parallel Transputer Array; Retinal Image; simulation environment; transputer array; virtual machines", treatment = "P Practical", } @Article{Turega:1992:CAS, author = "M. Turega", title = "A Computer Architecture to Support Neural Net Simulation", journal = j-COMP-J, volume = "35", number = "4", pages = "353--360", month = aug, year = "1992", CODEN = "CMPJA6", ISSN = "0010-4620 (print), 1460-2067 (electronic)", ISSN-L = "0010-4620", bibdate = "Wed Jul 21 09:53:36 MDT 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www3.oup.co.uk/computer_journal/Volume_35/Issue_04/Vol35_04.index.html", URL = "http://www3.oup.co.uk/computer_journal/Volume_35/Issue_04/Vol35_04.body.html#AbstractTurega", acknowledgement = ack-nhfb, affiliation = "Department of Comput., Univ. of Manchester Inst. of Sci. Technol., UK", author-1-adr = "Department of Computation, University of Manchester Institute Of Science and Technology, P.O. Box 88, Manchester M60 IQD", classcodes = "C7430 (Computer engineering); C5220P (Parallel architecture); C5290 (Neural computing techniques); C1230D (Neural nets)", classification = "C1230D (Neural nets); C5220P (Parallel architecture); C5290 (Neural computing techniques); C7430 (Computer engineering)", corpsource = "Department of Comput., Univ. of Manchester Inst. of Sci. Technol., UK", fjournal = "The Computer Journal", journal-URL = "http://comjnl.oxfordjournals.org/", keywords = "architecture; back propagation model; Back propagation model; computer; Computer architecture; input response; Input response; memory nodes; Memory nodes; neural net simulation; Neural net simulation; neural nets; parallel architectures; processor nodes; Processor nodes; real-world problems; Real-world problems; virtual machines; weight adjustment; Weight adjustment", thesaurus = "Neural nets; Parallel architectures; Virtual machines", treatment = "P Practical; T Theoretical or Mathematical", } @TechReport{Cahill:1993:ICV, author = "Vinny Cahill and Paul Taylor and Gradimir Starovic and Brendan Tangney and Darragh O'Grady and Rodger Lea and Christian Jacquemot and Peter Strarup Jensen and Paulo Amaral and Adam Mirowski and James Loveluck and Youcef Laribi and Xavier Rousset de Pina and Pedro Sousa", title = "Implementing the {Comandos} Virtual Machine", type = "Technical Report", number = "TCD-CS-93-32", institution = "Trinity College; Chorus Systemes; OSF Grenoble Research Institute; Unite mixte BULL-IMAG; INESC", address = "Dublin, Ireland; Grenoble, France", pages = "50", year = "1993", bibdate = "Mon Apr 10 08:38:58 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "Also in Chapter 10 of The Comandos Distributed Application Platform.Cahill, {V}., Balter, {R}., Harris, {N}., and Rousset dePina, {X}. (Ed.s),Springer-Verlag, Berlin, 1993.", URL = "ftp://ftp.cs.tcd.ie/pub/tcd/tech-reports/reports.93/TCD-CS-93-32.ps.gz; ftp://ftp.dsg.cs.tcd.ie/pub/doc/TCD-CS-93-32.ps.gz", abstract = "This report describes the different implementations of the Comandos platform. This report is published as Chapter 10 of The Comandos Distributed Application Platform Cahill, V., Balter, R., Harris, N., and Rousset de Pina, X. (Eds.), Springer-Verlag, Berlin, 1993", contact-1 = "", contact-2 = "", contact-3 = "", contact-4 = "", contact-5 = "", copyright = "1993 TCD DSG", dsgref = "comandos", retrieval = "Hard copy available by writing to: Rachel Noctor, Librarian, Department of Computer Science, Trinity College, Dublin 2, Ireland", source = "~publications/published/DeptTechReports/ComandosBookTRs/C10-vm_impl/", xxnote = "Check last author: Sousa or Souza??", } @MastersThesis{Cavender:1993:APV, author = "Mark Edward Cavender", title = "Asynchronous parallel virtual machine", type = "M.S. thesis", school = "University of Texas at San Antonio. Division of Mathematics and Computer Science and Statistics", address = "San Antonio, TX, USA", pages = "vi + 228", year = "1993", bibdate = "Mon Jan 15 18:16:25 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, keywords = "Parallel processing (Electronic computers); Virtual computer systems.", } @TechReport{Crowl:1993:CLI, author = "Lawrence A. Crowl", title = "A Common Library Interface to Shared-Memory Multiprocessors", number = "93-80-08", institution = "Department of Computer Science, Oregon State University", year = "1993", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "Fri, 15 Dec 1995 03:17:47 GMT", URL = "http://www.cs.orst.edu/techpub/reports/1993/1993R-ORSTCS-93-80-08/", abstract = "Programmers using a wide variety of shared-memory multiprocessors cannot yet rely on the availability of programming tools other than K\&R C and Fortran 77. To overcome the sequential nature of these languages, vendors usually provide parallel programming primitives via user-callable libraries. Unfortunately, the vendor-provided libraries often differ substantially. In addition to providing differing mechanisms to create and synchronize processes; libraries often have different models of how the processes share and allocate memory within their address space. This paper describes a common library interface to seven different shared-memory multiprocessors. Surprisingly, this library needs only two pages of implementation on each of the multiprocessors. However, the effect on the programming model is significant. Programmers must use the library's virtual machine model to obtain efficient programs on all the different physical machines.", keywords = "multiprocessor shared-memory programming parallel portable system operating multiprocessor", } @Article{Culler:1993:LTR, author = "David E. Culler and Richard M. Karp and David A. Patterson and Abhijit Sahay and Klaus E. Schauser and Eunice Santos and Ramesh Subramonian and Thorsten von Eicken", title = "{LogP}: towards a realistic model of parallel computation", journal = j-SIGPLAN, volume = "28", number = "7", pages = "1--12", month = jul, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:39 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, affiliation = "Div. of Comput. Sci., California Univ., Berkeley, CA, USA", classification = "C5440 (Multiprocessor systems and techniques); C6110P (Parallel programming); C7430 (Computer engineering)", confdate = "19-22 May 1993", conflocation = "San Diego, CA, USA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", keywords = "CM-5; Communication bandwidth; Communication delay; Computing bandwidth; LogP; Machine configuration; Machine designers; Parallel computers; Parallel machine model; Portable parallel algorithms", thesaurus = "Parallel algorithms; Parallel machines; Parallel programming; Virtual machines", } @InProceedings{Despons:1993:CCP, author = "R. Despons and T. Muntean", title = "Constructing correct protocols for a diffusion virtual machine in message passing parallel architectures", crossref = "Grebe:1993:TAS", pages = "465--480", year = "1993", bibdate = "Wed Apr 16 06:39:19 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, classification = "C5220P (Parallel architecture); C5440 (Multiprocessor systems and techniques); C5640 (Protocols); C6150N (Distributed systems); C7430 (Computer engineering)", corpsource = "IMAG-LGI Lab., Grenoble Univ., France", keywords = "architectures; communication protocols; diffusion protocols; diffusion virtual machine; machines; massively parallel architectures; message passing; parallel; parallel algorithms; parallel applications; parallel architectures; parallel machines; programming environments; protocols; virtual machines", pubcountry = "Netherlands", treatment = "P Practical", } @InProceedings{Drapeau:1993:SLT, author = "Ann L. Drapeau and Randy H. Katz", title = "Striping in Large Tape Libraries", crossref = "IEEE:1993:PSP", pages = "378--387", year = "1993", bibdate = "Wed Apr 15 12:04:03 MDT 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, affiliation = "Univ of California", affiliationaddress = "Berkeley, CA, USA", classification = "723; C5320C (Storage on moving magnetic media); C5470 (Performance evaluation and testing); C7430 (Computer engineering)", corpsource = "Comput. Sci. Div., California Univ., Berkeley, CA, USA", keywords = "data striping concepts; Database systems; discrete event simulation; event-driven simulator; Event-driven simulator; EXB120 tape robot; large tape libraries; Large tape libraries; magnetic tape storage; Massive tertiary storage systems; multimedia databases; Non-striping system; online libraries; performance evaluation; random workload; randomly distributed access; records management; robot arms; Scientific data collection; software libraries; Storage allocation (computer); Striping concepts; tertiary storage databases; virtual machines", sponsororg = "IEEE; ACM SIGARCH", treatment = "P Practical", } @InProceedings{Golub:1993:MER, author = "D. B. Golub and R. Manikundalam and F. L. Rawson", title = "{MVM}---an environment for running multiple {DOS}, {Windows} and {DPMI} programs on the microkernel", crossref = "USENIX:1993:PUM", pages = "173--190", year = "1993", bibdate = "Sat Sep 28 18:52:45 MDT 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, affiliation = "Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA", classification = "C5440 (Multiprocessor systems and techniques); C6150J (Operating systems); C6150N (Distributed systems)", keywords = "Access sharing; Client/server emulation cradle; DOS Protected Mode Interface; DPMI programs; Industry standard; Legacy software; Mach based systems; Microkernel; Multiple applications; Multiple DOS programs; Multiple Virtual Machines; MVM; PC DOS system; Personal computer; Protected mode DOS extenders; Virtual machine environment; Windows", thesaurus = "IBM computers; Input-output programs; Microcomputer applications; Multiprocessing programs; Operating systems [computers]; Virtual machines", } @Article{Grimshaw:1993:DOP, author = "Andrew S. Grimshaw and W. Timothy Strayer and P. Narayan", title = "Dynamic, object-oriented parallel processing", journal = j-IEEE-PAR-DIST-TECH, volume = "1", number = "2", pages = "33--47", month = may, year = "1993", CODEN = "IPDTEX", DOI = "https://doi.org/10.1109/88.218174", ISSN = "1063-6552 (print), 1558-1861 (electronic)", ISSN-L = "1063-6552", bibdate = "Fri Apr 11 07:24:28 MDT 1997", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, affiliation = "Univ of Virginia", classification = "721.1; 722.4; 723.1; C5440 (Multiprocessor systems and techniques); C6110B (Software engineering techniques); C6110J (Object-oriented programming); C6115 (Programming support)", corpsource = "Department of Comput. Sci., Virginia Univ., Charlottesville, VA, USA", fjournal = "IEEE parallel and distributed technology: systems and applications", journalabr = "IEEE Parallel Distrib Technol", keywords = "32-node Intel iPSC/2; based distributed-memory systems; comparison; compiler-; Computer programming; Concurrent programs; Distributed computer systems; DNA; dynamic parallel processing; easy; Gaussian elimination; hand-coded implementations; high performance; hypercube; image convolution; medium-grain parallel; Mentat; Multiprocessing systems; Object oriented programming; object-; object-oriented programming; oriented parallel processing; Parallel processing; parallel processing; Parallel processing systems; Parallel programming; parallelism; partial; performance evaluation; pivoting; portable software; protein sequence; software; software portability; software tools; sparse matrix-vector multiplication; Sun IPC Sparcstations; virtual-machine model", treatment = "P Practical", } @TechReport{Herbordt:1993:EEA, author = "Martin C. Herbordt and Charles C. Weems", title = "An Environment for Evaluating Architectures for Spatially Mapped Computatio: System Architecture and Preliminary Results", type = "Technical Report", number = "UM-CS-1993-070", institution = "University of Massachusetts, Amherst, Computer Science", month = sep, year = "1993", bibdate = "Mon Apr 10 11:35:35 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "ftp://ftp.cs.umass.edu/pub/techrept/1993/UM-CS-1993-070.ps", abstract = "An environment which addresses several problems in evaluating massively parallel array architectures is described. A realistic workload including a series of applications currently being used as building blocks in vision research has been constructed. Both flexibility in architectural parameter selection and simulation efficiency are maintained by combining virtual machine emulation with trace driven simulation. The trade-off between fairness to diverse target architectures and programmability of the test programs is addressed through the use of operator and application libraries. Initial results are presented indicating the appropriate balance between register file and cache to optimize performance under varying levels of processor element virtualization.", keywords = "ENPASSANT; machine emulation; massively parallel array architectures; trace driven simulation; virtual", notes = "93-70 {"}An Environment for Evaluating Architectures for Spatially Mapped Computation: System Architecture and Preliminary Results{"} Martic C. Herbordt, Charles C. Weems Computer Science Department Box 34610 Lederle Graduate Research Center University of Massachusetts Amherst, MA 01003-4610 September 1993", revision = "April 3, 1996", } @Article{Inouchi:1993:PTI, author = "H. Inouchi and N. McLoughlin", editor = "H. Sorensen", title = "Parallel techniques for image processing and artificial neural network simulation", journal = "Ai and Cognitive Science '91", publisher = pub-SV, address = pub-SV:adr, pages = "177--89", year = "1993", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "The emergence of systems composed of multiple processing elements and memory units, and their associated models of computation promise to alleviate many of the limitations of conventional Von Neumann architectures. The implication of this to the field of artificial intelligence is twofold, parallel systems offer both a significant increase in computing power/speed available, and a more natural physical architecture for implementing parallel solutions to AI problems. We discuss general parallel programming techniques, their real applications to image processing and neural network simulation, parallel implementation of neural network models, and finally we finish with our conclusions derived from this work.", keywords = "AI problems; artificial intelligence; artificial neural network simulation; computation models; image processing; memory units; multiple processing elements; NEURAL NETS; neural network models IMAGE PROCESSING; PARALLEL ALGORITHMS; parallel programming; PARALLEL PROGRAMMING; parallel systems; parallel techniques; VIRTUAL MACHINES; Von Neumann architectures", } @PhdThesis{Knaggs:1993:PTA, author = "Peter J. Knaggs", title = "Practical and Theoretical Aspects of {Forth} Software Development", school = "School of Computing and Mathematics", address = "University of Teesside, Middlesbrough, Cleveland. UK", month = mar, year = "1993", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "ftp://cis.paisley.ac.uk/forth/thesis", abstract = "This is an investigation into the use of the Forth programming environment. The main areas of enquiry were: interfacing Forth to other languages; interfacing Forth and local area networks; and the use of RISC processors with stack based architecture such as the NC4000 and Harris RTX series.\par We describe how to interface Forth and C. We also provide a system with a multi-tasking interrupt driven interface to the IBM NetBIOS networking software and a simple, generic, method of task activation through message passing.\par Many aspects of the investigation proved to be dependent on a more thorough theoretical underpinning for the Forth language. The use of a typeless parameter stack means that a programmer must concern himself with the intellectual burden of managing the parameter stack. The mismatching of stack elements can be the cause of subtle logic errors. We therefore investigated the possibility of developing a ``type algebra'' that would allow us to develop a typed version of Forth. This thesis includes a theory for a ``type signature algebra'' for the stack based argument passing method used by Forth.\par To support the use of multi-tasking we provide a simple, but formal, theory of concurrent tasks based on state machines that synchronise on events. This has a graphical notation for people who are not familiar with formal notations.\par We also looked at how formalisms might be used to define a semantic model for the Forth language and how formalisms can help to define the relationship between Forth's stack based virtual machine and register based target processors.", } @Article{Kumar:1993:FHS, author = "Sanjaya Kumar and James H. Aylor and Barry W. Johnson and Wm. A. Wulf", title = "A Framework for Hardware\slash Software Codesign", journal = j-COMPUTER, volume = "26", number = "12", pages = "39--45", month = dec, year = "1993", CODEN = "CPTRB4", ISSN = "0018-9162 (print), 1558-0814 (electronic)", ISSN-L = "0018-9162", bibdate = "Mon Feb 3 07:28:57 MST 1997", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "This article presents several codesign concepts, including a. model for evaluating hardware/software alternatives and an integrated hardware/software model that supports representations at different levels of detail.", acknowledgement = ack-nhfb, affiliation = "Virginia Univ., Charlottesville, VA, USA", classification = "722; 723; C5210 (Logic design methods); C6110B (Software engineering techniques); C7430 (Computer engineering)", fjournal = "Computer", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2", journalabr = "Computer", keywords = "Codesign exploration; Codesign methodology; Common simulation environment; Computer hardware; Computer software; Computers; Design; Hardware design; Hardware software codesign; Hardware/software codesign; Hardware/software tradeoffs; Interface modification; Model continuity; Software design", thesaurus = "Discrete event simulation; Logic design; Software engineering; Virtual machines", } @InProceedings{Loyot:1993:VVM, author = "E. C. {Loyot, Jr.} and A. S. Grimshaw", title = "{VMPP}: a virtual machine for parallel processing", crossref = "IEEE:1993:PSI", pages = "735--740", year = "1993", bibdate = "Wed Apr 16 06:39:19 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, classification = "C6110P (Parallel programming); C6150C (Compilers, interpreters and other processors); C7430 (Computer engineering)", corpsource = "Department of Comput. Sci., Virginia Univ., Charlottesville, VA, USA", keywords = "front-end translators; parallel languages; parallel processing; parallel source languages; portability; program interpreters; software; virtual machine; virtual machines; VMPP", sponsororg = "IEEE Comput. Soc.; ACM Sigarch", treatment = "P Practical", } @Article{Manning:1993:AAE, author = "Serge M. Manning and David G. Meyer", title = "Analysis of Asynchronous Execution Streams with {I}-Caching in Massively Parallel Systems", journal = j-J-PAR-DIST-COMP, volume = "19", number = "3", pages = "279--291", month = nov, year = "1993", CODEN = "JPDCER", DOI = "https://doi.org/10.1006/jpdc.1993.1112", ISSN = "0743-7315 (print), 1096-0848 (electronic)", ISSN-L = "0743-7315", bibdate = "Thu Mar 9 09:18:53 MST 2000", bibsource = "http://www.idealibrary.com/servlet/useragent?func=showAllIssues&curIssueID=jpdc; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1112/production; http://www.idealibrary.com/links/doi/10.1006/jpdc.1993.1112/production/pdf", acknowledgement = ack-nhfb, classification = "C5220P (Parallel architecture); C7430 (Computer engineering)", corpsource = "Sch. of Electr. Eng., Purdue Univ., West Lafayette, IN, USA", fjournal = "Journal of Parallel and Distributed Computing", journal-URL = "http://www.sciencedirect.com/science/journal/07437315", keywords = "asynchronous execution streams; buffer storage; I-caching; instruction caching system; massively; mode; multiprocessor simulation; parallel architectures; parallel program execution; parallel systems; SIMD; SPMD; virtual machines", treatment = "P Practical; T Theoretical or Mathematical", } @TechReport{McHugh:1993:ILC, author = "C. (Colm) McHugh and V. (Vinny) Cahill", title = "Interfacing a language to the {Commandos} [i.e., {Comandos}] virtual machine", volume = "TCD-CS-93-33", type = "External technical reports", institution = "Department of Computer Science, Trinity College", address = "Dublin, Ireland", pages = "23", year = "1993", LCCN = "95.B02502", bibdate = "Mon Apr 10 10:43:15 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; library.ox.ac.uk:210/ADVANCE", acknowledgement = ack-nhfb, subject = "Eiffel (Computer program language); Electronic data processing; Distributed processing; Object-oriented programming (Computer science)", } @InProceedings{Mzaik:1993:SPA, author = "T. Mzaik and J. Jagadeesh", booktitle = "National Aerospace and Electronics Conference. NAECON 1993", title = "Simulation of pyramid architecture on the connection machine and implementation of algorithms", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "838--44", year = "1993", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Many parallel architectures have been proposed to meet the high computational requirement of image processing and computer vision . SIMD pyramid architectures have been proposed to efficiently implement several classes of vision tasks such as multiresolution and top-down/bottom up algorithms. In this paper, a pyramid simulation environment implemented on the Connection Machine (CM) is presented. Discussion of the mapping scheme and the basic features of the simulator along with implementation of several pyramid algorithms using the simulator is presented.", keywords = "computer vision; connection machine; Gaussian pyramid; image processing; IMAGE SEGMENTATION; Laplacian pyramid; mapping; multiresolution algorithm; NEURAL NETS; PARALLEL ALGORITHMS; parallel architectures; PARALLEL ARCHITECTURES; PROGRAMMING ENVIRONMENTS; pyramid algorithms; pyramid architecture; pyramid search; pyramid simulation environment; segmentation COMPUTER VISION; SIMD; subband pyramid; top-down/bottom up algorithms; VIRTUAL MACHINES", } @InProceedings{Poulsen:1993:ETP, author = "David K. Poulsen and Pen-Chung Yew", title = "Execution-Driven Tools for Parallel Simulation of Parallel Architectures and Applications", crossref = "IEEE:1993:PSP", pages = "860--869", year = "1993", bibdate = "Wed Apr 15 12:04:03 MDT 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, affiliation = "Univ of Illinois at Urbana-Champaign", affiliationaddress = "Urbana, IL, USA", classification = "723; 921.5; C5220P (Parallel architecture); C6150C (Compilers, interpreters and other processors); C6150G (Diagnostic, testing, debugging and evaluating systems); C7430 (Computer engineering)", corpsource = "Center for Supercomput. Res. and Dev., Illinois Univ., Urbana, IL, USA", keywords = "Critical path simulation (CPS); EPG-sim; execution-driven critical path simulation; execution-driven simulations; Execution-driven tools; intelligent source-level instrumentation; Intelligent source-level instrumentation; optimistically parallelized codes; Optimization; parallel application codes; parallel applications; parallel architectures; Parallel processing systems; parallelising compilers; Parallelizing compilers; parallelizing compilers; Program compilers; program compilers; software tools; Source-level instrumentation; source-level instrumentation; trace generation; virtual machines", sponsororg = "IEEE; ACM SIGARCH", treatment = "P Practical", } @TechReport{Ramsdell:1993:RVP, author = "John D. Ramsdell", title = "The Revised {VLISP} PreScheme Front End", institution = "MITRE", pages = "91", year = "1993", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "ftp://cs.indiana.edu/pub/scheme-repository/txt/vlisp/preschemerevised.dvi.Z", abstract = "Verified programming Languaeg Implementation Project developed a formally verified implementation of the Scheme programming language. It used a systems programming dialect of Scheme, called VLISP PreScheme to program the VLISP Virtual Machine, a byte-code interpreter. The original compiler only accepted programs that specify iterative processes. This document describes a revision of the language and its compiler. The most important change is the compiler provides a stack to save control information for procedure calls so programs that specify recursive processes are accepted. the revision expands the systems programming tasks for which VLISP PreScheme can be used and simplifies the task of matching an algorithm with its code.", checked = "19940101", email = "ramsdell@mitre.org", source = "URL", } @Article{Rong:1993:LMM, author = "Tsai Shang Rong and Lian-Jou Tsai", title = "A Logical Machine Monitor Supporting an Environment for Development and Execution of Operating Systems", journal = j-J-SYST-SOFTW, volume = "21", number = "1", pages = "27--39", month = apr, year = "1993", CODEN = "JSSODM", ISSN = "0164-1212 (print), 1873-1228 (electronic)", ISSN-L = "0164-1212", bibdate = "Wed Dec 16 08:24:49 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "The logical machine is an approach for designing and developing operating systems. It partitions conventional operating systems into two parts, the logical machine operating system and the logical machine monitor, which are responsible for user services and system resource management, respectively. The logical machine monitor provides a logical machine interface for the logical machine operating system to get the resources it needs. A logical machine monitor, LMM386, has been successfully implemented to provide an environment for the development and execution of a logical machine operating systems (LMOS). Also, the LMM386 introduces a tool for developing LMM386 itself and the LMOS. This article discusses how to develop a logical machine system on 80386 machines. An LMOS derived from MINIX, executed in this environment, was built to demonstrate the feasibility and merits of the logical machine concept. By this approach, one can easily monitor the behaviour of the LMOS. Furthermore, by applying the concept in a distributed environment, one can enhance the system capabilities, such as remote disk mapping, disk replication and fault tolerance, without changing the internal logic of the LMOS.", acknowledgement = ack-nhfb, affiliation = "Department of Electr. Eng., Nat. Cheng-Kung Univ., Tainan, Taiwan", classification = "C6150J (Operating systems); C7430 (Computer engineering)", fjournal = "The Journal of systems and software", journal-URL = "http://www.sciencedirect.com/science/journal/01641212", keywords = "80386 Machines; Disk replication; Distributed environment; Fault tolerance; LMM386; Logical machine monitor; Logical machine operating system; MINIX; Remote disk mapping; System development; System resource management; User services; Virtual machine", thesaurus = "Operating systems [computers]; Virtual machines", xxauthor = "Shang Rong Tsai and Lian-Jou Tsai", } @InProceedings{Sebes:1993:MAL, author = "E. J. Sebes and T. C. Vickers-Benzel", title = "Modularity of Assembly-Language Implementations of Trusted Systems", crossref = "Anonymous:1993:NCS", pages = "173--184", year = "1993", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "This paper presents an approach to assessing the modularity of trusted systems that are implemented in low-level languages. The approach presented is based on experience gained from in-depth analyses of the security features of such systems. The methods described here are centered around defining analogs of high-level language (HLL) constructs in low-level language (LLL) implementations, so that similar modularity interpretations can be applied. This paper can serve to extend the findings of the NSA System Architecture Working Group (SAWG) to the critical class of complex trusted systems which require the use of lower level implementation languages. Such LLL modularity interpretations are essential to the application of evaluation criteria to a broad range of systems, including trusted systems for use in embedded or real-time military applications, and mainframe trusted system products such as OSs or Virtual Machine Monitors. Many such systems must use a carefully balanced approach to meeting requirements such as reconfigurability, fault tolerance, and isolation-based access control, while still satisfying modularity requirements.", keywords = "Trusted Systems, Evaluation Criteria, Modularity, Assembly-Language, Software Analysis Techniques, Software Development Techniques", } @TechReport{Simpkins:1993:AVM, author = "N. K. Simpkins and G. Cruickshank and {P.E.International}", title = "{ALEP-0 Virtual Machine extensions}", institution = "CEC", year = "1993", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", } @Article{Tsai:1993:LMM, author = "Shang Rong Tsai and Lian-Jou Tsai", title = "A logical machine monitor supporting an environment for development and execution of operating systems", journal = j-J-SYST-SOFTW, volume = "21", number = "1", pages = "27--39", month = apr, year = "1993", CODEN = "JSSODM", ISSN = "0164-1212 (print), 1873-1228 (electronic)", ISSN-L = "0164-1212", bibdate = "Mon Sep 30 17:00:16 MDT 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "The logical machine is an approach for designing and developing operating systems. It partitions conventional operating systems into two parts, the logical machine operating system and the logical machine monitor, which are responsible for user services and system resource management, respectively. The logical machine monitor provides a logical machine interface for the logical machine operating system to get the resources it needs. A logical machine monitor, LMM386, has been successfully implemented to provide an environment for the development and execution of a logical machine operating systems (LMOS). Also, the LMM386 introduces a tool for developing LMM386 itself and the LMOS. This article discusses how to develop a logical machine system on 80386 machines. An LMOS derived from MINIX, executed in this environment, was built to demonstrate the feasibility and merits of the logical machine concept. By this approach, one can easily monitor the behaviour of the LMOS. Furthermore, by applying the concept in a distributed environment, one can enhance the system capabilities, such as remote disk mapping, disk replication and fault tolerance, without changing the internal logic of the LMOS.", acknowledgement = ack-nhfb, affiliation = "Department of Electr. Eng., Nat. Cheng-Kung Univ., Tainan, Taiwan", classification = "C6150J (Operating systems); C7430 (Computer engineering)", fjournal = "The Journal of systems and software", journal-URL = "http://www.sciencedirect.com/science/journal/01641212", keywords = "80386 Machines; Disk replication; Distributed environment; Fault tolerance; LMM386; Logical machine monitor; Logical machine operating system; MINIX; Remote disk mapping; System development; System resource management; User services; Virtual machine", thesaurus = "Operating systems [computers]; Virtual machines", } @TechReport{Anonymous:1994:SAS, author = "Anonymous", title = "Software architecture standard for simulation virtual machine: version 2.0", number = "NASA CR-188291", institution = "National Aeronautics and Space Administration", address = "Washington, DC, USA", pages = "????", year = "1994", LCCN = "NAS 1.26:188291", bibdate = "Mon Apr 10 10:43:28 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; melvyl.cdlib.org:210/CDL90", series = "NASA contractor report", acknowledgement = ack-nhfb, remark = "Shipping list number 94-0856-M.", subject = "ADA (programming language).; Computer programming.; Computerized simulation.; Maintenance.; Real time operation.; Software engineering.; Standards", } @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-SIGPLAN, volume = "29", number = "11", pages = "122--131", month = nov, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:57 MST 2003", bibsource = "http://portal.acm.org/; http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/195473/p122-argade/", abstract = "In this paper, we present a non-invasive and efficient technique for simulating applications complete with their operating system interaction. The technique involves booting and initiating an application on a hardware development system, capturing the entire state of the application and the microprocessor at a well defined point in execution and then simulating the application on microprocessor simulators. Extensive statistics generated from the simulators on run-time dynamics of the application, the operating system as well as the microprocessor enabled us to tune the operating system and the microprocessor architecture and implementation. The results also enabled us to optimize system level design choices by anticipating/predicting the performance of the target system. Lastly, the results were used to adjust and refocus the evolution of the architecture of both the operating system and the microprocessor.", acknowledgement = ack-nhfb, classification = "C5430 (Microcomputers); C5470 (Performance evaluation and testing); C6150G (Diagnostic, testing, debugging and evaluating systems); C6150J (Operating systems)", conflocation = "San Jose, CA, USA; 4--7 Oct. 1994", conftitle = "Sixth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-VI)", corpsource = "AT and T Bell Labs., Allentown, PA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", keywords = "application simulation; computer architecture; design; hardware development system; measurement; microcomputers; microprocessor; microprocessor architecture; microprocessor simulators; operating system; operating system interaction; operating systems (computers); performance; performance evaluation; reliability; run-time dynamics; run-time dynamics monitoring; statistics; system level design; system monitoring; theory; user applications; virtual machines virtual machines", sponsororg = "ACM; IEEE Comput. Soc", subject = "{\bf D.4.8} Software, OPERATING SYSTEMS, Performance, Monitors. {\bf D.4.8} Software, OPERATING SYSTEMS, Performance, Modeling and prediction. {\bf C.0} Computer Systems Organization, GENERAL, Instruction set design. {\bf C.4} Computer Systems Organization, PERFORMANCE OF SYSTEMS.", treatment = "P Practical", } @Article{Averbuch:1994:PES, author = "A. Averbuch and E. Gabber and S. Itzikowitz and B. Shoham", title = "On the parallel elliptic single\slash multigrid solutions about aligned and nonaligned bodies using the {Virtual Machine for Multiprocessors}", journal = j-SCI-PROG, volume = "3", number = "1", pages = "13--32", month = "Spring", year = "1994", CODEN = "SCIPEV", ISSN = "1058-9244 (print), 1875-919X (electronic)", ISSN-L = "1058-9244", bibdate = "Thu Mar 28 12:27:27 MST 2002", bibsource = "Compendex database; ftp://ftp.ira.uka.de/bibliography/Parallel/mgnet.bib; ftp://ftp.ira.uka.de/bibliography/Parallel/pvm.bib; ftp://ftp.math.utah.edu/pub/tex/bib/pvm.bib; https://www.math.utah.edu/pub/tex/bib/sciprogram.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, classification = "C4170 (Differential equations); C5440 (Multiprocessing systems); C6110B (Software engineering techniques); C6110P (Parallel programming); C6150N (Distributed systems software)", corpsource = "Sch. of Math. Sci., Tel Aviv Univ., Israel", fjournal = "Scientific Programming", journal-URL = "http://iospress.metapress.com/content/1058-9244", keywords = "algorithm; aligned bodies; alignment overhead; architectures; coherent services; distributed memory multiprocessor; efficient programming; elliptic equations; explicitly parallel application programs; for Multi-Processors software package; grid points; memory multiprocessors; memory systems; message passing; MIMD; MOS; multi-user shared memory multiprocessors; multiprocessors; nonaligned bodies; parallel architectures; parallel elliptic; parallel elliptic multigrid solutions; parallel program writing; parallel programming; partial differential equations; performance; portable programming; Sequent Symmetry; shared; single grid solution; single-user shared; software packages; software portability; transputer network; transputer systems; Virtual Machine", treatment = "P Practical", } @InProceedings{Beletsky:1994:OPV, author = "V. Beletsky and T. Popova and A. Chemeris", title = "Organization of a parallel virtual machine", crossref = "Horiguchi:1994:ISP", pages = "421--426", year = "1994", bibdate = "Wed Apr 16 06:39:19 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, classification = "C5220P (Parallel architecture); C5440 (Multiprocessing systems); C6150N (Distributed systems software); C7430 (Computer engineering)", corpsource = "Lab. of Parallel Comput., Acad. of Sci., Kiev, Ukraine", keywords = "compilers; dependence graph building; loop parallelization; parallel architectures; parallel machines; parallel virtual machine organization; processor; program compilers; scheduling; scheduling job programs; simulating programs; simulation; virtual machines", sponsororg = "Japan Advanced Inst. Sci. and Technol.; IEEE Comput. Soc.; IEEE Comput. Soc. Tech. Committee on Comput. Archit.; IEEE Comput. Soc. Tech. Committee on Parallel Process.; IPSJ Tech. Committee on Algorithms; IPSJ Tech. Committee on Comput. Archit.; IEICE Tech. Committee on Comput. Syst", treatment = "P Practical", } @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-SIGPLAN, volume = "29", number = "11", pages = "158--170", month = nov, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:57 MST 2003", bibsource = "http://portal.acm.org/; http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/195473/p158-bershad/", abstract = "This paper describes a method for improving the performance of a large direct-mapped cache by reducing the number of conflict misses. Our solution consists of two components: an inexpensive hardware device called a Cache Miss Lookaside (CML) buffer that detects conflicts by recording and summarizing a history of cache misses, and a software policy within the operating system's virtual memory system that removes conflicts by dynamically remapping pages whenever large numbers of conflict misses are detected. Using trace-driven simulation of applications and the operating system, we show that a CML buffer enables a large direct-mapped cache to perform nearly as well as a two-way set associative cache of equivalent size and speed, although with lower hardware cost and complexity.", acknowledgement = ack-nhfb, classification = "C5320G (Semiconductor storage); C5470 (Performance evaluation and testing); C6120 (File organisation); C6150J (Operating systems)", conflocation = "San Jose, CA, USA; 4--7 Oct. 1994", conftitle = "Sixth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-VI)", corpsource = "Department of Comput. Sci. and Eng., Washington Univ., Seattle, WA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", keywords = "associative cache; Cache Miss Lookaside buffer; cache performance; cache storage; CML buffer; complexity; conflict detection; conflict misses; design; hardware cost; hardware device; large direct-mapped cache; large direct-mapped caches; measurement; operating system; operating systems (computers); performance; performance evaluation; software policy; theory; trace-driven simulation; virtual machines; virtual memory system; virtual storage", sponsororg = "ACM; IEEE Comput. Soc", subject = "{\bf B.3.2} Hardware, MEMORY STRUCTURES, Design Styles, Cache memories. {\bf D.4.2} Software, OPERATING SYSTEMS, Storage Management. {\bf D.4.4} Software, OPERATING SYSTEMS, Communications Management, Buffering.", treatment = "P Practical", } @MastersThesis{Biradar:1994:ADL, author = "Umesh V. Biradar", title = "Adaptive distributed load balancing model for parallel virtual machine", type = "Master of Science in Computer Science", school = "Department of Computer Science, College of Engineering, Lamar University", address = "Beaumont, TX, USA", pages = "viii + 44", year = "1994", bibdate = "Mon Jan 15 18:16:39 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, keywords = "Distributed operating systems (Computers); Electronic data processing --- Distributed processing.; Multiprocessors; Parallel processing (Electronic computers)", } @Article{Butt:1994:RDS, author = "Farooq Butt", title = "Rapid development of a source-level debugger for {PowerPC} microprocessors", journal = j-SIGPLAN, volume = "29", number = "12", pages = "73--77", month = dec, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:58 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, classification = "C5130 (Microprocessor chips); C6115 (Programming support); C6140B (Machine-oriented languages); C6150C (Compilers, interpreters and other processors); C6150G (Diagnostic, testing, debugging and evaluating systems)", corpsource = "Compiler and Tools Group, RISC Software Group, Austin, TX, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", keywords = "compile-edit-debug environment; design cycle times; emergent microprocessors; gdb; instruction sets; microprocessor chips; Motorola PowerPC 601 microprocessor; Motorola PowerPC 603 microprocessor; PowerPC instruction set; PowerPC microprocessors; program compilers; program debugging; rapid development; software microprocessor simulator; software tools; software-development environment; source-level debugger; virtual machines", treatment = "P Practical", } @InProceedings{Damodaran-Kamal:1994:TRP, author = "S. K. Damodaran-Kamal and J. M. Francioni", title = "Testing races in parallel programs with an {OtOt} strategy", crossref = "Ostrand:1994:PIS", journal = j-SIGSOFT, year = "1994", CODEN = "SFENDP", ISSN = "0163-5948", ISSN-L = "0163-5948", bibdate = "Sun Dec 22 10:18:08 MST 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/pvm.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, affiliation = "Department of Comput. Sci., Southwestern Louisiana Univ., Lafayette, LA, USA", classification = "C4240P (Parallel programming and algorithm theory); C6110P (Parallel programming); C6150G (Diagnostic, testing, debugging and evaluating systems); C7430 (Computer engineering)", fjournal = "ACM SIGSOFT Software Engineering Notes", issue = "spec. issue. p. 216-27", journal-URL = "https://dl.acm.org/citation.cfm?id=J728", keywords = "Concurrent programs; Controlled execution; Debugging tool; Exponential complexity; General-purpose run-time testing technique; Mdb; Nondeterminism; One-thread-at-one-time strategy; OtOt strategy; Parallel Virtual Machine; Polynomial time complexity; Race conditions specification; Race detection; Race expressions; Race testing; Unrestricted message passing parallel programs", thesaurus = "Computational complexity; Hazards and race conditions; Message passing; Parallel programming; Program debugging; Program testing; Virtual machines", } @Article{Dean:1994:CPV, author = "C. E. Dean and R. C. Denny and P. C. Stephenson and G. J. Milne and E. Pantos", title = "Computing with parallel virtual machines", journal = j-J-PHYS-IV-COLLOQUE, volume = "4", number = "C9", pages = "C9/445--448", month = nov, year = "1994", CODEN = "JPICEI", ISSN = "1155-4339", ISSN-L = "1155-4339", bibdate = "Sun Dec 22 10:20:45 MST 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/pvm.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, affiliation = "SERC Daresbury Lab., Warrington, UK", classification = "C4240P (Parallel programming and algorithm theory); C6110P (Parallel programming); C7320 (Physics and chemistry computing)", fjournal = "Journal de physique. IV, Colloque", keywords = "64-Node Intel iPSC/860 hypercube; Computing elements; CPU performance; DALAI; LSQINT; Parallel execution; Parallel virtual machines; PATTERN; Processing time; PROJECT; Single program multiple data; Synchrotron radiation", thesaurus = "Parallel programming; Physics computing; Synchrotron radiation", } @Article{Erenyi:1994:IPA, author = "I. Erenyi and Z. Fazekas", title = "Image processing applications and their parallel aspects", journal = j-COMP-CONTROL-ENG-J, volume = "5", number = "2", pages = "71--4", year = "1994", CODEN = "CCEJEL", ISSN = "0956-3385 (print), 1741-0460 (electronic)", ISSN-L = "0956-3385", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Image processing activities at KFKI Research Institute for Measurement and Computing Techniques are summarised. First, KFKI's contribution to the VEGA project is described. Then two HW/SW platforms are mentioned (together with applications in intelligent microscopy, industrial quality control). Finally, the analysis/simulation of promising parallel architectures-to achieve considerable speed-up for image processing primitives-is outlined. This inevitably involves the modification/parallelisation of algorithms to exploit parallel capabilities of the architectures.", fjournal = "Computing and Control Engineering Journal", keywords = "analysis/simulation; HW/SW platforms; image processing applications; industrial quality control; intelligent microscopy; PARALLEL ALGORITHMS; PARALLEL ARCHITECTURES; parallel architectures IMAGE PROCESSING; parallel aspects; RESEARCH INITIATIVES; VEGA project; VIRTUAL MACHINES", } @Manual{IBM:1994:CGN, author = "{IBM}", title = "Conversion guide and notebook for {VM\slash XA SP} and {VM\slash ESA}, release 2.2: virtual machine", organization = "International Business Machines Corporation", address = "1701 North St., Endicott 13760-5553 NY, USA", edition = "Fifth", pages = "1061", year = "1994", LCCN = "QA76.9.C68 C67 1994", bibdate = "Mon Apr 10 10:43:48 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.loc.gov:7090/Voyager", note = "Publication number SC24-5525-04.", acknowledgement = ack-nhfb, subject = "Computer system conversion; Virtual computer systems; Computer architecture", } @Article{Kelsey:1994:TSI, author = "Richard A. Kelsey and Jonathan A. Rees", title = "A Tractable {Scheme} Implementation", journal = j-LISP-SYMB-COMPUT, volume = "7", number = "4", pages = "315--335", month = "????", year = "1994", CODEN = "LSCOEX", ISSN = "0892-4635 (print), 1573-0557 (electronic)", ISSN-L = "0892-4635", bibdate = "Fri Feb 12 08:11:22 MST 1999", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, affiliation = "NEC Research Inst", classification = "721.1; 723.1; 723.1.1", fjournal = "Lisp and Symbolic Computation", journalabr = "LISP Symb Comput", keywords = "Byte code interpreters; Codes (symbols); Computational complexity; Computer programming; Layered design; lisp (programming language); Modularity; Partial evaluation; Program compilers; Program interpreters; Scheme programming language; Virtual machines; Virtual reality", } @Article{Lopez:1994:ICI, author = "Gus Lopez and Bjorn Freeman-Benson and Alan Borning", title = "Implementing Constraint Imperative Programming Languages: The {Kaleidoscope} '93 Virtual Machine", journal = j-SIGPLAN, volume = "29", number = "10", pages = "259--271", month = oct, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:55 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, classification = "C6110 (Systems analysis and programming); C6110J (Object-oriented programming); C6110L (Logic programming); C6140D (High level languages)", conflocation = "Portland, OR, USA; 23-27 Oct. 1994", conftitle = "Ninth Annual Conference on Object-Oriented Programming Systems, Languages, and Applications. OOPSLA '94", corpsource = "Dept. of Comput. Sci. and Eng., Washington Univ., Seattle, WA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", keywords = "CIP languages; constraint handling; constraint imperative programming; constraint imperative programming languages; constraint languages; constraint-based data store; declarative constraints; destructive assignment; high level languages; imperative machine; imperative programming; imperative state; incremental constraint solver; K-machine; Kaleidoscope'93 virtual machine; logic programming languages; object-oriented languages; pointers; programming; user-defined constraints; virtual machines", sponsororg = "ACM", treatment = "P Practical", } @InProceedings{Muntean:1994:PGM, author = "T. Muntean and A. Melo", title = "{PAROS}: a Generic Multi Virtual Machines Parallel Operating System", crossref = "Joubert:1994:PCT", pages = "319--328", year = "1994", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", } @Article{Schulman:1994:IWV, author = "Andrew Schulman", title = "Undocumented Corner: Introduction to {`The Windows 3.1 Virtual Machine Control Block Part 2' (K. Zytaruk)}", journal = j-DDJ, volume = "19", number = "2", pages = "107--??", month = feb, year = "1994", CODEN = "DDJOEB", ISSN = "1044-789X", bibdate = "Mon Sep 2 09:09:39 MDT 1996", bibsource = "http://www.ddj.com/index/author/index.htm; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; UnCover database", abstract = "In Part 2 of his article on the Windows 3.1 Virtual Machine Manager, Kelly Zytanuk presents his Windows VM Explorer application.", acknowledgement = ack-nhfb, fjournal = "Dr. Dobb's Journal of Software Tools", } @Article{Schulman:1994:UCI, author = "Andrew Schulman", title = "Undocumented Corner: Introduction to `{The Windows 3.1 Virtual Machine Control Block Part 1}' ({K. Zytaruk})", journal = j-DDJ, volume = "19", number = "1", pages = "115--??", month = jan, year = "1994", CODEN = "DDJOEB", ISSN = "1044-789X", bibdate = "Mon Sep 2 09:09:39 MDT 1996", bibsource = "http://www.ddj.com/index/author/index.htm; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; UnCover database", abstract = "Much of the preemptive multitasking for Microsoft's Chicago operating system already exists in the form of the Windows 3.1 Virtual Machine Manager. This month, Kelly Zytanuk examines the overall structure of the virtual-memory control block. Next month, he presents a Windows VM Explorer application.", acknowledgement = ack-nhfb, fjournal = "Dr. Dobb's Journal of Software Tools", } @Article{Stone:1994:PSO, author = "L. C. Stone and S. B. Shukla and B. Neta", title = "Parallel satellite orbit prediction using a workstation cluster", journal = j-COMPUT-MATH-APPL, volume = "28", number = "8", pages = "1--8", month = oct, year = "1994", CODEN = "CMAPDK", ISSN = "0898-1221 (print), 1873-7668 (electronic)", ISSN-L = "0898-1221", bibdate = "Wed Mar 1 19:11:24 MST 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/computmathappl1990.bib; https://www.math.utah.edu/pub/tex/bib/pvm.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/0898122194001650", acknowledgement = ack-nhfb, affiliation = "Naval Postgraduate Sch., Monterey, CA, USA", classification = "A9385 (Instrumentation and techniques for geophysical, hydrospheric and lower atmosphere research); A9575P (Mathematical and computer techniques); C5440 (Multiprocessor systems and techniques); C7350 (Astronomy and astrophysics)", fjournal = "Computers and Mathematics with Applications", journal-URL = "http://www.sciencedirect.com/science/journal/08981221", keywords = "Function decomposition techniques; Parallel computing; Parallel satellite orbit prediction; Parallel Virtual Machine; Performance metric; SUN workstations; Workstation cluster", pubcountry = "UK", thesaurus = "Artificial satellites; Astronomy computing; Parallel processing; Workstations", } @Article{Welch:1994:PVM, author = "L. R. Welch", title = "A Parallel Virtual Machine for Programs Composed of Abstract Data Types", journal = j-IEEE-TRANS-COMPUT, volume = "43", number = "11", pages = "1249--1261", month = nov, year = "1994", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/12.324558", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Thu Jul 7 07:13:58 MDT 2011", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput1990.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=324558", acknowledgement = ack-nhfb, classification = "C6110J (Object-oriented programming); C6110P (Parallel programming); C6120 (File organisation); C6150N (Distributed systems)", corpsource = "Dept. of Comput. and Inf. Sci., New Jersey Inst. of Technol., Newark, NJ, USA", fjournal = "IEEE Transactions on Computers", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", keywords = "abstract data types; ADTs; ARC; Asynchronous Remote Procedure Call; automatic parameter restoration; data structures; data synchronization; database management; dynamic load balancing; languages; machines; modularity; multiprocessing programs; parallel programming; parallel virtual machine; programming; remote procedure calls; reuse; software reusability; system development; systems; virtual", treatment = "P Practical", } @Article{Zytaruk:1994:WVMa, author = "Kelly Zytaruk", title = "The {Windows} 3.1 Virtual Machine Control Block. {Part} 1", journal = j-DDJ, volume = "19", number = "1", pages = "115--??", month = jan, year = "1994", CODEN = "DDJOEB", ISSN = "1044-789X", bibdate = "Mon Sep 2 09:09:39 MDT 1996", bibsource = "http://www.ddj.com/index/author/index.htm; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Dr. Dobb's Journal of Software Tools", } @Article{Zytaruk:1994:WVMb, author = "Kelly Zytaruk", title = "The {Windows} 3.1 Virtual Machine Control Block. {Part} 2", journal = j-DDJ, volume = "19", number = "2", pages = "107--??", month = feb, year = "1994", CODEN = "DDJOEB", ISSN = "1044-789X", bibdate = "Mon Sep 2 09:09:39 MDT 1996", bibsource = "http://www.ddj.com/index/author/index.htm; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Dr. Dobb's Journal of Software Tools", } @Article{Ambriola:1995:DVM, author = "Vincenzo Ambriola and Giovanni A. Cignoni", title = "A distributed virtual machine to support software process", journal = j-SIGSOFT, volume = "20", number = "1", pages = "85--89", month = jan, year = "1995", CODEN = "SFENDP", DOI = "https://doi.org/10.1145/225907.225919", ISSN = "0163-5948 (print), 1943-5843 (electronic)", ISSN-L = "0163-5948", bibdate = "Wed Aug 1 17:12:57 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsoft1990.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "The availability of new technologies increases, at least potentially, the chance to support cooperative work exploiting the many resources offered by computer networks. This opportunity is impaired by the lack of tools able to manage the large variety of network resources at an adequate level of abstraction. This lack is particularly felt in the implementation of software process support environments. In this paper we describe how, in Oikos, we realized the distributed run-time support to process enactment. On the basis of this experience, we claim the need of a homogeneous framework that overcomes this limitation. We propose oiXos, a virtual machine that abstracts a network of Unix workstations, disk servers, and X Window terminals. We introduce the notions of component, item, and gibject. Upon these notions we build the abstraction level given by the oiXos virtual machine. We discuss the oiXos architecture that relies on a collection of system components that manage the objects of the oiXos machine.", acknowledgement = ack-nhfb, fjournal = "ACM SIGSOFT Software Engineering Notes", journal-URL = "https://dl.acm.org/citation.cfm?id=J728", } @Article{Bunge:1995:MCM, author = "Hans-Peter Bunge and John R. Baumgardner", title = "Mantle convection modeling on parallel virtual machines", journal = j-COMPUT-PHYS, volume = "9", number = "2", pages = "207--??", month = mar, year = "1995", CODEN = "CPHYE2", DOI = "https://doi.org/10.1063/1.168525", ISSN = "0894-1866 (print), 1558-4208 (electronic)", ISSN-L = "0894-1866", bibdate = "Wed Apr 10 08:45:53 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/computphys.bib; https://www.math.utah.edu/pub/tex/bib/pvm.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://aip.scitation.org/doi/10.1063/1.168525", acknowledgement = ack-nhfb, ajournal = "Comput. Phys", fjournal = "Computers in Physics", journal-URL = "https://aip.scitation.org/journal/cip", } @Article{Hollerbach:1995:FDA, author = "Rainer Hollerbach", title = "Fast dynamo action in spherical geometry: Numerical calculations using parallel virtual machines", journal = j-COMPUT-PHYS, volume = "9", number = "4", pages = "460--??", month = jul, year = "1995", CODEN = "CPHYE2", DOI = "https://doi.org/10.1063/1.168547", ISSN = "0894-1866 (print), 1558-4208 (electronic)", ISSN-L = "0894-1866", bibdate = "Wed Apr 10 08:45:55 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/computphys.bib; https://www.math.utah.edu/pub/tex/bib/pvm.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://aip.scitation.org/doi/10.1063/1.168547", acknowledgement = ack-nhfb, ajournal = "Comput. Phys", fjournal = "Computers in Physics", journal-URL = "https://aip.scitation.org/journal/cip", } @Manual{Sun:1995:JVMa, title = "The {Java} Virtual Machine Specification", organization = "Sun Microsystems", edition = "1.0 Beta", month = aug, year = "1995", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://java.sun.com/doc/vmspec/VMSpec.ps", added-by = "sti", annote = "a virtual machine similar to UCSD p-code or smalltalk. stack-machine. dynamic loading. direct support for object orientation (e.g. virtual method calls)", keywords = "java, virtual machine, bytecode", } @Manual{Sun:1995:JVMb, author = "{Sun Microsystems}", key = "JVMPI", title = "{Java Virtual Machine Profiling Interface (JVMPI)}", organization = "Sun Microsystems", year = "1995", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "http://java.sun.com/j2se/1.3/docs/guide/jvmpi/", URL = "http://java.sun.com/j2se/1.3/docs/guide/jvmpi/", comment = "Profiling interface for {J}ava", } @Article{Anonymous:1996:TWJb, author = "Anonymous", title = "Towards {Web}\slash {Java}-based high performance distributed computing --- an evolving virtual machine", journal = j-IEEE-INT-SYMP-HIGH-PERF-DIST-COMP-PROC, pages = "308--317", year = "1996", CODEN = "PIDCFB", ISSN = "1082-8907", bibdate = "Thu Dec 12 06:31:53 MST 1996", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/java.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "IEEE catalog number 96TB100069.", acknowledgement = ack-nhfb, affiliation = "Syracuse Univ", affiliationaddress = "NY, USA", classification = "722.1; 722.4; 723.1; 723.5; 921.6", conference = "Proceedings of the 1996 5th IEEE International Symposium on High Performance Distributed Computing", fjournal = "IEEE International Symposium on High Performance Distributed Computing, Proceedings", keywords = "Computer programming; Computer vision; Distributed computer systems; Information technology; Internet; Mathematical models; Performance; Software prototyping; Virtual storage; World wide virtual machine", meetingaddress = "Syracuse, NY, USA", meetingdate = "Aug 6--9 1996", meetingdate2 = "08/06--09/96", sponsor = "IEEE", } @Article{Burnet:1996:PCP, author = "Maxwell M. Burnet and Robert M. Supnik", title = "Preserving computing's past: restoration and simulation", journal = j-DEC-TECH-J, volume = "8", number = "3", pages = "23--38", month = dec, year = "1996", CODEN = "DTJOEL", ISSN = "0898-901X", bibdate = "Sat Jul 16 18:53:33 2005", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "ftp://ftp.digital.com/pub/Digital/info/DTJ/v8n3/Preserving_Computings_Past_R_07jan1997DTJN02P8.ps; http://artematrix.org/archive/computer/restoration.simulation.htm; http://simh.trailing-edge.com/docs/dtjn02pf.pdf; http://www.digital.com:80/info/DTJN02/DTJN02AH.HTM; http://www.digital.com:80/info/DTJN02/DTJN02HM.HTM; http://www.digital.com:80/info/DTJN02/DTJN02P8.PS; http://www.digital.com:80/info/DTJN02/DTJN02PF.PDF; http://www.digital.com:80/info/DTJN02/DTJN02SC.TXT", abstract = "Restoration and simulation are two techniques for preserving computing systems of historical interest. In computer restoration, historical systems are returned to working condition through repair of broken electrical and mechanical subsystems, if necessary substituting current parts for the original ones. In computer simulation, historical systems are re-created as software programs on current computer systems. In each case, the operating environment of the original system is presented to a modern user for inspection or analysis. This differs with computer conservation, which preserves historical systems in their current state, usually one of disrepair. The authors argue that an understanding of computing's past is vital to understanding its future, and thus that restoration, rather than just conservation, of historic systems is an important activity for computer technologists.", acknowledgement = ack-nhfb, classcodes = "C0200 (General computer topics); C7430 (Computer engineering)", fjournal = "Digital Technical Journal", keywords = "computer restoration; computer simulation; computing's past; digital computers; historical interest; history; machines; maintenance engineering; SIMH (virtual machine); virtual; working condition", treatment = "P Practical", } @Misc{Campbell-Kelly:1996:ES, author = "Martin Campbell-Kelly", title = "The {EDSAC} Simulator", howpublished = "Web site", year = "1996", bibdate = "Sat Nov 17 07:57:27 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "Downloadable simulator software available for Microsoft Windows and GNU/Linux x86.", URL = "http://www.dcs.warwick.ac.uk/~edsac/", acknowledgement = ack-nhfb, } @InProceedings{Dincer:1996:BWW, author = "Kivanc Dincer and Geoffrey C. Fox", title = "Building a World-Wide Virtual Machine Based on {Web} and {HPCC} Technologies", crossref = "ACM:1996:SCP", pages = "??--??", year = "1996", bibdate = "Mon Mar 23 12:31:18 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.supercomp.org/sc96/proceedings/SC96PROC/DINCER/INDEX.HTM", acknowledgement = ack-nhfb, } @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/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Operating Systems Review", } @InProceedings{Fox:1996:TWJ, author = "G. Fox and W. Furmanski", title = "Towards {Web\slash Java}-based high performance distributed computing --- an evolving virtual machine", crossref = "IEEE:1996:PFIa", pages = "??--??", year = "1996", bibdate = "Sat Mar 15 08:49:09 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/java.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, classcodes = "C7430 (Computer engineering); C6150N (Distributed systems software)", conflocation = "Syracuse, NY, USA; 6--9 Aug. 1996", conftitle = "Proceedings of 5th IEEE International Symposium on High Performance Distributed Computing", corpsource = "Northeast Parallel Archit. Center, Syracuse Univ., NY, USA", keywords = "3D; authoring languages; Bridge-based Collaboratory; CareWeb; distributed interpretative virtual machine architecture; distributed processing; evolutionary path; Information Infrastructure; Internet; Java-based high-performance distributed computing; National; Northeast; object-oriented languages; Parallel Architectures Center; virtual machines; Visible Human; Web technology prototypes; WebFlow; WebVM; World Wide Web-based distributed environments", sponsororg = "IEEE Comput. Soc. Tech. Committee on Distributed Process.; Northeast Parallel Architectures Center; New York State Center for Adv. Technol. Comput. Applications and Software Eng. (CASE Center) at Syracuse Univ.; Rome Lab", treatment = "A Application; G General Review", } @Manual{IBM:1996:CAM, author = "{IBM}", title = "{CMS} application multitasking, version 2, release 2.0: virtual machine", organization = "International Business Machines Corporation", address = "1701 North St., Enicott 13760-5553, NY, USA", edition = "Second", pages = "xiv + 380", year = "1996", LCCN = "QA76.58 .C59 1996", bibdate = "Mon Apr 10 10:43:48 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.loc.gov:7090/Voyager", note = "Publication number SC24-5766-01.", acknowledgement = ack-nhfb, subject = "Parallel processing (Electronic computers); Multitasking (Computer science); CMS (Computer file)", } @Article{Tamm:1996:LBV, author = "Boris Tamm and Kuldar Taveter", title = "A List-based Virtual Machine for {COBOL}", journal = j-SPE, volume = "26", number = "12", pages = "1347--1371", month = dec, year = "1996", CODEN = "SPEXBL", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Thu Jul 29 15:11:09 MDT 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www3.interscience.wiley.com/journalfinder.html", URL = "http://www3.interscience.wiley.com/cgi-bin/abstract?ID=16778", acknowledgement = ack-nhfb, fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", } @InProceedings{Tremblay:1996:PHI, author = "Marc Tremblay and Michael O'Connor", title = "{PicoJava}: a hardware Implementation of the {Java Virtual Machine}", crossref = "IEEE:1996:HCV", pages = "131--144", year = "1996", bibdate = "Sat Jan 6 19:21:13 MST 2001", bibsource = "ftp://www.hotchips.org/pub/hotc7to11cd/hc96/hc8_pdf/4.3.pdf; https://www.math.utah.edu/pub/tex/bib/java.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; OCLC Proceedings database", acknowledgement = ack-nhfb, } @Article{Venners:1996:UHL, author = "Bill Venners", title = "Under the Hood: The lean, mean, virtual machine", journal = j-JAVAWORLD, volume = "1", number = "4", pages = "??--??", month = jun, year = "1996", CODEN = "????", ISSN = "1091-8906", bibdate = "Thu Aug 13 08:48:26 MDT 1998", bibsource = "http://www.javaworld.com/javaworld/; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.javaworld.com/javaworld/jw-06-1996/jw-06-vm.htm", acknowledgement = ack-nhfb, } @Article{Waddington:1996:JVM, author = "Simon Waddington and Stephen Li", title = "{Java}: Virtual Machine for Virtually Any Platform", journal = j-EMBED-SYS-PROG, volume = "9", number = "6", pages = "26--28, 30, 32, 34, 36, 38, 40, 42", day = "1", month = jun, year = "1996", CODEN = "EYPRE4", ISSN = "1040-3272", bibdate = "Sat Mar 15 08:49:09 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/java.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; UnCover library database", abstract = "There's no doubt about it, Java has become a hot topic in recent months. But should embedded developers care? This overview describes Java's applicability in embedded systems.", acknowledgement = ack-nhfb, classcodes = "C6140D (High level languages); C6110J (Object-oriented programming); C6150N (Distributed systems software); C7210 (Information services and centres)", corpsource = "Wind River Syst. Inc., USA", fjournal = "Embedded Systems Programming", keywords = "embedded systems; interactive environment; Internet; Java; language; object oriented; object-oriented; object-oriented languages; portable; programming; real-time systems; system security; virtual machine; virtual machines; Web pages; World Wide Web", treatment = "P Practical", } @Article{Anonymous:1997:BFJ, author = "Anonymous", title = "Bug found in {Java Virtual Machine}", journal = j-NETWORK-SECURITY, volume = "1997", number = "3", pages = "2--2", month = mar, year = "1997", CODEN = "NTSCF5", DOI = "https://doi.org/10.1016/S1353-4858(97)83033-4", ISSN = "1353-4858 (print), 1872-9371 (electronic)", ISSN-L = "1353-4858", bibdate = "Mon Dec 4 16:57:04 MST 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/java.bib; https://www.math.utah.edu/pub/tex/bib/network-security.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1353485897830334", acknowledgement = ack-nhfb, fjournal = "Network Security", journal-URL = "https://www.sciencedirect.com/journal/network-security", } @Article{Anonymous:1997:BRJe, author = "Anonymous", title = "Book Review: {{\booktitle{Java Virtual Machine}}: By Jon Meyer and Troy Downing. O'Reilly, Sebastopol, CA. (1997). 426 pages. \$32.95 (diskette included)}", journal = j-COMPUT-MATH-APPL, volume = "34", number = "10", pages = "135--135", month = nov, year = "1997", CODEN = "CMAPDK", ISSN = "0898-1221 (print), 1873-7668 (electronic)", ISSN-L = "0898-1221", bibdate = "Wed Mar 1 21:48:40 MST 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/computmathappl1990.bib; https://www.math.utah.edu/pub/tex/bib/java.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0898122197901899", acknowledgement = ack-nhfb, fjournal = "Computers and Mathematics with Applications", journal-URL = "http://www.sciencedirect.com/science/journal/08981221", } @Article{Anonymous:1997:IJV, author = "Anonymous", title = "Inside the {Java Virtual Machine}", journal = j-UNIX-REVIEW, volume = "15", number = "1", pages = "31, 32, 34--36, 38--39", month = jan, year = "1997", CODEN = "UNRED5", ISSN = "0742-3136", bibdate = "Tue Dec 03 11:25:02 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/java.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "Adapted, with permission, from \cite{Lindholm:1997:JVM}.", acknowledgement = ack-nhfb, fjournal = "UNIX review", } @Book{Anonymous:1997:JVM, author = "Anonymous", title = "{Java Virtual Machine} unleashed", publisher = pub-SAMS, address = pub-SAMS:adr, pages = "????", year = "1997", ISBN = "1-57521-247-1 (paperback)", ISBN-13 = "978-1-57521-247-0 (paperback)", LCCN = "9710 BOOK NOT YET IN LC", bibdate = "Mon Apr 10 10:43:48 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.loc.gov:7090/Voyager", acknowledgement = ack-nhfb, } @MastersThesis{Cladingboel:1997:RJV, author = "Christopher Cladingboel", title = "Real {Java Virtual Machines}: Hardware Compilation and the {Java Virtual Machine}", type = "Thesis ({M.Sc.})", school = "Board of the Faculty of Mathematical Sciences, Oxford University", address = "Oxford, UK", pages = "107", year = "1997", bibdate = "Mon Apr 10 11:07:23 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, } @TechReport{Cohen:1997:DJV, author = "R. Cohen", title = "The Defensive {Java Virtual Machine} Specification", type = "Technical Report", institution = "Computational Logic Inc.", address = "Austin, TX, USA", year = "1997", bibdate = "Thu Dec 01 07:17:25 2011", bibsource = "https://www.math.utah.edu/pub/tex/bib/java.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, } @InProceedings{Comar:1997:TGJ, author = "C. Comar and G. Dismukes and F. Gasperoni", title = "Targeting {GNAT} to the {Java Virtual Machine}", crossref = "ACM:1997:PTA", pages = "149--164", year = "1997", bibdate = "Tue Apr 20 13:43:51 MDT 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/gnu.bib; https://www.math.utah.edu/pub/tex/bib/java.bib; https://www.math.utah.edu/pub/tex/bib/sigada.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, } @Book{Dallmeier:1997:JVM, author = "Matthias K. Dallmeier", title = "{Java Virtual Machine, Sprache, Konzept, Architektur}", publisher = pub-ORA, address = pub-ORA:adr, pages = "209", year = "1997", ISBN = "3-930673-73-8", ISBN-13 = "978-3-930673-73-5", LCCN = "????", bibdate = "Mon Mar 02 19:18:51 1998", bibsource = "http://lightyear.ncsa.uiuc.edu/~srp/java/german.html; https://www.math.utah.edu/pub/tex/bib/java.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "Includes CD-ROM.", price = "25 DM", URL = "http://www.ora.de/", acknowledgement = ack-nhfb, language = "German", } @Article{Hines:1997:VMJ, author = "J. R. Hines", title = "Virtual machines jockey for position", journal = j-IEEE-SPECTRUM, volume = "34", number = "7", pages = "16--16", month = jul, year = "1997", CODEN = "IEESAM", DOI = "https://doi.org/10.1109/MSPEC.1997.609806", ISSN = "0018-9235 (print), 1939-9340 (electronic)", ISSN-L = "0018-9235", bibdate = "Thu Jan 16 07:37:23 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeespectrum1990.bib; https://www.math.utah.edu/pub/tex/bib/java.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Spectrum", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6", keywords = "Books; Costs; Design optimization; Java; Microprocessors; Programming profession; Sun; Virtual manufacturing; Visual BASIC; Web sites", } @Article{Kalin:1997:NMP, author = "Sari Kalin", title = "News: {Microsoft} plans {Java} virtual machine for {Unix}, {WinCE} by 1998", journal = j-JAVAWORLD, volume = "2", number = "5", pages = "??--??", month = may, year = "1997", CODEN = "????", ISSN = "1091-8906", bibdate = "Thu Aug 13 14:52:26 1998", bibsource = "http://www.javaworld.com/javaworld/; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.javaworld.com/javaworld/jw-05-1997/jw-05-infoworld.microsoftvm.htm", acknowledgement = ack-nhfb, } @Article{Lindholm:1997:IJV, author = "Tim Lindholm and Frank Yellin", title = "Inside the {Java Virtual Machine}", journal = j-UNIX-REVIEW, volume = "15", number = "1", pages = "31, 32, 34--36, 38, 39", month = jan, year = "1997", CODEN = "UNRED5", ISSN = "0742-3136", bibdate = "Sat Mar 15 08:49:09 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/java.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, classcodes = "C7430 (Computer engineering); C6110J (Object-oriented programming); C6140D (High level languages); C6140B (Machine-oriented languages); C6150C (Compilers, interpreters and other processors); C6120 (File organisation)", fjournal = "UNIX review", keywords = "abstract data types; bytecode files; instruction sets; interpreter; interpreters; Java bytecodes; Java programs; Java Virtual Machine; JVM; languages; object oriented language; object-oriented; object-oriented programming; program; program execution; run time module; verifier; virtual machines", treatment = "P Practical", } @Book{Lindholm:1997:JVM, author = "Tim Lindholm and Frank Yellin", title = "The {Java} Virtual Machine Specification", publisher = pub-AW, address = pub-AW:adr, pages = "xvi + 475", year = "1997", ISBN = "0-201-63452-X", ISBN-13 = "978-0-201-63452-5", LCCN = "QA76.73.J38L56 1997", bibdate = "Tue Mar 04 15:04:45 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", price = "US\$36.53", series = "The Java Series", URL = "http://www.aw.com/cp/javaseries.html", acknowledgement = ack-nhfb, keywords = "Internet (Computer network); Java (Computer program language); Java (computer program language); programming languages (electronic computers); systems; virtual computer; Virtual computer systems", lccnalt = "96-015897", tableofcontents = "1. Introduction\\ 2. Java Concepts\\ 3. Structure of the Java Virtual Machine\\ 4. The class File Format\\ 5. Constant Pool Resolution\\ 6. Java Virtual Machine Instruction Set\\ 7. Compiling for the Java Virtual Machine\\ 8. Threads and Locks\\ 9. An Optimization \\ 10. Opcode Mnemonics by Opcode", } @Manual{Lucent:1997:LPL, title = "The {Limbo} Programming Language", organization = "Lucent Technologies Inc", year = "1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://inferno.lucent.com/inferno/", abstract = "Limbo is a programming language intended for applications running distributed systems on small computers. It supports modular programming, strong type checking at compile- and run-time, interprocess communication over typed channels, automatic garbage collection, and simple abstract data types. It is designed for safe execution even on small machines without hardware memory protection. In its initial implementation for the Inferno operating system, object programs generated by the Limbo compiler run using an interpreter for a fixed virtual machine. Inferno and its accompanying virtual machine run either stand-alone on bare hardware or as an application under conventional operating systems like Unix, Windows 95, Windows NT, and Plan 9. For several architectures, including Intel x86 and MIPS, Limbo object programs are transformed on-the-fly into instructions for the underlying hardware.", } @Book{Meyer:1997:JVM, author = "Jon Meyer and Troy Downing", title = "{Java} Virtual Machine", publisher = pub-ORA, address = pub-ORA:adr, pages = "xxiv + 426", month = feb, year = "1997", ISBN = "1-56592-194-1", ISBN-13 = "978-1-56592-194-8", LCCN = "QA76.73.J38 M49 1997", bibdate = "Mon Apr 18 14:52:22 MDT 2005", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.loc.gov:7090/Voyager", price = "US\$32.95", series = "The Java series", URL = "http://www.ora.com/www/item/javavm.html; http://www.oreilly.com/catalog/javavm", acknowledgement = ack-nhfb, keywords = "computer systems; Java (computer program language); technology -- computers and computer technology; virtual", subject = "Java (Computer program language); Java virtual machine", } @Article{Montague:1997:JEJ, author = "Bruce R. Montague", title = "{JN}: {OS} for an Embedded {Java Network Computer} --- Supporting {Java}'s {Virtual Machine} on a single-chip embedded {PC} attached to the {Internet}", journal = j-IEEE-MICRO, volume = "17", number = "3", pages = "54--60", month = may # "\slash " # jun, year = "1997", CODEN = "IEMIDZ", DOI = "https://doi.org/10.1109/40.591656", ISSN = "0272-1732 (print), 1937-4143 (electronic)", ISSN-L = "0272-1732", bibdate = "Thu Dec 14 06:08:58 MST 2000", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeemicro.bib; https://www.math.utah.edu/pub/tex/bib/java.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; Science Citation Index database (1980--2000)", URL = "http://pascal.computer.org/mi/books/mi1997/pdf/m3054.pdf", acknowledgement = ack-nhfb, fjournal = "IEEE Micro", journal-URL = "http://www.computer.org/csdl/mags/mi/index.html", } @Article{OConnor:1997:PJV, author = "J. Michael O'Connor and Marc Tremblay", title = "{Picojava-I} --- The {Java Virtual Machine} in Hardware", journal = j-IEEE-MICRO, volume = "17", number = "2", pages = "45--53", month = mar # "\slash " # apr, year = "1997", CODEN = "IEMIDZ", DOI = "https://doi.org/10.1109/40.592314", ISSN = "0272-1732 (print), 1937-4143 (electronic)", ISSN-L = "0272-1732", bibdate = "Thu Dec 14 06:08:58 MST 2000", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeemicro.bib; https://www.math.utah.edu/pub/tex/bib/java.bib; https://www.math.utah.edu/pub/tex/bib/microchip.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; Science Citation Index database (1980--2000)", acknowledgement = ack-nhfb, classification = "C5220 (Computer architecture); C6150C (Compilers, interpreters and other processors); C7430 (Computer engineering)", corpsource = "Sun Microsyst., Mountain View, CA, USA", fjournal = "IEEE Micro", journal-URL = "http://www.computer.org/csdl/mags/mi/index.html", keywords = "byte codes; computer architecture; dynamic distribution; Java virtual machine; microarchitecture; microarchitecture trade-offs; performance; picoJava-I; program compilers; virtual machines", treatment = "P Practical", } @Article{Smith:1997:JNV, author = "Gregory S. Smith", title = "{Java}'s new virtual machine", journal = j-JAVAWORLD, volume = "2", number = "5", pages = "??--??", month = may, year = "1997", CODEN = "????", ISSN = "1091-8906", bibdate = "Thu Aug 13 14:52:26 1998", bibsource = "http://www.javaworld.com/javaworld/; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.javaworld.com/javaworld/jw-05-1997/jw-05-jo-vm.htm", acknowledgement = ack-nhfb, } @Article{Stankovic:1997:VRR, author = "John A. Stankovic", title = "Virtual Roundtable: Real-Time Global Virtual Machines", journal = j-IEEE-CONCURR, volume = "5", number = "3", pages = "26--27", month = jul # "\slash " # sep, year = "1997", CODEN = "IECMFX", ISSN = "1092-3063 (print), 1558-0849 (electronic)", ISSN-L = "1092-3063", bibdate = "Mon Jun 7 07:52:29 MDT 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeeconcurrency.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://dlib.computer.org/pd/books/pd1997/pdf/p3026.pdf", acknowledgement = ack-nhfb, fjournal = "IEEE Concurrency", } @Manual{Sun:1997:JCL, title = "{Java Card 2.0} Language Subset and Virtual Machine Specification", organization = "{SUN} Microsystems, Inc.", address = "Palo Alto/CA", edition = "Revision 1.0 Final", day = "13", month = oct, year = "1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "ftp://ftp.javasoft.com/docs/javacard/JC20-Language.pdf", added-at = "Mon Oct 12 17:29:42 1998", added-by = "gka", } @Book{Venners:1997:IJV, author = "Bill Venners", title = "Inside the {Java} Virtual Machine", publisher = pub-MCGRAW-HILL, address = pub-MCGRAW-HILL:adr, pages = "384", month = nov, year = "1997", ISBN = "0-07-913248-0", ISBN-13 = "978-0-07-913248-2", LCCN = "QA76.73.J38 V46 1998", bibdate = "Wed Jun 17 22:05:06 MDT 1998", bibsource = "http://www.javaworld.com/javaworld/books/jw-books-alphabytitle.html; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www.mcgraw-hill.com/", price = "US\$39.95", URL = "http://mcgraw-hill.inforonics.com/cgi/getarec?mgh31406%comp", acknowledgement = ack-nhfb, } @Article{Venners:1997:UHHa, author = "Bill Venners", title = "Under the Hood: How the {Java} virtual machine handles exceptions", journal = j-JAVAWORLD, volume = "2", number = "1", pages = "??--??", month = jan, year = "1997", CODEN = "????", ISSN = "1091-8906", bibdate = "Thu Aug 13 10:32:58 1998", bibsource = "http://www.javaworld.com/javaworld/; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.javaworld.com/javaworld/jw-01-1997/jw-01-hood.htm", acknowledgement = ack-nhfb, } @Article{Venners:1997:UHHb, author = "Bill Venners", title = "Under the Hood: How the {Java} virtual machine handles method invocation and return", journal = j-JAVAWORLD, volume = "2", number = "6", pages = "??--??", month = jun, year = "1997", CODEN = "????", ISSN = "1091-8906", bibdate = "Thu Aug 13 14:52:27 1998", bibsource = "http://www.javaworld.com/javaworld/; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.javaworld.com/javaworld/jw-06-1997/jw-06-hood.htm", acknowledgement = ack-nhfb, } @Article{Venners:1997:UHHc, author = "Bill Venners", title = "Under the Hood: How the {Java} virtual machine performs thread synchronization", journal = j-JAVAWORLD, volume = "2", number = "7", pages = "??--??", month = jul, year = "1997", CODEN = "????", ISSN = "1091-8906", bibdate = "Thu Aug 13 14:52:27 1998", bibsource = "http://www.javaworld.com/javaworld/; https://www.math.utah.edu/pub/tex/bib/java.bib; https://www.math.utah.edu/pub/tex/bib/multithreading.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.javaworld.com/javaworld/jw-07-1997/jw-07-hood.htm", acknowledgement = ack-nhfb, } @Article{Villadeamigo:1997:EES, author = "Jos{\'e} M. P{\'e}rez Villadeamigo and Santiago Rodr{\'\i}guez de la Fuente and Rafael M{\'e}ndez Cavanillas and M. Isabel Garc{\'\i}a Clemente", title = "The em88110: emulating a superscalar processor", journal = j-SIGCSE, volume = "29", number = "4", pages = "45--50", month = dec, year = "1997", CODEN = "SIGSD3", DOI = "https://doi.org/10.1145/271125.271153", ISSN = "0097-8418 (print), 2331-3927 (electronic)", ISSN-L = "0097-8418", bibdate = "Sat Nov 17 18:57:42 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigcse1990.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Assembly programming is a very important topic to teach computer architecture. Current computers include special techniques to improve performance such as pipeline and multiple instruction issue per cycle. But these kinds of computers are difficult to use in laboratory works because of the great amount of details of the target computer architecture that are not relevant to beginners. Hence, we decided to build a configurable emulator of a superscalar processor to create a wide set of laboratory works, from the simplest one that uses the computer as a serial processor to the most complex that uses the full set of performance improvements of a superscalar computer. Most of the computer parameters can be established by the student or the teacher providing a virtual machine that is easier to use. Students can do their laboratory work without taking into account the additional problems generated by a real computer.", acknowledgement = ack-nhfb, fjournal = "SIGCSE Bulletin (ACM Special Interest Group on Computer Science Education)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J688", } @InProceedings{Winterbottom:1997:DIV, author = "Phil Winterbottom and Rob Pike", title = "The Design of the {Inferno} Virtual Machine", crossref = "IEEE:1997:HCI", pages = "??--??", year = "1997", bibdate = "Mon Jan 08 16:33:30 2001", bibsource = "ftp://www.hotchips.org/pub/hotc7to11cd/hc97/pdf_images/hc97_4a_winterbottom_2up.txt; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, } @Article{Wong:1997:MHJ, author = "Wylie Wong", title = "{Microsoft} hones {Java} strategy: Virtual machine, class libraries are on top", journal = j-COMPUTERWORLD, volume = "31", number = "14", pages = "113--113", day = "7", month = apr, year = "1997", CODEN = "CMPWAB", ISSN = "0010-4841", bibdate = "Tue Apr 22 07:48:54 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/java.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "ComputerWorld", } @Article{Agesen:1998:GCL, author = "Ole Agesen and David Detlefs and J. Eliot B. Moss", title = "Garbage Collection and Local Variable Type-Precision and Liveness in {Java Virtual Machines}", journal = j-SIGPLAN, volume = "33", number = "5", pages = "269--279", month = may, year = "1998", CODEN = "SINODQ", ISBN = "0-89791-987-4", ISBN-13 = "978-0-89791-987-6", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:47 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/277650/index.html; http://www.cs.virginia.edu/pldi98/program.html; https://www.math.utah.edu/pub/tex/bib/java.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/277650/p269-agesen/; http://www.cs.virginia.edu/pldi98/program.html", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'98.", fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", keywords = "experimentation; measurement; performance; verification", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Memory management (garbage collection). {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Java. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Type structure.", } @Article{Armstrong:1998:CSH, author = "Eric Armstrong", title = "Cover Story: {HotSpot}: a new breed of virtual machine", journal = j-JAVAWORLD, volume = "3", number = "3", pages = "??--??", month = mar, year = "1998", CODEN = "????", ISSN = "1091-8906", bibdate = "Thu Aug 13 10:33:03 1998", bibsource = "http://www.javaworld.com/javaworld/; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.javaworld.com/javaworld/jw-03-1998/jw-03-hotspot.htm", acknowledgement = ack-nhfb, } @Article{AzanonEsteire:1998:JST, author = "Oscar {Aza{\~n}{\'o}n Esteire} and Juan Manual {Cueva Lovelle}", title = "{J} --- Set of Tools for Native Code Generation for the {Java Virtual Machine}", journal = j-SIGPLAN, volume = "33", number = "3", pages = "73--79", month = mar, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Apr 30 08:30:23 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/java.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @Article{Bak:1998:NCJ, author = "Lars Bak and John Duimovich and Jesse Fang and Scott Meyer and David Ungar", title = "The new crop of {Java} virtual machines (panel)", journal = j-SIGPLAN, volume = "33", number = "10", pages = "179--182", month = oct, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:52 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/java.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @Article{Brier:1998:NIA, author = "Steven E. Brier", title = "News: {IBM} augments {OS/2} with new {Java} virtual machine", journal = j-JAVAWORLD, volume = "3", number = "3", pages = "??--??", month = mar, year = "1998", CODEN = "????", ISSN = "1091-8906", bibdate = "Thu Aug 13 10:33:04 1998", bibsource = "http://www.javaworld.com/javaworld/; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.javaworld.com/javaworld/jw-03-1998/jw-03-infoworld.ibm.htm", acknowledgement = ack-nhfb, } @Article{Crawford:1998:BSJ, author = "Ronald {Crawford, II}", title = "Behind the Scenes of the {Java 1.1 Virtual Machine}", journal = j-JAVA-REPORT, volume = "3", number = "??", pages = "??--??", month = nov, year = "1998", CODEN = "JREPFI", ISSN = "1086-4660", bibdate = "Sat Dec 26 13:52:53 1998", bibsource = "http://archive.javareport.com/9811/html/from_pages/index.shtml; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://archive.javareport.com/9811/html/from_pages/ftp_feature.shtml", abstract = "Ronald explores the mechanism responsible for allowing the Java technology to run compiled Java code on any operating system, network computer, or hardware device that supports Java.", acknowledgement = ack-nhfb, } @Article{Esteire:1998:STN, author = "Oscar Aza{\~n}{\'o}n Esteire and Juan Manuel Cueva Lovelle", title = "Set of tools for native code generation for the {Java} virtual machines", journal = j-SIGPLAN, volume = "33", number = "3", pages = "73--79", month = mar, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:45 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/java.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @Article{Fong:1998:PLA, author = "Philip W. L. Fong and Robert D. Cameron", title = "Proof linking: an architecture for modular verification of dynamically-linked mobile code", journal = j-SIGSOFT, volume = "23", number = "6", pages = "222--230", month = nov, year = "1998", CODEN = "SFENDP", DOI = "https://doi.org/10.1145/291252.288317", ISSN = "0163-5948 (print), 1943-5843 (electronic)", ISSN-L = "0163-5948", bibdate = "Wed Aug 1 17:13:40 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsoft1990.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Security flaws are routinely discovered in commercial implementations of mobile code systems such as the Java Virtual Machine (JVM). Typical architectures for such systems exhibit complex interdependencies between the loader, the verifier, and the linker, making them difficult to craft, validate, and maintain. This reveals a software engineering challenge that is common to all mobile code systems in which a static verification phase is introduced before dynamic linking. In such systems, one has to articulate how loading, verification, and linking interact with each other, and how the three processes should be organized to address various security issues. We propose a standard architecture for crafting mobile code verifiers, based on the concept of proof linking. This architecture modularizes the verification process and isolates the dependencies among the loader, verifier, and linker. We also formalize the process of proof linking and establish properties to which correct implementations must conform. As an example, we instantiate our architecture for the problem of Java bytecode verification and assess the correctness of this instantiation. Finally, we briefly discuss alternative mobile code verification architectures enabled by our modularization.", acknowledgement = ack-nhfb, fjournal = "ACM SIGSOFT Software Engineering Notes", journal-URL = "https://dl.acm.org/citation.cfm?id=J728", } @Article{Franz:1998:JVM, author = "Michael Franz", title = "The {Java Virtual Machine}: a Passing Fad?", journal = j-IEEE-SOFTWARE, volume = "15", number = "6", pages = "26--29", month = nov # "\slash " # dec, year = "1998", CODEN = "IESOEG", DOI = "https://doi.org/10.1109/52.730834", ISSN = "0740-7459 (print), 0740-7459 (electronic)", ISSN-L = "0740-7459", bibdate = "Mon Jan 4 07:38:57 MST 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeesoft.bib; https://www.math.utah.edu/pub/tex/bib/java.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://computer.org/software/so1998/s6026abs.htm; http://dlib.computer.org/so/books/so1998/pdf/s6026.pdf", acknowledgement = ack-nhfb, fjournal = "IEEE Software", journal-URL = "http://www.computer.org/portal/web/csdl/magazines/software", } @Article{Hagiya:1998:NMD, author = "M. Hagiya and A. Tozawa", title = "On a New Method for Dataflow Analysis of {Java Virtual Machine} Subroutines", journal = j-LECT-NOTES-COMP-SCI, volume = "1503", pages = "17--32", year = "1998", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Tue Jan 5 08:21:58 MST 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/java.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Lecture Notes in Computer Science", } @Article{Leung:1998:DGD, author = "Kwong-Sak Leung and Kin-Hong Lee and Yuk-Yin Wong", title = "{DJM}: a Global Distributed Virtual Machine on the {Internet}", journal = j-SPE, volume = "28", number = "12", pages = "1269--1297", month = oct, year = "1998", CODEN = "SPEXBL", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Thu Jul 29 15:12:01 MDT 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www3.interscience.wiley.com/journalfinder.html", URL = "http://www3.interscience.wiley.com/cgi-bin/abstract?ID=1763; http://www3.interscience.wiley.com/cgi-bin/fulltext?ID=1763&PLACEBO=IE.pdf", acknowledgement = ack-nhfb, fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", } @Article{Liang:1998:DCL, author = "Sheng Liang and Gilad Bracha", title = "Dynamic Class Loading in the {Java Virtual Machine}", journal = j-SIGPLAN, volume = "33", number = "10", pages = "36--44", month = oct, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:52 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/java.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @Article{McGhan:1998:CPP, author = "Harlan McGhan and Mike O'Connor", title = "Computing Practices: {PicoJava}: a Direct Execution Engine For {Java} Bytecode", journal = j-COMPUTER, volume = "31", number = "10", pages = "22--30", month = oct, year = "1998", CODEN = "CPTRB4", ISSN = "0018-9162 (print), 1558-0814 (electronic)", ISSN-L = "0018-9162", bibdate = "Tue Oct 6 18:50:08 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://dlib.computer.org/co/books/co1998/pdf/rx022.pdf; http://www.computer.org/computer/co1998/rx022abs.htm", acknowledgement = ack-nhfb, fjournal = "Computer", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2", } @Article{Migliardi:1998:DRV, author = "M. Migliardi and J. Dongarra and A. Geist and V. Sunderam", title = "Dynamic Reconfiguration and Virtual Machine Management in the {Harness} Metacomputing System", journal = j-LECT-NOTES-COMP-SCI, volume = "1505", pages = "127--134", year = "1998", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Tue Jan 5 08:21:58 MST 1999", bibsource = "https://www.math.utah.edu/pub/bibnet/authors/d/dongarra-jack-j.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.netlib.org/utk/people/JackDongarra/PAPERS/harness1.ps", acknowledgement = ack-nhfb, fjournal = "Lecture Notes in Computer Science", } @Book{Miller:1998:VMB, author = "Gregory R. Miller and Stephen C. Cooper", title = "Visual mechanics: beams and stress states", publisher = "PWS Publishing Company", address = "Boston, MA, USA", pages = "x + 149", year = "1998", ISBN = "0-534-95587-8", ISBN-13 = "978-0-534-95587-8", LCCN = "TA660.B4 M55 1998", bibdate = "Mon Apr 10 10:43:48 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.loc.gov:7090/Voyager", acknowledgement = ack-nhfb, subject = "Girders; Mathematical models; Data processing; Structural analysis (Engineering); Strains and stresses; Java virtual machine", } @Article{Millet:1998:PGT, author = "Laurent Millet and Ted Baker", title = "Porting the {GNAT} Tasking Runtime System to the {Java Virtual Machine}", journal = j-LECT-NOTES-COMP-SCI, volume = "1411", pages = "19--??", year = "1998", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Tue Feb 5 11:52:10 MST 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1411.htm; https://www.math.utah.edu/pub/tex/bib/gnu.bib; https://www.math.utah.edu/pub/tex/bib/java.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1411/14110019.htm; http://link.springer-ny.com/link/service/series/0558/papers/1411/14110019.pdf", acknowledgement = ack-nhfb, fjournal = "Lecture Notes in Computer Science", } @TechReport{Taivalsaari:1998:IJV, author = "Antero Taivalsaari", title = "Implementing a {Java Virtual Machine} in the {Java} programming language", volume = "98-64", institution = "Sun Microsystems", address = "Palo Alto, CA, USA", pages = "23", month = mar, year = "1998", LCCN = "QA76.8.S86.S65", bibdate = "Mon Apr 10 10:43:19 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; library.mit.edu:9909/mit01", series = "SMLI TR", abstract = "JavaInJava is a Java virtual machine written in the Java programming language. The system was built at Sun Microsystems Laboratories in order to examine the feasibility of constructing high-quality virtual machines using the Java programming language and to experiment with new virtual machine implementation techniques. In this paper we describe the overall architecture of JavaInJava and summarize a number of interesting technical issues that were encountered during its implementation.", acknowledgement = ack-nhfb, subject = "Java (Computer program language); Virtual computer systems", } @TechReport{Tolksdorf:1998:PLJ, author = "Robert Tolksdorf", title = "Programming Languages for the {Java Virtual Machine}", institution = "Technische Universit{\"a}t Berlin, Fachbereich 13, Informatik, Formale Methoden, Logik und Programmierung (FLP), Sekr. FR 6-10", address = "Franklinstra{\ss}e 28/29, D-10587 Berlin, Germany", year = "1998", bibdate = "Tue Feb 09 05:47:54 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/java.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "World-Wide Web document with pointers to more than 60 compilers and translators between various programming languages and Java.", URL = "http://grunge.cs.tu-berlin.de/~tolk/vmlanguages.html", acknowledgement = ack-nhfb, } @Article{Ungar:1998:PNC, author = "David Ungar and Lars Bak and Jesse Fang and John Duimovich and Scott Meyer", title = "Panel 2: The New Crop of {Java Virtual Machines}", journal = j-SIGPLAN, volume = "33", number = "10", pages = "179--182", month = oct, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Nov 5 06:59:51 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/java.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @Article{Vanhelsuwe:1998:BRJb, author = "Laurence Vanhelsuw{\'e}", title = "Book review: {Java} virtual machine books --- a comparative review", journal = j-JAVAWORLD, volume = "3", number = "3", pages = "??--??", month = mar, year = "1998", CODEN = "????", ISSN = "1091-8906", bibdate = "Thu Aug 13 10:33:04 1998", bibsource = "http://www.javaworld.com/javaworld/; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.javaworld.com/javaworld/jw-03-1998/jw-03-bookreview.htm", acknowledgement = ack-nhfb, } @Article{Westley:1998:WJA, author = "Terry J. Westley", title = "Writing {Java} applets in {Ada}: a beginner's guide", journal = j-ADA-USER-J, volume = "19", number = "1", pages = "57--82", month = apr, year = "1998", CODEN = "AUJOET", ISSN = "0268-652X", bibdate = "Sat Oct 10 15:17:00 MDT 1998", bibsource = "Compendex database; http://www.adauk.org.uk/pubs/jvol19_1.htm; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, classification = "722.4; 723.1; 723.1.1; 723.5", fjournal = "Ada User Journal", journal-URL = "http://www.ada-europe.org/auj/archive", journalabr = "Ada User J", keywords = "Ada (programming language); C (programming language); Computer simulation; Computer systems programming; Java virtual machine (jvm); Object oriented programming; Response time (computer systems)", } @InProceedings{Yalamanchilli:1998:CPJa, author = "Narendar Yalamanchilli and William Cohen", title = "Communication Performance of {Java} based {Parallel Virtual Machines}", crossref = "ACM:1998:AWJ", pages = "??--??", year = "1998", bibdate = "Thu Apr 27 10:43:08 2000", bibsource = "https://www.math.utah.edu/pub/tex/bib/java.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.cs.ucsb.edu/conferences/java98/papers/passing.pdf; http://www.cs.ucsb.edu/conferences/java98/papers/passing.ps", acknowledgement = ack-nhfb, } @Article{Yalamanchilli:1998:CPJb, author = "Narendar Yalamanchilli and William Cohen", title = "Communication performance of {Java}-based parallel virtual machines", journal = j-CPE, volume = "10", number = "11--13", pages = "1189--1196", month = sep, year = "1998", CODEN = "CPEXEI", ISSN = "1040-3108", ISSN-L = "1040-3108", bibdate = "Tue Sep 7 06:06:44 MDT 1999", bibsource = "http://www.interscience.wiley.com/jpages/1040-3108/; https://www.math.utah.edu/pub/tex/bib/cpe.bib; https://www.math.utah.edu/pub/tex/bib/java.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www3.interscience.wiley.com/journalfinder.html", note = "Special Issue: Java for High-performance Network Computing.", URL = "http://www3.interscience.wiley.com/cgi-bin/abstract?ID=10050407; http://www3.interscience.wiley.com/cgi-bin/fulltext?ID=10050407&PLACEBO=IE.pdf", acknowledgement = ack-nhfb, fjournal = "Concurrency, practice and experience", } @Article{Aagren:1999:TCC, author = "Ola {\AA}gren", title = "Teaching computer concepts using virtual machines", journal = j-SIGCSE, volume = "31", number = "2", pages = "84--85", month = jun, year = "1999", CODEN = "SIGSD3", DOI = "https://doi.org/10.1145/571535.571578", ISSN = "0097-8418 (print), 2331-3927 (electronic)", ISSN-L = "0097-8418", bibdate = "Sat Nov 17 16:56:38 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigcse1990.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "A set of virtual assemblers and a virtual machine are used as a teaching tool in order to teach students differences and similarities between architectural styles of computer processors. Programs written by the students in the virtual assemblers are compiled using the corresponding virtual assembler. They are then executed on the virtual machine so that students can follow the execution of the programs step by step or at full speed.", acknowledgement = ack-nhfb, fjournal = "SIGCSE Bulletin (ACM Special Interest Group on Computer Science Education)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J688", } @Article{Anonymous:1999:MVM, author = "Anonymous", title = "{Microsoft} virtual machine vulnerability", journal = j-NETWORK-SECURITY, volume = "1999", number = "12", pages = "2--2", month = dec, year = "1999", CODEN = "NTSCF5", DOI = "https://doi.org/10.1016/S1353-4858(99)90324-0", ISSN = "1353-4858 (print), 1872-9371 (electronic)", ISSN-L = "1353-4858", bibdate = "Mon Dec 4 16:57:48 MST 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/network-security.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1353485899903240", acknowledgement = ack-nhfb, fjournal = "Network Security", journal-URL = "https://www.sciencedirect.com/journal/network-security", } @Article{Barbosa:1999:ADM, author = "J. Barbosa and A. Padilha", title = "Algorithm-Dependent Method to Determine the Optimal Number of Computers in Parallel Virtual Machines", journal = j-LECT-NOTES-COMP-SCI, volume = "1573", pages = "508--521", year = "1999", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Tue Sep 14 06:09:05 MDT 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Lecture Notes in Computer Science", keywords = "parallel processing; VECPAR; vector processing", } @Article{Beck:1999:HNG, author = "Micah Beck and Jack J. Dongarra and Graham E. Fagg and G. Al Geist and Paul Gray and James Kohl and Mauro Migliardi and Keith Moore and Terry Moore and Philip Papadopoulous and Stephen L. Scott and Vaidy Sunderam", title = "{HARNESS}: a Next Generation Distributed Virtual Machine", journal = j-FUT-GEN-COMP-SYS, volume = "15", number = "5--6", pages = "571--582", day = "1", month = oct, year = "1999", CODEN = "FGSEVI", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Tue Mar 05 17:45:35 2002", bibsource = "ftp://ftp.math.utah.edu/pub/bibnet/authors/d/dongarra-jack-j.bib; http://www.elsevier.com/locate/issn/0167739X; https://www.math.utah.edu/pub/bibnet/authors/d/dongarra-jack-j.bib; https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.elsevier.com/gej-ng/10/19/19/30/21/20/abstract.html; http://www.netlib.org/utk/people/JackDongarra/PAPERS/harness2.ps", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @MastersThesis{Coffing:1999:XPM, author = "Charles L. Coffing", title = "An x86 protected mode virtual machine monitor for the {MIT} exokernel", type = "Thesis ({S.B. and M.Eng.})", school = "Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology", address = "Cambridge, MA, USA", pages = "109", year = "1999", LCCN = "Thesis", bibdate = "Mon Apr 10 10:43:19 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; library.mit.edu:9909/mit01", note = "Supervised by M. Frans Kaashoek.", acknowledgement = ack-nhfb, } @Book{Engel:1999:PJV, author = "Joshua Engel", title = "Programming for the {Java Virtual Machine}", publisher = pub-AW, address = pub-AW:adr, pages = "xix + 488", year = "1999", ISBN = "0-201-30972-6 , 0-201-61654-8 (CD-ROM)", ISBN-13 = "978-0-201-30972-0, 978-0-201-61654-5 (CD-ROM)", LCCN = "QA76.73.J38E543 1999", bibdate = "Tue May 11 08:13:32 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", price = "US\$39.95", acknowledgement = ack-nhfb, subject = "Java (Computer program language); Java Virtual Machine", } @Article{Geist:1999:HAV, author = "G. A. {Geist II} and James Arthur Kohl and Stephen Scott and Philip M. Papadopoulos", title = "{Harness}: Adaptable Virtual Machine Environment for Heterogeneous Cluster", journal = j-PARALLEL-PROCESS-LETT, volume = "9", number = "2", pages = "253--??", month = jun, year = "1999", CODEN = "PPLTEE", ISSN = "0129-6264 (print), 1793-642X (electronic)", bibdate = "Thu Jan 6 12:02:35 MST 2005", bibsource = "http://ejournals.wspc.com.sg/ppl/; https://www.math.utah.edu/pub/tex/bib/parallelprocesslett.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Parallel Processing Letters", journal-URL = "http://www.worldscientific.com/loi/ppl", } @Article{Grimaud:1999:FTI, author = "Gilles Grimaud and Jean-Louis Lanet and Jean-Jacques Vandewalle", title = "{FACADE}: a typed intermediate language dedicated to smart cards", journal = j-SIGSOFT, volume = "24", number = "6", pages = "476--493", month = nov, year = "1999", CODEN = "SFENDP", DOI = "https://doi.org/10.1145/318774.319265", ISSN = "0163-5948 (print), 1943-5843 (electronic)", ISSN-L = "0163-5948", bibdate = "Wed Aug 1 17:13:48 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsoft1990.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "The use of smart cards to run software modules on demand has become a major business concern for application issuers. Such down-loadable executable content needs to be trusted by the card execution environment in order to ensure that an instruction on a memory area is compliant with the definition of the data stored in this area (i.e. its type). Current solutions for smart cards rely on three techniques. For Java Card, either an off-card verifier-converter performs a static verification of type-safety, or a defensive virtual machine performs the verification at runtime. For other types of open smart cards, no type-checking is carried out and the trust is only based on the containment of applications. Static verification is more efficient and flexible than dynamic techniques. Nevertheless, as the Java verifier cannot fit into a card, the trust is dependent on an external third-party. In this way, the card security has been partly turned to the outside. We propose and describe the FACADE language for which the type-safety verification can be performed statically on-card.", acknowledgement = ack-nhfb, fjournal = "ACM SIGSOFT Software Engineering Notes", journal-URL = "https://dl.acm.org/citation.cfm?id=J728", } @Article{Kernighan:1999:REL, author = "Brian W. Kernighan and Rob Pike", title = "Regular Expressions: Languages, Algorithms, Software", journal = j-DDJ, volume = "24", number = "4", pages = "19--22", month = apr, year = "1999", CODEN = "DDJOEB", ISSN = "1044-789X", bibdate = "Wed Mar 3 06:30:11 MST 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/dr-dobbs-1990.bib; https://www.math.utah.edu/pub/tex/bib/plan9.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "See also \cite{Thompson:1968:PTR,Cox:2007:REM,Cox:2009:REM,Cox:2010:REM,Cox:2012:REM}", URL = "http://www.ddj.com/ftp/1999/1999_04/regexp.txt; http://www.ddj.com/ftp/1999/1999_04/regexp.zip", abstract = "Regular expressions, one of the most broadly applicable of programmer's tools, provide a compact and expressive notation for describing patterns of text. They are also algorithmically interesting, easy to implement, and highly useful. Additional resources include regexp.txt (listings) and regexp.zip (source code).", acknowledgement = ack-nhfb, fjournal = "Dr. Dobb's Journal of Software Tools", } @TechReport{Lewis:1999:EBP, author = "Brian T. Lewis and Bernd Mathiske", title = "Efficient barriers for persistent object caching in a high-performance {Java} virtual machine", volume = "99-81", institution = "Sun Microsystems", address = "Palo Alto, CA, USA", pages = "9", month = dec, year = "1999", LCCN = "QA76.8.S86.S65", bibdate = "Mon Apr 10 10:43:19 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; library.mit.edu:9909/mit01", series = "SMLI TR", abstract = "We implemented orthogonal persistence for the Java platform by adding persistent object caching to a high-performance virtual machine that uses exact garbage collection, the Sun Microsystems Laboratories Virtual Machine for Research (`ResearchVM'). This paper gives an overview of our design for the read and write barriers needed to support persistence. The key design decision we made was the choice of a pointer swizzling strategy. Pointer swizzling speeds up programs by translating persistent addresses (references to persistent objects on disk) into normal virtual memory addresses in the object cache. The swizzling technique we chose is simple (requires few source changes to the ResearchVM) and performs well (adds acceptably low CPU overhead to the ResearchVM). Our integration of the new barriers was considerably simplified by an internal memory interface that the ResearchVM consistently uses, except in its Just-In-Time (JIT) compiler, to access program runtime values. Our new persistent version of the ResearchVM, the PEVM, requires just 30\% of the changes necessary in our previous persistent virtual machine implementations. It executes programs with only modest runtime overhead (typically 10--20\%) compared to an unchanged ResearchVM.", acknowledgement = ack-nhfb, subject = "Java (Computer program language); Virtual computer systems; Object-oriented databases", } @InProceedings{Liang:1999:CPS, author = "Sheng Liang and Deepa Viswanathan", title = "Comprehensive Profiling Support in the {Java Virtual Machine}", crossref = "USENIX:1999:PFU", pages = "??--??", year = "1999", bibdate = "Fri Oct 18 07:14:18 2002", bibsource = "https://www.math.utah.edu/pub/tex/bib/java.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.usenix.org/publications/library/proceedings/coots99/liang.html", acknowledgement = ack-nhfb, } @Book{Lindholm:1999:JVM, author = "Tim Lindholm and Frank Yellin", title = "The {Java Virtual Machine} Specification", publisher = pub-AW, address = pub-AW:adr, edition = "Second", pages = "xv + 473", year = "1999", ISBN = "0-201-43294-3", ISBN-13 = "978-0-201-43294-7", LCCN = "QA76.73.J38L56 1999", bibdate = "Tue May 11 07:30:11 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", price = "US\$42.95", acknowledgement = ack-nhfb, } @Article{Qian:1999:FSJ, author = "Z. Qian", title = "A Formal Specification of {Java[TM]} Virtual Machine Instructions for Objects, Methods and Subroutines", journal = j-LECT-NOTES-COMP-SCI, volume = "1523", pages = "271--??", year = "1999", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Mon Sep 13 16:57:02 MDT 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/java.bib; https://www.math.utah.edu/pub/tex/bib/lncs1999a.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Lecture Notes in Computer Science", } @InProceedings{Rosenblum:1999:VVP, author = "Mendel Rosenblum", title = "{VMware}'s {Virtual Platform}: a Virtual Machine Monitor for Commodity {PCs}", crossref = "IEEE:1999:HCS", pages = "??--??", year = "1999", bibdate = "Mon Jan 08 17:44:03 2001", bibsource = "ftp://www.hotchips.org//pub/hotc7to11cd/hc99/hc11_pdf/hc99.s6.1.Rosenblum.txt; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, } @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/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Operating Systems Review", } @Manual{Sun:1999:JCV, key = "JCVM", title = "{Java Card} 2.1 Virtual Machine Specification", organization = "{SUN} Microsystems, Inc.", day = "3", month = mar, year = "1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "Final Revision 1.0", added-at = "Fri Jan 15 10:34:37 1999", added-by = "gka", } @Manual{Sun:1999:JPD, author = "{Sun Microsystems}", key = "JPDA", title = "{Java Platform Debugger Architecture (JPDA)}", organization = "Sun Microsystems", address = "Mountain View, CA, USA", year = "1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://java.sun.com/j2se/1.3/docs/guide/jpda/", comment = "Debugger architecture for {J}ava. Includes: Java Virtual Machine Debugger Interface (JVMDI) which defines the services a VM must provide for debugging; Java Debug Wire Protocol (JDWP) which defines the format of information and requests transferred between the process being debugged and the debugger front end that implements the Java Debug Interface (JDI) which defines information and requests at the user code level", } @Book{Venners:1999:IJV, author = "Bill Venners", title = "Inside the {Java Virtual Machine}", publisher = pub-MCGRAW-HILL, address = pub-MCGRAW-HILL:adr, edition = "Second", pages = "xxxi + 703", year = "1999", ISBN = "0-07-135093-4", ISBN-13 = "978-0-07-135093-8", LCCN = "QA76.73.J38 V46 1999", bibdate = "Thu Mar 23 07:01:27 MST 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.loc.gov:7090/Voyager", URL = "http://www.loc.gov/catdir/description/mh024/00269375.html", acknowledgement = ack-nhfb, subject = "Java (Computer program language); Java Virtual Machine", } @Article{Venners:1999:SJV, author = "Bill Venners", title = "The state of the {Java} virtual machine ({JVM})", journal = j-JAVAWORLD, volume = "4", number = "1", pages = "??--??", month = jan, year = "1999", CODEN = "????", ISSN = "1091-8906", bibdate = "Mon Jan 4 06:11:43 MST 1999", bibsource = "http://www.javaworld.com/javaworld/; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.javaworld.com/javaworld/jbe/jw-jbe-jvm.htm", acknowledgement = ack-nhfb, } @Article{Wakeling:1999:CLF, author = "David Wakeling", title = "Compiling lazy functional programs for the {Java} Virtual Machine", journal = j-J-FUNCT-PROGRAM, volume = "9", number = "6", pages = "579--603", month = nov, year = "1999", CODEN = "JFPRES", DOI = "", ISSN = "0956-7968 (print), 1469-7653 (electronic)", ISSN-L = "0956-7968", bibdate = "Tue Jul 11 18:02:19 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/java.bib; https://www.math.utah.edu/pub/tex/bib/jfunctprogram.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.cambridge.org/core/product/AC59FAFC68063D9EC71E4FCF283E7EFC", acknowledgement = ack-nhfb, ajournal = "J. Funct. Program.", fjournal = "Journal of Functional Programming", journal-URL = "http://journals.cambridge.org/action/displayJournal?jid=JFP", onlinedate = "01 November 1999", } @InProceedings{Waldron:1999:AVM, author = "John Waldron and Owen Harrison", title = "Analysis of Virtual Machine Stack Frame Usage by {Java} Methods", crossref = "Anonymous:1999:PII", pages = "271--274", year = "1999", bibdate = "Tue Oct 24 10:29:21 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, } @Article{Walters:1999:VVP, author = "Brian Walters", title = "{VMware} Virtual Platform", journal = j-LINUX-J, volume = "63", pages = "??--??", month = jul, year = "1999", CODEN = "LIJOFX", ISSN = "1075-3583 (print), 1938-3827 (electronic)", ISSN-L = "1075-3583", bibdate = "Thu Sep 21 07:44:10 MDT 2000", bibsource = "http://noframes.linuxjournal.com/lj-issues/issue63/index.html; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://noframes.linuxjournal.com/lj-issues/3458.html", acknowledgement = ack-nhfb, fjournal = "Linux journal", journal-URL = "http://portal.acm.org/citation.cfm?id=J508", } @TechReport{Wolczko:1999:UTJ, author = "M. Wolczko", title = "Using a {Tracing Java Virtual Machine} to gather data on the behavior of {Java} programs", institution = "Sun Microsystems, Inc.", address = "Menlo Park, CA, USA", pages = "????", year = "1999", bibdate = "Tue Oct 24 10:30:38 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://research.sun.com/people/mario/tracing-jvm/", acknowledgement = ack-nhfb, } @InProceedings{Yelland:1999:CAJ, author = "Phillip M. Yelland", title = "A compositional account of the {Java} virtual machine", crossref = "ACM:1999:PPA", pages = "57--69", year = "1999", bibdate = "Mon May 3 12:58:58 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/java.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/292540/p57-yelland/", acknowledgement = ack-nhfb, keywords = "measurement; verification", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Java. {\bf H.5.1} Information Systems, INFORMATION INTERFACES AND PRESENTATION, Multimedia Information Systems, Artificial, augmented, and virtual realities. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Haskell. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Polymorphism.", } @Book{Dalheimer:19xx:JVM, author = "Matthias K. Dalheimer", title = "{Java Virtual Machine, Sprache, Konzept\ldots{}}", publisher = pub-ORA, address = pub-ORA:adr, year = "19xx", ISBN = "3-930673-73-8 (??invalid ISBN??)", ISBN-13 = "978-3-930673-73-5 (??invalid ISBN??)", LCCN = "????", bibdate = "Wed Jun 17 22:05:06 MDT 1998", bibsource = "http://www.javaworld.com/javaworld/books/jw-books-alphabytitle.html; https://www.math.utah.edu/pub/tex/bib/java.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www.ora.de/", price = "29 DM", URL = "http://www.oreilly.de/german/essential/javavm/index.html", acknowledgement = ack-nhfb, language = "German", } @Book{Lindholm:19xx:JVMa, author = "Tim Lindholm and Frank Yellin", title = "The {Java} Virtual Machine", publisher = pub-GOTOP-INFORMATION, address = pub-GOTOP-INFORMATION:adr, pages = "????", year = "19xx", ISBN = "????", ISBN-13 = "????", LCCN = "????", bibdate = "Mon Aug 18 07:55:47 MDT 1997", bibsource = "http://lightyear.ncsa.uiuc.edu/~srp/java/chinese.html; https://www.math.utah.edu/pub/tex/bib/java.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "Chinese translation by Thi Shiang Workshop.", URL = "http://www.gotop.com.tw", acknowledgement = ack-nhfb, language = "Chinese", } @Book{Lindholm:19xx:JVMb, author = "Tim Lindholm and Frank Yellin", title = "The {Java} Virtual Machine", publisher = pub-GOTOP-INFORMATION, address = pub-GOTOP-INFORMATION:adr, year = "19xx", ISBN = "????", ISBN-13 = "????", LCCN = "????", bibdate = "Wed Jun 17 22:05:06 MDT 1998", bibsource = "http://www.gotop.com.tw; http://www.javaworld.com/javaworld/books/jw-books-alphabytitle.html; https://www.math.utah.edu/pub/tex/bib/java.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "Chinese translation by Thi Shiang Workshop.", price = "????", acknowledgement = ack-nhfb, language = "Chinese", } @Book{Meyer:19xx:JVMb, author = "Jon Meyer and Troy Downing", title = "The {Java} Virtual Machine", publisher = pub-ORA, address = pub-ORA:adr, year = "19xx", ISBN = "4-900900-63-X", ISBN-13 = "978-4-900900-63-9", LCCN = "????", bibdate = "Wed Jun 17 22:05:06 MDT 1998", bibsource = "http://www.javaworld.com/javaworld/books/jw-books-alphabytitle.html; https://www.math.utah.edu/pub/tex/bib/java.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www.oreilly.co.jp/", note = "Japanese translation.", price = "4,500 yen", acknowledgement = ack-nhfb, language = "Japanese", } @Article{Alpern:2000:JAV, author = "B. Alpern and C. R. Attanasio and J. J. Barton and M. G. Burke and P. Cheng and J.-D. Choi and A. Cocchi and S. J. Fink and D. Grove and M. Hind and S. F. Hummel and D. Lieber and V. Litvinov and M. F. Mergen and T. Ngo and J. R. Russell and V. Sarkar and M. J. Serrano and J. C. Shepherd and S. E. Smith and V. C. Sreedhar and H. Srinivasan and J. Whaley", title = "The {Jalape{\~n}o} virtual machine", journal = j-IBM-SYS-J, volume = "39", number = "1", pages = "211--238", month = "????", year = "2000", CODEN = "IBMSA7", ISSN = "0018-8670", bibdate = "Mon Apr 24 15:43:02 MDT 2000", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.research.ibm.com/journal/sj/391/alpern.html", acknowledgement = ack-nhfb, fjournal = "IBM Systems Journal", keywords = "Java", ordernumber = "G321-0137", } @Article{Anonymous:2000:AJV, author = "Anonymous", title = "Announcement: {{\em Java Virtual Machine Research and Technology Symposium (JVM '01)}}", journal = j-LOGIN, volume = "25", number = "3", pages = "??--??", month = jun, year = "2000", CODEN = "LOGNEM", ISSN = "1044-6397", bibdate = "Tue Apr 11 06:42:33 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www.usenix.org/publications/login/2000-6/index.html", URL = "http://www.usenix.org/events/jvm01", acknowledgement = ack-nhfb, fjournal = ";login: the USENIX Association newsletter", } @Article{Azevedo:2000:AAJ, author = "Ana Azevedo and Alex Nicolau and Joe Hummel", title = "An annotation-aware {Java} virtual machine implementation", journal = j-CPE, volume = "12", number = "6", pages = "423--444", month = may, year = "2000", CODEN = "CPEXEI", DOI = "https://doi.org/10.1002/1096-9128(200005)12:6<423::AID-CPE483>3.0.CO;2-L", ISSN = "1040-3108", ISSN-L = "1040-3108", bibdate = "Sun Oct 29 16:57:06 MST 2000", bibsource = "http://www.interscience.wiley.com/jpages/1040-3108; https://www.math.utah.edu/pub/tex/bib/cpe.bib; https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www3.interscience.wiley.com/journalfinder.html", URL = "http://www3.interscience.wiley.com/cgi-bin/abstract/72515731/START; http://www3.interscience.wiley.com/cgi-bin/fulltext?ID=72515731&PLACEBO=IE.pdf", acknowledgement = ack-nhfb, fjournal = "Concurrency, practice and experience", } @MastersThesis{Caamano:2000:PJS, author = "Paul Caamano", title = "Porting a {Java Virtual Machine} to an embedded system", type = "Thesis (M.S.)", school = "Department of Computer Science, University of California, Santa Cruz", address = "Santa Cruz, CA, USA", pages = "viii + 56", year = "2000", LCCN = "QA76.73.J38 C33 2000", bibdate = "Mon Apr 10 11:18:00 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; melvyl.cdlib.org:210/CDL90", acknowledgement = ack-nhfb, subject = "Java (Computer program language); Virtual computer systems; Embedded computer systems", } @Article{Chelius:2000:ING, author = "Guillaume Chelius and {\'E}ric Fleury", title = "An {IP} Next Generation Compliant {Java\TM} Virtual Machine", journal = j-LECT-NOTES-COMP-SCI, volume = "1800", pages = "528--??", year = "2000", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Fri Feb 1 09:16:18 MST 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1800.htm; https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1800/18000528.htm; http://link.springer-ny.com/link/service/series/0558/papers/1800/18000528.pdf", acknowledgement = ack-nhfb, fjournal = "Lecture Notes in Computer Science", } @Book{Compton:2000:VLB, author = "Jason Compton", title = "{VMware 2} for {Linux}: [a better way to run multiple operating systems on {Linux}]", publisher = "Prima Tech", address = "Rocklin, CA, USA", pages = "xxii + 406", year = "2000", ISBN = "0-7615-2764-8", ISBN-13 = "978-0-7615-2764-0", LCCN = "QA76.76.O63 C656 2000", bibdate = "Sun Apr 9 15:43:22 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.loc.gov:7090/Voyager", acknowledgement = ack-nhfb, subject = "Linux; Operating systems (Computers); Virtual computer systems", } @TechReport{Crookston:2000:VCM, author = "Newell W. Crookston and Brian Whipple and William J. Grenney", title = "Virtual {C} machine and integrated development environment for {ATMS} controllers", number = "00-109", institution = "Utah Department of Transportation", address = "Salt Lake City, UT, USA", pages = "23", month = apr, year = "2000", LCCN = "QA76.9.V5 .C76 2000", bibdate = "Mon Apr 10 10:43:28 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; melvyl.cdlib.org:210/CDL90", series = "MPC report", acknowledgement = ack-nhfb, remark = "Performed for the Mountain Plains Consortium.. Sponsored by U.S. Department of Transportation University Transportation Centers Program", subject = "Virtual computer systems; Utah; Digital control systems; Intelligent Vehicle Highway Systems; Traffic engineering; advanced traffic management systems", } @Article{Czajkowski:2000:AIJ, author = "Grzegorz Czajkowski", title = "Application isolation in the {Java$^{TM}$} {Virtual} {Machine}", journal = j-SIGPLAN, volume = "35", number = "10", pages = "354--366", month = oct, year = "2000", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Nov 7 16:57:37 MST 2000", bibsource = "http://www.acm.org/pubs/contents/proceedings/series/oopsla/; https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.acm.org/pubs/citations/proceedings/oops/353171/p354-czajkowski/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @Article{Dillenberger:2000:BJV, author = "D. Dillenberger and R. Bordawekar and C. W. Clark and D. Durand and D. Emmes and O. Gohda and S. Howard and M. F. Oliver and F. Samuel and R. W. {St. John}", title = "Building a {Java} virtual machine for server applications: The {JVM} on {OS/390}", journal = j-IBM-SYS-J, volume = "39", number = "1", pages = "194--210", month = "????", year = "2000", CODEN = "IBMSA7", ISSN = "0018-8670", bibdate = "Mon Apr 24 15:43:02 MDT 2000", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.research.ibm.com/journal/sj/391/dillenberger.html", acknowledgement = ack-nhfb, fjournal = "IBM Systems Journal", ordernumber = "G321-0137", } @Article{Farkas:2000:QEC, author = "Keith I. Farkas and Jason Flinn and Godmar Back and Dirk Grunwald and Jennifer M. Anderson", title = "Quantifying the energy consumption of a pocket computer and a {Java Virtual Machine}", journal = j-SIGMETRICS, volume = "28", number = "1", pages = "252--263", month = jun, year = "2000", CODEN = "????", DOI = "https://doi.org/10.1145/345063.339421", ISSN = "0163-5999 (print), 1557-9484 (electronic)", ISSN-L = "0163-5999", bibdate = "Thu Jun 26 11:31:11 MDT 2008", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/sigmetrics.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "In this paper, we examine the energy consumption of a state-of-the-art pocket computer. Using a data acquisition system, we measure the energy consumption of the Itsy Pocket Computer, developed by Compaq Computer Corporation's Palo Alto Research Labs. We begin by showing that the energy usage characteristics of the Itsy differ markedly from that of a notebook computer. Then, since we expect that flexible software environments will become increasingly prevalent on pocket computers, we consider applications running in a Java environment. In particular, we explain some of the Java design tradeoffs applicable to pocket computers, and quantify their energy costs. For the design options we considered and the three workloads we studied, we find a maximum change in energy use of 25\%.", acknowledgement = ack-nhfb, fjournal = "ACM SIGMETRICS Performance Evaluation Review", journal-URL = "http://portal.acm.org/toc.cfm?id=J618", } @InProceedings{Gough:2000:EJV, author = "K. John Gough and Diane Corney", booktitle = "{Modular Programming Languages}", title = "Evaluating the {Java Virtual Machine} as a Target for Languages Other Than {Java}", publisher = pub-SV, address = pub-SV:adr, pages = "278--290", year = "2000", DOI = "https://doi.org/10.1007/10722581_22", ISBN = "3-540-44519-6", ISBN-13 = "978-3-540-44519-7", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Sat Jan 6 06:42:26 MST 2024", bibsource = "https://www.math.utah.edu/pub/bibnet/authors/w/wirth-niklaus.bib; https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer.com/chapter/10.1007/10722581_22", acknowledgement = ack-nhfb, keywords = "Oberon-2", } @Article{Grefen:2000:CCO, author = "P. Grefen and K. Aberer and Y. Hoffner and H. Ludwig", title = "{CrossFlow}: Cross-organizational workflow management in dynamic virtual enterprises", journal = j-INT-J-COMPUT-SYST-SCI-ENG, volume = "15", number = "5", pages = "??--??", month = sep, year = "2000", CODEN = "CSSEEI", ISSN = "0267-6192", bibdate = "Wed Feb 20 12:01:01 2002", bibsource = "http://www.crlpublishing.co.uk/cssecont00.htm; https://www.math.utah.edu/pub/tex/bib/computsystscieng.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, journal-URL = "http://www.crlpublishing.co.uk/csse", } @Article{Gu:2000:EHP, author = "W. Gu and N. A. Burns and M. T. Collins and W. Y. P. Wong", title = "The evolution of a high-performing {Java} virtual machine", journal = j-IBM-SYS-J, volume = "39", number = "1", pages = "135--150", month = "????", year = "2000", CODEN = "IBMSA7", ISSN = "0018-8670", bibdate = "Mon Apr 24 15:43:02 MDT 2000", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.research.ibm.com/journal/sj/391/gu.html", acknowledgement = ack-nhfb, fjournal = "IBM Systems Journal", ordernumber = "G321-0137", } @Book{Klappheck:2000:BLE, author = "G{\"u}nther Klappheck and Peter Glinsky and Frank Gehrke", title = "{Das Buch --- LINUX Edition 2000: [jetzt zur S.u.S.E. 6.4, Installation und Bedienung von LINUX und seinen Werkzeugen, LINUX im Netzwerk und Internet, LINUX und ISDN, der Desktop KDE 1.x, VMware unter LINUX]}", publisher = "Sybex", address = "D{\"u}sseldorf, Germany", pages = "xxviii + 906", year = "2000", ISBN = "3-8155-0175-X", ISBN-13 = "978-3-8155-0175-7", LCCN = "????", bibdate = "Sat Oct 14 17:21:53 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.gbv.de:20011/gvk", price = "DM 69.95", acknowledgement = ack-nhfb, language = "German", remark = "CD 1 enth.: S.u.S.E. 6.4 Evaluation version; CD 2 enth.: Linux-Tools. Nebent.: Linux - Das Buch, Edition 2000", subject = "SuSE LINUX 6.4", } @InProceedings{Lawton:2000:PVM, author = "Kevin P. Lawton", title = "{Plex86}: An {180x86} Virtual Machine", crossref = "USENIX:2000:PAL", pages = "??--??", year = "2000", bibdate = "Wed Oct 16 05:17:16 2002", bibsource = "https://www.math.utah.edu/pub/tex/bib/usenix2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.usenix.org/publications/library/proceedings/als2000/lawton.html", acknowledgement = ack-nhfb, } @TechReport{Lewis:2000:APH, author = "Brian T. Lewis and Bernd Mathiske and Neal M. Gafter", title = "Architecture of the {PEVM}: a high-performance orthogonally persistent {Java Virtual Machine}", number = "2000-93", institution = "Sun Microsystems", address = "Palo Alto, CA, USA", pages = "19", month = oct, year = "2000", LCCN = "QA76.8.S86.S65", bibdate = "Mon Apr 10 10:43:19 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; library.mit.edu:9909/mit01", series = "SMLI TR", abstract = "This paper describes the design and implementation of the PEVM, a new scalable, high-performance implementation of orthogonal persistence for the Java platform (OPJ). The PEVM is based on the Sun Microsystems Laboratories Virtual Machine for Research (ResearchVM), which features an optimizing Just-In-Time compiler, exact generational garbage collection, and fast thread synchronization. It also uses a new, scalable persistent object store designed to manage more than 80GB of objects. The PEVM is approximately ten times faster than previous OPJ implementations and can run significantly larger programs. It is faster than or comparable in performance to several commercial persistence solutions for the Java platform. Despite the PEVM's speed and scalability, its implementation is simpler than our previous OPJ implementation (e.g., just 43\% of the VM source patches needed by our previous OPJ implementation). Its speed and simplicity are largely due to our pointer swizzling strategy, the ResearchVM's exact memory management, and a few simple but effective mechanisms. For example, we implement some key data structures in the Java programming language since this automatically makes them persistent.", acknowledgement = ack-nhfb, subject = "Operating systems (Computers); Java (Computer program language); Computer architecture", } @InProceedings{Li:2000:UCS, author = "Tao Li and Lizy Kurian John and Vijaykrishnan Narayanan and Anand Sivasubramaniam and Jyotsna Sabarinathan and Anupama Murthy", title = "Using complete system simulation to characterize {SPECjvm98} benchmarks", crossref = "ACM:2000:CPI", pages = "22--33", year = "2000", DOI = "https://doi.org/10.1145/335231.335234", bibdate = "Tue Oct 24 10:02:36 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Complete system simulation to understand the influence of architecture and operating systems on application execution has been identified to be crucial for systems design. While there have been previous attempts at understanding the architectural impact of Java programs, there has been no prior work investigating the operating system (kernel) activity during their executions. This problem is particularly interesting in the context of Java since it is not only the application that can invoke kernel services, but so does the underlying Java Virtual Machine (JVM) implementation which runs these programs. Further, the JVM style (JIT compiler or interpreter) and the manner in which the different JVM components (such as the garbage collector and class loader) are exercised, can have a significant impact on the kernel activities.To investigate these issues, this research uses complete system simulation of the SPECjvm98 benchmarks on the SimOS simulation platform. The execution of these benchmarks on both JIT compilers and interpreters is profiled in detail, to identify and quantify where time is spent in each component. The kernel activity of SPECjvm98 applications constitutes up to 17\% of the execution time in the large dataset and up to 31\% in the small dataset. The average kernel activity in the large dataset is approximately 10\%, in comparison to around 2\% in four SPECInt benchmarks studied. Of the kernel services, TLB miss handling is the most dominant in all applications. The TLB miss rates in the JIT compiler, dynamic class loader and garbage collector portions of the JVM are individually analyzed. In addition to such execution profiles, the ILP in the user and kernel mode are also quantified. The Java code is seen to limit exploitable parallelism and aggressive instruction issue is seen to be less efficient for SPECjvm98 benchmarks in comparison to SPEC95 programs. Also, the kernel mode of execution does not exhibit as much ILP as the user mode.", acknowledgement = ack-nhfb, } @TechReport{Mathiske:2000:APM, author = "Bernd Mathiske and Daniel Schneider", title = "Automatic persistent memory management for the {Spotless} virtual machine on the {Palm} connected organizer", type = "SMLI TR", number = "2000-89", institution = "Sun Microsystems", address = "Palo Alto, CA, USA", pages = "18", month = jun, year = "2000", LCCN = "QA76.8.S86.S65", bibdate = "Mon Apr 10 10:43:19 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; library.mit.edu:9909/mit01", abstract = "Palm organizers are widely used in a multi-tasking fashion. Users switch from one application to another without losing the context established in either of them. Despite its obvious usefulness, there is no automatic support for this convenience in the organizer's operating system, PalmOS. Programmers must implement event callbacks that have to operate on a PalmOS database API to save and reload specific application state. In this report, we describe how this burden can be eliminated. We enhanced the Spotless Java virtual machine for the Palm organizer with transparent multi-tasking support that automates persistence. As a consequence, running Java programs can be beamed between the infra-red links of two Palm organizers. A beamed program will resume on the receiving organizer in the exact same state as on the sending device. A HotSync operation effectively establishes a checkpoint for each involved Java program. The original Spotless JVM's address range for running programs is limited to a few tens of KB in the dynamic RAM area. By directly addressing the much larger static RAM area, our modified VM supports address ranges of several MB. We provide an easy-to-use protocol that leverages persistent threads for automatic life cycle control of external resources (e.g., windows, forms and databases). When applied at the library level, this protocol maintains complete persistence transparency for the application programmer.", acknowledgement = ack-nhfb, subject = "Palm (Computer); Multitasking (Computer science)", } @Article{Nieh:2000:EV, author = "Jason Nieh and Ozgur Can Leonard", title = "Examining {VMware}", journal = j-DDJ, volume = "25", number = "8", pages = "70, 72--74, 76", month = aug, year = "2000", CODEN = "DDJOEB", ISSN = "1044-789X", bibdate = "Thu Nov 9 08:25:16 MST 2000", bibsource = "http://www.ddj.com/; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "VMware is a virtual machine platform that provides an abstraction of x86 PC hardware so that multiple operating systems can run unmodified at the same time on a standard PC. Among other things, this means you can run Windows applications with Linux.", acknowledgement = ack-nhfb, fjournal = "Dr. Dobb's Journal of Software Tools", } @InProceedings{Provos:2000:EVM, author = "Niels Provos", title = "Encrypting Virtual Machine", crossref = "USENIX:2000:PNU", pages = "??--??", year = "2000", bibdate = "Wed Oct 16 05:17:16 2002", bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib; https://www.math.utah.edu/pub/tex/bib/usenix2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.usenix.org/publications/library/proceedings/sec2000/provos.html", acknowledgement = ack-nhfb, } @InProceedings{Robin:2000:AIP, author = "John Scott Robin and Cynthia E. Irvine", title = "Analysis of the {Intel Pentium}'s Ability to Support a Secure Virtual Machine Monitor", crossref = "USENIX:2000:PNU", pages = "??--??", year = "2000", bibdate = "Wed Oct 16 05:17:16 2002", bibsource = "https://www.math.utah.edu/pub/tex/bib/usenix2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.usenix.org/publications/library/proceedings/sec2000/robin.html", acknowledgement = ack-nhfb, } @Article{Shyu:2000:APV, author = "Shyong-Jian Shyu and B. M. T. Lin", title = "An application of parallel virtual machine framework to film production problem", journal = j-COMPUT-MATH-APPL, volume = "39", number = "12", pages = "53--62", month = jun, year = "2000", CODEN = "CMAPDK", ISSN = "0898-1221 (print), 1873-7668 (electronic)", ISSN-L = "0898-1221", bibdate = "Wed Mar 1 21:49:06 MST 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/computmathappl2000.bib; https://www.math.utah.edu/pub/tex/bib/pvm.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0898122100001292", acknowledgement = ack-nhfb, fjournal = "Computers and Mathematics with Applications", journal-URL = "http://www.sciencedirect.com/science/journal/08981221", } @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/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Operating Systems Review", } @Article{Steven:2000:JCR, author = "John Steven and Pravir Chandra and Bob Fleck and Andy Podgurski", title = "{jRapture}: a Capture\slash Replay tool for observation-based testing", journal = j-SIGSOFT, volume = "25", number = "5", pages = "158--167", month = sep, year = "2000", CODEN = "SFENDP", DOI = "https://doi.org/10.1145/347636.348993", ISSN = "0163-5948 (print), 1943-5843 (electronic)", ISSN-L = "0163-5948", bibdate = "Wed Aug 1 17:14:00 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsoft2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "We describe the design of jRapture: a tool for capturing and replaying Java program executions in the field. jRapture works with Java binaries (byte code) and any compliant implementation of the Java virtual machine. It employs a lightweight, transparent capture process that permits unobtrusive capture of a Java programs executions. jRapture captures interactions between a Java program and the system, including GUI, file, and console inputs, among other types, and on replay it presents each thread with exactly the same input sequence it saw during capture. In addition, jRapture has a profiling interface that permits a Java program to be instrumented for profiling --- after its executions have been captured. Using an XML-based profiling specification language a tester can specify various forms of profiling to be carried out during replay.", acknowledgement = ack-nhfb, fjournal = "ACM SIGSOFT Software Engineering Notes", journal-URL = "https://dl.acm.org/citation.cfm?id=J728", } @InProceedings{vanDoorn:2000:SJV, author = "Leendert van Doorn", title = "A Secure {Java{\TM} Virtual Machine}", crossref = "USENIX:2000:PNU", pages = "??--??", year = "2000", bibdate = "Wed Oct 16 05:17:16 2002", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/usenix2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.usenix.org/publications/library/proceedings/sec2000/vandoorn.html", acknowledgement = ack-nhfb, } @Article{Viswanathan:2000:JVM, author = "D. Viswanathan and S. Liang", title = "{Java Virtual Machine Profiler Interface}", journal = j-IBM-SYS-J, volume = "39", number = "1", pages = "82--95", month = "????", year = "2000", CODEN = "IBMSA7", ISSN = "0018-8670", bibdate = "Mon Apr 24 15:43:02 MDT 2000", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.research.ibm.com/journal/sj/391/viswanathan.html", acknowledgement = ack-nhfb, fjournal = "IBM Systems Journal", ordernumber = "G321-0137", } @Article{Yutaka:2000:EJV, author = "Oiwa Yutaka and Kenjiro Taura and Akinori Yonezawa", title = "Extending {Java} virtual machine with integer-reference conversion", journal = j-CPE, volume = "12", number = "6", pages = "407--422", month = may, year = "2000", CODEN = "CPEXEI", DOI = "https://doi.org/10.1002/1096-9128(200005)12:6<407::AID-CPE482>3.0.CO;2-E", ISSN = "1040-3108", ISSN-L = "1040-3108", bibdate = "Sun Oct 29 16:57:06 MST 2000", bibsource = "http://www.interscience.wiley.com/jpages/1040-3108; https://www.math.utah.edu/pub/tex/bib/cpe.bib; https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www3.interscience.wiley.com/journalfinder.html", URL = "http://www3.interscience.wiley.com/cgi-bin/abstract/72515729/START; http://www3.interscience.wiley.com/cgi-bin/fulltext?ID=72515729&PLACEBO=IE.pdf", acknowledgement = ack-nhfb, fjournal = "Concurrency, practice and experience", } @Article{Anonymous:2001:CRJ, author = "Anonymous", title = "Conference Report: {{\em 1st Java VM Virtual Machine Research and Technology Symposium (JVM '01)}}", journal = j-LOGIN, volume = "26", number = "5", pages = "??--??", month = aug, year = "2001", CODEN = "LOGNEM", ISSN = "1044-6397", bibdate = "Tue Apr 11 06:42:33 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www.usenix.org/publications/login/2001-08/index.html", acknowledgement = ack-nhfb, fjournal = ";login: the USENIX Association newsletter", } @InProceedings{Aoki:2001:SVM, author = "Takashi Aoki and Takeshi Eto", title = "On the Software Virtual Machine for the Real Hardware Stack Machine", crossref = "USENIX:2001:PJV", pages = "??--??", year = "2001", bibdate = "Tue Oct 15 17:45:19 2002", bibsource = "https://www.math.utah.edu/pub/tex/bib/usenix2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.usenix.org/publications/library/proceedings/jvm01/aoki.html", acknowledgement = ack-nhfb, } @Article{Aridor:2001:DIV, author = "Yariv Aridor and Michael Factor and Avi Teperman", title = "A distributed implementation of a virtual machine for {Java}", journal = j-CCPE, volume = "13", number = "3", pages = "221--244", month = mar, year = "2001", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.565", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Wed Jul 25 10:55:46 MDT 2001", bibsource = "http://www.interscience.wiley.com/jpages/1532-0626; https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www3.interscience.wiley.com/journalfinder.html", URL = "http://www3.interscience.wiley.com/cgi-bin/abstract/78003113/START; http://www3.interscience.wiley.com/cgi-bin/fulltext?ID=78003113&PLACEBO=IE.pdf", acknowledgement = ack-nhfb, fjournal = "Concurrency and Computation: Prac\-tice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", } @Book{Born:2001:VWP, author = "G{\"u}nter Born", title = "{VMware Workstation Praxisf{\"u}hrer: Installation, Konfiguration, Anwendung unter Windows und Linux}", publisher = "SuSE-PRESS", address = "N{\"u}rnberg, Germany", pages = "xxii + 372", year = "2001", ISBN = "3-934678-81-5", ISBN-13 = "978-3-934678-81-1", LCCN = "????", bibdate = "Sat Oct 14 17:21:53 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.gbv.de:20011/gvk", price = "DM 79.00, EUR 40.00", acknowledgement = ack-nhfb, language = "German", subject = "VMware Workstation", } @Article{Braught:2001:KSC, author = "Grant Braught and David Reed", title = "The knob \& switch computer: a computer architecture simulator for introductory computer science", journal = j-JERIC, volume = "1", number = "4", pages = "31--45", month = dec, year = "2001", CODEN = "????", ISSN = "1531-4278", bibdate = "Tue Feb 3 18:43:37 MST 2004", bibsource = "http://www.acm.org/pubs/contents/journals/jeric/; https://www.math.utah.edu/pub/tex/bib/jeric.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "ACM Journal on Educational Resources in Computing (JERIC)", } @Article{Bredlau:2001:ALT, author = "Carl Bredlau and Dorothy Deremer", title = "Assembly language through the {Java Virtual Machine}", journal = j-SIGCSE, volume = "33", number = "1", pages = "194--198", month = mar, year = "2001", CODEN = "SIGSD3", DOI = "https://doi.org/10.1145/366413.364583", ISSN = "0097-8418 (print), 2331-3927 (electronic)", ISSN-L = "0097-8418", bibdate = "Sat Nov 17 16:56:46 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigcse2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Student understanding of choices and design decisions about instruction formats, addressing, instruction types, and flow of control is developed through the assembly level. We propose the Java Virtual Machine (JVM) as the architecture for teaching assembly language. The paper describes how to use the JVM as a teaching tool for a sophomore level Assembly Language and Computer Architecture course.", acknowledgement = ack-nhfb, fjournal = "SIGCSE Bulletin (ACM Special Interest Group on Computer Science Education)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J688", } @InProceedings{Breg:2001:JVM, author = "Fabian Breg and Constantine Polychronopoulos", title = "{Java Virtual Machine} Support for Object Serialization", crossref = "ACM:2001:PAJ", pages = "173--180", year = "2001", bibdate = "Mon May 06 09:31:01 2002", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.philippsen.com/JGI2001/camerareadyabstracts/12.html; http://www.philippsen.com/JGI2001/finalpapers/18500173.ps", acknowledgement = ack-nhfb, keywords = "Java", } @Article{Czajkowski:2001:MCV, author = "Grzegorz Czajkowski and Laurent Dayn{\'e}s", title = "Multitasking without compromise: a virtual machine evolution", journal = j-SIGPLAN, volume = "36", number = "11", pages = "125--138", month = nov, year = "2001", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Apr 9 14:44:52 MDT 2002", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "Proceedings of the 2001 ACM SIGPLAN Conference on Object Oriented Programming, Systems, Languages and Applications (OOPSLA'01).", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @InProceedings{Daly:2001:PID, author = "Charles Daly and Jane Horgan and James Power and John Waldron", title = "Platform Independent Dynamic {Java Virtual Machine Analysis}: the {Java Grande Forum} Benchmark Suite", crossref = "ACM:2001:PAJ", pages = "106--115", year = "2001", bibdate = "Mon May 06 09:31:01 2002", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.philippsen.com/JGI2001/camerareadyabstracts/16.html; http://www.philippsen.com/JGI2001/finalpapers/18500106.ps", acknowledgement = ack-nhfb, keywords = "Java", } @Article{Decker:2001:PMS, author = "Rick Decker and Stuart Hirshfield", title = "The {PIPPIN} machine: simulations of language processing", journal = j-JERIC, volume = "1", number = "4", pages = "4--17", month = dec, year = "2001", CODEN = "????", ISSN = "1531-4278", bibdate = "Tue Feb 3 18:43:37 MST 2004", bibsource = "http://www.acm.org/pubs/contents/journals/jeric/; https://www.math.utah.edu/pub/tex/bib/jeric.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "ACM Journal on Educational Resources in Computing (JERIC)", } @Article{Denning:2001:OVM, author = "Peter J. Denning", title = "Origin of Virtual Machines and Other Virtualities", journal = j-IEEE-ANN-HIST-COMPUT, volume = "23", number = "3", pages = "73--73", month = jul, year = "2001", CODEN = "IAHCEX", DOI = "https://doi.org/10.1109/85.948908", ISSN = "1058-6180 (print), 1934-1547 (electronic)", ISSN-L = "1058-6180", bibdate = "Fri Feb 22 12:42:03 MST 2002", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://computer.org/annals/an2001/a3073abs.htm; http://dlib.computer.org/an/books/an2001/pdf/a3073.pdf", acknowledgement = ack-nhfb, fjournal = "IEEE Annals of the History of Computing", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=85", } @InProceedings{Dutchyn:2001:MDJ, author = "Christopher Dutchyn and Paul Lu and Duane Szafron and Steven Bromling and Wade Holst", title = "Multi-Dispatch in the {Java Virtual Machine}: Design and Implementation", crossref = "USENIX:2001:PUC", pages = "??--??", year = "2001", bibdate = "Tue Oct 15 18:09:43 2002", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/usenix2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.usenix.org/publications/library/proceedings/coots01/dutchyn.html", acknowledgement = ack-nhfb, } @Book{ECMA-335-1, author = "{ECMA}", title = "{ECMA-335}: {Common Language Infrastructure (CLI)}", publisher = pub-ECMA, address = pub-ECMA:adr, pages = "xiii + 479", month = dec, year = "2001", bibdate = "Sat May 08 07:36:41 2010", bibsource = "http://www.ecma-international.org/publications/standards/Standard.htm; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.ecma.ch/ecma1/STAND/ecma-335.htm", acknowledgement = ack-nhfb, ECMAnumber = "ECMA-335", remark = "Also ISO/IEC 23271.", } @Article{Ertl:2001:BEV, author = "M. Anton Ertl and David Gregg", title = "The Behavior of Efficient Virtual Machine Interpreters on Modern Architectures", journal = j-LECT-NOTES-COMP-SCI, volume = "2150", pages = "403--??", year = "2001", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Sat Feb 2 13:05:53 MST 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2150.htm; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2150/21500403.htm; http://link.springer-ny.com/link/service/series/0558/papers/2150/21500403.pdf", acknowledgement = ack-nhfb, fjournal = "Lecture Notes in Computer Science", } @Article{Fischer:2001:SAN, author = "Markus Fischer", title = "System Area Network Extensions to the Parallel Virtual Machine", journal = j-LECT-NOTES-COMP-SCI, volume = "2131", pages = "98--??", year = "2001", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Fri Feb 1 08:13:55 MST 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2131.htm; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2131/21310098.htm; http://link.springer-ny.com/link/service/series/0558/papers/2131/21310098.pdf", acknowledgement = ack-nhfb, fjournal = "Lecture Notes in Computer Science", } @InProceedings{Gannon:2001:JCC, author = "Dennis Gannon and others", title = "Panel Discussion: {Java}, {C++}, {C\#}, and Virtual Machines for high performance", crossref = "ACM:2001:PAJ", pages = "??--??", year = "2001", bibdate = "Mon May 06 09:31:01 2002", bibsource = "https://www.math.utah.edu/pub/tex/bib/csharp.bib; https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, keywords = "Java", } @Article{Gonzalez-Castano:2001:JCV, author = "F. J. Gonz{\'a}lez-Casta{\~n}o and L. Anido-Rif{\'o}n and J. M. Pousada-Carballo and P. S. Rodr{\'\i}guez-Hern{\'a}ndez and R. L{\'o}pez-G{\'o}mez", title = "A {Java\slash CORBA} virtual machine architecture for remote execution of optimization solvers in heterogeneous networks", journal = j-SPE, volume = "31", number = "1", pages = "1--16", month = jan, year = "2001", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/1097-024X(200101)31:1<1::AID-SPE354>3.0.CO;2-C", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Tue Mar 13 06:25:28 MST 2001", bibsource = "http://www.interscience.wiley.com/jpages/0038-0644; https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www3.interscience.wiley.com/journalfinder.html", URL = "http://www3.interscience.wiley.com/cgi-bin/abstract/76502341/START; http://www3.interscience.wiley.com/cgi-bin/fulltext?ID=76502341&PLACEBO=IE.pdf", acknowledgement = ack-nhfb, fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", } @Article{Guzdial:2001:UST, author = "Mark Guzdial", title = "Using squeak for teaching user interface software", journal = j-SIGCSE, volume = "33", number = "1", pages = "219--223", month = mar, year = "2001", CODEN = "SIGSD3", DOI = "https://doi.org/10.1145/366413.364588", ISSN = "0097-8418 (print), 2331-3927 (electronic)", ISSN-L = "0097-8418", bibdate = "Sat Nov 17 16:56:46 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigcse2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Squeak is a new programming language that is particularly appropriate for learning computer science. It offers an excellent infrastructure for interesting projects (e.g., multimedia, Web browsing and serving), and all source code is included (and written in Squeak) from the virtual machine, windowing, on up. Squeak is being used in a course on Objects and Design (focusing on the development of user interfaces), both to enhance the infrastructure for a course on, and to change how user interfaces are taught. Rather than teach a toolkit, the focus is now on teaching students how to build toolkits. This paper presents a pilot study suggesting benefits of our new approach.", acknowledgement = ack-nhfb, fjournal = "SIGCSE Bulletin (ACM Special Interest Group on Computer Science Education)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J688", } @Article{Hartel:2001:FSJ, author = "Pieter H. Hartel and Luc Moreau", title = "Formalizing the safety of {Java}, the {Java Virtual Machine}, and {Java} card", journal = j-COMP-SURV, volume = "33", number = "4", pages = "517--558", month = dec, year = "2001", CODEN = "CMSVAN", DOI = "https://doi.org/10.1145/503112.503115", ISSN = "0360-0300 (print), 1557-7341 (electronic)", ISSN-L = "0360-0300", bibdate = "Thu Jun 19 10:17:06 MDT 2008", bibsource = "http://www.acm.org/pubs/contents/journals/surveys/; https://www.math.utah.edu/pub/tex/bib/compsurv.bib; https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib; https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "We review the existing literature on Java safety, emphasizing formal approaches, and the impact of Java safety on small footprint devices such as smartcards. The conclusion is that although a lot of good work has been done, a more concerted effort is needed to build a coherent set of machine-readable formal models of the whole of Java and its implementation. This is a formidable task but we believe it is essential to build trust in Java safety, and thence to achieve ITSEC level 6 or Common Criteria level 7 certification for Java programs.", acknowledgement = ack-nhfb, fjournal = "ACM Computing Surveys", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204", keywords = "Common criteria; programming", } @Book{Hsu:2001:CAS, author = "John Y. Hsu", title = "Computer Architecture: Software Aspects, Coding, Hardware", publisher = pub-CRC, address = pub-CRC:adr, pages = "427", year = "2001", ISBN = "0-8493-1026-1, 1-351-83604-8, 1-4200-4110-X (e-book)", ISBN-13 = "978-0-8493-1026-3, 978-1-351-83604-3, 978-1-4200-4110-1 (e-book)", LCCN = "A76.9.A73 H758 2001", bibdate = "Fri Jan 19 15:47:59 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/fparith.bib; https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/microchip.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; https://www.math.utah.edu/pub/tex/bib/visual-instruction-set.bib", price = "US\$89.95, UK\pounds 59.99", abstract = "With the new developments in computer architecture, fairly recent publications can quickly become outdated. Computer Architecture: Software Aspects, Coding, and Hardware takes a modern approach. This comprehensive, practical text provides that critical understanding of a central processor by clearly detailing fundamentals, and cutting edge design features. With its balanced software/hardware perspective and its description of Pentium processors, the book allows readers to acquire practical PC software experience. The text presents a foundation-level set of ideas, design concepts, and applications that fully meet the requirements of computer organization and architecture courses. The book features a ``bottom up'' computer design approach, based upon the author's thirty years experience in both academe and industry. By combining computer engineering with electrical engineering, the author describes how logic circuits are designed in a CPU. The extensive coverage of a microprogrammed CPU and new processor design features gives the insight of current computer development. Computer Architecture: Software Aspects, Coding, and Hardware presents a comprehensive review of the subject, from beginner to advanced levels. Topics include: * Two's complement numbers * Integer overflow * Exponent overflow and underflow * Looping * Addressing modes * Indexing * Subroutine linking * I/O structures * Memory mapped I/O * Cycle stealing * Interrupts * Multitasking * Microprogrammed CPU * Multiplication tree * Instruction queue * Multimedia instructions * Instruction cache * Virtual memory * Data cache * Alpha chip * Interprocessor communications * Branch prediction * Speculative loading * Register stack * JAVA virtual machine * Stack machine principles.", acknowledgement = ack-nhfb, keywords = "Compaq/DEC Alpha; floating-point arithmetic; Intel x86; Java Virtual Machine; multimedia instructions; Pentium", libnote = "Not yet in my library.", tableofcontents = "Number Systems \\ Basic Computer Principles \\ Assembly Language Principles \\ Computer Architecture--General Features \\ Microprogrammed CPU Design \\ Superscalar Machine Principles \\ Vector and Multiple-Processor Machines \\ Processor Design Case Studies \\ Stack Machine Principles", } @Article{Lewis:2001:APH, author = "Brian Lewis and Bernd Mathiske and Neal Gafter", title = "Architecture of the {PEVM}: a High-Performance Orthogonally {Persistent Java{\TM} Virtual Machine}", journal = j-LECT-NOTES-COMP-SCI, volume = "2135", pages = "18--??", year = "2001", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Sat Feb 2 13:05:37 MST 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2135.htm; https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2135/21350018.htm; http://link.springer-ny.com/link/service/series/0558/papers/2135/21350018.pdf", acknowledgement = ack-nhfb, fjournal = "Lecture Notes in Computer Science", } @InProceedings{Maessen:2001:PAS, author = "Jan-Willem Maessen and Vivek Sarkar and David Grove", title = "Program analysis for safety guarantees in a {Java} virtual machine written in {Java}", crossref = "ACM:2001:ASS", pages = "62--65", year = "2001", bibdate = "Thu Aug 30 08:01:24 MDT 2001", bibsource = "http://www.acm.org/pubs/contents/proceedings/series/paste/; https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.acm.org/pubs/articles/proceedings/soft/379605/p62-maessen/p62-maessen.pdf; http://www.acm.org/pubs/citations/proceedings/soft/379605/p62-maessen/", acknowledgement = ack-nhfb, } @Article{Menczer:2001:OTR, author = "Filippo Menczer and Alberto Maria Segre", title = "{OAMulator}: a teaching resource to introduce computer architecture concepts", journal = j-JERIC, volume = "1", number = "4", pages = "18--30", month = dec, year = "2001", CODEN = "????", ISSN = "1531-4278", bibdate = "Tue Feb 3 18:43:37 MST 2004", bibsource = "http://www.acm.org/pubs/contents/journals/jeric/; https://www.math.utah.edu/pub/tex/bib/jeric.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "ACM Journal on Educational Resources in Computing (JERIC)", } @InProceedings{Moore:2001:EFJ, author = "J. Strother Moore and George M. Porter", title = "An Executable Formal {Java Virtual Machine} Thread Model", crossref = "USENIX:2001:PJV", pages = "??--??", year = "2001", bibdate = "Tue Oct 15 17:45:19 2002", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/usenix2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.usenix.org/publications/library/proceedings/jvm01/moore.html", acknowledgement = ack-nhfb, } @Article{Ng:2001:VEWa, author = "Choong Ng", title = "{VMware Express 2.0} and {Win4Lin 2.0}: a Comparison Review", journal = j-LINUX-J, volume = "85", pages = "??--??", month = may, year = "2001", CODEN = "LIJOFX", ISSN = "1075-3583 (print), 1938-3827 (electronic)", ISSN-L = "1075-3583", bibdate = "Wed May 23 15:20:33 MDT 2001", bibsource = "http://noframes.linuxjournal.com/lj-issues/issue85/index.html; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "Not in journal issue: {Web} only.", URL = "http://www.linuxjournal.com/articles/linux_review/0036.html", acknowledgement = ack-nhfb, fjournal = "Linux journal", journal-URL = "http://portal.acm.org/citation.cfm?id=J508", } @Article{Ng:2001:VEWb, author = "Choong Ng", title = "{VMware} Express 2.0 and Win4Lin 2.0: a Comparison Review", journal = j-LINUX-J, volume = "86", pages = "??--??", month = jun, year = "2001", CODEN = "LIJOFX", ISSN = "1075-3583 (print), 1938-3827 (electronic)", ISSN-L = "1075-3583", bibdate = "Wed May 23 15:20:33 MDT 2001", bibsource = "http://noframes.linuxjournal.com/lj-issues/issue86/index.html; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "Not in journal issue: {Web} only.", URL = "http://www.linuxjournal.com/articles/linux_review/0036.html", acknowledgement = ack-nhfb, fjournal = "Linux journal", journal-URL = "http://portal.acm.org/citation.cfm?id=J508", } @Article{Osborne:2001:PC, author = "Hugh Osborne", title = "The {Postroom Computer}", journal = j-JERIC, volume = "1", number = "4", pages = "81--110", month = dec, year = "2001", CODEN = "????", ISSN = "1531-4278", bibdate = "Tue Feb 3 18:43:37 MST 2004", bibsource = "http://www.acm.org/pubs/contents/journals/jeric/; https://www.math.utah.edu/pub/tex/bib/jeric.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "ACM Journal on Educational Resources in Computing (JERIC)", } @Article{Radhakrishnan:2001:JRS, author = "R. Radhakrishnan and N. Vijaykrishnan and L. K. John and A. Sivasubramaniam and J. Rubio and J. Sabarinathan", title = "{Java} runtime systems: characterization and architectural implications", journal = j-IEEE-TRANS-COMPUT, volume = "50", number = "2", pages = "131--146", month = feb, year = "2001", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/12.908989", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Tue Oct 24 10:08:12 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "The Java Virtual Machine (JVM) is the cornerstone of Java technology and its efficiency in executing the portable Java bytecodes is crucial for the success of this technology. Interpretation, Just-in-Time (JIT) compilation, and hardware realization are well-known solutions for a JVM and previous research has proposed optimizations for each of these techniques. However, each technique has its pros and cons and may not be uniformly attractive for all hardware platforms. Instead, an understanding of the architectural implications of JVM implementations with real applications can be crucial to the development of enabling technologies for efficient Java runtime system development on a wide range of platforms. Toward this goal, this paper examines architectural issues from both the hardware and JVM implementation perspectives. The paper starts by identifying the important execution characteristics of Java applications from a bytecode perspective. It then explores the potential of a smart JIT compiler strategy that can dynamically interpret or compile based on associated costs and investigates the CPU and cache architectural support that would benefit JVM implementations. We also study the available parallelism during the different execution modes using applications from the SPECjvm98 benchmarks. At the bytecode level, it is observed that less than 5 out of the 256 bytecodes constitute 90 percent of the dynamic bytecode stream. Method sizes fall into a trinodal distribution with peak of 1, 9, and 26 bytecodes across all benchmarks. The architectural issues explored in this study show that, when Java applications are executed with a JIT compiler, selective translation using good heuristics can improve performance, but the saving is only 10-15 percent at best. The instruction and data cache performance of Java applications are seen to be better than that of C/C++ applications except in the case of data cache performance in the JIT mode. Write misses resulting from installation of JIT compiler output dominate the misses and deteriorate the data cache performance in JIT mode. A study on the available parallelism shows that Java programs executed using JIT compilers have parallelism comparable to C/C++ programs for small window sizes, but falls behind when the window size is increased. Java programs executed using the interpreter have very little parallelism due to the stack nature of the SVM instruction set, which is dominant in the interpreted execution mode. In addition, this work gives revealing insights and architectural proposals for designing an efficient Java runtime system.", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Computers", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", } @Article{Riehle:2001:AUV, author = "Dirk Riehle and Steven Fraleigh and Dirk Bucka-Lassen and Nosa Omorogbe", title = "The architecture of a {UML} virtual machine", journal = j-SIGPLAN, volume = "36", number = "11", pages = "327--341", month = nov, year = "2001", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Apr 9 14:44:52 MDT 2002", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "Proceedings of the 2001 ACM SIGPLAN Conference on Object Oriented Programming, Systems, Languages and Applications (OOPSLA'01).", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @InProceedings{Russell:2001:HSA, author = "Kenneth Russell and Lars Bak", title = "The {HotSpot{\TM}} Serviceability Agent: An Out-of-Process High-Level Debugger for a {Java{\TM} Virtual Machine}", crossref = "USENIX:2001:PJV", pages = "??--??", year = "2001", bibdate = "Tue Oct 15 17:45:19 2002", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/usenix2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.usenix.org/publications/library/proceedings/jvm01/russell.html", acknowledgement = ack-nhfb, } @Article{Sarkar:2001:HPS, author = "Vivek Sarkar and Julian Dolby", title = "High-Performance Scalable {Java} Virtual Machines", journal = j-LECT-NOTES-COMP-SCI, volume = "2228", pages = "151--??", year = "2001", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Sat Feb 2 13:07:14 MST 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2228.htm; https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2228/22280151.htm; http://link.springer-ny.com/link/service/series/0558/papers/2228/22280151.pdf", acknowledgement = ack-nhfb, fjournal = "Lecture Notes in Computer Science", } @Article{Sarmiento:2001:SFU, author = "Evan Sarmiento", title = "Securing {FreeBSD} Using {Jail}", journal = j-SYS-ADMIN, volume = "10", number = "5", pages = "31, 32, 34, 36--37", month = may, year = "2001", CODEN = "SYADE7", ISSN = "1061-2688", bibdate = "Mon Apr 16 18:53:13 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/sysadmin.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.samag.com/", abstract = "Sarmiento describes the OpenRoot project he's implemented using the Jail feature of FreeBSD.", acknowledgement = ack-nhfb, } @InProceedings{Schneider:2001:APM, author = "Daniel Schneider and Bernd Mathiske and Matthias Ernst and Matthew Seidl", title = "Automatic Persistent Memory Management for the {Spotless Java{\TM} Virtual Machine} on the {Palm Connected Organizer}", crossref = "USENIX:2001:PJV", pages = "??--??", year = "2001", bibdate = "Tue Oct 15 17:45:19 2002", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/usenix2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.usenix.org/publications/library/proceedings/jvm01/schneider.html", acknowledgement = ack-nhfb, } @Article{Shudo:2001:AME, author = "Kazuyuki Shudo and Yoichi Muraoka", title = "Asynchronous migration of execution context in {Java Virtual Machines}", journal = j-FUT-GEN-COMP-SYS, volume = "18", number = "2", pages = "225--233", month = oct, year = "2001", CODEN = "FGSEVI", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Wed Feb 27 12:41:22 MST 2002", bibsource = "http://www.elsevier.com/locate/issn/0167739X; https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.elsevier.com/gej-ng/10/19/19/60/31/30/abstract.html", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Skrien:2001:CST, author = "Dale Skrien", title = "{CPU Sim 3.1}: a tool for simulating computer architectures for computer organization classes", journal = j-JERIC, volume = "1", number = "4", pages = "46--59", month = dec, year = "2001", CODEN = "????", ISSN = "1531-4278", bibdate = "Tue Feb 3 18:43:37 MST 2004", bibsource = "http://www.acm.org/pubs/contents/journals/jeric/; https://www.math.utah.edu/pub/tex/bib/jeric.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.cs.colby.edu/djskrien/CPUSim/", acknowledgement = ack-nhfb, fjournal = "ACM Journal on Educational Resources in Computing (JERIC)", lastaccessed = "17 November 2012", } @Book{Stark:2001:JJV, author = "Robert F. St{\"a}rk and Joachim Schmid and Egon B{\"o}rger", title = "{Java} and the {Java Virtual Machine}: definition, verification, validation", publisher = pub-SV, address = pub-SV:adr, pages = "x + 381", year = "2001", ISBN = "3-540-42088-6", ISBN-13 = "978-3-540-42088-0", LCCN = "QA76.73.J38 S785 2001", bibdate = "Mon May 6 06:26:30 MDT 2002", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "Includes CD-ROM with the entire text of the book and numerous examples and exercises.", price = "US\$49.95", acknowledgement = ack-nhfb, keywords = "Java (computer program language); virtual computer systems", } @InProceedings{Sugerman:2001:VDV, author = "Jeremy Sugerman and Ganesh Venkitachalam and Beng-Hong Lim", title = "Virtualizing {I/O} Devices on {VMware Workstation}'s Hosted Virtual Machine Monitor", crossref = "USENIX:2001:PUA", pages = "??--??", year = "2001", bibdate = "Tue Oct 15 17:19:08 2002", bibsource = "https://www.math.utah.edu/pub/tex/bib/usenix2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.usenix.org/publications/library/proceedings/usenix01/sugerman.html", acknowledgement = ack-nhfb, } @InProceedings{Suri:2001:SCR, author = "Niranjan Suri", title = "State Capture and Resource Control for {Java}: The Design and Implementation of the {Aroma Virtual Machine}", crossref = "USENIX:2001:PJV", pages = "??--??", year = "2001", bibdate = "Tue Oct 15 17:45:19 2002", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/usenix2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.usenix.org/publications/library/proceedings/jvm01/JVM_wips/S15.pdf", acknowledgement = ack-nhfb, } @Article{vonLaszewski:2001:GBA, author = "Gregor von Laszewski and Kazuyuki Shudo and Yoichi Muraoka", title = "Grid-Based Asynchronous Migration of Execution Context in {Java} Virtual Machines", journal = j-LECT-NOTES-COMP-SCI, volume = "1900", pages = "22--??", year = "2001", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Sat Feb 2 13:02:44 MST 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1900.htm; https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1900/19000022.htm; http://link.springer-ny.com/link/service/series/0558/papers/1900/19000022.pdf", acknowledgement = ack-nhfb, fjournal = "Lecture Notes in Computer Science", } @Article{Wainer:2001:UAS, author = "Gabriel A. Wainer and Sergio Daicz and Luis F. De Simoni and Demian Wassermann", title = "Using the {Alfa-1} simulated processor for educational purposes", journal = j-JERIC, volume = "1", number = "4", pages = "111--151", month = dec, year = "2001", CODEN = "????", ISSN = "1531-4278", bibdate = "Tue Feb 3 18:43:37 MST 2004", bibsource = "http://www.acm.org/pubs/contents/journals/jeric/; https://www.math.utah.edu/pub/tex/bib/jeric.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "ACM Journal on Educational Resources in Computing (JERIC)", } @InProceedings{Welsh:2001:VCH, author = "M. Welsh and D. Culler", title = "Virtualization Considered Harmful: {OS} Design Directions for Well-Conditioned Services", crossref = "IEEE:2001:EIW", pages = "139--146", year = "2001", bibdate = "Fri Feb 22 11:41:03 MST 2002", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; OCLC Proceedings database", acknowledgement = ack-nhfb, } @Article{Widdowson:2001:JIS, author = "Liam Widdowson", title = "Jailed {Internet} Services", journal = j-SYS-ADMIN, volume = "10", number = "8", pages = "39, 41--42, 44--45", month = aug, year = "2001", CODEN = "SYADE7", ISSN = "1061-2688", bibdate = "Wed Jul 11 07:06:35 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/sysadmin.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.samag.com/", abstract = "Widdowson explains how to configure software to execute within a chroot jail and describes the security benefits.", acknowledgement = ack-nhfb, } @Article{Wilson:2001:UVD, author = "Brian Wilson", title = "Using {VMWare} as a Development Tool", journal = j-SYS-ADMIN, volume = "10", number = "3", pages = "57--59", month = mar, year = "2001", CODEN = "SYADE7", ISSN = "1061-2688", bibdate = "Wed Feb 14 09:44:56 MST 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.samag.com/", abstract = "Columns.", acknowledgement = ack-nhfb, fjournal = "Sys admin: the journal for UNIX system administrators", } @Article{Yehezkel:2001:TST, author = "Cecile Yehezkel and William Yurcik and Murray Pearson and Dean Armstrong", title = "Three simulator tools for teaching computer architecture: {Little Man} computer, and {RTLSim}", journal = j-JERIC, volume = "1", number = "4", pages = "60--80", month = dec, year = "2001", CODEN = "????", ISSN = "1531-4278", bibdate = "Tue Feb 3 18:43:37 MST 2004", bibsource = "http://www.acm.org/pubs/contents/journals/jeric/; https://www.math.utah.edu/pub/tex/bib/jeric.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "ACM Journal on Educational Resources in Computing (JERIC)", } @Article{Zhang:2001:HJAb, author = "Xiaolan Zhang and Margo Seltzer", title = "{HBench:Java}: an application-specific benchmarking framework for {Java Virtual Machines}", journal = j-CCPE, volume = "13", number = "8--9", pages = "775--792", month = jul # "\slash " # aug, year = "2001", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.578", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Wed Jul 25 10:55:47 MDT 2001", bibsource = "http://www.interscience.wiley.com/jpages/1532-0626; https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www3.interscience.wiley.com/journalfinder.html", URL = "http://www3.interscience.wiley.com/cgi-bin/abstract/84503219/START; http://www3.interscience.wiley.com/cgi-bin/fulltext?ID=84503219&PLACEBO=IE.pdf", acknowledgement = ack-nhfb, fjournal = "Concurrency and Computation: Prac\-tice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", } @Article{Anonymous:2002:CRJ, author = "Anonymous", title = "Conference Report: {{\em 2nd Java Virtual Machine Research and Technology Symposium}}", journal = j-LOGIN, volume = "27", number = "5", pages = "??--??", month = oct, year = "2002", CODEN = "LOGNEM", ISSN = "1044-6397", bibdate = "Tue Apr 11 10:52:12 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www.usenix.org/publications/login/2002-10/index.html", URL = "http://www.usenix.org/publications/library/proceedings/javavm02/JavaVM2002.pdf", acknowledgement = ack-nhfb, fjournal = ";login: the USENIX Association newsletter", } @MastersThesis{Arvizo:2002:VMT, author = "Teodoro Arvizo", title = "A virtual machine for a type-$ \omega $ denotational proof language", type = "Thesis ({M.Eng.} and {S.B.})", school = "Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology", address = "Cambridge, MA, USA", pages = "123", year = "2002", bibdate = "Mon Apr 10 11:22:36 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; library.mit.edu:9909/mit01", note = "Supervised by Howard E. Shrobe.", acknowledgement = ack-nhfb, } @Article{Barthe:2002:FCB, author = "Gilles Barthe and Guillaume Dufay and Line Jakubiec and Sim{\~a}o Melo de Sousa", title = "A Formal Correspondence between Offensive and Defensive {JavaCard} Virtual Machines", journal = j-LECT-NOTES-COMP-SCI, volume = "2294", pages = "32--??", year = "2002", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Tue Sep 10 19:09:17 MDT 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2294.htm; https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2294/22940032.htm; http://link.springer-ny.com/link/service/series/0558/papers/2294/22940032.pdf", acknowledgement = ack-nhfb, fjournal = "Lecture Notes in Computer Science", } @Book{Blunden:2002:VMD, author = "Bill Blunden", title = "Virtual machine design and implementation in {C/C++}", publisher = "Wordware Publishing", address = "Plano, TX, USA", pages = "xvii + 668", year = "2002", ISBN = "1-55622-903-8 (paperback)", ISBN-13 = "978-1-55622-903-9 (paperback)", LCCN = "QA76.9.V5 B59 2002", bibdate = "Thu Jul 14 12:01:14 MDT 2005", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.loc.gov:7090/Voyager", acknowledgement = ack-nhfb, libnote = "Not in my library.", subject = "Virtual computer systems; C++ (Computer program language)", } @Article{Bosilca:2002:OOE, author = "George Bosilca and Gilles Fedak and Franck Cappello", title = "{OVM}: {Out}-of-order execution parallel virtual machine", journal = j-FUT-GEN-COMP-SYS, volume = "18", number = "4", pages = "525--537", month = mar, year = "2002", CODEN = "FGSEVI", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Wed Feb 27 12:41:22 MST 2002", bibsource = "http://www.elsevier.com/locate/issn/0167739X; https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.elsevier.com/gej-ng/10/19/19/60/33/34/abstract.html", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Burch:2002:LGS, author = "Carl Burch", title = "{Logisim}: a graphical system for logic circuit design and simulation", journal = j-JERIC, volume = "2", number = "1", pages = "5--16", month = mar, year = "2002", CODEN = "????", ISSN = "1531-4278", bibdate = "Tue Feb 3 18:43:37 MST 2004", bibsource = "http://www.acm.org/pubs/contents/journals/jeric/; https://www.math.utah.edu/pub/tex/bib/jeric.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "ACM Journal on Educational Resources in Computing (JERIC)", } @Article{Czajkowski:2002:CSA, author = "Grzegorz Czajkowski and Laurent Dayn{\`e}s and Nathaniel Nystrom", title = "Code Sharing among Virtual Machines", journal = j-LECT-NOTES-COMP-SCI, volume = "2374", pages = "155--??", year = "2002", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Tue Sep 10 19:09:57 MDT 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2374.htm; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2374/23740155.htm; http://link.springer-ny.com/link/service/series/0558/papers/2374/23740155.pdf", acknowledgement = ack-nhfb, fjournal = "Lecture Notes in Computer Science", } @Article{Diessel:2002:THL, author = "O. Diessel and U. Malik and K. So", title = "Towards High-Level Specification, Synthesis, and Virtualization of Programmable Logic Designs (Research Note)", journal = j-LECT-NOTES-COMP-SCI, volume = "2400", pages = "314--??", year = "2002", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Tue Sep 10 19:10:14 MDT 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2400.htm; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2400/24000314.htm; http://link.springer-ny.com/link/service/series/0558/papers/2400/24000314.pdf", acknowledgement = ack-nhfb, fjournal = "Lecture Notes in Computer Science", } @Article{Dugan:2002:SIS, author = "B. Dugan and J. Zahorjan", title = "The {Sloop ISA} and the {SMOK} toolkit", journal = j-JERIC, volume = "2", number = "1", pages = "49--71", month = mar, year = "2002", CODEN = "????", ISSN = "1531-4278", bibdate = "Tue Feb 3 18:43:37 MST 2004", bibsource = "http://www.acm.org/pubs/contents/journals/jeric/; https://www.math.utah.edu/pub/tex/bib/jeric.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "ACM Journal on Educational Resources in Computing (JERIC)", } @Book{ECMA-335-2, author = "{ECMA}", title = "{ECMA-335}: {Common Language Infrastructure (CLI)}", publisher = pub-ECMA, address = pub-ECMA:adr, edition = "Second", pages = "iv + 99 (Part I), vii + 164 (Part II), iv + 124 (Part III), i + 16 (Part IV), ii + 78 (Part V)", month = dec, year = "2002", bibdate = "Mon May 16 06:24:46 2005", bibsource = "http://www.ecma-international.org/publications/standards/Standard.htm; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.ecma-international.org/publications/files/ECMA-ST/Ecma-335-xml.zip; http://www.ecma-international.org/publications/files/ECMA-ST/Ecma-335.pdf; http://www.ecma.ch/ecma1/STAND/ecma-335.htm", acknowledgement = ack-nhfb, ECMAnumber = "ECMA-335", remark = "Also ISO/IEC 23271.", } @Article{Ertl:2002:VGE, author = "M. Anton Ertl and David Gregg and Andreas Krall and Bernd Paysan", title = "{Vmgen} --- a generator of efficient virtual machine interpreters", journal = j-SPE, volume = "32", number = "3", pages = "265--294", month = mar, year = "2002", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/spe.434", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Fri Feb 22 12:06:59 MST 2002", bibsource = "http://www.interscience.wiley.com/jpages/0038-0644; https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www3.interscience.wiley.com/journalfinder.html", URL = "http://www.complang.tuwien.ac.at/anton/vmgen/; http://www.complang.tuwien.ac.at/papers/ertl+02.ps.gz; http://www3.interscience.wiley.com/cgi-bin/abstract/90010508/START; http://www3.interscience.wiley.com/cgi-bin/fulltext?ID=90010508&PLACEBO=IE.pdf", acknowledgement = ack-nhfb, fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", keywords = "byte code; Cacao virtual machine; Forth; generator; GForth virtual machine; interpreter; Java; stack architecture; virtual machine", } @Article{Folliot:2002:BFR, author = "B. Folliot and I. Piumarta and L. Seinturier and C. Baillarguet and C. Khoury and A. Leger and F. Ogel", title = "Beyond Flexibility and Reflection: The Virtual Virtual Machine Approach", journal = j-LECT-NOTES-COMP-SCI, volume = "2326", pages = "16--??", year = "2002", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Tue Sep 10 19:09:32 MDT 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2326.htm; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2326/23260016.htm; http://link.springer-ny.com/link/service/series/0558/papers/2326/23260016.pdf", acknowledgement = ack-nhfb, fjournal = "Lecture Notes in Computer Science", } @Article{Geist:2002:PVM, author = "Al Geist", title = "Petascale Virtual Machine: Computing on 100,000 Processors", journal = j-LECT-NOTES-COMP-SCI, volume = "2474", pages = "6--??", year = "2002", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Sat Nov 30 20:57:35 MST 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2474.htm; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer.de/link/service/series/0558/bibs/2474/24740006.htm; http://link.springer.de/link/service/series/0558/papers/2474/24740006.pdf", acknowledgement = ack-nhfb, fjournal = "Lecture Notes in Computer Science", } @Article{Ha:2002:AHS, author = "Yajun Ha and Radovan Hipik and Serge Vernalde and Diederik Verkest and Marc Engels and Rudy Lauwereins and Hugo De Man", title = "Adding Hardware Support to the {HotSpot} Virtual Machine for Domain Specific Applications", journal = j-LECT-NOTES-COMP-SCI, volume = "2438", pages = "1135--??", year = "2002", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Tue Sep 10 19:10:28 MDT 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2438.htm; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2438/24381135.htm; http://link.springer-ny.com/link/service/series/0558/papers/2438/24381135.pdf", acknowledgement = ack-nhfb, fjournal = "Lecture Notes in Computer Science", } @Article{Hoganson:2002:HPC, author = "Kenneth E. Hoganson", title = "High-performance computer architecture and algorithm simulator", journal = j-JERIC, volume = "2", number = "1", pages = "131--148", month = mar, year = "2002", CODEN = "????", ISSN = "1531-4278", bibdate = "Tue Feb 3 18:43:37 MST 2004", bibsource = "http://www.acm.org/pubs/contents/journals/jeric/; https://www.math.utah.edu/pub/tex/bib/jeric.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "ACM Journal on Educational Resources in Computing (JERIC)", } @InProceedings{Jacob:2002:CAP, author = "Matthias Jacob and Keith Randall", title = "Cross-Architectural Performance Portability of a {Java Virtual Machine} Implementation", crossref = "USENIX:2002:PJV", pages = "??--??", year = "2002", bibdate = "Tue Oct 15 12:37:27 2002", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/usenix2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.usenix.org/publications/library/proceedings/javavm02/jacob.html", acknowledgement = ack-nhfb, } @Article{Jung:2002:DIS, author = "Jun-Young Jung and Min-Soo Jung", title = "Design and Implementation of Small-Sized {Java Virtual Machine} on {Java} Platform {Jini}", journal = j-LECT-NOTES-COMP-SCI, volume = "2343", pages = "571--??", year = "2002", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Sat Nov 30 20:57:12 MST 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2343.htm; https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer.de/link/service/series/0558/bibs/2343/23430571.htm; http://link.springer.de/link/service/series/0558/papers/2343/23430571.pdf", acknowledgement = ack-nhfb, fjournal = "Lecture Notes in Computer Science", } @Article{Kasprzyk:2002:APV, author = "Leszek Kasprzyk and Ryszard Nawrowski and Andrzej Tomczewski", title = "Application of a Parallel Virtual Machine for the Analysis of a Luminous Field", journal = j-LECT-NOTES-COMP-SCI, volume = "2474", pages = "122--??", year = "2002", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Sat Nov 30 20:57:35 MST 2002", bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2474.htm; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer.de/link/service/series/0558/bibs/2474/24740122.htm; http://link.springer.de/link/service/series/0558/papers/2474/24740122.pdf", acknowledgement = ack-nhfb, fjournal = "Lecture Notes in Computer Science", } @Article{Levis:2002:MTV, author = "Philip Levis and David Culler", title = "{Mat{\'e}}: a tiny virtual machine for sensor networks", journal = j-COMP-ARCH-NEWS, volume = "30", number = "5", pages = "85--95", month = dec, year = "2002", CODEN = "CANED2", ISSN = "0163-5964 (ACM), 0884-7495 (IEEE)", ISSN-L = "0163-5964", bibdate = "Fri May 12 09:41:23 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGARCH Computer Architecture News", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89", } @Article{Magnusson:2002:SFS, author = "Peter S. Magnusson and Magnus Christensson and Jesper Eskilson and Daniel Forsgren and Gustav H{\aa}llberg and Johan H{\"o}gberg and Fredrik Larsson and Andreas Moestedt and Bengt Werner", title = "{Simics}: a Full System Simulation Platform", journal = j-COMPUTER, volume = "35", number = "2", pages = "50--58", month = feb, year = "2002", CODEN = "CPTRB4", ISSN = "0018-9162 (print), 1558-0814 (electronic)", ISSN-L = "0018-9162", bibdate = "Fri Feb 8 07:11:47 MST 2002", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://dlib.computer.org/co/books/co2002/pdf/r2050.pdf; http://www.computer.org/computer/co2002/r2050abs.htm", acknowledgement = ack-nhfb, fjournal = "Computer", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2", } @InProceedings{Mikheev:2002:OEJ, author = "V. Mikheev and N. Lipsky and D. Gurchenkov and P. Pavlov and V. Sukharev and A. MarkovS. Kuksenko and S. Fedoseev and D. Leskov and A. Yeryomin", editor = "", booktitle = "Proceedings of the third international workshop on Software and performance: WOSP '02, July 24--26, 2002 Rome, Italy", title = "Overview of {Excelsior JET}, a High Performance Alternative to {Java Virtual Machines}", publisher = pub-ACM, address = pub-ACM:adr, pages = "104--113", year = "2002", ISBN = "", ISBN-13 = "", LCCN = "", bibdate = "Mon Apr 18 15:13:51 2005", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, } @Article{Moure:2002:KS, author = "J. C. Moure and Dolores I. Rexachs and Emilio Luque", title = "The {KScalar} simulator", journal = j-JERIC, volume = "2", number = "1", pages = "73--116", month = mar, year = "2002", CODEN = "????", ISSN = "1531-4278", bibdate = "Tue Feb 3 18:43:37 MST 2004", bibsource = "http://www.acm.org/pubs/contents/journals/jeric/; https://www.math.utah.edu/pub/tex/bib/jeric.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "ACM Journal on Educational Resources in Computing (JERIC)", } @InProceedings{Rajan:2002:CPJ, author = "A. S. Rajan and Shiwen Hu and J. Rubio", title = "Cache performance in {Java} virtual machines: a study of constituent phases", crossref = "IEEE:2002:WII", pages = "81--90", year = "2002", bibdate = "Tue Oct 24 10:13:38 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "This paper studies the level 1 cache performance of Java programs by analyzing memory reference traces of the SPECjvm98 applications executed by the Latte Java virtual machine. We study in detail Java programs' cache performance of different access types in three JVM phases, under two execution modes, using three cache configurations and two application data sets. We observe that the poor data cache performance in the JIT execution mode is caused by code installation, when the data write miss rate in the execution engine can be as high as 70\%. In addition, code installation also deteriorates instruction cache performance during execution of translated code. High cache miss rate in garbage collection is mainly caused by large working set and pointer chasing of the garbage collector. A larger data cache works better on eliminating data cache read misses than write misses, and is more efficient on improving cache performance in the execution engine than in the garbage collection. As application data set increases in the JIT execution mode, instruction cache and data cache write miss rates of the execution engine decrease, while data cache read miss rate of the execution engine increases. On the other hand, impact of varying data set on cache performance is not as pronounced in the interpreted mode as in the JIT mode.", acknowledgement = ack-nhfb, } @InProceedings{Raner:2002:LJV, author = "Mirko Raner", title = "A Lightweight {Java Virtual Machine} for a Stack-Based Microprocessor", crossref = "USENIX:2002:PJV", pages = "??--??", year = "2002", bibdate = "Tue Oct 15 12:37:27 2002", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/usenix2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.usenix.org/publications/library/proceedings/javavm02/raner.html", acknowledgement = ack-nhfb, } @Article{Roblitz:2002:LSE, author = "Thomas R{\"o}blitz and Frank Mueller and Oliver B{\"u}hn", title = "{LegoSim}: simulation of embedded kernels over {Pthreads}", journal = j-JERIC, volume = "2", number = "1", pages = "117--130", month = mar, year = "2002", CODEN = "????", ISSN = "1531-4278", bibdate = "Tue Feb 3 18:43:37 MST 2004", bibsource = "http://www.acm.org/pubs/contents/journals/jeric/; https://www.math.utah.edu/pub/tex/bib/jeric.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "ACM Journal on Educational Resources in Computing (JERIC)", } @Book{Russell:2002:SCI, editor = "Steve Russell and others", title = "Server consolidation with the {IBM eServer xSeries 440} and {VMware ESX Server}", publisher = "IBM, International Technical Support Organization", address = "????", pages = "xiv + 222", month = NOV, year = "2002", ISBN = "0-7384-2684-9", ISBN-13 = "978-0-7384-2684-6", LCCN = "QA76.9.C55 S378 2002", bibdate = "Sun Apr 9 15:43:22 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.loc.gov:7090/Voyager", note = "Publication number SG24-6852-00.", series = "IBM redbooks", acknowledgement = ack-nhfb, subject = "Client/server computing; Management; Web servers; IBM computers", } @InProceedings{S:2002:SPI, author = "Venugopal K. S. and Geetha Manjunath and Venkatesh Krishnan", title = "{sEc}: a Portable Interpreter Optimizing Technique for Embedded {Java Virtual Machine}", crossref = "USENIX:2002:PJV", pages = "??--??", year = "2002", bibdate = "Tue Oct 15 12:37:27 2002", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/usenix2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.usenix.org/publications/library/proceedings/javavm02/venugopal.html", acknowledgement = ack-nhfb, } @Article{Shelburne:2002:PEP, author = "Brian J. Shelburne", title = "A {PDP-8} emulator program", journal = j-JERIC, volume = "2", number = "1", pages = "17--47", month = mar, year = "2002", CODEN = "????", DOI = "https://doi.org/10.1145/545197.545200", ISSN = "1531-4278", bibdate = "Thu Aug 07 17:10:23 2008", bibsource = "http://www.acm.org/pubs/contents/journals/jeric/; https://www.math.utah.edu/pub/tex/bib/jeric.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "The clean, simple, and elegant architecture of the classic PDP-8 makes it an ideal candidate for studying concepts in computer organization. The PDP-8 emulator program allows a user to write, edit, assemble, debug, trace, and execute PDP-8 machine code and PDP-8 assembler language programs. With it, the user can obtain a feel for the PDP-8. The PDP-8 emulator program includes a simple built-in text editor which is used to write and edit PDP-8 assembler language programs, an assembler to translate these programs into PDP-8 machine code, and a virtual PDP-8 engine upon which to execute the code. PDP-8 code can be executed from a debug screen display that allows the user to observe the contents of registers and memory as the code executes or code can be executed using an I/O interface that requires user-written PDP-8 I/O routines. This article provides an introduction to both the PDP-8 architecture and PDP-8 assembler language and discusses how to use the PDP-8 emulator program. The PDP-8 emulator program runs under MS-DOS in a command window.", acknowledgement = ack-nhfb, fjournal = "ACM Journal on Educational Resources in Computing (JERIC)", keywords = "virtual machine", } @Article{Surdeanu:2002:DPA, author = "Mihai Surdeanu and Dan Moldovan", title = "Design and Performance Analysis of a Distributed {Java Virtual Machine}", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "13", number = "6", pages = "611--627", month = jun, year = "2002", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2002.1011415", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Wed Oct 23 15:36:27 MDT 2002", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://dlib.computer.org/td/books/td2002/pdf/l0611.pdf; http://www.computer.org/tpds/td2002/l0611abs.htm", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Parallel and Distributed Systems", journal-URL = "http://www.computer.org/tpds/archives.htm", } @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; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGOPS Operating Systems Review", } @Book{Ward:2002:BVC, author = "Brian Ward", title = "The book of {VMware}: the complete guide to {VMware} workstation", publisher = pub-NO-STARCH, address = pub-NO-STARCH:adr, pages = "xv + 249", year = "2002", ISBN = "1-886411-72-7", ISBN-13 = "978-1-886411-72-2", LCCN = "QA76.76.O63 W3653 2002", bibdate = "Sat Dec 06 08:24:50 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", price = "US\$39.95", acknowledgement = ack-nhfb, } @Article{Wells:2002:HMA, author = "Paul Damian Wells", title = "The {HSSM} macro-architecture, {Virtual Machine} and {H} languages", journal = j-SIGPLAN, volume = "37", number = "4", pages = "74--82", month = apr, year = "2002", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu May 15 12:23:01 MDT 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", keywords = "Hierarchical Simultaneous Set Membership (HSSM)", } @Article{Whaley:2002:AEO, author = "John Whaley and Michael C. Martin and Monica S. Lam", title = "Automatic extraction of object-oriented component interfaces", journal = j-SIGSOFT, volume = "27", number = "4", pages = "218--228", month = jul, year = "2002", CODEN = "SFENDP", DOI = "https://doi.org/10.1145/566171.566212", ISSN = "0163-5948 (print), 1943-5843 (electronic)", ISSN-L = "0163-5948", bibdate = "Wed Aug 1 17:14:20 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsoft2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Component-based software design is a popular and effective approach to designing large systems. While components typically have well-defined interfaces, sequencing information---which calls must come in which order---is often not formally specified. This paper proposes using multiple finite statemachine (FSM) submodels to model the interface of a class. A submodel includes a subset of methods that, for example, implement a Java interface, or access some particular field. Each state-modifying method is represented as a state in the FSM, and transitions of the FSMs represent allow able pairs of consecutive methods. In addition, state-preserving methods are constrained to execute only under certain states. We have designed and implemented a system that includes static analyses to deduce illegal call sequences in a program, dynamic instrumentation techniques to extract models from execution runs, and a dynamic model checker that ensures that the code conforms to the model. Extracted models can serve as documentation; they can serve as constraints to be enforced by a static checker; they can be studied directly by developers to determine if the program is exhibiting unexpected behavior; or they can be used to determine the completeness of a test suite. Our system has been run on several large code bases, including the joeq virtual machine, the basic Java libraries, and the Java 2 Enterprise Edition library code. Our experience suggests that this approach yields useful information.", acknowledgement = ack-nhfb, fjournal = "ACM SIGSOFT Software Engineering Notes", journal-URL = "https://dl.acm.org/citation.cfm?id=J728", } @Article{Yurcik:2002:SIS, author = "William (Bill) Yurcik", title = "Special issue on {\em specialized\/} computer architecture simulators that see the present and may hold the future", journal = j-JERIC, volume = "2", number = "1", pages = "1--3", month = mar, year = "2002", CODEN = "????", ISSN = "1531-4278", bibdate = "Tue Feb 3 18:43:37 MST 2004", bibsource = "http://www.acm.org/pubs/contents/journals/jeric/; https://www.math.utah.edu/pub/tex/bib/jeric.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "ACM Journal on Educational Resources in Computing (JERIC)", } @InProceedings{Ahmad:2003:ADP, author = "I. Ahmad and J. M. Anderson and A. M. Holler and R. Kambo and V. Makhija", title = "An analysis of disk performance in {VMware ESX Server} virtual machines", crossref = "IEEE:2003:IIW", pages = "65--76", year = "2003", DOI = "https://doi.org/10.1109/WWC.2003.1249058", bibdate = "Sat Oct 14 17:02:30 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "VMware ESX Server is a software platform that efficiently multiplexes the hardware resources of a server among virtual machines. This paper studies the performance of a key component of the ESX Server architecture: its storage subsystem. We characterize the performance of native systems and virtual machines using a series of disk microbenchmarks on several different storage systems. We show that the virtual machines perform well compared to native, and that the I/O behavior of virtual machines closely matches that of the native server. We then discuss how the microbenchmarks can be used to estimate virtual machine performance for disk-intensive applications by studying two workloads: a simple file server and a commercial mail server.", acknowledgement = ack-nhfb, } @Article{Anonymous:2003:PJU, author = "Anonymous", title = "Products: {JetBrains} Upgrades {IntelliJ Java IDE}; {Catalyst}'s {USB} Analyzer Supports Device Emulation; {VMware} Releases {Enterprise Server VM} Software; {Motorola} Offers Free Soft Modem Reference Design; {RealNetworks} Releases Source for {Helix DNA Server}; {Packeteer} Accelerates Intranet and {Internet} Applications", journal = j-COMPUTER, volume = "36", number = "3", pages = "80--81", month = mar, year = "2003", CODEN = "CPTRB4", ISSN = "0018-9162 (print), 1558-0814 (electronic)", ISSN-L = "0018-9162", bibdate = "Fri Dec 12 19:53:55 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/computer2000.bib; https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://csdl.computer.org/dl/mags/co/2003/03/r3080.htm; http://csdl.computer.org/dl/mags/co/2003/03/r3080.pdf", acknowledgement = ack-nhfb, fjournal = "Computer", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2", } @Article{Anonymous:2003:PVF, author = "Anonymous", title = "Products: {VMware}'s Fourth-Generation Desktop Virtualization Software; Automated Design Reviews with {Reviewer for Rose}; {CodeWeavers} Debues {CrossOver Office}; {Corel Smart Graphics Studio} Now Available; {IronGrid}'s {Java} Performance Tool; {Infragistics} Releases {NetAdvantage} Component Collection", journal = j-COMPUTER, volume = "36", number = "6", pages = "98--99", month = jun, year = "2003", CODEN = "CPTRB4", ISSN = "0018-9162 (print), 1558-0814 (electronic)", ISSN-L = "0018-9162", bibdate = "Fri Dec 12 19:53:41 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/computer2000.bib; https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://csdl.computer.org/dl/mags/co/2003/06/r6098.htm; http://csdl.computer.org/dl/mags/co/2003/06/r6098.pdf", acknowledgement = ack-nhfb, fjournal = "Computer", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2", } @InProceedings{Barham:2003:VMM, author = "Paul Barham and Boris Dragovic and Keir Fraser and Steven Hand and Tim Harris and Alex Ho and Rolf Neugebauer and Ian Pratt and Andrew Warfield", title = "Virtual machine monitors: {Xen} and the art of virtualization", crossref = "ACM:2003:SPA", pages = "164--177", year = "2003", DOI = "https://doi.org/10.1145/945445.945462", bibdate = "Sat Oct 14 13:33:07 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Numerous systems have been designed which use virtualization to subdivide the ample resources of a modern computer. Some require specialized hardware, or cannot support commodity operating systems. Some target 100\% binary compatibility at the expense of performance. Others sacrifice security or functionality for speed. Few offer resource isolation or performance guarantees; most provide only best-effort provisioning, risking denial of service.This paper presents Xen, an x86 virtual machine monitor which allows multiple commodity operating systems to share conventional hardware in a safe and resource managed fashion, but without sacrificing either performance or functionality. This is achieved by providing an idealized virtual machine abstraction to which operating systems such as Linux, BSD and Windows XP, can be ported with minimal effort.Our design is targeted at hosting up to 100 virtual machine instances simultaneously on a modern server. The virtualization approach taken by Xen is extremely efficient: we allow operating systems such as Linux and Windows XP to be hosted simultaneously for a negligible performance overhead --- at most a few percent compared with the unvirtualized case. We considerably outperform competing commercial and freely available solutions in a range of microbenchmarks and system-wide tests.", acknowledgement = ack-nhfb, } @Article{Breg:2003:JVM, author = "Fabian Breg and Constantine D. Polychronopoulos", title = "{Java Virtual Machine} support for object serialization", journal = j-CCPE, volume = "15", number = "3--5", pages = "263--275", month = mar # "\slash " # apr, year = "2003", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.667", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Tue Jan 13 09:28:08 MST 2004", bibsource = "http://www.interscience.wiley.com/jpages/1532-0626; https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www3.interscience.wiley.com/journalfinder.html", acknowledgement = ack-nhfb, fjournal = "Concurrency and Computation: Prac\-tice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", onlinedate = "12 Feb 2003", } @Article{Brown:2003:SFE, author = "Rhodes Brown and Karel Driesen and David Eng and Laurie Hendren and John Jorgensen and Clark Verbrugge and Qin Wang", title = "{STEP}: a framework for the efficient encoding of general trace data", journal = j-SIGSOFT, volume = "28", number = "1", pages = "27--34", month = jan, year = "2003", CODEN = "SFENDP", DOI = "https://doi.org/10.1145/634636.586103", ISSN = "0163-5948 (print), 1943-5843 (electronic)", ISSN-L = "0163-5948", bibdate = "Wed Aug 1 17:14:25 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/sigsoft2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Traditional tracing systems are often limited to recording a fixed set of basic program events. This limitation can frustrate an application or compiler developer who is trying to understand and characterize the complex behavior of software systems such as a Java program running on a Java Virtual Machine. In the past, many developers have resorted to specialized tracing systems that target a particular type of program event. This approach often results in an obscure and poorly documented encoding format which can limit the reuse and sharing of potentially valuable information. To address this problem, we present STEP, a system designed to provide profiler developers with a standard method for encoding general program trace data in a flexible and compact format. The system consists of a trace data definition language along with a compiler and an architecture that simplifies the client interface by encapsulating the details of encoding and interpretation.", acknowledgement = ack-nhfb, fjournal = "ACM SIGSOFT Software Engineering Notes", journal-URL = "https://dl.acm.org/citation.cfm?id=J728", } @Article{Cai:2003:THI, author = "H. Cai and A. J. Wellings", title = "Towards a High Integrity Real-Time {Java} Virtual Machine", journal = j-LECT-NOTES-COMP-SCI, volume = "2889", pages = "319--334", year = "2003", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Tue Dec 2 18:51:43 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; Ingenta database", acknowledgement = ack-nhfb, fjournal = "Lecture Notes in Computer Science", } @Article{Chen:2003:EJV, author = "D. Chen and V. Talwar", title = "Extending {Java Virtual Machines} for networked embedded devices", journal = "Research Disclosure", volume = "475", publisher = "Kenneth Mason Publications", pages = "475/076", year = "2003", CODEN = "????", ISSN = "0374-4353", bibdate = "Mon Dec 8 15:22:46 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; Ingenta database", acknowledgement = ack-nhfb, } @Book{Compton:2003:VL, author = "Jason Compton", title = "{VMware 2} for {Linux}", publisher = "Premier Press", address = "Rocklin, CA, USA", pages = "xxii + 406", year = "2003", ISBN = "0-7615-2764-8", ISBN-13 = "978-0-7615-2764-0", LCCN = "QA76.76.O63 C656 2000", bibdate = "Sat Dec 06 08:42:35 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "Includes CD-ROM.", price = "US\$39.99", acknowledgement = ack-nhfb, } @Article{Debbabi:2003:MCA, author = "M. Debbabi and M. Erhioui and L. Ketari and N. Tawbi and H. Yahyaoui and S. Zhioua", title = "Method Call Acceleration in Embedded {Java} Virtual Machines", journal = j-LECT-NOTES-COMP-SCI, volume = "2659", pages = "750--759", year = "2003", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Wed Jul 9 10:18:07 MDT 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; Ingenta database", acknowledgement = ack-nhfb, fjournal = "Lecture Notes in Computer Science", } @Article{Eeckhout:2003:HJP, author = "Lieven Eeckhout and Andy Georges and Koen {De Bosschere}", title = "How {Java} programs interact with virtual machines at the microarchitectural level", journal = j-SIGPLAN, volume = "38", number = "11", pages = "169--186", month = nov, year = "2003", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:34 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @Article{Ertl:2003:OIB, author = "M. Anton Ertl and David Gregg", title = "Optimizing indirect branch prediction accuracy in virtual machine interpreters", journal = j-SIGPLAN, volume = "38", number = "5", pages = "278--288", month = may, year = "2003", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat Oct 11 12:45:00 MDT 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @Article{Friedman:2003:TFT, author = "R. Friedman and A. Kama", title = "Transparent Fault-Tolerant {Java Virtual Machine}", journal = "Proceedings of the Symposium on Reliable Distributed Systems", volume = "EDIT22", pages = "319--328", year = "2003", CODEN = "????", ISSN = "1060-9857", bibdate = "Mon Dec 8 15:22:46 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; Ingenta database", acknowledgement = ack-nhfb, } @Article{GomezMartin:2003:JVE, author = "P. P. GomezMartin and M. A. GomezMartin and P. A. GonzalezCalero", title = "{Javy}: Virtual Environment for Case-Based Teaching of {Java Virtual Machine}", journal = j-LECT-NOTES-COMP-SCI, volume = "2773", pages = "906--913", year = "2003", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Tue Oct 21 05:29:09 MDT 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; Ingenta database", acknowledgement = ack-nhfb, fjournal = "Lecture Notes in Computer Science", } @Article{Gregg:2003:PID, author = "David Gregg and James Power and John Waldron", title = "Platform independent dynamic {Java} virtual machine analysis: the {Java Grande Forum} benchmark suite", journal = j-CCPE, volume = "15", number = "3--5", pages = "459--484", month = mar # "\slash " # apr, year = "2003", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.666", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Tue Jan 13 09:28:08 MST 2004", bibsource = "http://www.interscience.wiley.com/jpages/1532-0626; https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www3.interscience.wiley.com/journalfinder.html", acknowledgement = ack-nhfb, fjournal = "Concurrency and Computation: Prac\-tice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", onlinedate = "12 Feb 2003", } @Article{Hu:2003:DJV, author = "E. Y. S. Hu and A. J. Wellings and G. Bernat", title = "Deriving {Java Virtual Machine} Timing Models for Portable Worst-Case Execution Time Analysis", journal = j-LECT-NOTES-COMP-SCI, volume = "2889", pages = "411--424", year = "2003", CODEN = "LNCSD9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Tue Dec 2 18:51:43 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; Ingenta database", acknowledgement = ack-nhfb, fjournal = "Lecture Notes in Computer Science", } @PhdThesis{Ive:2003:TER, author = "Anders Ive", title = "Towards an embedded real-time {Java Virtual Machine}", volume = "20", type = "Thesis (fil.dr.)", school = "Lund University, Department of Computer Science", address = "Lund, Sweden", pages = "viii + 139", year = "2003", LCCN = "????", bibdate = "Mon Apr 10 10:43:56 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.bibsys.no:2100/BIBSYS", series = "Dissertation / Department of Computer Science, Lund University", acknowledgement = ack-nhfb, subject = "JVM; microsystems", } @InProceedings{McAuley:2003:CVC, author = "Derek McAuley and Rolf Neugebauer", title = "A case for virtual channel processors", crossref = "ACM:2003:ATA", pages = "237--242", year = "2003", DOI = "https://doi.org/10.1145/944747.944758", bibdate = "Sat Oct 14 14:03:33 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Modern desktop and server computer systems use multiple processors: general purpose CPU(s), graphic processor (GPU), network processors (NP) on Network Interface Cards (NICs), RAID controllers, and signal processors on sound cards and modems. Some of these processors traditionally have been special purpose processors but there is a trend towards replacing some of these with embedded general purpose processors. At the same time main CPUs become more powerful; desktop CPUs start featuring Simultaneous Multi-Threading (SMT); and Symmetric Multi-Processing (SMP) systems are widely used in server systems. However, the structure of operating systems has not really changed to reflect these trends --- different types of processors evolve at different time scales (largely driven by market forces) requiring significant changes to operating systems kernels to reflect the appropriate tradeoffs.In this position paper we propose to re-vitalise the old idea of channel processors by encapsulating operating system I/O subsystems in Virtual Channel Processors (VCPs). VCPs perform I/O operations on behalf of an OS. They provide similar development, performance, and fault isolation as dedicated (embedded) I/O processors do while offering the flexibility to split functionality between the main processor(s) and dedicated processors without affecting the rest of the OS. If part of a VCP is executed on the main processor, we propose to make use of virtual machine technology and SMT/SMP features to isolate its performance from that of the rest of the system and to protect the system from faults within the VCP.", acknowledgement = ack-nhfb, } @Article{Mengant:2003:NBJ, author = "J. Y. Mengant", title = "{A.NET} Bridge to a {Java Virtual Machine}: {Java} and {.NET} interoperability, with a little help from {C++}", journal = j-CCCUJ, volume = "21", number = "10", pages = "28", year = "2003", CODEN = "CCUJEX", ISSN = "1075-2838", bibdate = "Tue Oct 7 05:32:12 MDT 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; Ingenta database", acknowledgement = ack-nhfb, fjournal = "C/C++ Users Journal", } @MastersThesis{Panesar-Walawege:2003:VHM, author = "Rajwinder Kaur Panesar-Walawege", title = "{Views}: a platform-independent {GUI} toolkit for the shared-source {Common Language Infrastructure}", type = "Thesis ({M. Sc.})", publisher = "National Library of Canada = Biblioth\`eque nationale du Canada", school = "University of Victoria", address = "Victoria, BC, Canada", year = "2003", ISBN = "0-612-85233-4", ISBN-13 = "978-0-612-85233-4", LCCN = "????", bibdate = "Mon May 17 09:04:07 MDT 2010", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", series = "Canadian theses = Th\`eses canadiennes.", acknowledgement = ack-nhfb, } @Book{Ragsdale:2003:CLI, author = "Susann Ragsdale and David Sussman and Mark Fussell", title = "The {Common Language Infrastructure} Annotated Standard", publisher = pub-AW, address = pub-AW:adr, pages = "826", year = "2003", ISBN = "0-321-15493-2", ISBN-13 = "978-0-321-15493-4", LCCN = "????", bibdate = "Mon May 17 09:04:07 MDT 2010", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", series = "Microsoft.NET development series", acknowledgement = ack-nhfb, subject = "object-oriented methods (computer science); Microsoft.NET Framework", } @Article{Requet:2003:BME, author = "Antoine Requet", title = "A {B} model for ensuring soundness of a large subset of the {Java Card} virtual machine", journal = j-SCI-COMPUT-PROGRAM, volume = "46", number = "3", pages = "283--306", month = mar, year = "2003", CODEN = "SCPGD4", ISSN = "0167-6423 (print), 1872-7964 (electronic)", ISSN-L = "0167-6423", bibdate = "Sun Jan 11 10:42:01 MST 2004", bibsource = "http://www.elsevier.com/locate/issn/01676423; https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/scicomputprogram.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www.sciencedirect.com/science/journal/01676423", acknowledgement = ack-nhfb, fjournal = "Science of Computer Programming", journal-URL = "http://www.sciencedirect.com/science/journal/01676423", } @Article{Shaylor:2003:JVM, author = "Nik Shaylor and Douglas N. Simon and William R. Bush", title = "A {Java} Virtual Machine Architecture for Very Small Devices", journal = j-SIGPLAN, volume = "38", number = "7", pages = "34--41", month = jul, year = "2003", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat Oct 11 12:45:03 MDT 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; Ingenta database", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @Article{Shippy:2003:PGT, author = "P. J. Shippy", title = "Porting the {Gnat} Tasking Runtime System to the {Java Virtual Machine}", journal = "Literary Review", volume = "47", number = "2", pages = "119--120", year = "2003", CODEN = "????", ISSN = "0024-4589", bibdate = "Mon Apr 5 09:19:58 MDT 2004", bibsource = "https://www.math.utah.edu/pub/tex/bib/gnu.bib; https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; Ingenta database", acknowledgement = ack-nhfb, } @Article{Stefanovic:2003:OFG, author = "Darko Stefanovi{\'c} and Matthew Hertz and Stephen M. Blackburn and Kathryn S. McKinley and J. Eliot B. Moss", title = "Older-first Garbage Collection in Practice: Evaluation in a {Java} Virtual Machine", journal = j-SIGPLAN, volume = "38", number = "2s", pages = "25--36", month = feb, year = "2003", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu May 15 12:23:14 MDT 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; Ingenta database", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @Book{Stutz:2003:SSC, author = "David Stutz and Ted Neward and Geoff Shilling", title = "Shared Source {CLI} Essentials", publisher = pub-ORA, address = pub-ORA:adr, pages = "xviii + 357", year = "2003", ISBN = "0-596-00351-X", ISBN-13 = "978-0-596-00351-7", LCCN = "QA76.625 .S76 2003", bibdate = "Mon Apr 18 15:05:28 MDT 2005", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www.oreilly.com/catalog/prdindex.html; z3950.loc.gov:7090/Voyager", price = "US\$34.95", URL = "http://www.oreilly.com/catalog/9780596003517; http://www.oreilly.com/catalog/sscliess", acknowledgement = ack-nhfb, publishersummary = "This concise and insightful guide provides a roadmap for anyone trying to navigate or manipulate the Shared Source CLI code (codenamed ``Rotor''). With as many as 1.3 million lines of code in 14,000 files, this book is absolutely necessary for anyone who wants to jump into the complex nucleus of Microsoft's .NET Platform. The book includes a CD-ROM that contains all the source code and files.", subject = "Internet programming; Microsoft .NET Framework; Virtual computer systems", } @Article{Tikir:2003:RDS, author = "Mustafa M. Tikir and Jeffrey K. Hollingsworth and Guei-Yuan Lueh", title = "Recompilation for debugging support in a {JIT-compiler}", journal = j-SIGSOFT, volume = "28", number = "1", pages = "10--17", month = jan, year = "2003", CODEN = "SFENDP", DOI = "https://doi.org/10.1145/634636.586100", ISSN = "0163-5948 (print), 1943-5843 (electronic)", ISSN-L = "0163-5948", bibdate = "Wed Aug 1 17:14:25 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/sigsoft2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "A static Java compiler converts Java source code into a verifiably secure and compact architecture-neutral intermediate format, called Java byte codes. The Java byte codes can be either interpreted by a Java Virtual Machine or translated into native code by Java Just-In-Time compilers. Static Java compilers embed debug information in the Java class files to be used by the source level debuggers. However, the debug information is generated for architecture independent byte codes and most of the debug information is valid only when the byte codes are interpreted. Translating byte codes into native instructions puts a limitation on the amount of usable debug information that can be used by source level debuggers. In this paper, we present a new technique to generate valid debug information when Just-In-Time compilers are used. Our approach is based on the dynamic recompilation of Java methods by a fast code generator and lazily generates debug information when it is required. We also present three implementations for field watch support in the Java Virtual Machine Debugger Interface to investigate the runtime overhead and code size growth by our approach.", acknowledgement = ack-nhfb, fjournal = "ACM SIGSOFT Software Engineering Notes", journal-URL = "https://dl.acm.org/citation.cfm?id=J728", } @InProceedings{Vogels:2003:HNC, author = "Werner Vogels", title = "{HPC.NET} --- are {CLI}-based Virtual Machines Suitable for High Performance Computing?", crossref = "ACM:2003:SII", pages = "??--??", year = "2003", bibdate = "Wed Nov 26 07:34:20 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sc-conference.org/sc2003/inter_cal/inter_cal_detail.php?eventid=10710#2; http://www.sc-conference.org/sc2003/paperpdfs/pap251.pdf", abstract = "The Common Language Infrastructure is a new, standardized virtual machine that is likely to become popular on several platforms. In this paper we review whether this technology has any future in the high-performance computing community, for example by targeting the same application space as the Java-Grande Forum. We review the technology by benchmarking three implementations of the CLI and compare those with the results on Java virtual machines.", acknowledgement = ack-nhfb, } @Book{Ward:2003:VWH, author = "Brian Ward and Gerhard Franken", title = "{VMware Workstation: [das Handbuch; Installation, Konfiguration, Anwendung und Troubleshooting; Gast-Systeme: Windows, Linux, BSD, Novell NetWare, Solaris, FreeDOS und Oberon; virtuelle Netzwerke, Netzwerkkonfiguration und -dienste]}", publisher = "mitp-Verl.", address = "Landsberg, Germany", pages = "336", year = "2003", ISBN = "3-8266-0964-6", ISBN-13 = "978-3-8266-0964-0", LCCN = "????", bibdate = "Sat Oct 14 17:21:53 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.gbv.de:20011/gvk", price = "EUR 32.00 (DE)", URL = "http://www.gbv.de/du/services/agi/FCC0A57071BE8695C125704A0029797F/FLMA122525", acknowledgement = ack-nhfb, language = "German", subject = "VMware Workstation", } @Book{Adra:2004:APV, editor = "Bill Adra and others", title = "Advanced {POWER} virtualization on {IBM e-server p5} servers. Introduction and basic configuration", publisher = pub-IBM, address = pub-IBM:adr, pages = "xviii + 268", year = "2004", ISBN = "0-7384-9081-4", ISBN-13 = "978-0-7384-9081-6", LCCN = "QA76.9.V5 A378 2004", bibdate = "Thu Jan 21 14:10:00 MST 2010", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.loc.gov:7090/Voyager", series = "IBM redbooks", URL = "http://www.loc.gov/catdir/toc/fy0608/2005274479.html", acknowledgement = ack-nhfb, subject = "Virtual computer systems", } @Article{Anonymous:2004:CRV, author = "Anonymous", title = "Conference Report: {{\em 3rd Virtual Machine Research and Technology Symposium (VM '04)}}", journal = j-LOGIN, volume = "29", number = "4", pages = "??--??", month = aug, year = "2004", CODEN = "LOGNEM", ISSN = "1044-6397", bibdate = "Tue Apr 11 10:52:40 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www.usenix.org/publications/login/2004-08/index.html", URL = "http://www.usenix.org/publications/login/2004-08/openpdfs/vm04reports.pdf", acknowledgement = ack-nhfb, fjournal = ";login: the USENIX Association newsletter", } @Book{Bastiaansen:2004:RGU, author = "Rob Bastiaansen", title = "{Rob}'s Guide to Using {VMWARE}", publisher = "Books4Brains", address = "????", pages = "268 (est.)", year = "2004", ISBN = "90-808934-1-2", ISBN-13 = "978-90-808934-1-2", LCCN = "????", bibdate = "Sat Oct 14 17:57:33 2006", bibsource = "http://www.comcol.nl/detail/55734.htm; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, } @Article{Davoli:2004:TOS, author = "Renzo Davoli", title = "Teaching operating systems administration with {User Mode Linux}", journal = j-SIGCSE, volume = "36", number = "3", pages = "112--116", month = sep, year = "2004", CODEN = "SIGSD3", DOI = "https://doi.org/10.1145/1026487.1008027", ISSN = "0097-8418 (print), 2331-3927 (electronic)", ISSN-L = "0097-8418", bibdate = "Sat Nov 17 16:57:09 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigcse2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "User Mode Linux is a virtual machine running on a GNU-Linux operating system. It is the right choice for teaching operating systems' administration, as it does not need any dedicated hardware. It runs at user level (no need for root, i.e., administrator, access or possible security threats) and it does not have the performance problems of an emulator. This paper describes how to set up a laboratory for teaching operating systems' administration.", acknowledgement = ack-nhfb, fjournal = "SIGCSE Bulletin (ACM Special Interest Group on Computer Science Education)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J688", } @Article{Doyle:2004:DIM, author = "Patrick Doyle and Carlos Cavanna and Tarek S. Abdelrahman", title = "The design and implementation of a modular and extensible {Java Virtual Machine}", journal = j-SPE, volume = "34", number = "3", pages = "287--313", month = mar, year = "2004", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/spe.565", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Sat Apr 16 07:26:27 MDT 2005", bibsource = "http://www.interscience.wiley.com/jpages/0038-0644; https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www3.interscience.wiley.com/journalfinder.html", acknowledgement = ack-nhfb, fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", onlinedate = "5 Jan 2004", } @Book{Dufrasne:2004:IVE, editor = "Bertrand Dufrasne and others", title = "Implementing {VMware ESX Server} with {IBM TotalStorage FAStT}", publisher = "IBM, International Support Organization", address = "????", pages = "xvi + 246", month = sep, year = "2004", ISBN = "0-7384-9134-9", ISBN-13 = "978-0-7384-9134-9", LCCN = "TK5105.86 I475 2004", bibdate = "Sun Apr 9 15:43:22 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.loc.gov:7090/Voyager", note = "Publication number SG24-6434-00.", series = "IBM redbooks", acknowledgement = ack-nhfb, subject = "Storage area networks (Computer networks); Web servers; IBM computers", } @InProceedings{Ho:2004:PPD, author = "Alex Ho and Steven Hand and Tim Harris", title = "{PDB}: Pervasive Debugging With {Xen}", crossref = "IEEE:2004:FIA", pages = "260--265", year = "2004", DOI = "https://doi.org/10.1109/GRID.2004.49", bibdate = "Sat Oct 14 14:20:54 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Building distributed grid applications is notoriously difficult: the complex interactions between concurrently running processes, middleware, operating systems, underlying devices, and interconnecting networks can lead to unpredictable and difficult to analyze errors. Yet debugging support for such systems is woefully inadequate; typically a central user interface coordinates a set of conventional debuggers. This structure leads to synchronization problems and is limited to debugging user-mode applications. In this paper we present the design and implementation of PDB, a pervasive debugger which executes in a virtualization layer underneath the entire distributed system. By running each node of a distributed application in a separate virtual environment atop the debugger, PDB can exercise full control over the entire execution environment.", acknowledgement = ack-nhfb, } @InProceedings{Hohmuth:2004:RTS, author = "Michael Hohmuth and Michael Peter and Hermann H{\"a}rtig and Jonathan S. Shapiro", title = "Reducing {TCB} size by using untrusted components: small kernels versus virtual-machine monitors", crossref = "ACM:2004:PWA", pages = "??--??", year = "2004", DOI = "https://doi.org/10.1145/1133572.1133615", bibdate = "Sat Oct 14 14:28:03 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Secure systems are best built on top of a small trusted operating system: The smaller the operating system, the easier it can be assured or verified for correctness.In this paper, we oppose the view that virtual-machine monitors (VMMs) are the smallest systems that provide secure isolation because they have been specifically designed to provide little more than this property. The problem with this assertion is that VMMs typically do not support interprocess communication, complicating the use of untrusted components inside a secure systems.We propose extending traditional VMMs with features for secure message passing and memory sharing to enable the use of untrusted components in secure systems. We argue that moving system components out of the TCB into the untrusted part of the system and communicating with them using IPC reduces the overall size of the TCB.We argue that many secure applications can make use of untrusted components through trusted wrappers without risking security properties such as confidentiality and integrity.", acknowledgement = ack-nhfb, articlenumber = "22", } @Article{Hu:2004:TLI, author = "Ji Hu and Christoph Meinel and Michael Schmitt", title = "Tele-lab {IT} security: an architecture for interactive lessons for security education", journal = j-SIGCSE, volume = "36", number = "1", pages = "412--416", month = mar, year = "2004", CODEN = "SIGSD3", DOI = "https://doi.org/10.1145/1028174.971440", ISSN = "0097-8418 (print), 2331-3927 (electronic)", ISSN-L = "0097-8418", bibdate = "Sat Nov 17 16:57:06 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigcse2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "IT security education is an important activity in computer science education. The broad range of existing security threats makes it necessary to teach students the principles of IT security as well as to let them gain hands-on experience. In order to enable students to practice IT security anytime anywhere, a novel tutoring system is being developed at the University of Trier, Germany, which allows them to get familiar with security technologies and tools via the Internet. Based on virtual machine technology, users are able to perform exercises on a Linux system instead of in a restricted simulation environment. This paper describes the user interface of the Tele-Lab IT Security, its system architecture and its functional components.", acknowledgement = ack-nhfb, fjournal = "SIGCSE Bulletin (ACM Special Interest Group on Computer Science Education)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J688", } @Article{Huang:2004:MDS, author = "Lan Huang and Gang Peng and Tzi-cker Chiueh", title = "Multi-dimensional storage virtualization", journal = j-SIGMETRICS, volume = "32", number = "1", pages = "14--24", month = jun, year = "2004", CODEN = "????", DOI = "https://doi.org/10.1145/1012888.1005692", ISSN = "0163-5999 (print), 1557-9484 (electronic)", ISSN-L = "0163-5999", bibdate = "Fri Jun 27 09:21:18 MDT 2008", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigmetrics.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Most state-of-the-art commercial storage virtualization systems focus only on one particular storage attribute, capacity. This paper describes the design, implementation and evaluation of a {\em multi-dimensional storage virtualization\/} system called Stonehenge, which is able to virtualize a cluster-based physical storage system along multiple dimensions, including bandwidth, capacity, and latency. As a result, Stonehenge is able to multiplex multiple virtual disks, each with a distinct bandwidth, capacity, and latency attribute, on a single physical storage system as if they are separate physical disks. A key enabling technology for Stonehenge is an efficiency-aware real-time disk scheduling algorithm called dual-queue disk scheduling, which maximizes disk utilization efficiency while providing Quality of Service (QoS) guarantees. To optimize disk utilization efficiency, Stonehenge exploits run-time measurements extensively, for admission control, computing latency-derived bandwidth requirement, and predicting disk service time.", acknowledgement = ack-nhfb, fjournal = "ACM SIGMETRICS Performance Evaluation Review", journal-URL = "http://portal.acm.org/toc.cfm?id=J618", keywords = "quality of service; storage virtualization", } @InProceedings{Krsul:2004:VPM, author = "Ivan Krsul and Arijit Ganguly and Jian Zhang and Jose A. B. Fortes and Renato J. Figueiredo", title = "{VMPlants}: Providing and Managing Virtual Machine Execution Environments for {Grid} Computing", crossref = "ACM:2004:SHP", pages = "7--??", year = "2004", DOI = "https://doi.org/10.1109/SC.2004.67", bibdate = "Sat Oct 14 14:33:45 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Virtual machines provide flexible, powerful execution environments for Grid computing, offering isolation and security mechanisms complementary to operating systems, customization and encapsulation of entire application environments, and support for legacy applications. This paper describes a Grid service, VMPlant, that provides for automated configuration and creation of flexible VMs that, once configured to meet application needs, can then subsequently be copied (``cloned'') and dynamically instantiated to provide homogeneous execution environments across distributed Grid resources. In combination with complementary middleware for user, data and resource management, the functionality enabled by VMPlant allows for problem-solving environments to deliver Grid applications to users with unprecedented flexibility. VMPlant supports a graph-based model for the definition of customized VM configuration actions; partial graph matching, VM state storage and ``cloning'' for efficient creation. This paper presents the VMPlant architecture, describes a prototype implementation of the service, and presents an analysis of its performance.", acknowledgement = ack-nhfb, } @InProceedings{LeVasseur:2004:SAR, author = "Joshua LeVasseur and Volkmar Uhlig", title = "A sledgehammer approach to reuse of legacy device drivers", crossref = "ACM:2004:PWA", pages = "??--??", year = "2004", DOI = "https://doi.org/10.1145/1133572.1133617", bibdate = "Sat Oct 14 15:41:52 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Device drivers account for the majority of an operating system's code base, and reuse of the existing driver infrastructure is a pragmatic requirement of any new OS project. New operating systems should benefit from the existing device driver code base without demanding legacy support from the kernel.Instead of trying to directly integrate existing device drivers we propose a more radical approach. We run the unmodified device driver, with its complete original OS, isolated in a virtual machine. Our flexible approach, requiring only minimal support infrastructure, allows us to run any existing device driver, independently of the OS or driver vendor.", acknowledgement = ack-nhfb, articlenumber = "24", } @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-COMP-ARCH-NEWS, volume = "32", number = "5", pages = "211--223", month = dec, year = "2004", CODEN = "CANED2", ISSN = "0163-5964 (ACM), 0884-7495 (IEEE)", ISSN-L = "0163-5964", bibdate = "Fri May 12 09:41:24 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGARCH Computer Architecture News", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89", } @Article{McKusick:2004:JFF, author = "Kirk McKusick", title = "The Jail Facility in {FreeBSD 5.2}", journal = j-LOGIN, volume = "29", number = "4", pages = "??--??", month = aug, year = "2004", CODEN = "LOGNEM", ISSN = "1044-6397", bibdate = "Tue Apr 11 10:52:42 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/usenix2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www.usenix.org/publications/login/2004-08/index.html", URL = "http://www.usenix.org/publications/login/2004-08/pdfs/mckusick.pdf", acknowledgement = ack-nhfb, } @Book{Miller:2004:CLI, author = "James S. Miller and Susann Ragsdale", title = "The {Common Language Infrastructure} Annotated Standard", publisher = pub-AW, address = pub-AW:adr, pages = "xxxii + 891", year = "2004", ISBN = "0-321-15493-2", ISBN-13 = "978-0-321-15493-4", LCCN = "QA76.7 .M52 2003", bibdate = "Wed Mar 15 08:58:53 MST 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.loc.gov:7090/Voyager", acknowledgement = ack-nhfb, subject = "Programming languages (Electronic computers); Microsoft .NET Framework", } @Article{Nelson:2004:CDC, author = "T. Nelson", title = "A Cosmology for a Different Computer Universe: Data Model, Mechanisms, Virtual Machine and Visualization Infrastructure", journal = j-J-DIGITAL-INFO, volume = "5", number = "1", pages = "??--??", month = jul, year = "2004", CODEN = "????", ISSN = "1368-7506", bibdate = "Tue Jul 5 18:53:03 MDT 2005", bibsource = "http://jodi.ecs.soton.ac.uk/; https://www.math.utah.edu/pub/tex/bib/jdigitalinfo.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://jodi.tamu.edu/Articles/v05/i01/Nelson", acknowledgement = ack-nhfb, fjournal = "Journal of Digital Information", } @Article{Rosenblum:2004:RVM, author = "Mendel Rosenblum", title = "The Reincarnation of Virtual Machines", journal = j-QUEUE, volume = "2", number = "5", pages = "34--40", month = jul, year = "2004", CODEN = "AQCUAE", DOI = "https://doi.org/10.1145/1016998.1017000", ISSN = "1542-7730 (print), 1542-7749 (electronic)", ISSN-L = "1542-7730", bibdate = "Sat Nov 6 17:44:33 MST 2004", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "ACM Queue: Tomorrow's Computing Today", } @Article{Schmalenbach:2004:JVM, author = "C. Schmalenbach and C. Hofig", title = "The {Java Virtual Machine} Profiler Interface", journal = j-DDJ, volume = "29", number = "7", pages = "28--33", year = "2004", CODEN = "DDJOEB", ISSN = "1044-789X", bibdate = "Tue Sep 28 15:27:39 MDT 2004", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; Ingenta database", acknowledgement = ack-nhfb, fjournal = "Dr. Dobb's Journal of Software Tools", } @Article{Siveroni:2004:OSJ, author = "I. A. Siveroni", title = "Operational semantics of the {Java Card Virtual Machine}", journal = j-J-LOGIC-ALG-PROG, volume = "58", number = "1--2", pages = "3--25", year = "2004", CODEN = "????", ISSN = "1567-8326", ISSN-L = "1567-8326", bibdate = "Tue Jan 27 06:08:07 MST 2004", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; Ingenta database", acknowledgement = ack-nhfb, fjournal = "Journal of Logic and Algebraic Programming", } @Article{Supnik:2004:SVM, author = "Bob Supnik", title = "Simulators: Virtual Machines of the Past (and Future)", journal = j-QUEUE, volume = "2", number = "5", pages = "52--58", month = jul, year = "2004", CODEN = "AQCUAE", DOI = "https://doi.org/10.1145/1016998.1017002", ISSN = "1542-7730 (print), 1542-7749 (electronic)", ISSN-L = "1542-7730", bibdate = "Sat Nov 6 17:44:33 MST 2004", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "ACM Queue: Tomorrow's Computing Today", } @Article{Adams:2005:CMC, author = "Joel C. Adams and W. David Laverell", title = "Configuring a multi-course lab for system-level projects", journal = j-SIGCSE, volume = "37", number = "1", pages = "525--529", month = mar, year = "2005", CODEN = "SIGSD3", DOI = "https://doi.org/10.1145/1047124.1047509", ISSN = "0097-8418 (print), 2331-3927 (electronic)", ISSN-L = "0097-8418", bibdate = "Sat Nov 17 16:57:13 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigcse2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Having students modify an actual operating system kernel or network protocol stack opens their eyes to what is going on ``beneath the hood'' of a computer. However student modifications to a system may result in an unstable computer. Because of this, giving students such experience has in the past required a lab and/or computers dedicated to the students in the system-level course, and computer science departments without such dedicated facilities have been unable to provide their students with system-level experience. In this paper, we present two ways of giving students system-level experience in a non-dedicated lab; one using commercial software (VMware), and another using open-source freeware (User Mode Linux Kernel).", acknowledgement = ack-nhfb, fjournal = "SIGCSE Bulletin (ACM Special Interest Group on Computer Science Education)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J688", } @Article{Alpern:2005:JRV, author = "B. Alpern and S. Augart and S. M. Blackburn and M. Butrico and A. Cocchi and P. Cheng and J. Dolby and S. Fink and D. Grove and M. Hind and K. S. McKinley and M. Mergen and J. E. B. Moss and T. Ngo and V. Sarkar and M. Trapp", title = "The {Jikes Research Virtual Machine} project: Building an open-source research community", journal = j-IBM-SYS-J, volume = "44", number = "2", pages = "399--417", month = "????", year = "2005", CODEN = "IBMSA7", ISSN = "0018-8670", bibdate = "Sat Apr 16 18:29:43 MDT 2005", bibsource = "https://www.math.utah.edu/pub/tex/bib/gnu.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www.research.ibm.com/journal/", URL = "http://www.research.ibm.com/journal/sj/442/alpern.html; http://www.research.ibm.com/journal/sj/442/alpern.pdf; http://www.research.ibm.com/journal/sj/442/alpern.txt", acknowledgement = ack-nhfb, fjournal = "IBM Systems Journal", } @InProceedings{Alpern:2005:PVE, author = "Bowen Alpern and Joshua Auerbach and Vasanth Bala and Thomas Frauenhofer and Todd Mummert and Michael Pigott", title = "{PDS}: a virtual execution environment for software deployment", crossref = "ACM:2005:PFA", pages = "175--185", year = "2005", DOI = "https://doi.org/10.1145/1064979.1065004", bibdate = "Sat Oct 14 16:55:50 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "The Progressive Deployment System (PDS) is a virtual execution environment and infrastructure designed specifically for deploying software, or ``assets'', on demand while enabling management from a central location. PDS intercepts a select subset of system calls on the target machine to provide a partial virtualization at the operating system level. This enables an asset's install-time environment to be reproduced virtually while otherwise not isolating the asset from peer applications on the target machine. Asset components, or ``shards'', are fetched as they are needed (or they may be pre-fetched), enabling the asset to be progressively deployed by overlapping deployment with execution. Cryptographic digests are used to eliminate redundant shards within and among assets, which enables more efficient deployment. A framework is provided for intercepting interfaces above the operating system (e.g., Java class loading), enabling optimizations requiring semantic awareness not present at the OS level. The paper presents the design of PDS, motivates its ``porous isolation model'' with respect to the challenges of software deployment, and presents measurements of PDS's execution characteristics.", acknowledgement = ack-nhfb, } @Article{Anderson:2005:OII, author = "Thomas Anderson and Larry Peterson and Scott Shenker and Jonathan Turner", title = "Overcoming the {Internet} Impasse through Virtualization", journal = j-COMPUTER, volume = "38", number = "4", pages = "34--??", month = apr, year = "2005", CODEN = "CPTRB4", DOI = "https://doi.org/10.1109/MC.2005.136", ISSN = "0018-9162 (print), 1558-0814 (electronic)", ISSN-L = "0018-9162", bibdate = "Wed May 4 16:02:15 MDT 2005", bibsource = "https://www.math.utah.edu/pub/tex/bib/computer2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://csdl.computer.org/dl/mags/co/2005/04/r4034.htm; http://csdl.computer.org/dl/mags/co/2005/04/r4034.pdf", acknowledgement = ack-nhfb, fjournal = "Computer", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2", } @Article{Anonymous:2005:NPV, author = "Anonymous", title = "New Products: Virtual Iron ({VFe})", journal = j-LINUX-J, volume = "139", pages = "18--18", month = dec, year = "2005", CODEN = "LIJOFX", ISSN = "1075-3583 (print), 1938-3827 (electronic)", ISSN-L = "1075-3583", bibdate = "Sat Oct 14 15:24:05 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Linux journal", journal-URL = "http://portal.acm.org/citation.cfm?id=J508", keywords = "Virtual Iron; Xen", remark = "VFe allows up to ten operating systems to run concurrently on a physical processor, a single operating system to span 16 processors or any combination in between, all sharing the same physical resources.", } @Article{Armstrong:2005:AVC, author = "W. J. Armstrong and R. L. Arndt and D. C. Boutcher and R. G. Kovacs and D. Larson and K. A. Lucke and N. Nayar and R. C. Swanberg", title = "Advanced virtualization capabilities of {POWER5} systems", journal = j-IBM-JRD, volume = "49", number = "4/5", pages = "523--532", month = "????", year = "2005", CODEN = "IBMJAE", ISSN = "0018-8646 (print), 2151-8556 (electronic)", ISSN-L = "0018-8646", bibdate = "Wed Oct 5 07:12:31 MDT 2005", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www.research.ibm.com/journal/", URL = "http://www.research.ibm.com/journal/rd/494/armstrong.html", acknowledgement = ack-nhfb, fjournal = "IBM Journal of Research and Development", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520", } @Article{Arnold:2005:IVM, author = "Matthew Arnold and Adam Welc and V. T. Rajan", title = "Improving virtual machine performance using a cross-run profile repository", journal = j-SIGPLAN, volume = "40", number = "10", pages = "297--311", month = oct, year = "2005", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Dec 13 08:30:58 MST 2005", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @Article{Barr:2005:JEA, author = "Rimon Barr and Zygmunt J. Haas and Robbert van Renesse", title = "{JiST}: an efficient approach to simulation using virtual machines", journal = j-SPE, volume = "35", number = "6", pages = "539--576", month = may, year = "2005", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/spe.647", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Sat Apr 16 07:26:39 MDT 2005", bibsource = "http://www.interscience.wiley.com/jpages/0038-0644; https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www3.interscience.wiley.com/journalfinder.html", acknowledgement = ack-nhfb, fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", onlinedate = "16 Feb 2005", } @Article{Bauer:2005:PPF, author = "Mick Bauer", title = "Paranoid penguin: The future of {Linux} security", journal = j-LINUX-J, volume = "2005", number = "136", pages = "10--10", month = aug, year = "2005", CODEN = "LIJOFX", ISSN = "1075-3583 (print), 1938-3827 (electronic)", ISSN-L = "1075-3583", bibdate = "Sat Dec 24 17:46:10 MST 2005", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Linux journal", journal-URL = "http://portal.acm.org/citation.cfm?id=J508", keywords = "Hypervisors and Virtual Machines", } @Misc{Beebe:2005:VM, author = "Nelson H. F. Beebe", title = "Virtual Machines", howpublished = "World-Wide Web document.", day = "1", month = aug, year = "2005", bibdate = "Tue Aug 02 19:05:33 2005", bibsource = "https://www.math.utah.edu/pub/bibnet/authors/b/beebe-nelson-h-f.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.math.utah.edu/~beebe/vm.html", acknowledgement = ack-nhfb, } @Book{Blank:2005:APV, editor = "Annika Blank and others", title = "Advanced {POWER} virtualization on {IBM System p5}", publisher = pub-IBM, address = pub-IBM:adr, edition = "Second", pages = "xxii + 424", year = "2005", ISBN = "0-7384-9404-6", ISBN-13 = "978-0-7384-9404-3", LCCN = "QA76.9.V5 A38 2005", bibdate = "Thu Jan 21 14:08:50 MST 2010", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.loc.gov:7090/Voyager", series = "IBM redbooks", URL = "http://www.loc.gov/catdir/toc/fy0608/2006273965.html", acknowledgement = ack-nhfb, remark = "This edition applies to IBM AIX 5L version 5.3, HMC version 5 release 1.0, Virtual IO server version 1.2 running on IBM system p5 and IBM eserver p5 systems.", subject = "Virtual computer systems", } @InProceedings{Calder:2005:EVM, author = "Brad Calder and Andrew A. Chien and Ju Wang and Don Yang", title = "The {Entropia Virtual Machine} for desktop grids", crossref = "ACM:2005:PFA", pages = "186--185", year = "2005", DOI = "https://doi.org/10.1145/1064979.1065005", bibdate = "Sat Oct 14 15:31:19 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Desktop distributed computing allows companies to exploit the idle cycles on pervasive desktop PC systems to increase the available computing power by orders of magnitude (10x--1000x). Applications are submitted, distributed, and run on a grid of desktop PCs. Since the applications may be malformed, or malicious, the key challenges for a desktop grid are how to (1) prevent the distributed computing application from unwarranted access or modification of data and files on the desktop PC, (2) control the distributed computing application's resource usage and behavior as it runs on the desktop PC, and (3) provide protection for the distributed application's program and its data. In this paper we describe the Entropia Virtual Machine, and the solutions it embodies for each of these challenges.", acknowledgement = ack-nhfb, } @InProceedings{Childs:2005:SCG, author = "Stephen Childs and Brian Coghlan and David O'Callaghan and Geoff Quigley and John Walsh", title = "A Single-Computer {Grid} Gateway Using Virtual Machines", crossref = "Shih:2005:ICA", pages = "310--315", year = "2005", DOI = "https://doi.org/10.1109/AINA.2005.65", bibdate = "Sat Oct 14 15:27:50 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Grid middleware is enabling resource sharing between computing centres across the world and sites with existing clusters are eager to connect to the Grid using middleware such as that developed by the LHC Computing Grid (LCG) project. However; the hardware requirements for access to the Grid remain high: a standard LCG Grid gateway requires four separate servers. We propose the use of Virtual Machine (VM) technology to run multiple OS instances, allowing a full Grid gateway to be hosted on a single computer. This would significantly reduce the hardware, installation and management commitments required of a site that wants to connect to the Grid. In this paper, we outline the architecture of a single-computer Grid gateway. We evaluate implementations of this architecture using two popular open-source VMs: Xen and User-Mode Linux (UML). Our results show that Xen outperforms UML for installation tasks and standard gateway operations. Configuration is similar to that of sites running multi-computer gateways, making it easy to keep site installation profiles Synchronised. Our VM gateway architecture provides a low-cost entry path to the Grid and will be of interest to many institutions wishing to connect their existing facilities.", acknowledgement = ack-nhfb, } @Book{Clark:2005:SVT, author = "Tom Clark", title = "Storage virtualization: technologies for simplifying data storage and management", publisher = pub-AW, address = pub-AW:adr, pages = "xvii + 234", year = "2005", ISBN = "0-321-26251-4", ISBN-13 = "978-0-321-26251-6", LCCN = "QA76.9.V5 C55 2005", bibdate = "Thu Jan 21 14:10:53 MST 2010", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.loc.gov:7090/Voyager", acknowledgement = ack-nhfb, subject = "Virtual storage (Computer science); Information storage and retrieval systems; Database management", } @Book{Craig:2005:VM, author = "Iain D. Craig", title = "Virtual machines", publisher = pub-SV, address = pub-SV:adr, pages = "xv + 269", year = "2005", ISBN = "1-85233-969-1", ISBN-13 = "978-1-85233-969-2", LCCN = "QA76.9 CRA", bibdate = "Thu Jul 14 12:01:15 MDT 2005", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; library.ox.ac.uk:210/ADVANCE; z3950.loc.gov:7090/Voyager", acknowledgement = ack-nhfb, libnote = "Not in my library.", subject = "Virtual computer systems; Parallel processing", } @Article{Davoli:2005:VSV, author = "Renzo Davoli and Michael Goldweber", title = "Virtual square ({$ V^2 $}) in computer science education", journal = j-SIGCSE, volume = "37", number = "3", pages = "301--305", month = sep, year = "2005", CODEN = "SIGSD3", DOI = "https://doi.org/10.1145/1151954.1067528", ISSN = "0097-8418 (print), 2331-3927 (electronic)", ISSN-L = "0097-8418", bibdate = "Sat Nov 17 16:57:19 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigcse2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "It is common to name as virtual the imaginary space that can be created by software using computers and networks. This space is not only a set of processing and communications means and methods but it is also a space where humans can ``meet,'' exchange ideas, leave messages etc. Students in computer science must learn how to design, implement, manage and debug the systems and networks that create this virtual space. Furthermore, CS students need an experimental environment --a playground-- where they can develop their skills at creating and supporting these virtual environments. For this ``playground'' we propose a virtual world made up of emulated computer systems and emulated networks. This emulated world will be the students' testing environment, where they can run their own services, administer their own machines and set up security attacks without any danger to real networks and systems. It is a virtual space based on virtual machines and virtual networks but it is also a meeting place for computer science students, where they can test the effectiveness of their ideas. This ``space'' therefore is a twice virtual space, which we call virtual to the second power or virtual squared (V$^2$ ). It is a virtual environment that is a also virtual location (i.e., a town square) where different real computers, virtual systems and people can meet and communicate.", acknowledgement = ack-nhfb, fjournal = "SIGCSE Bulletin (ACM Special Interest Group on Computer Science Education)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J688", } @Book{ECMA-335-3, author = "{ECMA}", title = "{ECMA-335}: {Common Language Infrastructure (CLI)}", publisher = pub-ECMA, address = pub-ECMA:adr, edition = "Third", pages = "viii + 104 (Part I), viii + 192 (Part II), iv + 138 (Part III), ii + 20 (Part IV), i + 4 (Part V), ii + 60 (Part VI)", month = jun, year = "2005", bibdate = "Thu Apr 20 10:08:14 2006", bibsource = "http://www.ecma-international.org/publications/standards/Standard.htm; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.ecma-international.org/publications/files/ECMA-ST/Ecma-335-xml.zip; http://www.ecma-international.org/publications/files/ECMA-ST/Ecma-335.pdf; http://www.ecma.ch/ecma1/STAND/ecma-335.htm", acknowledgement = ack-nhfb, ECMAnumber = "ECMA-335", remark = "Also ISO/IEC 23271.", } @Article{Ertl:2005:AIV, author = "M. Anton Ertl", title = "Advances in interpreters, virtual machines and emulators", journal = j-SCI-COMPUT-PROGRAM, volume = "57", number = "3", pages = "251--252", month = sep, year = "2005", CODEN = "SCPGD4", ISSN = "0167-6423 (print), 1872-7964 (electronic)", ISSN-L = "0167-6423", bibdate = "Fri Apr 1 18:38:50 MDT 2011", bibsource = "https://www.math.utah.edu/pub/tex/bib/scicomputprogram.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www.sciencedirect.com/science/journal/01676423", acknowledgement = ack-nhfb, fjournal = "Science of Computer Programming", journal-URL = "http://www.sciencedirect.com/science/journal/01676423", } @Article{Figueiredo:2005:GEI, author = "Renato Figueiredo and Peter A. Dinda and Jos{\'e} Fortes", title = "{Guest Editors}' Introduction: Resource Virtualization Renaissance", journal = j-COMPUTER, volume = "38", number = "5", pages = "28--??", month = may, year = "2005", CODEN = "CPTRB4", ISSN = "0018-9162 (print), 1558-0814 (electronic)", ISSN-L = "0018-9162", bibdate = "Wed May 4 16:02:16 MDT 2005", bibsource = "https://www.math.utah.edu/pub/tex/bib/computer2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://csdl.computer.org/comp/mags/co/2005/05/r5028.pdf; http://csdl.computer.org/comp/mags/co/2005/05/r5028abs.htm", acknowledgement = ack-nhfb, fjournal = "Computer", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2", } @Article{Franz:2005:PVM, author = "Michael Franz and Deepak Chandra and Andreas Gal and Vivek Haldar and Christian W. Probst and Ferm{\'\i}n Reig and Ning Wang", title = "A portable virtual machine target for proof-carrying code", journal = j-SCI-COMPUT-PROGRAM, volume = "57", number = "3", pages = "275--294", month = sep, year = "2005", CODEN = "SCPGD4", ISSN = "0167-6423 (print), 1872-7964 (electronic)", ISSN-L = "0167-6423", bibdate = "Fri Apr 1 18:38:50 MDT 2011", bibsource = "https://www.math.utah.edu/pub/tex/bib/scicomputprogram.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www.sciencedirect.com/science/journal/01676423", acknowledgement = ack-nhfb, fjournal = "Science of Computer Programming", journal-URL = "http://www.sciencedirect.com/science/journal/01676423", } @MastersThesis{Fredriksen:2005:UUV, author = "Kai Fredriksen", title = "{UMLexe} --- {UML} virtual machine: a framework for model execution", type = "Masteroppgave i informatikk", school = "Universitetet i Oslo", address = "Oslo, Norway", pages = "122", year = "2005", bibdate = "Mon Apr 10 11:25:42 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, } @Book{Gibbs:2005:APV, editor = "G. Benton Gibbs and others", title = "Advanced {POWER} virtualization on {IBM eserver p5} servers. Architecture and performance considerations", publisher = pub-IBM, address = pub-IBM:adr, edition = "Second", pages = "xvi + 412", year = "2005", ISBN = "0-7384-9238-8 (paperback)", ISBN-13 = "978-0-7384-9238-4 (paperback)", LCCN = "QA76.9.V5 A377 2005", bibdate = "Thu Jan 21 14:08:33 MST 2010", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.loc.gov:7090/Voyager", series = "IBM redbooks", URL = "http://www.loc.gov/catdir/toc/fy0608/2006275016.html", acknowledgement = ack-nhfb, remark = "This edition applies to IBM eserver p5 servers that include the POWER5 microprocessor architecture and the IBM AIX 5L version 5.3 operating system.", subject = "Virtual computer systems", } @Article{Griffith:2005:MME, author = "Rean Griffith and Gail Kaiser", title = "Manipulating managed execution runtimes to support self-healing systems", journal = j-SIGSOFT, volume = "30", number = "4", pages = "1--7", month = jul, year = "2005", CODEN = "SFENDP", DOI = "https://doi.org/10.1145/1082983.1083066", ISSN = "0163-5948 (print), 1943-5843 (electronic)", ISSN-L = "0163-5948", bibdate = "Wed Aug 1 17:14:51 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsoft2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Self-healing systems require that repair mechanisms are available to resolve problems that arise while the system executes. Managed execution environments such as the Common Language Runtime (CLR) and Java Virtual Machine (JVM) provide a number of application services (application isolation, security sandboxing, garbage collection and structured exception handling) which are geared primarily at making managed applications more robust. However, none of these services directly enables applications to perform repairs or consistency checks of their components. From a design and implementation standpoint, the preferred way to enable repair in a self-healing system is to use an externalized repair/adaptation architecture rather than hardwiring adaptation logic inside the system where it is harder to analyze, reuse and extend. We present a framework that allows a repair engine to dynamically attach and detach to/from a managed application while it executes essentially adding repair mechanisms as another application service provided in the execution environment.", acknowledgement = ack-nhfb, fjournal = "ACM SIGSOFT Software Engineering Notes", journal-URL = "https://dl.acm.org/citation.cfm?id=J728", } @Article{Hansen:2005:IJP, author = "Stuart A. Hansen", editor = "Wanda Dann and Thomas L. Naps and Paul T. Tymann and Doug Baldwin", title = "Interpreting {Java} Program Runtimes", journal = j-SIGCSE, volume = "37", number = "1", pages = "36--40", month = mar, year = "2005", CODEN = "SIGSD3", DOI = "https://doi.org/10.1145/1047124.1047372; https://doi.org/10.1145/1047344.1047372", ISBN = "1-58113-997-7", ISBN-13 = "978-1-58113-997-6", ISSN = "0097-8418 (print), 2331-3927 (electronic)", ISSN-L = "0097-8418", bibdate = "Sat Nov 17 16:57:13 MST 2012", bibsource = "DBLP; http://dblp.uni-trier.de/db/conf/sigcse/sigcse2005.html#Hansen05; http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/sigcse2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; Ingenta database", URL = "ftp://ftp.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Compiler/java.bib; ftp://ftp.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/DBLP/2005.bib", abstract = "Many instructors use program runtimes to illustrate and reinforce algorithm complexity concepts. Hardware, operating systems and compilers all influence the runtimes, but generally not to the extent of making the data difficult to interpret. The Java virtual machine adds an additional layer of software, making it much harder to see the relationship between the runtimes and the underlying algorithm. This paper presents some of the basic issues the author and his students have encountered when analyzing Java program runtimes and briefly discusses strategies to address them.", acknowledgement = ack-nhfb, fjournal = "SIGCSE Bulletin (ACM Special Interest Group on Computer Science Education)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J688", } @InProceedings{Ho:2005:DPD, author = "Alex Ho and Steven Hand", title = "On the design of a pervasive debugger", crossref = "ACM:2005:APS", pages = "117--122", year = "2005", DOI = "https://doi.org/10.1145/1085130.1085146", bibdate = "Sat Oct 14 15:23:00 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Increased reuse of software components has led to a software mishmash as existing packages are used as building blocks for new systems. Current debuggers cannot cope with the intricate interactions between components written in different languages and spread over multiple hosts. This paper explores the design of a pervasive debugger for concurrent and distributed applications. By executing the target in a virtualized environment, the debugger can atomically control the entire application, stopping and examining each component in a consistent state. Developers can simultaneously control multiple heterogeneous targets located anywhere in the software hierarchy.", acknowledgement = ack-nhfb, } @Book{ISO:2005:IIIa, author = "{International Organization for Standardization}", title = "{ISO\slash IEC 23271:2003}: Information technology --- Common Language Infrastructure", publisher = pub-ISO, address = pub-ISO:adr, pages = "xi + 99 (Part. I), ix + 164 (Part. II), vi + 125 (Part. III), iii + 16 (Part. IV), iv + 79 (Part. V)", year = "2005", ISBN = "????", ISBN-13 = "????", LCCN = "????", bibdate = "Mon Mar 13 18:31:49 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", price = "328 Sfr (print)", URL = "http://standards.iso.org/ittf/PubliclyAvailableStandards/c036769_ISO_IEC_23271_2003(E).zip; http://www.iso.org/iso/en/CatalogueDetailPage.CatalogueDetail?CSNUMBER=36769", acknowledgement = ack-nhfb, } @Book{ISO:2005:IIIb, author = "{International Organization for Standardization}", title = "{ISO\slash IEC TR 23272}: Information technology --- Common Language Infrastructure --- Profiles and Libraries", publisher = pub-ISO, address = pub-ISO:adr, pages = "6", year = "2005", ISBN = "????", ISBN-13 = "????", LCCN = "????", bibdate = "Mon Mar 13 18:31:49 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", price = "328 Sfr (print)", URL = "http://standards.iso.org/ittf/PubliclyAvailableStandards/c036770_ISO_IEC_TR_23272_2003(E).zip; http://www.iso.org/iso/en/CatalogueDetailPage.CatalogueDetail?CSNUMBER=36770", acknowledgement = ack-nhfb, } @Book{Jacob:2005:DOE, editor = "Bart Jacob and others", title = "On demand Operating Environment: managing the infrastructure (virtualization engine update)", publisher = pub-IBM, address = pub-IBM:adr, edition = "Second", pages = "xxiv + 364", year = "2005", ISBN = "0-7384-9124-1 (paperback)", ISBN-13 = "978-0-7384-9124-0 (paperback)", LCCN = "QA76.754 .O5 2005", bibdate = "Thu Jan 21 14:09:26 MST 2010", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.loc.gov:7090/Voyager", series = "IBM redbooks", acknowledgement = ack-nhfb, remark = "June 2005.", subject = "Computer software; Management; Business; Computer programs; Electronic commerce", } @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/virtual-machines.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 = "Operating Systems Review", } @InProceedings{Kaneda:2005:VMM, author = "Kenji Kaneda and Yoshihiro Oyama and Akinori Yonezawa", title = "A virtual machine monitor for utilizing non-dedicated clusters", crossref = "Vrable:2005:SPA", pages = "1--11", year = "2005", DOI = "https://doi.org/10.1145/1095810.1118618", bibdate = "Sat Oct 14 16:49:46 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "We have designed and implemented a virtual machine monitor (VMM) for utilizing non-dedicated clusters. The VMM virtualizes a shared-memory multi-processor machine on a commodity cluster. In addition, it hides dynamic changes of physical hardware configurations. The experimental result demonstrates the feasibility of our approach.", acknowledgement = ack-nhfb, } @InProceedings{LeVasseur:2005:PVU, author = "Joshua LeVasseur and Volkmar Uhlig and Ben Leslie and Matthew Chapman and Gernot Heiser", title = "Pre-virtualization: uniting two worlds", crossref = "Vrable:2005:SPA", pages = "1--2", year = "2005", DOI = "https://doi.org/10.1145/1095810.1118604", bibdate = "Sat Oct 14 14:47:51 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Virtual machines are used in an increasingly varied set of application scenarios that favor different trade-offs. The virtual machine (VM) is an attractive solution, since it enables the use of the same operating systems across the scenarios, while permitting substitution of different hypervisors appropriate for the trade-offs. One of these scenarios is server consolidation, where a number of machines are replaced by VMs running on a single physical machine, increasing resource utilization. Another attractive scenario is the use of a VM to add features to an OS that contradict the design of the OS, such as enabling secure computing platforms with strictly controlled information flow. These two scenarios have dramatically different performance versus security trade offs, easily addressed by using different hypervisors.", acknowledgement = ack-nhfb, } @PhdThesis{Liang:2005:DLM, author = "Jiangang Liang", title = "Development of logical models for {CNC} machine tool motion control system with application to virtual machine tool design", type = "Dissertations ({Ph.D.})", school = "University of California, Davis", address = "Davis, CA, USA", month = mar, year = "2005", bibdate = "Mon Apr 10 11:29:09 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; melvyl.cdlib.org:210/CDL90", URL = "http://uclibs.org/PID/11984", acknowledgement = ack-nhfb, } @InProceedings{Lin:2005:VMB, author = "Bin Lin and Peter A. Dinda", title = "{VSched}: Mixing Batch And Interactive Virtual Machines Using Periodic Real-time Scheduling", crossref = "ACM:2005:PAI", pages = "8--??", year = "2005", DOI = "https://doi.org/10.1109/SC.2005.80", bibdate = "Sat Oct 14 15:09:27 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "We are developing Virtuoso, a system for distributed computing using virtual machines (VMs). Virtuoso must be able to mix batch und interactive VMs on the same physical hardware, while satisfying constraint on responsiveness and compute rates for each workload. VSched is the component of Virtuoso that provides this capability. VSched is an entirely user-level tool that interacts with the stock Linux kernel running below any type-11 virtual machine monitor to schedule VMs (indeed, any process) using a periodic real-time scheduling model. This abstraction allows compute rate and responsiveness constraints to be straightforwardly described using a period und a slice within the period, and it allows for just and simple admission control. This paper makes the case for periodic real-time scheduling for VM-based computing environments, and then describes and evaluates VSched. It also applies VSched to scheduling parallel workloads, showing that it can help a BSP application maintain a fixed stable performance despite externally caused loud imbalance.", acknowledgement = ack-nhfb, } @InProceedings{Lucchetti:2005:EDR, author = "Dominic Lucchetti and Steven K. Reinhardt and Peter M. Chen", title = "{ExtraVirt}: detecting and recovering from transient processor faults", crossref = "Vrable:2005:SPA", pages = "1--8", year = "2005", DOI = "https://doi.org/10.1145/1095810.1118621", bibdate = "Sat Oct 14 15:20:04 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Reliability is becoming an increasingly important issue in modern processor design. Smaller feature sizes and more numerous transistors are projected to increase the frequency of transient faults [4, 5]. Our project, ExtraVirt, leverages the trend toward multi-core and multi-processor systems to survive these transient faults. Our goals are (1) to add fault tolerance without modifying existing operating systems, applications or hardware, (2) to minimize the time spent executing software that cannot tolerate faults, and (3) to minimize the time and space overhead needed to detect and recover from faults. We accomplish these goals by leveraging virtual-machine technology and by sharing memory and I/O devices across replicas. ExtraVirt extends prior work on VM-level fault tolerance[2] by detecting and recovering from non-fail-stop faults and by running multiple replicas efficiently on a single machine.", acknowledgement = ack-nhfb, } @Book{Matthys:2005:IVE, author = "Christian Matthys and Hiroshi Ito and Bill Souhrada and Lynn Winkelbauer and Holger M. Wittmann and others", title = "{IBM} virtualization engine, version 1: planning and installation guide", publisher = pub-IBM, address = pub-IBM:adr, pages = "xvi + 398", year = "2005", ISBN = "0-7384-9277-9", ISBN-13 = "978-0-7384-9277-3", LCCN = "MLCM 2006/42092 (Q)", bibdate = "Thu Jan 21 14:08:41 MST 2010", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.loc.gov:7090/Voyager", series = "IBM redbooks", acknowledgement = ack-nhfb, } @Book{McKusick:2005:DIF, author = "Marshall Kirk McKusick and George V. Neville-Neil", title = "The Design and Implementation of the {FreeBSD} Operating System", publisher = pub-AW, address = pub-AW:adr, pages = "xxviii + 683", year = "2005", ISBN = "0-201-70245-2 (hardcover)", ISBN-13 = "978-0-201-70245-3 (hardcover)", LCCN = "QA76.76.O63 M398745 2005", bibdate = "Fri Jul 09 07:45:56 2004", bibsource = "https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.loc.gov:7090/Voyager", URL = "http://www.mckusick.com/FreeBSDbook.html", abstract = "As in earlier Addison-Wesley books on the UNIX-based BSD operating system, Kirk McKusick and George Neville-Neil deliver here the most comprehensive, up-to-date, and authoritative technical information on the internal structure of open source FreeBSD. Readers involved in technical and sales support can learn the capabilities and limitations of the system; applications developers can learn effectively and efficiently how to interface to the system; system administrators can learn how to maintain, tune, and configure the system; and systems programmers can learn how to extend, enhance, and interface to the system. The authors provide a concise overview of FreeBSD's design and implementation. Then, while explaining key design decisions, they detail the concepts, data structures, and algorithms used in implementing the systems facilities. As a result, readers can use this book as both a practical reference and an in-depth study of a contemporary, portable, open source operating system. This book: Details the many performance improvements in the virtual memory system Describes the new symmetric multiprocessor support Includes new sections on threads and their scheduling Introduces the new jail facility to ease the hosting of multiple domains Updates information on networking and interprocess communication Already widely used for Internet services and firewalls, high-availability servers, and general timesharing systems, the lean quality of FreeBSD also suits the growing area of embedded systems. Unlike Linux, FreeBSD does not require users to publicize any changes they make to the source code.", acknowledgement = ack-nhfb, subject = "FreeBSD; Free computer software; Operating systems (Computers)", tableofcontents = "1: History and goals \\ 2: Design overview of FreeBSD \\ 3: Kernel services \\ 4: Process management \\ 5: Memory management \\ 6: I/O system overview \\ 7: Devices \\ 8: Local filesystems \\ 9: network filesystem \\ 10: Terminal handling \\ 11: Interprocess communication \\ 12: Network communication \\ 13: Network protocols \\ 14: Startup and shutdown", } @InProceedings{Menon:2005:DPO, author = "Aravind Menon and Jose Renato Santos and Yoshio Turner and G. (John) Janakiraman and Willy Zwaenepoel", title = "Diagnosing performance overheads in the {Xen} virtual machine environment", crossref = "ACM:2005:PFA", pages = "13--23", year = "2005", DOI = "https://doi.org/10.1145/1064979.1064984", bibdate = "Sat Oct 14 13:39:15 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Virtual Machine (VM) environments (e.g., VMware and Xen) are experiencing a resurgence of interest for diverse uses including server consolidation and shared hosting. An application's performance in a virtual machine environment can differ markedly from its performance in a non-virtualized environment because of interactions with the underlying virtual machine monitor and other virtual machines. However, few tools are currently available to help debug performance problems in virtual machine environments.In this paper, we present Xenoprof, a system-wide statistical profiling toolkit implemented for the Xen virtual machine environment. The toolkit enables coordinated profiling of multiple VMs in a system to obtain the distribution of hardware events such as clock cycles and cache and TLB misses. The toolkit will facilitate a better understanding of performance characteristics of Xen's mechanisms allowing the community to optimize the Xen implementation.We use our toolkit to analyze performance overheads incurred by networking applications running in Xen VMs. We focus on networking applications since virtualizing network I/O devices is relatively expensive. Our experimental results quantify Xen's performance overheads for network I/O device virtualization in uni- and multi-processor systems. With certain Xen configurations, networking workloads in the Xen environment can suffer significant performance degradation. Our results identify the main sources of this overhead which should be the focus of Xen optimization efforts. We also show how our profiling toolkit was used to uncover and resolve performance bugs that we encountered in our experiments which caused unexpected application behavior.", acknowledgement = ack-nhfb, } @Book{Muller:2005:VVE, editor = "Al Muller and Seburn Wilson and Don Happe and Gary J. Humphrey", title = "Virtualization with {VMware ESX Server}", publisher = pub-SYNGRESS, address = pub-SYNGRESS:adr, pages = "xxiii + 463", year = "2005", ISBN = "1-59749-019-9", ISBN-13 = "978-1-59749-019-1", LCCN = "QA76.76.O63 V465 2005; QA76.9.V5 V57 2005eb", bibdate = "Sat Oct 14 17:21:38 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; melvyl.cdlib.org:210/CDL90", URL = "http://site.ebrary.com/lib/ucsc/Doc?id=10110269", acknowledgement = ack-nhfb, subject = "VMware; Virtual computer systems", } @Article{Munawar:2005:BPB, author = "Mohammad A. Munawar and Paul A. S. Ward", title = "Better performance or better manageability?", journal = j-SIGSOFT, volume = "30", number = "4", pages = "1--4", month = jul, year = "2005", CODEN = "SFENDP", DOI = "https://doi.org/10.1145/1082983.1083072", ISSN = "0163-5948 (print), 1943-5843 (electronic)", ISSN-L = "0163-5948", bibdate = "Wed Aug 1 17:14:51 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/sigsoft2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Competition among software providers creates enormous pressure on design and development teams to improve application performance. However, increased performance leads to systems whose behaviour is harder to predict. This in turn makes software harder to manage, or self-manage in the case of autonomic software. In this paper we elaborate on this problem, first in generic terms, and then taking memory-usage monitoring in a Java Virtual Machine as a specific example. We motivate the need for more research in developing monitoring techniques that can cope with the complexity of modern software systems. We finally present our own efforts in this direction.", acknowledgement = ack-nhfb, fjournal = "ACM SIGSOFT Software Engineering Notes", journal-URL = "https://dl.acm.org/citation.cfm?id=J728", } @Article{Nieh:2005:ETO, author = "Jason Nieh and Chris Vaill", title = "Experiences teaching operating systems using virtual platforms and {Linux}", journal = j-SIGCSE, volume = "37", number = "1", pages = "520--524", month = mar, year = "2005", CODEN = "SIGSD3", DOI = "https://doi.org/10.1145/1047124.1047508", ISSN = "0097-8418 (print), 2331-3927 (electronic)", ISSN-L = "0097-8418", bibdate = "Sat Nov 17 16:57:13 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigcse2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Operating system courses teach students much more when they provide hands-on kernel-level project experience with a real operating system. However, enabling a large class of students to do kernel development can be difficult. To address this problem, we created a virtual kernel development environment in which operating systems can be developed, debugged, and rebooted in a shared computer facility without affecting other users. Using virtual machines and remote display technology, our virtual kernel development laboratory enables even distance learning students at remote locations to participate in kernel development projects with on-campus students. We have successfully deployed and used our virtual kernel development environment together with the open-source Linux kernel to provide kernel-level project experiences for over nine hundred students in the introductory operating system course at Columbia University.", acknowledgement = ack-nhfb, fjournal = "SIGCSE Bulletin (ACM Special Interest Group on Computer Science Education)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J688", } @Book{Oglesby:2005:VES, author = "Ron Oglesby and Scott Herold", title = "{VMware ESX Server}: Advanced Technical Design Guide", publisher = "Brian Madden Publishing", address = "Silver Spring, MD, USA", pages = "444", year = "2005", ISBN = "0-9711510-6-7", ISBN-13 = "978-0-9711510-6-2", LCCN = "QA76.9.V5 O35 2005eb; **See", bibdate = "Sun Apr 9 15:35:45 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; library.mit.edu:9909/mit01", URL = "http://library.books24x7.com/library.asp?B&bookid=12048", acknowledgement = ack-nhfb, subject = "WMware; Virtual computer systems; Web servers", } @Article{Oi:2005:DLV, author = "Hitoshi Oi", title = "On the design of the local variable cache in a hardware translation-based {Java Virtual Machine}", journal = j-SIGPLAN, volume = "40", number = "7", pages = "87--94", month = jul, year = "2005", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Oct 5 07:55:13 MDT 2005", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @Article{Parson:2005:OOD, author = "Dale Parson and David J. Murray and Yu Chen", title = "Object-oriented design patterns for debugging heterogeneous languages and virtual machines", journal = j-SPE, volume = "35", number = "3", pages = "255--279", month = mar, year = "2005", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/spe.634", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Sat Apr 16 07:26:37 MDT 2005", bibsource = "http://www.interscience.wiley.com/jpages/0038-0644; https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www3.interscience.wiley.com/journalfinder.html", acknowledgement = ack-nhfb, fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", onlinedate = "3 Dec 2004", } @Article{Rosenblum:2005:VMM, author = "Mendel Rosenblum and Tal Garfinkel", title = "Virtual Machine Monitors: Current Technology and Future Trends", journal = j-COMPUTER, volume = "38", number = "5", pages = "39--??", month = may, year = "2005", CODEN = "CPTRB4", ISSN = "0018-9162 (print), 1558-0814 (electronic)", ISSN-L = "0018-9162", bibdate = "Wed May 4 16:02:16 MDT 2005", bibsource = "https://www.math.utah.edu/pub/tex/bib/computer2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://csdl.computer.org/comp/mags/co/2005/05/r5039abs.htm; http://csdl.computer.org/dl/mags/co/2005/05/r5039.pdf", acknowledgement = ack-nhfb, fjournal = "Computer", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2", } @InProceedings{Sailer:2005:BMB, author = "Reiner Sailer and Trent Jaeger and Enriquillo Valdez and Ramon Caceres and Ronald Perez and Stefan Berger and John Linwood Griffin and Leendert van Doorn", title = "Building a {MAC}-Based Security Architecture for the {Xen} Open-Source Hypervisor", crossref = "IEEE:2005:PAC", pages = "276--285", year = "2005", DOI = "https://doi.org/10.1109/CSAC.2005.13", bibdate = "Sat Oct 14 14:12:24 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "We present the sHype hypervisor security architecture and examine in detail its mandatory access control facilities. While existing hypervisor security approaches aiming at high assurance have been proven useful for high-security environments that prioritize security over performance and code reuse, our approach aims at commercial security where near-zero performance overhead, non-intrusive implementation, and usability are of paramount importance. sHype enforces strong isolation at the granularity of a virtual machine, thus providing a robust foundation on which higher software layers can enact finer-grained controls. We provide the rationale behind the sHype design and describe and evaluate our implementation for the Xen open-source hypervisor.", acknowledgement = ack-nhfb, } @Article{Smith:2005:AVM, author = "James E. Smith and Ravi Nair", title = "The Architecture of Virtual Machines", journal = j-COMPUTER, volume = "38", number = "5", pages = "32--??", month = may, year = "2005", CODEN = "CPTRB4", ISSN = "0018-9162 (print), 1558-0814 (electronic)", ISSN-L = "0018-9162", bibdate = "Wed May 4 16:02:16 MDT 2005", bibsource = "https://www.math.utah.edu/pub/tex/bib/computer2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://csdl.computer.org/comp/mags/co/2005/05/r5032abs.htm; http://csdl.computer.org/dl/mags/co/2005/05/r5032.pdf", acknowledgement = ack-nhfb, fjournal = "Computer", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2", } @Book{Smith:2005:VMV, author = "James E. (James Edward) Smith and Ravi Nair", title = "Virtual Machines: Versatile Platforms for Systems and Processes", publisher = pub-MORGAN-KAUFMANN, address = pub-MORGAN-KAUFMANN:adrsf, pages = "xxii + 638", year = "2005", ISBN = "1-55860-910-5 (hardcover), 0-08-052540-7 (e-book), 1-4933-0376-7", ISBN-13 = "978-1-55860-910-5 (hardcover), 978-0-08-052540-2 (e-book), 978-1-4933-0376-2", LCCN = "QA76.9.V5 S54 2005", bibdate = "Thu Jul 21 08:04:00 2005", bibsource = "https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.loc.gov:7090/Voyager", URL = "http://books.elsevier.com/us/bookscat/search/details.asp?country=United+States&community=mk&imprint=Morgan+Kaufmann&isbn=1558609105", abstract = "Virtual Machine technology applies the concept of virtualization to an entire machine, circumventing real machine compatibility constraints and hardware resource constraints to enable a higher degree of software portability and flexibility. Virtual machines are rapidly becoming an essential element in computer system design. They provide system security, flexibility, cross-platform compatibility, reliability, and resource efficiency. Designed to solve problems in combining and using major computer system components, virtual machine technologies play a key role in many disciplines, including operating systems, programming languages, and computer architecture. For example, at the process level, virtualizing technologies support dynamic program translation and platform-independent network computing. At the system level, they support multiple operating system environments on the same hardware platform and in servers. Historically, individual virtual machine techniques have been developed within the specific disciplines that employ them (in some cases they aren't even referred to as virtual machines), making it difficult to see their common underlying relationships in a cohesive way. In this text, Smith and Nair take a new approach by examining virtual machines as a unified discipline. Pulling together cross-cutting technologies allows virtual machine implementations to be studied and engineered in a well-structured manner. Topics include instruction set emulation, dynamic program translation and optimization, high level virtual machines (including Java and CLI), and system virtual machines for both single-user systems and servers. Examines virtual machine technologies across the disciplines that use them. Operating systems, programming languages and computer architecture. Defining a new and unified discipline. Reviewed by principle researchers at Microsoft, HP, and by other industry research groups. Written by two authors who combine several decades of expertise in computer system research and development, both in academia and industry.", acknowledgement = ack-nhfb, subject = "Virtual computer systems; Computer architecture; System design", tableofcontents = "Introduction to virtual machines \\ Emulation: interpretation and binary translation \\ Process virtual machines \\ Dynamic binary optimization \\ High-level language virtual machine architecture \\ High-level language virtual machine implementation \\ Codesigned virtual machines \\ System virtual machines \\ Multiprocessor virtualization \\ Emerging applications", } @TechReport{Steil:2005:MMM, author = "Michael Steil", title = "17 Mistakes {Microsoft} Made in the {Xbox} Security System", type = "Report", institution = "Xbox Linux Project", pages = "13", month = dec, year = "2005", bibdate = "Fri Jan 31 08:12:04 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://events.ccc.de/congress/2005/fahrplan/attachments/591-paper_xbox.pdf", acknowledgement = ack-nhfb, keywords = "Microsoft; Northbridge; RC4; RC5; Southbridge; TEA; virtual machine; Xbox gaming console; Xbox Linux Project", } @Article{Strongin:2005:TCU, author = "Geoffrey Strongin", title = "Trusted computing using {AMD} {``Pacifica''} and {``Presidio''} secure virtual machine technology", journal = j-INFO-SEC-TECH-REP, volume = "10", number = "2", pages = "120--132", month = "????", year = "2005", CODEN = "ISTRFR", DOI = "https://doi.org/10.1016/j.istr.2005.05.006", ISSN = "1363-4127 (print), 1873-605X (electronic)", ISSN-L = "1363-4127", bibdate = "Sun May 8 07:58:34 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/infosectechrep.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1363412705000257", acknowledgement = ack-nhfb, ajournal = "Info. Sec. Tech. Rep.", fjournal = "Information Security Technical Report", journal-URL = "https://www.sciencedirect.com/journal/information-security-technical-report", } @Article{Treese:2005:VVE, author = "Win Treese", title = "Virtualization virtually everywhere", journal = "{netWorker}", volume = "9", number = "2", pages = "13--15", month = jun, year = "2005", DOI = "https://doi.org/10.1145/1065368.1065378", bibdate = "Sat Oct 14 16:58:00 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "I'm writing this column in April. Like many people, I'm using Intuit's TurboTax to prepare my income-tax forms. But I'm using TurboTax in a somewhat unusual way: running it on a virtual machine. TurboTax normally runs on Microsoft Windows, but the computer I want to use runs Linux. To make this all work, I'm using a program called VMware that provides the illusion of an entire separate computer on which Windows can run. From the point of view of the Linux system, VMware is just another application with just another window on the screen. The Windows software sees a full computer, and it can't really tell the difference between the virtual environment and the real one.", acknowledgement = ack-nhfb, } @Article{Uhlig:2005:IVT, author = "Rich Uhlig and Gil Neiger and Dion Rodgers and Amy L. Santoni and Fernando C. M. Martins and Andrew V. Anderson and Steven M. Bennett and Alain K{\"a}gi and Felix H. Leung and Larry Smith", title = "{Intel} Virtualization Technology", journal = j-COMPUTER, volume = "38", number = "5", pages = "48--??", month = may, year = "2005", CODEN = "CPTRB4", ISSN = "0018-9162 (print), 1558-0814 (electronic)", ISSN-L = "0018-9162", bibdate = "Wed May 4 16:02:16 MDT 2005", bibsource = "https://www.math.utah.edu/pub/tex/bib/computer2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://csdl.computer.org/comp/mags/co/2005/05/r5048abs.htm; http://csdl.computer.org/dl/mags/co/2005/05/r5048.pdf", acknowledgement = ack-nhfb, fjournal = "Computer", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2", } @Book{Warren:2005:VWH, author = "Steven S. Warren", title = "The {VMWare Workstation 5} Handbook", publisher = "Charles River Media", address = "Hingham, MA, USA", pages = "xvii + 334", year = "2005", ISBN = "1-58450-393-9", ISBN-13 = "978-1-58450-393-4", LCCN = "QA76.76.O63 W3665 2005", bibdate = "Sun Apr 09 15:40:54 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.loc.gov:7090/Voyager", URL = "http://www.loc.gov/catdir/toc/ecip0510/2005010053.html", acknowledgement = ack-nhfb, subject = "VMware; operating systems (computers); virtual computer systems", } @Article{Whitaker:2005:RDV, author = "Andrew Whitaker and Richard S. Cox and Marianne Shaw and Steven D. Gribble", title = "Rethinking the Design of Virtual Machine Monitors", journal = j-COMPUTER, volume = "38", number = "5", pages = "57--??", month = may, year = "2005", CODEN = "CPTRB4", ISSN = "0018-9162 (print), 1558-0814 (electronic)", ISSN-L = "0018-9162", bibdate = "Wed May 4 16:02:16 MDT 2005", bibsource = "https://www.math.utah.edu/pub/tex/bib/computer2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://csdl.computer.org/comp/mags/co/2005/05/r5057abs.htm; http://csdl.computer.org/dl/mags/co/2005/05/r5057.pdf", acknowledgement = ack-nhfb, fjournal = "Computer", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2", } @Book{Wolf:2005:VDE, author = "Chris Wolf and Erick M. Halter", title = "Virtualization: from the desktop to the enterprise", publisher = pub-APRESS, address = pub-APRESS:adr, pages = "xxxiv + 559", year = "2005", ISBN = "1-59059-495-9", ISBN-13 = "978-1-59059-495-7", LCCN = "QA76.76.O63 W614 2005", bibdate = "Sat Oct 14 17:21:39 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.loc.gov:7090/Voyager", series = "The expert's voice in networking", URL = "http://www.loc.gov/catdir/enhancements/fy0663/2006296449-d.html", acknowledgement = ack-nhfb, remark = "Learn to deploy and manage virtual machines, clusters, distributed file systems, and virtual storage in the first book to cover the entire realm of virtualization. Includes Windows and Linux VMware workstation evaluation software.", subject = "Operating systems (Computers); VMware; Computer networks", } @Article{Yang:2005:LMJ, author = "Byung-Sun Yang and Soo-Mook Moon and Kemal Ebcio{\u{g}}lu", title = "Lightweight monitors for the {Java} virtual machine", journal = j-SPE, volume = "35", number = "3", pages = "281--299", month = mar, year = "2005", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/spe.635", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Sat Apr 16 07:26:37 MDT 2005", bibsource = "http://www.interscience.wiley.com/jpages/0038-0644; https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www3.interscience.wiley.com/journalfinder.html", acknowledgement = ack-nhfb, fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", onlinedate = "3 Dec 2004", } @InProceedings{Zhang:2005:FVM, author = "Yuting Zhang and Azer Bestavros and Mina Guirguis and Ibrahim Matta and Richard West", title = "Friendly virtual machines: leveraging a feedback-control model for application adaptation", crossref = "ACM:2005:PFA", pages = "2--12", year = "2005", DOI = "https://doi.org/10.1145/1064979.1064983", bibdate = "Sat Oct 14 14:53:52 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "With the increased use of ``Virtual Machines'' (VMs) as vehicles that isolate applications running on the same host, it is necessary to devise techniques that enable multiple VMs to share underlying resources both fairly and efficiently. To that end, one common approach is to deploy complex resource management techniques in the hosting infrastructure. Alternately, in this paper, we advocate the use of self-adaptation in the VMs themselves based on feedback about resource usage and availability. Consequently, we define ``Friendly'' VM (FVM) to be a virtual machine that adjusts its demand for system resources, so that they are both efficiently and fairly allocated to competing FVMs. Such properties are ensured using one of many provably convergent control rules, such as Additive-Increase/Multiplicative-Decrease (AIMD). By adopting this distributed application-based approach to resource management, it is not necessary to make assumptions about the underlying resources nor about the requirements of FVMs competing for these resources. To demonstrate the elegance and simplicity of our approach, we present a prototype implementation of our FVM framework in User-Mode Linux (UML)---an implementation that consists of less than 500 lines of code changes to UML. We present an analytic, control-theoretic model of FVM adaptation, which establishes convergence and fairness properties. These properties are also backed up with experimental results using our prototype FVM implementation.", acknowledgement = ack-nhfb, } @Article{Zhang:2005:ILS, author = "Jianyong Zhang and Anand Sivasubramaniam and Alma Riska and Qian Wang and Erik Riedel", title = "An interposed 2-Level {I/O} scheduling framework for performance virtualization", journal = j-SIGMETRICS, volume = "33", number = "1", pages = "406--407", month = jun, year = "2005", CODEN = "????", DOI = "https://doi.org/10.1145/1064212.1064277", ISSN = "0163-5999 (print), 1557-9484 (electronic)", ISSN-L = "0163-5999", bibdate = "Fri Jun 27 09:21:27 MDT 2008", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigmetrics.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGMETRICS Performance Evaluation Review", journal-URL = "http://portal.acm.org/toc.cfm?id=J618", keywords = "fairness; I/O scheduling; performance isolation; quality of service; storage systems; virtualization", } @InProceedings{Zhao:2005:SSV, author = "Xin Zhao and Kevin Borders and Atul Prakash", title = "{SVGrid}: a secure virtual environment for untrusted grid applications", crossref = "ACM:2005:MPI", pages = "1--6", year = "2005", DOI = "https://doi.org/10.1145/1101499.1101515", bibdate = "Sat Oct 14 13:51:00 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Most grid security researches focus on user authentication and secure communication, the protection of grid computers is left to the underlying operating system. Unfortunately, most OS level protection mechanisms can be turned off after an attacker manages to exploit a vulnerability to gain privileged access.This paper proposes SVGrid, a Secure Virtual Grid computing environment, to protect grid computers' filesystem and network from malicious grid applications. SVGrid works by isolating grid applications in one or more grid virtual machines whose filesystem and network service are moved into a dedicated monitor virtual machine. All file and network access requests are then forced to go through the monitor virtual machine, where security policies can be enforced. The resource compartment guarantees that appropriate security policy enforcement cannot be bypassed or disabled, even if a grid virtual machine is compromised. We tested SVGrid against attacks on grid virtual machine using rootkit and Internet worm, SVGrid was able to prevent both of them from maliciously accessing filesystem and network. We also evaluated the performance of SVGrid system and only found that performance cost was reasonable considering the security benefits of SVGrid.", acknowledgement = ack-nhfb, } @Book{Zimmer:2005:VMV, author = "Dennis Zimmer", title = "{VMware and Microsoft Virtual Server: virtuelle Server im professionellen Einsatz; [VMware GSX, ESX und Microsoft Virtual Server; Virtualisierungssoftware im Vergleich; Planung, Installation und Verwaltung]}", publisher = "Galileo Press", address = "Bonn, Germany", pages = "612", year = "2005", ISBN = "3-89842-701-3", ISBN-13 = "978-3-89842-701-2", LCCN = "????", bibdate = "Sat Oct 14 17:21:53 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.gbv.de:20011/gvk", price = "EUR 49.90", series = "Galileo Computing", URL = "http://www.galileocomputing.de", acknowledgement = ack-nhfb, language = "German", subject = "Microsoft Virtual Server; VMware GSX Server; VMware ESX Server; Virtuelle Maschine; Unternehmen; Virtualisierung; Softwareprodukt", } @Article{Abramson:2006:IVT, author = "Darren Abramson and Jeff Jackson and Sridhar Muthrasanallur and Gil Neiger and Greg Regnier and Rajesh Sankaran and Ioannis Schoinas and Rich Uhlig and Balaji Vembu and John Weigert", title = "{Intel Virtualization Technology} for Directed {I/O}", journal = j-INTEL-TECH-J, volume = "10", number = "3", pages = "179--192", day = "10", month = aug, year = "2006", DOI = "https://doi.org/10.1535/itj.1003", ISSN = "1535-766X", bibdate = "Tue Oct 17 09:02:57 2006", bibsource = "ftp://download.intel.com/technology/itj/2006/v10i3/v10_iss03.pdf; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://developer.intel.com/technology/itj/2006/v10i3/2-io/1-abstract.htm", acknowledgement = ack-nhfb, } @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/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Operating Systems Review", } @Article{Anonymous:2006:TR, author = "Anonymous", title = "Technical Reviewers", journal = j-INTEL-TECH-J, volume = "10", number = "3", pages = "vii--vii", day = "10", month = aug, year = "2006", DOI = "https://doi.org/10.1535/itj.1003", ISSN = "1535-766X", bibdate = "Tue Oct 17 09:02:57 2006", bibsource = "ftp://download.intel.com/technology/itj/2006/volume10issue02/vol10_iss03.pdf; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "", acknowledgement = ack-nhfb, } @InProceedings{Asrigo:2006:UVB, author = "Kurniadi Asrigo and Lionel Litty and David Lie", title = "Using {VMM}-based sensors to monitor honeypots", crossref = "ACM:2006:VPS", pages = "13--23", year = "2006", DOI = "https://doi.org/10.1145/1134760.1134765", bibdate = "Sat Oct 14 13:49:31 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Virtual Machine Monitors (VMMs) are a common tool for implementing honeypots. In this paper we examine the implementation of a VMM-based intrusion detection and monitoring system for collecting information about attacks on honeypots. We document and evaluate three designs we have implemented on two open-source virtualization platforms: User-Mode Linux and Xen. Our results show that our designs give the monitor good visibility into the system and thus, a small number of monitoring sensors can detect a large number of intrusions. In a three month period, we were able to detect five different attacks, as well as collect and try 46 more exploits on our honeypots. All attacks were detected with only two monitoring sensors. We found that the performance overhead for monitoring such intrusions is independent of which events are being monitored, but depends entirely on the number of monitoring events and the underlying monitoring implementation. The performance overhead can be significantly improved by implementing the monitor directly in the privileged code of the VMM, though at the cost of increasing the size of the trusted computing base of the system.", acknowledgement = ack-nhfb, } @Article{Bartholomew:2006:QMM, author = "Daniel Bartholomew", title = "{QEMU}: a multihost, multitarget emulator", journal = j-LINUX-J, volume = "2006", number = "145", pages = "??--??", month = may, year = "2006", CODEN = "LIJOFX", ISSN = "1075-3583 (print), 1938-3827 (electronic)", ISSN-L = "1075-3583", bibdate = "Wed Aug 23 06:09:27 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Linux journal", journal-URL = "http://portal.acm.org/citation.cfm?id=J508", } @Book{Bastiaansen:2006:RGU, author = "Rob Bastiaansen", title = "{Rob}'s Guide to Using {VMWARE}", publisher = "Books4Brains", address = "????", edition = "Second", pages = "350 (est.)", year = "2006", ISBN = "90-808934-1-2", ISBN-13 = "978-90-808934-1-2", LCCN = "????", bibdate = "Sat Oct 14 17:57:33 2006", bibsource = "http://www.comcol.nl/detail/55734.htm; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, } @Article{Bauer:2006:PPSa, author = "Mick Bauer", title = "Paranoid penguin: security features in {SUSE 10.0}", journal = j-LINUX-J, volume = "2006", number = "144", pages = "??--??", month = apr, year = "2006", CODEN = "LIJOFX", ISSN = "1075-3583 (print), 1938-3827 (electronic)", ISSN-L = "1075-3583", bibdate = "Fri Apr 14 08:17:48 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Linux journal", journal-URL = "http://portal.acm.org/citation.cfm?id=J508", keywords = "virtual Machines in SUSE Linux", } @Article{Bauer:2006:PPSb, author = "Mick Bauer", title = "Paranoid penguin: security features in {Debian 3.1}", journal = j-LINUX-J, volume = "2006", number = "145", pages = "??--??", month = may, year = "2006", CODEN = "LIJOFX", ISSN = "1075-3583 (print), 1938-3827 (electronic)", ISSN-L = "1075-3583", bibdate = "Wed Aug 23 06:09:27 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Linux journal", journal-URL = "http://portal.acm.org/citation.cfm?id=J508", keywords = "virtual machines in Debian", } @Article{Bauer:2006:VWL, author = "Mick Bauer", title = "{VMware Workstation 5.5} for {Linux} hosts", journal = j-LINUX-J, volume = "2006", number = "145", pages = "??--??", month = may, year = "2006", CODEN = "LIJOFX", ISSN = "1075-3583 (print), 1938-3827 (electronic)", ISSN-L = "1075-3583", bibdate = "Wed Aug 23 06:09:27 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Linux journal", journal-URL = "http://portal.acm.org/citation.cfm?id=J508", } @Article{Bellovin:2006:IRV, author = "Steven M. Bellovin", title = "Inside risks: Virtual machines, virtual security?", journal = j-CACM, volume = "49", number = "10", pages = "104--104", month = oct, year = "2006", CODEN = "CACMA2", DOI = "https://doi.org/10.1145/1164394.1164414", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Fri Sep 29 06:28:21 MDT 2006", bibsource = "http://www.acm.org/pubs/contents/journals/cacm/; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79", } @Article{Bockisch:2006:AVMa, author = "Christoph Bockisch and Matthew Arnold and Tom Dinkelaker and Mira Mezini", title = "Adapting virtual machine techniques for seamless aspect support", journal = j-SIGPLAN, volume = "41", number = "10", pages = "109--124", month = oct, year = "2006", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/1167473.1167483", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jun 18 10:47:35 MDT 2008", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Current approaches to compiling aspect-oriented programs are inefficient. This inefficiency has negative effects on the productivity of the development process and is especially prohibitive for dynamic aspect deployment. In this work, we present how well-known virtual machine techniques can be used with only slight modifications to support fast aspect deployment while retaining runtime performance. Our implementation accelerates dynamic aspect deployment by several orders of magnitude relative to mainstream aspect-oriented environments. We also provide a detailed comparison of alternative implementations of execution environments with support for dynamic aspect deployment.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", keywords = "aspect weaving; aspect-oriented programming; dynamic deployment; envelope-based weaving; virtual machine support", } @Article{Bockisch:2006:ECF, author = "Christoph Bockisch and Sebastian Kanthak and Michael Haupt and Matthew Arnold and Mira Mezini", title = "Efficient control flow quantification", journal = j-SIGPLAN, volume = "41", number = "12", pages = "125--138", month = dec, year = "2006", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Oct 24 06:22:42 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", keywords = "virtual machine", } @InProceedings{Bullers:2006:VMI, author = "William I. {Bullers, Jr.} and Stephen Burd and Alessandro F. Seazzu", title = "Virtual machines --- an idea whose time has returned: application to network, security, and database courses", crossref = "ACM:2006:PST", pages = "102--106", year = "2006", DOI = "https://doi.org/10.1145/1121341.1121375", bibdate = "Sat Oct 14 15:13:55 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Virtual machines provide a secure environment within which students may install, configure, and experiment with operating system, network, and database software. This paper describes experiences teaching three advanced courses in system and network administration, information security and assurance, and database administration using VMware workstation in a shared student laboratory. The paper describes benefits and challenges in course and lab configuration, security, and administration.", acknowledgement = ack-nhfb, } @Book{Carbone:2006:WSH, author = "Janique Carbone", title = "{Windows Server 2008 Hyper-V} resource kit", publisher = pub-MICROSOFT, address = pub-MICROSOFT:adr, pages = "????", year = "2006", ISBN = "0-7356-2517-4", ISBN-13 = "978-0-7356-2517-4", LCCN = "QA", bibdate = "Mon May 17 09:06:20 MDT 2010", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, } @Article{Casazza:2006:RSP, author = "Jeffrey P. Casazza and Michael Greenfield and Kan Shi", title = "Redefining Server Performance Characterization for Virtualization Benchmarking", journal = j-INTEL-TECH-J, volume = "10", number = "3", pages = "243--251", day = "10", month = aug, year = "2006", DOI = "https://doi.org/10.1535/itj.1003", ISSN = "1535-766X", bibdate = "Tue Oct 17 09:02:57 2006", bibsource = "ftp://download.intel.com/technology/itj/2006/v10i3/v10_iss03.pdf; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://developer.intel.com/technology/itj/2006/v10i3/7-benchmarking/1-abstract.htm", acknowledgement = ack-nhfb, } @InProceedings{Chen:2006:LUO, author = "Haibo Chen and Rong Chen and Fengzhe Zhang and Binyu Zang and Pen-Chung Yew", title = "Live updating operating systems using virtualization", crossref = "ACM:2006:VPS", pages = "35--44", year = "2006", DOI = "https://doi.org/10.1145/1134760.1134767", bibdate = "Sat Oct 14 13:43:14 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Many critical IT infrastructures require non-disruptive operations. However, the operating systems thereon are far from perfect that patches and upgrades are frequently applied, in order to close vulnerabilities, add new features and enhance performance. To mitigate the loss of availability, such operating systems need to provide features such as live update through which patches and upgrades can be applied without having to stop and reboot the operating system. Unfortunately, most current live updating approaches cannot be easily applied to existing operating systems: some are tightly bound to specific design approaches (e.g. object-oriented); others can only be used under particular circumstances (e.g. quiescence states).In this paper, we propose using virtualization to provide the live update capability. The proposed approach allows a broad range of patches and upgrades to be applied at any time without the requirement of a quiescence state. Moreover, such approach shares good portability for its OS-transparency and is suitable for inclusion in general virtualization systems. We present a working prototype, LUCOS, which supports live update capability on Linux running on Xen virtual machine monitor. To demonstrate the applicability of our approach, we use real-life kernel patches from Linux kernel 2.6.10 to Linux kernel 2.6.11, and apply some of those kernel patches on the fly. Performance measurements show that our implementation incurs negligible performance overhead: a less than 1\% performance degradation compared to a Xen-Linux. The time to apply a patch is also very minimal.", acknowledgement = ack-nhfb, } @Book{Chryselius:2006:DQE, author = "Toralf Chryselius and Andrea Kuntz", title = "{Debian unter Qemu Einf{\"u}hrung in das Betriebssystem Debian Linux in der virtuellen Umgebung Qemu unter Windows}. ({German}) [Debian under {Qemu}: Introduction in the {Debian Linux} operating systems in the {Qemu} virtual machine under {Windows}]", volume = "17", publisher = "CVTD", address = "Bergfelde bei Berlin, Germany", pages = "159", year = "2006", ISBN = "3-86768-116-3 (book), 3-86768-716-1 (DVD)", ISBN-13 = "978-3-86768-116-2 (book), 978-3-86768-716-4 (DVD)", LCCN = "????", bibdate = "Mon May 17 09:07:48 MDT 2010", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", series = "Schriftenreihe Grenzg{\"a}nger - Linux leicht verst{\"a}ndlich", acknowledgement = ack-nhfb, language = "German", subject = "Debian GNU/LINUX 3.1; Windows XP; Qemu", } @Book{Chryselius:2006:IDQ, author = "Toralf Chryselius and Andrea Kuntz", title = "{Internetkommunikation in Debian unter Qemu Einf{\"u}hrung in das Betriebssystem Debian Linux in Qemu und Vorstellung der wichtigsten Internetprogramme}. ({German}) [{Internet} Communication in {Debian} under {Qemu}: Introduction in the {Debian Linux} operating system in {Qemu} and creation of the most important Internet programs]", volume = "18", publisher = "CVTD", address = "Bergfelde bei Berlin, Germany", pages = "109", year = "2006", ISBN = "3-86768-117-1 (book), 3-86768-717-X (DVD)", ISBN-13 = "978-3-86768-117-9 (book), 978-3-86768-717-1 (DVD)", LCCN = "????", bibdate = "Mon May 17 09:07:48 MDT 2010", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", series = "Schriftenreihe Grenzg{\"a}nger - Linux leicht verst{\"a}ndlich; Schriftenreihe Grenzg{\"a}nger - Linux leicht verst{\"a}ndlich", acknowledgement = ack-nhfb, language = "German", subject = "Internet; Computerunterst{\"u}tzte Kommunikation; Debian GNU/LINUX 3.1; Qemu", } @Book{Chryselius:2006:IKQa, author = "Toralf Chryselius and Andrea Kuntz", title = "{Internetkommunikation in Kubuntu unter Qemu Einf{\"u}hrung in das Betriebssystem Kubuntu und Vorstellung von Internetprogrammen in der virtuellen Umgebung Qemu}. ({German}) [{Internet} Communication in {Kubuntu} under {Qemu}: Introduction to the {Kubuntu} operating system and creation of {Internet} programs in the {Qemu} virtual machine]", volume = "6", publisher = "CVTD", address = "Bergfelde bei Berlin, Germany", pages = "107", year = "2006", ISBN = "3-86768-105-8 (Buch), 3-86768-705-6 (DVD)", ISBN-13 = "978-3-86768-105-6 (Buch), 978-3-86768-705-8 (DVD)", LCCN = "????", bibdate = "Mon May 17 09:07:48 MDT 2010", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", series = "Schriftenreihe Grenzg{\"a}nger - Linux leicht verst{\"a}ndlich; Schriftenreihe Grenzg{\"a}nger - Linux leicht verst{\"a}ndlich", acknowledgement = ack-nhfb, language = "German", subject = "Internet; Computerunterst{\"u}tzte Kommunikation; Kubuntu (Program); Qemu", } @Book{Chryselius:2006:IKQb, author = "Toralf Chryselius and Andrea Kuntz", title = "{Internetkommunikation in Kanotix unter Qemu Einf{\"u}hrung in das Betriebssystem Kanotix und Vorstellung von Internetprogrammen in der virtuellen Umgebung Qemu}", volume = "34", publisher = "CVTD", address = "Bergfelde bei Berlin, Germany", pages = "114", year = "2006", ISBN = "3-86768-133-3 (book), 3-86768-733-1 (DVD)", ISBN-13 = "978-3-86768-133-9 (book), 978-3-86768-733-1 (DVD)", LCCN = "????", bibdate = "Mon May 17 09:07:48 MDT 2010", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", series = "Schriftenreihe Grenzg{\"a}nger - Linux leicht verst{\"a}ndlich; Schriftenreihe Grenzg{\"a}nger - Linux leicht verst{\"a}ndlich", acknowledgement = ack-nhfb, language = "German", subject = "Internet; Computerunterst{\"u}tzte Kommunikation; Kanotix; Qemu", } @Book{Chryselius:2006:IKQc, author = "Toralf Chryselius and Andrea Kuntz", title = "{Internetkommunikation in Knoppix unter Qemu Einf{\"u}hrung in das Betriebssystem Knoppix und Vorstellung von Internetprogrammen in der virtuellen Umgebung Qemu}", volume = "50", publisher = "CVTD", address = "Bergfelde bei Berlin, Germany", pages = "121", year = "2006", ISBN = "3-86768-149-X (book)", ISBN-13 = "978-3-86768-149-0 (book)", LCCN = "????", bibdate = "Mon May 17 09:07:48 MDT 2010", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", series = "Schriftenreihe Grenzg{\"a}nger - Linux leicht verst{\"a}ndlich; Schriftenreihe Grenzg{\"a}nger - Linux leicht verst{\"a}ndlich", acknowledgement = ack-nhfb, language = "German", subject = "Internet; Computerunterst{\"u}tzte Kommunikation; Knoppix; Qemu", } @Book{Chryselius:2006:IOQ, author = "Toralf Chryselius and Andrea Kuntz", title = "{Internetkommunikation mit OpenSUSE unter Qemu: Einf{\"u}hrung in das Betriebssystem OpenSUSE Linux und Vorstellung von Internetprogrammen in der virtuellen Umgebung Qemu}", volume = "66", publisher = "CVTD", address = "Bergfelde bei Berlin, Germany", pages = "104", year = "2006", ISBN = "3-86768-165-1", ISBN-13 = "978-3-86768-165-0", LCCN = "????", bibdate = "Mon May 17 09:07:48 MDT 2010", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", series = "Schriftenreihe Grenzg{\"a}nger - Linux leicht verst{\"a}ndlich", acknowledgement = ack-nhfb, language = "German", } @Book{Chryselius:2006:IOV, author = "Toralf Chryselius and Andrea Kuntz", title = "{Internetkommunikation in OpenSUSE unter VMware [Qemu] Einf{\"u}hrung in das Betriebssystem OpenSUSE Linux und Vorstellung von Internetprogrammen in der virtuellen Umgebung VMware}", volume = "66", publisher = "CVTD", address = "Bergfelde bei Berlin, Germany", pages = "117", year = "2006", ISBN = "3-86768-165-1 (book)", ISBN-13 = "978-3-86768-165-0 (book)", LCCN = "????", bibdate = "Mon May 17 09:07:48 MDT 2010", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", series = "Schriftenreihe Grenzg{\"a}nger - Linux leicht verst{\"a}ndlich; Schriftenreihe Grenzg{\"a}nger - Linux leicht verst{\"a}ndlich", acknowledgement = ack-nhfb, language = "German", subject = "Internet; Computerunterst{\"u}tzte Kommunikation; SuSE LINUX 10.2 OSS; Qemu", } @Book{Chryselius:2006:KLQa, author = "Toralf Chryselius and Andrea Kuntz", title = "{Knoppix Linux unter Qemu Einf{\"u}hrung in das Betriebssystem Knoppix Linux in der virtuellen Umgebung Qemu unter Windows}", volume = "49", publisher = "CVTD", address = "Bergfelde bei Berlin, Germany", pages = "142", year = "2006", ISBN = "3-86768-148-1 (book), 3-86768-748-X (DVD)", ISBN-13 = "978-3-86768-148-3 (book), 978-3-86768-748-5 (DVD)", LCCN = "????", bibdate = "Mon May 17 09:07:48 MDT 2010", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", series = "Schriftenreihe Grenzg{\"a}nger - Linux leicht verst{\"a}ndlich; Schriftenreihe Grenzg{\"a}nger - Linux leicht verst{\"a}ndlich", acknowledgement = ack-nhfb, language = "German", subject = "Knoppix; Windows XP; Qemu", } @Book{Chryselius:2006:KLQb, author = "Toralf Chryselius and Andrea Kuntz", title = "{Kanotix Linux unter Qemu Einf{\"u}hrung in das Betriebssystem Kanotix Linux in der virtuellen Umgebung Qemu unter Windows}", volume = "33", publisher = "CVTD", address = "Bergfelde bei Berlin, Germany", pages = "156", year = "2006", ISBN = "3-86768-132-5 (book), 3-86768-732-3 (DVD)", ISBN-13 = "978-3-86768-132-2 (book), 978-3-86768-732-4 (DVD)", LCCN = "????", bibdate = "Mon May 17 09:07:48 MDT 2010", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", series = "Schriftenreihe Grenzg{\"a}nger - Linux leicht verst{\"a}ndlich; Schriftenreihe Grenzg{\"a}nger - Linux leicht verst{\"a}ndlich", acknowledgement = ack-nhfb, language = "German", subject = "Kanotix; Windows XP; Qemu", } @Book{Chryselius:2006:KQE, author = "Toralf Chryselius and Andrea Kuntz", title = "{Kubuntu unter Qemu Einf{\"u}hrung in das Betriebssystem Kubuntu Linux in der virtuellen Umgebung Qemu}", volume = "5", publisher = "CVTD", address = "Bergfelde bei Berlin, Germany", pages = "158", year = "2006", ISBN = "3-86768-104-X (book), 3-86768-704-8 (DVD)", ISBN-13 = "978-3-86768-104-9 (book), 978-3-86768-704-1 (DVD)", LCCN = "????", bibdate = "Mon May 17 09:07:48 MDT 2010", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", series = "Schriftenreihe Grenzg{\"a}nger - Linux leicht verst{\"a}ndlich; Schriftenreihe Grenzg{\"a}nger - Linux leicht verst{\"a}ndlich", acknowledgement = ack-nhfb, language = "German", subject = "Kubuntu ; Windows XP; Qemu", } @Book{Chryselius:2006:LDQ, author = "Toralf Chryselius and Andrea Kuntz", title = "{Lernprogramme in Debian unter Qemu Einf{\"u}hrung in das Betriebssystem Debian und Vorstellung von Lernprogrammen in der virtuellen Umgebung Qemu}", volume = "19", publisher = "CVTD", address = "Bergfelde bei Berlin, Germany", pages = "141", year = "2006", ISBN = "3-86768-118-X (book), 3-86768-718-8 (DVD)", ISBN-13 = "978-3-86768-118-6 (book), 978-3-86768-718-8 (DVD)", LCCN = "????", bibdate = "Mon May 17 09:07:48 MDT 2010", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", series = "Schriftenreihe Grenzg{\"a}nger - Linux leicht verst{\"a}ndlich; Schriftenreihe Grenzg{\"a}nger - Linux leicht verst{\"a}ndlich", acknowledgement = ack-nhfb, language = "German", subject = "Lernprogramm; Debian GNU/LINUX 3.1; Qemu", } @Book{Chryselius:2006:LKQa, author = "Toralf Chryselius and Andrea Kuntz", title = "{Lernprogramme in Knoppix unter Qemu Einf{\"u}hrung in das Betriebssystem Knoppix und Vorstellung von Lernprogrammen in der virtuellen Umgebung Qemu}", volume = "51", publisher = "CVTD", address = "Bergfelde bei Berlin, Germany", pages = "145", year = "2006", ISBN = "3-86768-150-3 (book), 3-86768-750-1 (DVD)", ISBN-13 = "978-3-86768-150-6 (book), 978-3-86768-750-8 (DVD)", LCCN = "????", bibdate = "Mon May 17 09:07:48 MDT 2010", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", series = "Schriftenreihe Grenzg{\"a}nger - Linux leicht verst{\"a}ndlich; Schriftenreihe Grenzg{\"a}nger - Linux leicht verst{\"a}ndlich", acknowledgement = ack-nhfb, language = "German", subject = "Lernprogramm; Knoppix; Qemu", } @Book{Chryselius:2006:LKQb, author = "Toralf Chryselius and Andrea Kuntz", title = "{Lernprogramme in Kanotix unter Qemu Einf{\"u}hrung in das Betriebssystem Kanotix und Vorstellung von Lernprogrammen in der virtuellen Umgebung Qemu}", volume = "35", publisher = "CVTD", address = "Bergfelde bei Berlin, Germany", pages = "151", year = "2006", ISBN = "3-86768-134-1 (book), 3-86768-734-X (DVD)", ISBN-13 = "978-3-86768-134-6 (book), 978-3-86768-734-8 (DVD)", LCCN = "????", bibdate = "Mon May 17 09:07:48 MDT 2010", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", series = "Schriftenreihe Grenzg{\"a}nger - Linux leicht verst{\"a}ndlich; Schriftenreihe Grenzg{\"a}nger - Linux leicht verst{\"a}ndlich", acknowledgement = ack-nhfb, language = "German", subject = "Lernprogramm; Kanotix; Qemu", } @Book{Chryselius:2006:LKQc, author = "Toralf Chryselius and Andrea Kuntz", title = "{Lernprogramme in Kubuntu unter Qemu Einf{\"u}hrung in das Betriebssystem Kubuntu und Vorstellung von Lernprogrammen in der virtuellen Umgebung Qemu}", volume = "7", publisher = "CVTD", address = "Bergfelde bei Berlin, Germany", pages = "152", year = "2006", ISBN = "3-86768-106-6 (book), 3-86768-706-4 (DVD)", ISBN-13 = "978-3-86768-106-3 (book), 978-3-86768-706-5 (DVD)", LCCN = "????", bibdate = "Mon May 17 09:07:48 MDT 2010", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", series = "Schriftenreihe Grenzg{\"a}nger - Linux leicht verst{\"a}ndlich; Schriftenreihe Grenzg{\"a}nger - Linux leicht verst{\"a}ndlich", acknowledgement = ack-nhfb, language = "German", subject = "Lernprogramm; Kubuntu ; Qemu", } @Book{Chryselius:2006:LOL, author = "Toralf Chryselius and Andrea Kuntz", title = "{Lernprogramme mit OpenSUSE Linux unter Qemu: Einf{\"u}hrung in das Betriebssystem, OpenSUSE Linux und Vorstellung von Lernprogrammen in der virtuellen Umgebung Quemu}", volume = "63", publisher = "CVTD", address = "Bergfelde bei Berlin, Germany", pages = "147", year = "2006", ISBN = "3-86768-166-X, 3-86768-766-8", ISBN-13 = "978-3-86768-166-7, 978-3-86768-766-9", LCCN = "????", bibdate = "Mon May 17 09:07:48 MDT 2010", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", series = "Schriftenreihe Grenzg{\"a}nger - Linux leicht verst{\"a}ndlich", acknowledgement = ack-nhfb, language = "German", remark = "Auf dem Buchr{\"u}cken ``Lernsoftware in OpenSUSE unter Qemu'' und Band 67.", } @Book{Chryselius:2006:OLQ, author = "Toralf Chryselius and Andrea Kuntz", title = "{OpenSuSE Linux unter Qemu Einf{\"u}hrung in das Betriebssystem OpenSUSE Linux in der virtuellen Umgebng Qemu unter Windows}", volume = "65", publisher = "CVTD", address = "Bergfelde bei Berlin, Germany", pages = "168", year = "2006", ISBN = "3-86768-164-3 (book)", ISBN-13 = "978-3-86768-164-3 (book)", LCCN = "????", bibdate = "Mon May 17 09:07:48 MDT 2010", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", series = "Schriftenreihe Grenzg{\"a}nger - Linux leicht verst{\"a}ndlich; Schriftenreihe Grenzg{\"a}nger - Linux leicht verst{\"a}ndlich", acknowledgement = ack-nhfb, language = "German", subject = "SuSE LINUX 10.2 OSS; Windows XP; Qemu", } @Book{Chryselius:2006:SKD, author = "Toralf Chryselius and Andrea Kuntz", title = "{Software f{\"u}r Kinder in Debian unter Qemu Einf{\"u}hrung in das Betriebssystem Debian und Vorstellung der Lern- und Spielesammlung Gcompris in der virtuellen Umgebung Qemu}", volume = "20", publisher = "CVTD", address = "Bergfelde bei Berlin, Germany", pages = "113", year = "2006", ISBN = "3-86768-119-8 (book), 3-86768-719-6 (DVD)", ISBN-13 = "978-3-86768-119-3 (book), 978-3-86768-719-5 (DVD)", LCCN = "????", bibdate = "Mon May 17 09:07:48 MDT 2010", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", series = "Schriftenreihe Grenzg{\"a}nger - Linux leicht verst{\"a}ndlich; Schriftenreihe Grenzg{\"a}nger - Linux leicht verst{\"a}ndlich", acknowledgement = ack-nhfb, language = "German", subject = "Kind; Lernprogramm; Debian GNU/LINUX 3.1; Qemu", } @Book{Chryselius:2006:SKKa, author = "Toralf Chryselius and Andrea Kuntz", title = "{Software f{\"u}r Kinder in Kubuntu unter Qemu Einf{\"u}hrung in das Betriebssystem Kubuntu und Vorstellung der Lern- und Spielesammlung GCompris in der virtuellen Umgebung Qemu}", volume = "8", publisher = "CVTD", address = "Bergfelde bei Berlin, Germany", pages = "108", year = "2006", ISBN = "3-86768-107-4 (book), 3-86768-707-2 (DVD)", ISBN-13 = "978-3-86768-107-0 (book), 978-3-86768-707-2 (DVD)", LCCN = "????", bibdate = "Mon May 17 09:07:48 MDT 2010", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", series = "Schriftenreihe Grenzg{\"a}nger - Linux leicht verst{\"a}ndlich; Schriftenreihe Grenzg{\"a}nger - Linux leicht verst{\"a}ndlich", acknowledgement = ack-nhfb, language = "German", subject = "Kind; Lernprogramm; Kubuntu ; Qemu", } @Book{Chryselius:2006:SKKb, author = "Toralf Chryselius and Andrea Kuntz", title = "{Software f{\"u}r Kinder in Kanotix unter Qemu Einf{\"u}hrung in das Betriebssystem Kanotix und Vorstellung der Lern- und Spielesammlung GCompris in der virtuellen Umgebung Qemu}", volume = "36", publisher = "CVTD", address = "Bergfelde bei Berlin, Germany", pages = "113", year = "2006", ISBN = "3-86768-135-X (book), 3-86768-735-8 (DVD)", ISBN-13 = "978-3-86768-135-3 (book), 978-3-86768-735-5 (DVD)", LCCN = "????", bibdate = "Mon May 17 09:07:48 MDT 2010", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", series = "Schriftenreihe Grenzg{\"a}nger - Linux leicht verst{\"a}ndlich; Schriftenreihe Grenzg{\"a}nger - Linux leicht verst{\"a}ndlich", acknowledgement = ack-nhfb, language = "German", subject = "Kind; Lernprogramm; Kanotix; Qemu", } @Book{Chryselius:2006:SKKc, author = "Toralf Chryselius and Andrea Kuntz", title = "{Software f{\"u}r Kinder in Knoppix unter Qemu Einf{\"u}hrung in das Betriebssystem Knoppix und Vorstellung der Lern- und Spielesammlung GCompris in der virtuellen Umgebung Qemu}", volume = "52", publisher = "CVTD", address = "Bergfelde bei Berlin, Germany", pages = "120", year = "2006", ISBN = "3-86768-151-1 (book)", ISBN-13 = "978-3-86768-151-3 (book)", LCCN = "????", bibdate = "Mon May 17 09:07:48 MDT 2010", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", series = "Schriftenreihe Grenzg{\"a}nger - Linux leicht verst{\"a}ndlich; Schriftenreihe Grenzg{\"a}nger - Linux leicht verst{\"a}ndlich", acknowledgement = ack-nhfb, language = "German", subject = "Kind; Lernprogramm; Knoppix; Qemu", } @InProceedings{Chubb:2006:VUL, author = "Peter Chubb", title = "Virtualization and User-Level Drivers", crossref = "Anonymous:2006:PGI", pages = "??--??", year = "2006", bibdate = "Sat Oct 14 18:26:53 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.ice.gelato.org/oct06/pres_pdf/gelato_ICE06oct_vm_chubb_unsw.pdf", acknowledgement = ack-nhfb, keywords = "Intel IA-64; Itanium", } @Article{Chung:2006:TTMa, 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-COMP-ARCH-NEWS, volume = "34", number = "5", pages = "371--381", month = dec, year = "2006", CODEN = "CANED2", ISSN = "0163-5964 (ACM), 0884-7495 (IEEE)", ISSN-L = "0163-5964", bibdate = "Fri Oct 27 06:18:30 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigarch.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGARCH Computer Architecture News", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89", } @Article{Chung:2006:TTMb, 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; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGOPS Operating Systems Review", } @Article{Chung:2006:TTMc, 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-SIGPLAN, volume = "41", number = "11", pages = "371--381", month = nov, year = "2006", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/1168918.1168903", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jun 18 10:49:40 MDT 2008", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "For transactional memory (TM) to achieve widespread acceptance, transactions should not be limited to the physical resources of any specific hardware implementation. TM systems should guarantee correct execution even when transactions exceed scheduling quanta, overflow the capacity of hardware caches and physical memory, or include more independent nesting levels than what is supported in hardware. Existing proposals for TM virtualization are either incomplete or rely on complex hardware implementations, which are an overkill if virtualization is invoked infrequently in the common case. We present eXtended Transactional Memory (XTM), the first TM virtualization system that virtualizes all aspects of transactional execution (time, space, and nesting depth). XTM is implemented in software using virtual memory support. It operates at page granularity, using private copies of overflowed pages to buffer memory updates until the transaction commits and snapshots of pages to detect interference between transactions. We also describe two enhancements to XTM that use limited hardware support to address key performance bottlenecks. We compare XTM to hardware-based virtualization using both real applications and synthetic microbenchmarks. We show that despite being software-based, XTM and its enhancements are competitive with hardware-based alternatives. Overall, we demonstrate that XTM provides a complete, flexible, and low-cost mechanism for practical TM virtualization.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", keywords = "chip multi-processor; OS support; transactional memory; virtualization", } @Book{Craig:2006:VM, author = "Iain D. Craig", title = "Virtual machines", publisher = pub-SV, address = pub-SV:adr, pages = "xv + 269", year = "2006", ISBN = "1-85233-969-1", ISBN-13 = "978-1-85233-969-2", LCCN = "QA76.9.V5 C73 2006", bibdate = "Thu Mar 23 07:06:45 MST 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.loc.gov:7090/Voyager", acknowledgement = ack-nhfb, keywords = "BCPL; JVM", subject = "Virtual computer systems", } @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/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Operating Systems Review", } @Article{Crosby:2006:VR, author = "Simon Crosby and David Brown", title = "The virtualization reality", journal = j-QUEUE, volume = "4", number = "10", pages = "34--41", month = dec # "\slash " # jan, year = "2006--2007", CODEN = "AQCUAE", DOI = "https://doi.org/10.1145/1189276.1189289", ISSN = "1542-7730 (print), 1542-7749 (electronic)", ISSN-L = "1542-7730", bibdate = "Fri Jun 20 11:14:33 MDT 2008", bibsource = "https://www.math.utah.edu/pub/tex/bib/queue.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Are hypervisors the new foundation for system software?", acknowledgement = ack-nhfb, fjournal = "ACM Queue: Tomorrow's Computing Today", keywords = "hypervisor; virtual machine", } @Article{DeRosa:2006:RSD, author = "Peter DeRosa and Kai Shen and Christopher Stewart and Jonathan Pearson", title = "Realism and simplicity: disk simulation for instructional {OS} performance evaluation", journal = j-SIGCSE, volume = "38", number = "1", pages = "308--312", month = mar, year = "2006", CODEN = "SIGSD3", DOI = "https://doi.org/10.1145/1124706.1121436", ISSN = "0097-8418 (print), 2331-3927 (electronic)", ISSN-L = "0097-8418", bibdate = "Sat Nov 17 16:57:23 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigcse2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Operating system laboratory assignments based on bare hardware or detailed machine simulators can be excessively challenging for many students. In the most often used approach, students develop kernels on virtual machines with a much simplified hardware interface. Traditionally this simplification goes so far as to make realistic performance measurement impossible. We propose Vesper, an instructional disk drive simulator with a high degree of performance realism. Vesper retains simplicity while providing timing statistics close to that of real disk drives. The key to our approach is to provide hardware abstractions that are simple but yet capable of capturing device interactions with major performance impacts. Vesper laboratory assignments allow students to realistically explore the performance consequences of various system designs without the cumbersome aspects of the real hardware interface. This paper describes the design and implementation of the Vesper disk drive simulator. We evaluate the effectiveness of Vesper-based laboratory assignments in terms of operating system performance evaluation. Student experience and feedback are also reported.", acknowledgement = ack-nhfb, fjournal = "SIGCSE Bulletin (ACM Special Interest Group on Computer Science Education)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J688", } @InProceedings{DeRose:2006:EXI, author = "C{\'e}sar {De Rose}", title = "Evaluating {Xen IA-64} Security and Performance", crossref = "Anonymous:2006:PGI", pages = "??--??", year = "2006", bibdate = "Sat Oct 14 18:26:53 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.ice.gelato.org/oct06/pres_pdf/gelato_ICE06oct_xeneval_derose_pucrs.pdf", acknowledgement = ack-nhfb, keywords = "Intel IA-64; Itanium", } @Article{Dong:2006:EXI, author = "Yaozu Dong and Shaofan Li and Asit Mallick and Jun Nakajim and Kun Tian and Xuefei Xu and Fred Yang and Wilfred Yu", title = "Extending {Xen} with {Intel} Virtualization Technology", journal = j-INTEL-TECH-J, volume = "10", number = "3", pages = "193--203", day = "10", month = aug, year = "2006", DOI = "https://doi.org/10.1535/itj.1003", ISSN = "1535-766X", bibdate = "Tue Oct 17 09:02:57 2006", bibsource = "ftp://download.intel.com/technology/itj/2006/v10i3/v10_iss03.pdf; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://developer.intel.com/technology/itj/2006/v10i3/3-xen/1-abstract.htm", acknowledgement = ack-nhfb, } @InProceedings{Dong:2006:XIV, author = "Yaozu Dong", title = "{Xen} and {Intel} Virtualization Technology for {IA-64}", crossref = "Anonymous:2006:PGI", pages = "??--??", year = "2006", bibdate = "Sat Oct 14 18:26:53 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.ice.gelato.org/oct06/pres_pdf/gelato_ICE06oct_xenvt_dong_intel.pdf", acknowledgement = ack-nhfb, keywords = "Intel IA-64; Itanium", } @Article{Dyer:2006:NPD, author = "Robert Dyer and Harish Narayanappa and Hridesh Rajan", title = "{Nu}: preserving design modularity in object code", journal = j-SIGSOFT, volume = "31", number = "6", pages = "1--2", month = nov, year = "2006", CODEN = "SFENDP", DOI = "https://doi.org/10.1145/1218776.1218802", ISSN = "0163-5948 (print), 1943-5843 (electronic)", ISSN-L = "0163-5948", bibdate = "Wed Aug 1 17:15:21 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsoft2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "For a number of reasons, such as to generate object code that is compliant with the existing virtual machines (VM), current compilers for aspect-oriented languages sacrifice design modularity when transforming source to object code by losing textual locality and intermingling concerns in the object code. Sacrificing design modularity has significant costs, especially in terms of the speed of incremental compilation. We present an intermediate language design that preserves aspect-oriented design modularity in Java byte code. We briefly describe our extensions to the Sun Hotspot VM to support the new intermediate language design.", acknowledgement = ack-nhfb, fjournal = "ACM SIGSOFT Software Engineering Notes", journal-URL = "https://dl.acm.org/citation.cfm?id=J728", } @Book{ECMA-335-4, author = "{ECMA}", title = "{ECMA-335}: {Common Language Infrastructure (CLI)}", publisher = pub-ECMA, address = pub-ECMA:adr, edition = "Fourth", pages = "vii + 104 (Part I), viii + 191 (Part II), iv + 138 (Part III), ii + 20 (Part IV), i + 4 (Part V), ii + 57 (Part VI)", month = jun, year = "2006", bibdate = "Sat May 08 07:44:58 2010", bibsource = "http://www.ecma-international.org/publications/standards/Standard.htm; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.ecma-international.org/publications/files/ECMA-ST/Ecma-335.pdf; http://www.ecma-international.org/publications/files/ECMA-ST/ECMA-335.zip; http://www.ecma-international.org/publications/standards/Ecma-335.htm", acknowledgement = ack-nhfb, ECMAnumber = "ECMA-335", remark = "Also ISO/IEC 23271-2006.", } @Article{England:2006:VME, author = "Paul England and John Manferdelli", title = "Virtual machines for enterprise desktop security", journal = j-INFO-SEC-TECH-REP, volume = "11", number = "4", pages = "193--202", month = "????", year = "2006", CODEN = "ISTRFR", DOI = "https://doi.org/10.1016/j.istr.2006.09.001", ISSN = "1363-4127 (print), 1873-605X (electronic)", ISSN-L = "1363-4127", bibdate = "Sun May 8 07:58:36 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/infosectechrep.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1363412706000501", acknowledgement = ack-nhfb, ajournal = "Info. Sec. Tech. Rep.", fjournal = "Information Security Technical Report", journal-URL = "https://www.sciencedirect.com/journal/information-security-technical-report", } @Article{Eugster:2006:UPJ, author = "Patrick Eugster", title = "Uniform proxies for {Java}", journal = j-SIGPLAN, volume = "41", number = "12", pages = "139--152", month = dec, year = "2006", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Oct 24 06:22:42 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", keywords = "virtual machine", } @Article{Fabian:2006:VE, author = "Patrick Fabian and Julia Palmer and Justin Richardson and Mic Bowman and Paul Brett and Rob Knauerhase and Jeff Sedayao and John Vicente and Cheng-Chee Koh and Sanjay Rungta", title = "Virtualization in the Enterprise", journal = j-INTEL-TECH-J, volume = "10", number = "3", pages = "227--242", day = "10", month = aug, year = "2006", DOI = "https://doi.org/10.1535/itj.1003", ISSN = "1535-766X", bibdate = "Tue Oct 17 09:02:57 2006", bibsource = "ftp://download.intel.com/technology/itj/2006/v10i3/v10_iss03.pdf; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://developer.intel.com/technology/itj/2006/v10i3/6-enterprise/1-abstract.htm", acknowledgement = ack-nhfb, } @Book{Fraser:2006:PVC, author = "Stephen Fraser", title = "{Pro Visual C++\slash CLI} and the {.NET 2.0} platform", publisher = pub-APRESS, address = pub-APRESS:adr, pages = "xli + 917", year = "2006", DOI = "https://doi.org/10.1007/978-1-4302-0109-0", ISBN = "1-4302-0109-6, 1-59059-640-4", ISBN-13 = "978-1-4302-0109-0, 978-1-59059-640-1", LCCN = "QA76.73.C153 F73 2006eb", bibdate = "Mon May 17 09:04:37 MDT 2010", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", series = "The expert's voice in .NET", acknowledgement = ack-nhfb, subject = "Microsoft Visual C++; C (Computer program language); Microsoft .NET", } @Article{Fu:2006:SMA, author = "Song Fu and Cheng-Zhong Xu", title = "Stochastic modeling and analysis of hybrid mobility in reconfigurable distributed virtual machines", journal = j-J-PAR-DIST-COMP, volume = "66", number = "11", pages = "1442--1454", month = nov, year = "2006", CODEN = "JPDCER", ISSN = "0743-7315 (print), 1096-0848 (electronic)", ISSN-L = "0743-7315", bibdate = "Fri Jul 11 20:32:35 MDT 2008", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www.sciencedirect.com/science/journal/07437315", acknowledgement = ack-nhfb, fjournal = "Journal of Parallel and Distributed Computing", journal-URL = "http://www.sciencedirect.com/science/journal/07437315", } @Book{Geiselhart:2006:IZV, editor = "Gregory Geiselhart and others", title = "{IBM z\slash VM} and {Linux} on {IBM System z}: virtualization cookbook for {Red Hat Enterprise Linux 4}", number = "SG24-7272-00", publisher = pub-IBM, address = pub-IBM:adr, pages = "xiv + 218", year = "2006", ISBN = "0-7384-9495-X (paperback)", ISBN-13 = "978-0-7384-9495-1 (paperback)", LCCN = "QA76.76.O63 I28 2006", bibdate = "Thu Jan 21 14:11:12 MST 2010", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.loc.gov:7090/Voyager", series = "IBM redbooks", acknowledgement = ack-nhfb, remark = "September 2006.", subject = "Linux; Operating systems (Computers); Computer systems; IBM computers; Programming", } @Article{Gilbert:2006:IVG, author = "Laura Gilbert and Jeff Tseng and Rhys Newman and Saeed Iqbal and Ronald Pepper and Onur Celebioglu and Jenwei Hsieh and Victor Mashayekhi and Mark Cobban", title = "Implications of virtualization on {Grids} for high energy physics applications", journal = j-J-PAR-DIST-COMP, volume = "66", number = "7", pages = "922--930", month = jul, year = "2006", CODEN = "JPDCER", ISSN = "0743-7315 (print), 1096-0848 (electronic)", ISSN-L = "0743-7315", bibdate = "Fri Jul 11 20:32:34 MDT 2008", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www.sciencedirect.com/science/journal/07437315", acknowledgement = ack-nhfb, fjournal = "Journal of Parallel and Distributed Computing", journal-URL = "http://www.sciencedirect.com/science/journal/07437315", } @Article{Habib:2006:X, author = "Irfan Habib", title = "{Xen}", journal = j-LINUX-J, volume = "2006", number = "145", pages = "??--??", month = may, year = "2006", CODEN = "LIJOFX", ISSN = "1075-3583 (print), 1938-3827 (electronic)", ISSN-L = "1075-3583", bibdate = "Wed Aug 23 06:09:27 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.cl.cam.ac.uk/Research/SRG/netos/xen/documentation.html; http://www.cl.cam.ac.uk/xeno; http://www.xensource.com/", abstract = "Xen is a hypervisor virtual machine that runs multiple open-source operating systems.", acknowledgement = ack-nhfb, fjournal = "Linux journal", journal-URL = "http://portal.acm.org/citation.cfm?id=J508", } @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/virtual-machines.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 = "Operating Systems Review", } @Article{Herrod:2006:FVT, author = "Steve Herrod", title = "The Future of Virtualization Technology", journal = j-COMP-ARCH-NEWS, volume = "34", number = "2", pages = "352--352", year = "2006", CODEN = "CANED2", ISSN = "0163-5964 (ACM), 0884-7495 (IEEE)", ISSN-L = "0163-5964", bibdate = "Mon Aug 21 15:00:05 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigarch.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGARCH Computer Architecture News", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89", } @Book{Hogenson:2006:CCV, author = "Gordon Hogenson", title = "{C++\slash CLI}: the {Visual C++} language for {.NET}", publisher = pub-APRESS, address = pub-APRESS:adr, pages = "xxxiv + 412", year = "2006", DOI = "https://doi.org/10.1007/978-1-4302-0282-0", ISBN = "1-4302-0282-3, 1-59059-705-2", ISBN-13 = "978-1-4302-0282-0, 978-1-59059-705-7", LCCN = "QA76.73.C153 H59 2006eb", bibdate = "Mon May 17 09:04:37 MDT 2010", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", series = "The Expert's voice in .NET", acknowledgement = ack-nhfb, subject = "C++/CLI (Computer program language); Microsoft .NET", } @Article{Hu:2006:RST, author = "Shiliang Hu and James E. Smith", title = "Reducing Startup Time in Co-Designed Virtual Machines", journal = j-COMP-ARCH-NEWS, volume = "34", number = "2", pages = "277--288", year = "2006", CODEN = "CANED2", ISSN = "0163-5964 (ACM), 0884-7495 (IEEE)", ISSN-L = "0163-5964", bibdate = "Mon Aug 21 15:00:05 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigarch.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGARCH Computer Architecture News", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89", } @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/virtual-machines.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 = "Operating Systems Review", } @InProceedings{Inoue:2006:VNP, author = "Hiroaki Inoue and Akihisa Ikeno and Masaki Kondo and Junji Sakai and Masato Edahiro", title = "{VIRTUS}: a new processor virtualization architecture for security-oriented next-generation mobile terminals", crossref = "ACM:2006:AAI", pages = "484--489", year = "2006", DOI = "https://doi.org/10.1145/1146909.1147038", bibdate = "Sat Oct 14 14:06:32 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "We propose a new processor virtualization architecture, VIRTUS, to provide a dedicated domain for pre-installed applications and virtualized domains for downloaded native applications. With it, security-oriented next-generation mobile terminals can provide any number of domains for native applications. VIRTUS features three new technologies: VMM asymmetrization, dynamic inter-domain communication and virtualization-assist logic, and it is first in the world to virtualize an ARM-based multiprocessor.", acknowledgement = ack-nhfb, } @Book{ISO:2006:III, author = "{International Organization for Standardization}", title = "{ISO\slash IEC 23271:2006}: Information technology: {Common Language Infrastructure (CLI)} Partitions {I} to {VI}", publisher = pub-ISO, address = pub-ISO:adr, edition = "Second", year = "2006", LCCN = "????", bibdate = "Mon May 17 09:04:07 MDT 2010", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", series = "International standard", acknowledgement = ack-nhfb, remark = "This second edition cancels and replaces the first edition (ISO/IEC 23271:2003).", subject = "Information technology; Standards; Programming languages (Electronic computers)", } @Book{ISO:2006:ITCa, author = "{International Organization for Standardization}", title = "{ISO\slash IEC TR 23272:2006}: Information technology: {Common Language Infrastructure (CLI)}: technical report on information derived from Partition {IV} {XML} file", publisher = pub-ISO, address = pub-ISO:adr, edition = "Second", pages = "????", year = "2006", LCCN = "????", bibdate = "Mon May 17 09:04:07 MDT 2010", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", series = "Technical report", acknowledgement = ack-nhfb, remark = "Cancels and replaces the first edition (ISO/IEC TR 23272:2003).", subject = "Programming languages (Electronic computers)", } @Book{ISO:2006:ITCb, author = "{International Organization for Standardization }", title = "{ISO\slash IEC TR 25438:2006}: Information technology: {Common Language Infrastructure (CLI)}: technical report: common generics", publisher = pub-ISO, address = pub-ISO:adr, year = "2006", LCCN = "????", bibdate = "Mon May 17 09:04:07 MDT 2010", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", series = "Technical report", acknowledgement = ack-nhfb, subject = "programming languages (electronic computers)", } @InProceedings{Jones:2006:ATP, author = "Stephen T. Jones and Andrea C. Arpaci-Dusseau and Remzi H. Arpaci-Dusseau", title = "{Antfarm}: Tracking Processes in a Virtual Machine Environment", crossref = "USENIX:2006:PUA", pages = "??--??", year = "2006", bibdate = "Wed Oct 18 11:41:42 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.usenix.org/events/usenix06/tech/jones.html", acknowledgement = ack-nhfb, } @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/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Operating Systems Review", } @Book{Joos:2006:OHE, author = "Thomas Joos", title = "{Das Online-Handbuch: enth{\"u}llt: Providerwahl, E-Mail, eBay, Google, Skype, Chatten, Instant messaging und vieles mehr; [auf der CD: Firefox 1.5, Thunderbird 1.5, OpenOffice 2.01, Oleco NetLCR, Netstumbler, VMWare Player, WINRar und vieles mehr]}", publisher = "Markt-+-Technik-Verl.", address = "M{\"u}nchen, Germany", pages = "905", year = "2006", ISBN = "3-8272-4076-X", ISBN-13 = "978-3-8272-4076-7", LCCN = "????", bibdate = "Sat Oct 14 17:21:53 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.gbv.de:20011/gvk", price = "EUR 39.90 (DE)", acknowledgement = ack-nhfb, language = "German", subject = "Internet", } @Article{Jordan:2006:SJT, author = "Mick Jordan and Laurent Dayn{\`e}s and Marcin Jarzab and Ciar{\'a}n Bryce and Grzegorz Czajkowski", title = "Scaling {J2EE} {\TM} application servers with the {Multi-tasking Virtual Machine}", journal = j-SPE, volume = "36", number = "6", pages = "557--580", month = may, year = "2006", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/spe.703", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Wed Oct 17 18:33:12 MDT 2007", bibsource = "http://www.interscience.wiley.com/jpages/0038-0644; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www3.interscience.wiley.com/journalfinder.html", acknowledgement = ack-nhfb, fjournal = "Software---Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", onlinedate = "14 Feb 2006", } @MastersThesis{Kelly:2006:PMX, author = "Ivan Kelly", title = "Porting {MINIX} to {Xen}", type = "Final year project", institution = "University of Limerick", school = "Department of Computer Science, University of Limerick", address = "Limerick, Ireland", pages = "vii + 45", day = "8", month = may, year = "2006", bibdate = "Fri Oct 24 09:09:23 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/minix.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://minixonxen.skynet.ie/cgi-bin/trac.cgi/attachment/wiki/Report/Report.pdf?format=raw; http://www.minix3.org/theses/kelly-xen.pdf", abstract = "Virtualisation has received a lot of attention from the I.T. media lately. Paravirtualisation in particular has drawn a lot of attention due to its high performance. Paravirtualised virtual machines run at near native speeds. Operating systems must be modified to run on paravirtualised platforms.\par Developers starting out in the field of paravirtualisation face a steep learning curve. This project hopes to soften that curve, by supplying developers with an insight into the porting of an operating system to a paravirtualised platform. In this case, the MINIX operating system is ported to the Xen platform.", acknowledgement = ack-nhfb, } @InProceedings{Liu:2006:HPV, author = "Jiuxing Liu and Wei Huang and Bulent Abali and Dhabaleswar K. Panda", title = "High Performance {VMM}-Bypass {I/O} in Virtual Machines", crossref = "USENIX:2006:PUA", pages = "??--??", year = "2006", bibdate = "Wed Oct 18 11:41:42 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, keywords = "virtual machine monitor (VMM)", } @Book{Marshall:2006:ASV, author = "David (David W.) Marshall and Wade A. Reynolds and Dave McCrory", title = "Advanced server virtualization: {VMware} and {Microsoft} platforms in the virtual data center", publisher = pub-AUERBACH, address = pub-AUERBACH:adr, pages = "xvi + 742", year = "2006", ISBN = "0-8493-3931-6", ISBN-13 = "978-0-8493-3931-8", LCCN = "QA76.76.O63 M3646 2006", bibdate = "Thu Jan 21 14:08:59 MST 2010", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.loc.gov:7090/Voyager", URL = "http://www.loc.gov/catdir/enhancements/fy0702/2006008008-d.html; http://www.loc.gov/catdir/toc/ecip0610/2006008008.html", acknowledgement = ack-nhfb, subject = "VMware; Operating systems (Computers); Virtual computer systems", } @InProceedings{Menon:2006:ONV, author = "Aravind Menon and Alan L. Cox and Willy Zwaenepoel", title = "Optimizing Network Virtualization in {Xen}", crossref = "USENIX:2006:PUA", pages = "??--??", year = "2006", bibdate = "Wed Oct 18 11:41:42 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.usenix.org/events/usenix06/tech/menon.html", acknowledgement = ack-nhfb, } @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/virtual-machines.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 = "Operating Systems Review", } @Book{Moreno:2006:NV, author = "Victor Moreno and Kumar Reddy", title = "Network virtualization", publisher = "Cisco Press", address = "Indianapolis, IN, USA", pages = "xx + 365", year = "2006", ISBN = "1-58705-248-2", ISBN-13 = "978-1-58705-248-4", LCCN = "TK5105.875.E87 M65 2006", bibdate = "Thu Jan 21 14:10:34 MST 2010", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.loc.gov:7090/Voyager", URL = "http://www.loc.gov/catdir/toc/fy0703/2005926713.html", acknowledgement = ack-nhfb, subject = "Extranets (Computer networks); Computer network architectures; Virtual computer systems", } @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/virtual-machines.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 = "Operating Systems Review", } @Book{Muller:2006:SVP, author = "Al Muller and Andy Jones and David E. Williams and Stephen Beaver and David A. Payne and Jeremy Pries and David E. Hart", title = "Scripting {VMware} Power Tools: Automating Virtual Infrastructure Administration", publisher = pub-SYNGRESS, address = pub-SYNGRESS:adr, pages = "xviii + 398", year = "2006", ISBN = "1-59749-059-8", ISBN-13 = "978-1-59749-059-7", LCCN = "QA76.76.O63 S385 2006eb", bibdate = "Sat Oct 14 17:53:01 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www.oreilly.com/catalog/1597490598/", acknowledgement = ack-nhfb, } @Article{Neiger:2006:IVT, author = "Gil Neiger and Amy Santoni and Felix Leung and Dion Rodgers and Rich Uhlig", title = "{Intel Virtualization Technology}: Hardware Support for Efficient Processor Virtualization", journal = j-INTEL-TECH-J, volume = "10", number = "3", pages = "167--177", day = "10", month = aug, year = "2006", DOI = "https://doi.org/10.1535/itj.1003", ISSN = "1535-766X", bibdate = "Tue Oct 17 09:02:57 2006", bibsource = "ftp://download.intel.com/technology/itj/2006/v10i3/v10_iss03.pdf; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://developer.intel.com/technology/itj/2006/v10i3/1-hardware/1-abstract.htm", acknowledgement = ack-nhfb, } @Article{Neumann:2006:IVT, author = "Dean Neumann and Dileep Kulkarni and Aaron Kunze and Gerald Rogers and Edwin Verplanke", title = "{Intel Virtualization Technology} in Embedded and Communications Infrastructure Applications", journal = j-INTEL-TECH-J, volume = "10", number = "3", pages = "", day = "10", month = aug, year = "2006", DOI = "https://doi.org/10.1535/itj.1003", ISSN = "1535-766X", bibdate = "Tue Oct 17 09:02:57 2006", bibsource = "ftp://download.intel.com/technology/itj/2006/v10i3/v10_iss03.pdf; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://developer.intel.com/technology/itj/2006/v10i3/5-communications/1-abstract.htm", acknowledgement = ack-nhfb, } @InProceedings{Oi:2006:IFH, author = "Hitoshi Oi", title = "Instruction folding in a hardware-translation based {Java Virtual Machine}", crossref = "ACM:2006:PCC", pages = "139--146", year = "2006", DOI = "https://doi.org/10.1145/1128022.1128041", bibdate = "Tue Jun 20 06:49:31 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Bytecode hardware-translation improves the performance of a Java Virtual Machine (JVM) with small hardware resource and complexity overhead. Instruction folding is a technique to further improve the performance of a JVM by reducing the redundancy in the stack-based instruction execution. However, the variable instruction length of the Java bytecode makes the folding logic complex. In this paper, we propose a folding scheme with reduced hardware complexity and evaluate its performance. For seven benchmark cases, the proposed scheme folded 6.6\% to 37.1\% of the bytecodes which correspond to 84.2\% to 102\% of the PicoJava-II's performance.", acknowledgement = ack-nhfb, } @Article{Pickett:2006:SSF, author = "Christopher J. F. Pickett and Clark Verbrugge", title = "{SableSpMT}: a software framework for analysing speculative multithreading in {Java}", journal = j-SIGSOFT, volume = "31", number = "1", pages = "59--66", month = jan, year = "2006", CODEN = "SFENDP", DOI = "https://doi.org/10.1145/1108768.1108809", ISSN = "0163-5948 (print), 1943-5843 (electronic)", ISSN-L = "0163-5948", bibdate = "Wed Aug 1 17:15:12 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/multithreading.bib; https://www.math.utah.edu/pub/tex/bib/sigsoft2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Speculative multithreading (SpMT) is a promising optimisation technique for achieving faster execution of sequential programs on multiprocessor hardware. Analysis of and data acquisition from such systems is however difficult and complex, and is typically limited to a specific hardware design and simulation environment. We have implemented a flexible, software-based speculative multithreading architecture within the context of a full-featured Java virtual machine. We consider the entire Java language and provide a complete set of support features for speculative execution, including return value prediction. Using our system we are able to generate extensive dynamic analysis information, analyse the effects of runtime feedback, and determine the impact of incorporating static, offline information. Our approach allows for accurate analysis of Java SpMT on existing, commodity multiprocessor hardware, and provides a vehicle for further experimentation with speculative approaches and optimisations.", acknowledgement = ack-nhfb, fjournal = "ACM SIGSOFT Software Engineering Notes", journal-URL = "https://dl.acm.org/citation.cfm?id=J728", } @InProceedings{Quynh:2006:RTI, author = "Nguyen Anh Quynh and Yoshiyasu Takefuji", title = "A Real-time Integrity Monitor for {Xen} Virtual Machine", crossref = "IEEE:2006:PIC", pages = "90--??", year = "2006", DOI = "https://doi.org/10.1109/ICNS.2006.13", bibdate = "Sat Oct 14 14:17:20 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "File-system integrity tools (FIT) are commonly deployed to assist forensic investigation after security incidents and as host-based intrusion detections (HIDS) tool to detect unauthorized file-system changes. Basically all the current solutions employ the same tactic: the administrator specifies a list of critical files and directories that needs to be monitored, then uses the FIT to create a base-line database that tracks general parameters about these files. The FIT is then re-run periodically, and if it detects the modifies of the filesystem against the information stored in the database, the report on the changed file is generated. However, this strategy is far from perfect: the intrusion detection cannot be done in real-time, which might render the whole scheme useless if the attacker can somehow take over the system with privileged access in the time between. The administrator also has a lot of problems to keep the database updating. Besides, he must do everything he can to protect the database and the FIT itself from compromising by the attacker, which is not an easy task especially if the attacker gains local access.", acknowledgement = ack-nhfb, } @Article{Ramachandran:2006:NCV, author = "Mahendra Ramachandran and Ned Smith and Matthew Wood and Sharad Garg and Jim Stanley and Eswar Eduri and Rinat Rappoport and Arie Chobotaro and Carl Klotz and Lori Janz", title = "New Client Virtualization Usage Models Using {Intel Virtualization Technology}", journal = j-INTEL-TECH-J, volume = "10", number = "3", pages = "205--216", day = "10", month = aug, year = "2006", DOI = "https://doi.org/10.1535/itj.1003", ISSN = "1535-766X", bibdate = "Tue Oct 17 09:02:57 2006", bibsource = "ftp://download.intel.com/technology/itj/2006/v10i3/v10_iss03.pdf; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://developer.intel.com/technology/itj/2006/v10i3/4-models/1-abstract.htm", acknowledgement = ack-nhfb, } @Book{ReFerre:2006:VIS, editor = "Massimo {Re Ferre'} and others", title = "Virtualization on the {IBM System x3950 Server}", publisher = pub-IBM, address = pub-IBM:adr, pages = "xii + 272", year = "2006", ISBN = "0-7384-9709-6 (paperback)", ISBN-13 = "978-0-7384-9709-9 (paperback)", LCCN = "QA76.9.V5 V578 2006", bibdate = "Thu Jan 21 14:11:31 MST 2010", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.loc.gov:7090/Voyager", series = "IBM redbooks; IBM eserver", URL = "http://www.loc.gov/catdir/toc/fy0706/2006284881.html", acknowledgement = ack-nhfb, remark = "The ``e'' in ``eserver'' is printed as the symbol for electronic. June 2006.", subject = "Virtual computer systems; IBM computers", } @Book{Robbins:2006:LGC, author = "Stuart Robbins", title = "Lessons in grid computing: the system is a mirror", publisher = pub-WILEY, address = pub-WILEY:adr, pages = "xviii + 363", year = "2006", ISBN = "0-471-79010-9 (cloth)", ISBN-13 = "978-0-471-79010-5 (cloth)", LCCN = "HD30.2 .R627 2006", bibdate = "Thu Jan 21 14:09:07 MST 2010", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.loc.gov:7090/Voyager", URL = "http://www.loc.gov/catdir/enhancements/fy0740/2006002910-b.html; http://www.loc.gov/catdir/enhancements/fy0740/2006002910-d.html; http://www.loc.gov/catdir/toc/ecip067/2006002910.html", acknowledgement = ack-nhfb, subject = "Information technology; Management; Business; Computer networks; Management information systems; Industrial management; Technological innovations; Decision making", tableofcontents = "Prime theorem \\ Interfaces \\ Relationship management \\ Virtualization \\ Orchestration \\ Complexity \\ Distributed resources \\ Flash teams \\ Network as narrative form \\ Identity \\ Organizational architecture \\ (Theory of) resonant usability \\ Turbulence \\ Libraries \\ Abstraction \\ Insubordination as an asset \\ The consortium \\ The everysphere \\ Q narratives \\ Leaving flatland \\ We are the platform", } @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/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Operating Systems Review", } @Article{Seetharaman:2006:TOU, author = "Swaminathan Seetharaman and Krishna Murthy", title = "Test Optimization Using Software Virtualization", journal = j-IEEE-SOFTWARE, volume = "23", number = "5", pages = "66--69", month = sep # "\slash " # oct, year = "2006", CODEN = "IESOEG", DOI = "https://doi.org/10.1109/MS.2006.143", ISSN = "0740-7459 (print), 0740-7459 (electronic)", ISSN-L = "0740-7459", bibdate = "Thu Jul 3 12:17:28 MDT 2008", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeesoft.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Software", journal-URL = "http://www.computer.org/portal/web/csdl/magazines/software", } @InProceedings{Smith:2006:SID, author = "Matthew Smith and Michael Engel and Thomas Friese and Bernd Freisleben and Gregory A. Koenig and William Yurcik", title = "Security Issues in On-Demand Grid and Cluster Computing", crossref = "Turner:2006:SIS", pages = "24--??", year = "2006", bibdate = "Sat Oct 14 15:36:21 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "In this paper, security issues in on-demand Grid and cluster computing are analyzed, a corresponding threat model is presented and the challenges with respect to authentication, authorization, delegation and single sign-on, secure communication, auditing, safety, and confidentiality are discussed. Three different levels of on-demand computing are identified, based on the number of resource providers, solution producers and users, and the trust relationships between them. It is argued that the threats associated with the first two levels can be handled by employing operating system virtualization technologies based on Xen, whereas the threats of the third level require the use of hardware security modules proposed in the context of the Trusted Computing Platform Alliance (TCPA). The presented security mechanisms increase the resilience of the service hosting environment against both malicious attacks and erroneous code. Thus, our proposal paves the way for large scale hosting of Grid or web services in commercial scenarios.", acknowledgement = ack-nhfb, } @Book{Spivey:2006:VHH, author = "Mark D. Spivey", title = "Virtually hacking: hacking the virtual computer", publisher = "Taylor and Francis", address = "Boca Raton, FL, USA", pages = "????", year = "2006", ISBN = "0-8493-7057-4", ISBN-13 = "978-0-8493-7057-1", LCCN = "QA76.76.O63 S6755 2006", bibdate = "Sat Oct 14 17:21:39 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.loc.gov:7090/Voyager", URL = "http://www.loc.gov/catdir/toc/ecip0612/2006013484.html", acknowledgement = ack-nhfb, subject = "VMware; Operating systems (Computers); Virtual computer systems", } @Book{Sprang:2006:XVL, author = "Henning Sprang", title = "{Xen: Virtualisierung unter Linux}", publisher = "Open Source Press", address = "M{\"u}nchen, Germany", pages = "350", year = "2006", ISBN = "3-937514-29-5", ISBN-13 = "978-3-937514-29-1", LCCN = "????", bibdate = "Sat Oct 14 17:41:07 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.gbv.de:20011/gvk", price = "ca. EUR 39.90, EUR 41.35 (AT)", acknowledgement = ack-nhfb, language = "German", } @Article{Swaine:2006:VR, author = "Michael Swaine", title = "Is Virtualization Real?", journal = j-DDJ, volume = "31", number = "12", pages = "18--19, 21--22", month = dec, year = "2006", CODEN = "DDJOEB", ISSN = "1044-789X", bibdate = "Fri Nov 17 07:22:34 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Dr. Dobb's Journal of Software Tools", } @Article{Tanenbaum:2006:CWM, author = "Andrew S. Tanenbaum and Jorrit N. Herder and Herbert Bos", title = "Can We Make Operating Systems Reliable and Secure?", journal = j-COMPUTER, volume = "39", number = "5", pages = "44--51", month = may, year = "2006", CODEN = "CPTRB4", DOI = "https://doi.org/10.1109/MC.2006.156", ISSN = "0018-9162 (print), 1558-0814 (electronic)", ISSN-L = "0018-9162", bibdate = "Fri Oct 24 08:45:10 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/computer2000.bib; https://www.math.utah.edu/pub/tex/bib/minix.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "Cover feature.", URL = "http://www.computer.org/csdl/mags/co/2006/05/r5044-abs.html", abstract = "Microkernels long discarded as unacceptable because of their lower performance compared with monolithic kernels might be making a comeback in operating systems due to their potentially higher reliability, which many researchers now regard as more important than performance. Each of the four different attempts to improve operating system reliability focuses on preventing buggy device drivers from crashing the system. In the Nooks approach, each driver is individually hand wrapped in a software jacket to carefully control its interactions with the rest of the operating system, but it leaves all the drivers in the kernel. The paravirtual machine approach takes this one step further and moves the drivers to one or more machines distinct from the main one, taking away even more power from the drivers. Both of these approaches are intended to improve the reliability of existing (legacy) operating systems. In contrast, two other approaches replace legacy operating systems with more reliable and secure ones. The multiserver approach runs each driver and operating system component in a separate user process and allows them to communicate using the microkernel's IPC mechanism. Finally, Singularity, the most radical approach, uses a type-safe language, a single address space, and formal contracts to carefully limit what each module can do.", acknowledgement = ack-nhfb, fjournal = "Computer", journal-URL = "http://www.computer.org/portal/web/csdl/magazines/computer; http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2", } @Article{Travostino:2006:SLM, author = "Franco Travostino and Paul Daspit and Leon Gommans and Chetan Jog and Cees de Laat and Joe Mambretti and Inder Monga and Bas van Oudenaarde and Satish Raghunath and Phil Yonghui Wang", title = "Seamless live migration of virtual machines over the {MAN\slash WAN}", journal = j-FUT-GEN-COMP-SYS, volume = "22", number = "8", pages = "901--907", month = oct, year = "2006", CODEN = "FGSEVI", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Sat Sep 11 13:08:07 MDT 2010", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www.sciencedirect.com/science/journal/0167739X", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Uhlig:2006:F, author = "Rich Uhlig", title = "Forward: {Intel Virtualization Technology}: Taking Virtualization Mainstream on {Intel} Architecture Platforms", journal = j-INTEL-TECH-J, volume = "10", number = "3", pages = "v--vi", day = "10", month = aug, year = "2006", DOI = "https://doi.org/10.1535/itj.1003", ISSN = "1535-766X", bibdate = "Tue Oct 17 09:02:57 2006", bibsource = "ftp://download.intel.com/technology/itj/2006/volume10issue02/vol10_iss03.pdf; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://developer.intel.com/technology/itj/2006/v10i3/foreword.htm", acknowledgement = ack-nhfb, } @Article{Vachon:2006:DBV, author = "Travis Vachon", title = "Dynamic balancing of virtual operating systems", journal = "Journal of Computing Sciences in Colleges", volume = "21", number = "6", pages = "309--310", month = jun, year = "2006", CODEN = "????", ISSN = "????", bibdate = "Sat Oct 14 14:23:59 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Recent improvements in computer hardware have made possible the use of virtualization techniques. While many of these techniques have focused on providing virtualized programming language environments, recently technology has emerged which aims to virtualize entire operating system environments.", acknowledgement = ack-nhfb, } @InProceedings{Vallee:2006:OTX, author = "Geoffroy Vallee and Stephen L. Scott", title = "{OSCAR} Testing with {Xen}", crossref = "IEEE:2006:PIS", pages = "43--?", year = "2006", DOI = "https://doi.org/10.1109/HPCS.2006.31", bibdate = "Sat Oct 14 13:57:08 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "The development of new OSCAR packages and of new releases is difficult because of the testing required for the ever growing set of supported Linux distributions. Each time, a new cluster has to be setup, including the full installation of the head node system. At the same time, some paravirtualization software, like Xen, allows one to create a set of virtual machines on a single physical machine. Therefore, the use of Xen for cluster virtualization and OSCAR testing may be interesting. This document presents Xen-OSCAR, a framework based on Xen, which aims at providing a solution to create a virtual OSCAR cluster.", acknowledgement = ack-nhfb, } @InProceedings{vanDoorn:2006:HVT, author = "Leendert van Doorn", title = "Hardware virtualization trends", crossref = "ACM:2006:VPS", pages = "45--45", year = "2006", DOI = "https://doi.org/10.1145/1134760.1134762", bibdate = "Sat Oct 14 15:16:51 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "As Intel is rolling out its Vanderpool processor virtualization technology and AMD its Secure Virtual Machine technology, we are only seeing the first wave of processor virtualization assists. Over the next few years the x86 space will change dramatically. We will see the introduction of massive multi-core, 64-bit, 2 nd generation processor virtualization capabilities, I/O isolation capabilities, and hardware security assists.Both Intel and AMD are differentiating their processors by providing enhancements that enable you to run multiple virtual machines in such a way that the guest is unaware that it is being virtualized. Ironically, largely because these technologies have been unavailable for so long, Linux and Windows are going into a different direction: paravirtualization. With paravirtualization the guest operating system collaborates closely with the virtual machine monitor through a set of well defined software interfaces. This approach does not require any new hardware features at all and has the potential of performing much better. So, this raises an interesting dilemma: Some of the new virtualization capabilities may already be obsolete before they are brought to market.In this talk I will discuss the new virtualization technologies that will be introduced over the next few years, how they help virtualization, what challenges they pose and how these virtualization technologies will likely consolidate.", acknowledgement = ack-nhfb, } @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/virtual-machines.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 = "Operating Systems Review", } @Article{Vaughan-Nichols:2006:NAV, author = "Stephen J. Vaughan-Nichols", title = "New Approach to Virtualization Is a Lightweight", journal = j-COMPUTER, volume = "39", number = "11", pages = "12--14", month = nov, year = "2006", CODEN = "CPTRB4", DOI = "https://doi.org/10.1109/MC.2006.393", ISSN = "0018-9162 (print), 1558-0814 (electronic)", ISSN-L = "0018-9162", bibdate = "Fri Jul 4 17:16:21 MDT 2008", bibsource = "https://www.math.utah.edu/pub/tex/bib/computer2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://csdl.computer.org/comp/mags/co/2006/11/ry012.pdf", acknowledgement = ack-nhfb, fjournal = "Computer", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2", } @Article{Venstermans:2006:BVB, author = "Kris Venstermans and Lieven Eeckhout and Koen {De Bosschere}", title = "64-bit versus 32-bit {Virtual Machines} for {Java}", journal = j-SPE, volume = "36", number = "1", pages = "1--26", month = jan, year = "2006", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/spe.679", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Tue Mar 14 11:39:19 MST 2006", bibsource = "http://www.interscience.wiley.com/jpages/0038-0644; https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www3.interscience.wiley.com/journalfinder.html", abstract = "The Java language is popular because of its platform independence, making it useful in a lot of technologies ranging from embedded devices to high-performance systems. The platform-independent property of Java, which is visible at the Java bytecode level, is only made possible thanks to the availability of a Virtual Machine (VM), which needs to be designed specifically for each underlying hardware platform. More specifically, the same Java bytecode should run properly on a 32-bit or a 64-bit VM. In this paper, we compare the behavioral characteristics of 32-bit and 64-bit VMs using a large set of Java benchmarks. This is done using the Jikes Research VM as well as the IBM JDK 1.4.0 production VM on a PowerPC-based IBM machine. By running the PowerPC machine in both 32-bit and 64-bit mode we are able to compare 32-bit and 64-bit VMs. We conclude that the space an object takes in the heap in 64-bit mode is 39.3\% larger on average than in 32-bit mode. We identify three reasons for this: (i) the larger pointer size, (ii) the increased header and (iii) the increased alignment. The minimally required heap size is 51.1\% larger on average in 64-bit than in 32-bit mode. From our experimental setup using hardware performance monitors, we observe that 64-bit computing typically results in a significantly larger number of data cache misses at all levels of the memory hierarchy. In addition, we observe that when a sufficiently large heap is available, the IBM JDK 1.4.0 VM is 1.7\% slower on average in 64-bit mode than in 32-bit mode.", acknowledgement = ack-nhfb, fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", keywords = "64-bit versus 32-bit computing; Java; performance evaluation; PowerPC; Virtual Machine", onlinedate = "15 Sep 2005", } @InProceedings{Wells:2006:HSS, author = "Philip M. Wells and Koushik Chakraborty and Gurindar S. Sohi", title = "Hardware support for spin management in overcommitted virtual machines", crossref = "ACM:2006:PPI", pages = "124--133", year = "2006", DOI = "https://doi.org/10.1145/1152154.1152176", bibdate = "Sat Oct 14 15:03:50 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Multiprocessor operating systems (OSs) pose several unique and conflicting challenges to System Virtual Machines (System VMs). For example, most existing system VMs resort to gang scheduling a guest OS's virtual processors (VCPUs) to avoid OS synchronization overhead. However, gang scheduling is infeasible for some application domains, and is inflexible in other domains.In an overcommitted environment, an individual guest OS has more VCPUs than available physical processors (PCPUs), precluding the use of gang scheduling. In such an environment, we demonstrate a more than two-fold increase in runtime when transparently virtualizing a chip-multiprocessor's cores. To combat this problem, we propose a hardware technique to detect several cases when a VCPU is not performing useful work, and suggest preempting that VCPU to run a different, more productive VCPU. Our technique can dramatically reduce cycles wasted on OS synchronization, without requiring any semantic information from the software.We then present a case study, typical of server consolidation, to demonstrate the potential of more flexible scheduling policies enabled by our technique. We propose one such policy that logically partitions the CMP cores between guest VMs. This policy increases throughput by 10\%--25\% for consolidated server workloads due to improved cache locality and core utilization, and substantially improves performance isolation in private caches.", acknowledgement = ack-nhfb, } @Book{Wills:2006:PVC, author = "Dean C. Wills", title = "{Pro Visual C++ 2005} for developers: featuring {C++\slash CLI}", publisher = pub-APRESS, address = pub-APRESS:adr, pages = "xxxii + 379", year = "2006", ISBN = "1-59059-608-0", ISBN-13 = "978-1-59059-608-1", LCCN = "QA76.73.C153 W5526 2006", bibdate = "Mon May 17 09:04:37 MDT 2010", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", series = "Books for professionals by professionals", URL = "http://www.loc.gov/catdir/toc/fy0803/2008295944.html", acknowledgement = ack-nhfb, subject = "Microsoft Visual C++; C++ (Computer program language); Microsoft .NET", } @TechReport{Wright:2006:IJV, author = "Greg Wright and Mario Wolczko and Phil McGachey and Erika Gunadi", title = "Introspection of a {Java Virtual Machine} under Simulation", type = "Technical Report", number = "TR-2006-159", institution = "Sun Microsystems, Inc.", address = "Menlo Park, CA, USA", month = sep, year = "2006", bibdate = "Tue Oct 24 08:05:32 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://research.sun.com/techrep/2006/smli_tr-2006-159.pdf", abstract = "Virtual machines are commonly used in commercially-significant systems, for example, Sun Microsystems' Java and Microsoft's .NET. The virtual machine offers many advantages to the system designer and administrator, but complicates the task of workload characterization: it presents an extra abstraction layer between the application and observed hardware effects. Understanding the behavior of the virtual machine is therefore important for all levels of the system architecture.\par We have constructed a tool which examines the state of a Sun Java HotSpot virtual machine running inside Virtutech's Simics execution-driven simulator. We can obtain detailed information about the virtual machine and application without disturbing the state of the simulation. For data, we can answer such questions as: Is a given address in the heap? If so, in which object? Of what class? For code, we can map program counter values back to Java methods and approximate Java source line information. Our tool allows us to relate individual events in the simulation, for example, a cache miss, to the higher-level behavior of the application and virtual machine.\par In this report, we present the design of our tool, including its capabilities and limitations, and demonstrate its application on the simulation's cache contents and cache misses.", acknowledgement = ack-nhfb, } @InProceedings{Yu:2006:FWV, author = "Yang Yu and Fanglu Guo and Susanta Nanda and Lap-chung Lam and Tzi-cker Chiueh", title = "A feather-weight virtual machine for {Windows} applications", crossref = "ACM:2006:VPS", pages = "24--34", year = "2006", DOI = "https://doi.org/10.1145/1134760.1134766", bibdate = "Sat Oct 14 14:42:37 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Many fault-tolerant and intrusion-tolerant systems require the ability to execute unsafe programs in a realistic environment without leaving permanent damages. Virtual machine technology meets this requirement perfectly because it provides an execution environment that is both realistic and isolated. In this paper, we introduce an OS level virtual machine architecture for Windows applications called Feather-weight Virtual Machine (FVM), under which virtual machines share as many resources of the host machine as possible while still isolated from one another and from the host machine. The key technique behind FVM is namespace virtualization, which isolates virtual machines by renaming resources at the OS system call interface. Through a copy-on-write scheme, FVM allows multiple virtual machines to physically share resources but logically isolate their resources from each other. A main technical challenge in FVM is how to achieve strong isolation among different virtual machines and the host machine, due to numerous namespaces and interprocess communication mechanisms on Windows. Experimental results demonstrate that FVM is more flexible and scalable, requires less system resource, incurs lower start-up and run-time performance overhead than existing hardware-level virtual machine technologies, and thus makes a compelling building block for security and fault-tolerant applications.", acknowledgement = ack-nhfb, } @Article{Zhang:2006:SPV, author = "Jianyong Zhang and Anand Sivasubramaniam and Qian Wang and Alma Riska and Erik Riedel", title = "Storage performance virtualization via throughput and latency control", journal = j-TOS, volume = "2", number = "3", pages = "283--308", month = aug, year = "2006", CODEN = "????", ISSN = "1553-3077 (print), 1553-3093 (electronic)", ISSN-L = "1553-3077", bibdate = "Sat Apr 14 11:04:31 MDT 2007", bibsource = "http://www.acm.org/pubs/contents/journals/tos/; https://www.math.utah.edu/pub/tex/bib/tos.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "ACM Transactions on Storage", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J960", } @Article{Zhao:2006:DFS, author = "Ming Zhao and Jian Zhang and Renato J. Figueiredo", title = "Distributed File System Virtualization Techniques Supporting On-Demand Virtual Machine Environments for Grid Computing", journal = "Cluster Computing", volume = "9", number = "1", pages = "45--56", month = jan, year = "2006", DOI = "https://doi.org/10.1007/s10586-006-4896-x", ISSN = "1386-7857", bibdate = "Sat Oct 14 15:00:03 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "This paper presents a data management solution which allows fast Virtual Machine (VM) instantiation and efficient run-time execution to support VMs as execution environments in Grid computing. It is based on novel distributed file system virtualization techniques and is unique in that: (1) it provides on-demand cross-domain access to VM state for unmodified VM monitors; (2) it enables private file system channels for VM instantiation by secure tunneling and session-key based authentication; (3) it supports user-level and write-back disk caches, per-application caching policies and middleware-driven consistency models; and (4) it leverages application-specific meta-data associated with files to expedite data transfers. The paper reports on its performance in wide-area setups using VMware-based VMs. Results show that the solution delivers performance over 30\ better than native NFS and with warm caches it can bring the application-perceived overheads below 10\% compared to a local-disk setup. The solution also allows a VM with 1.6 GB virtual disk and 320 MB virtual memory to be cloned within 160 seconds for the first clone and within 25 seconds for subsequent clones.", acknowledgement = ack-nhfb, } @Book{Zimmer:2006:VSV, author = "Dennis Zimmer", title = "{VMware Server and VMware Player: [Installation, Anwendung und Konfiguration; Konzeption und Einsatzm{\"o}glichkeiten; virtuelle Maschinen erstellen und nutzen]}", publisher = "Galileo Press", address = "Bonn, Germany", pages = "358", year = "2006", ISBN = "3-89842-822-2", ISBN-13 = "978-3-89842-822-4", LCCN = "????", bibdate = "Sat Oct 14 17:21:53 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.gbv.de:20011/gvk", series = "Galileo Computing", acknowledgement = ack-nhfb, language = "German", remark = "DVD-ROM u.d.T.: Zimmer, Dennis: VMware Server. - Falsche ISBN im Buch und auf der DVD-ROM.", } @InProceedings{Zimmermann:2006:AHM, author = "Alexander Zimmermann and Mesut G{\"u}nes and Martin Wenig and Jan Ritzerfeld and Ulrich Meis", title = "Architecture of the hybrid {MCG}-mesh testbed", crossref = "ACM:2006:PIW", pages = "88--89", year = "2006", DOI = "https://doi.org/10.1145/1160987.1161004", bibdate = "Sat Oct 14 14:37:23 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "The study of wireless and mobile networks is mainly based on simulations. Although simulation environments offer a convenient combination of flexibility and controllability, their largest disadvantage is that the results gained by using them are difficult to transfer into reality. This is due to the complex environment of mobile and wireless networks.In this paper we introduce a hybrid testbed approach, which consists of real mesh nodes and a virtualization environment. This combination provides on the one hand a flexible development environment for distributed network protocols and applications, and on the other hand a high degree in realism. Therefore, it allows the design and conduction of large scale networks where the results are easily transferred to the real world.", acknowledgement = ack-nhfb, } @Article{Zoppke:2006:VLE, author = "Till Zoppke and Ra{\'u}l Rojas", title = "The Virtual Life of {ENIAC}: Simulating the Operation of the First Electronic Computer", journal = j-IEEE-ANN-HIST-COMPUT, volume = "28", number = "2", pages = "18--25", month = apr # "\slash " # jun, year = "2006", CODEN = "IAHCEX", DOI = "https://doi.org/10.1109/MAHC.2006.40", ISSN = "1058-6180 (print), 1934-1547 (electronic)", ISSN-L = "1058-6180", bibdate = "Tue Oct 17 06:34:16 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Annals of the History of Computing", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=85", } @Article{Adamski:2007:SPE, author = "Marcin Adamski and Michal Kulczewski and Krzysztof Kurowski and Jarek Nabrzyski and Alastair Hume", title = "Security and performance enhancements to {OGSA-DAI} for {Grid} data virtualization", journal = j-CCPE, volume = "19", number = "16", pages = "2171--2182", month = nov, year = "2007", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.1165", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Mon Dec 5 10:08:17 MST 2011", bibsource = "http://www.interscience.wiley.com/jpages/1532-0626; https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Concurrency and Computation: Prac\-tice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", onlinedate = "22 May 2007", } @Article{Anonymous:2007:VPS, author = "Anonymous", title = "{VMware} patches security flaws", journal = j-NETWORK-SECURITY, volume = "2007", number = "10", pages = "2--2", month = oct, year = "2007", CODEN = "NTSCF5", DOI = "https://doi.org/10.1016/S1353-4858(07)70089-2", ISSN = "1353-4858 (print), 1872-9371 (electronic)", ISSN-L = "1353-4858", bibdate = "Mon Dec 4 16:59:44 MST 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/network-security.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1353485807700892", acknowledgement = ack-nhfb, fjournal = "Network Security", journal-URL = "https://www.sciencedirect.com/journal/network-security", } @Article{Arce:2007:GVM, author = "Iv{\'a}n Arce", title = "Ghost in the Virtual Machine", journal = j-IEEE-SEC-PRIV, volume = "5", number = "4", pages = "68--71", month = jul # "\slash " # aug, year = "2007", CODEN = "????", DOI = "https://doi.org/10.1109/MSP.2007.83", ISSN = "1540-7993 (print), 1558-4046 (electronic)", ISSN-L = "1540-7993", bibdate = "Thu Aug 2 17:50:45 MDT 2007", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Virtual machines and virtualization technologies aren't new to the computing world---they've been used for at least 40 years. Recently, the availability of virtualization software for low-cost computer equipment and the promise of both tangible reductions on total cost of ownership and rapid return on investment on virtualization projects have moved many organizations to adopt it as a key component of their IT strategy. In this installment of Attack Trends, I'll look at this technology trend with an eye toward security and analyze past and present advances in offensive security tools and techniques", acknowledgement = ack-nhfb, fjournal = "IEEE Security \& Privacy", } @Article{Armbruster:2007:RTJ, author = "Austin Armbruster and Jason Baker and Antonio Cunei and Chapman Flack and David Holmes and Filip Pizlo and Edward Pla and Marek Prochazka and Jan Vitek", title = "A real-time {Java} virtual machine with applications in avionics", journal = j-TECS, volume = "7", number = "1", pages = "5:1--5:49", month = dec, year = "2007", CODEN = "????", DOI = "https://doi.org/10.1145/1324969.1324974", ISSN = "1539-9087 (print), 1558-3465 (electronic)", ISSN-L = "1539-9087", bibdate = "Thu Jun 12 15:21:48 MDT 2008", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "This paper reports on our experience with the implementation of the Real-time Specification for Java on the Ovm open source Java virtual machine. We describe the architecture and main design decisions involved in implementing real-time Java on Ovm. We present the first use of Real-time Java in avionics in the context of control software for a ScanEagle Unmanned Aerial Vehicle.", acknowledgement = ack-nhfb, fjournal = "ACM Transactions on Embedded Computing Systems", journal-URL = "http://portal.acm.org/browse_dl.cfm?&idx=J840", keywords = "avionics; memory management; Real-Time Java; virtual machines", } @Article{Border:2007:DDM, author = "Charles Border", title = "The development and deployment of a multi-user, remote access virtualization system for networking, security, and system administration classes", journal = j-SIGCSE, volume = "39", number = "1", pages = "576--580", month = mar, year = "2007", CODEN = "SIGSD3", DOI = "https://doi.org/10.1145/1227504.1227501", ISSN = "0097-8418 (print), 2331-3927 (electronic)", ISSN-L = "0097-8418", bibdate = "Sat Nov 17 16:57:32 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigcse2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "We have combined four industry standard technologies to create a flexible, modular and easily extensible virtual server environment for both distance and local students to use in our networking, security, and system administration classes. By combining the remote access technologies of Remote Desktop, the multi-user capabilities of Microsoft Terminal Services, the ability to share sessions of Remote Assistance, and the ability to manipulate virtual machines and virtual networks using VMware Workstation, the Remote Laboratory Emulation System (RLES) allows students to conduct labs very similar to our local labs from either inside or outside our lab facility. While other people have been experimenting with various combinations of these technologies we have aggressively developed and implemented this system and feel that it has become a very important tool in our ability to cost-effectively provide computing infrastructure for local and distant students, and student and faculty research.", acknowledgement = ack-nhfb, fjournal = "SIGCSE Bulletin (ACM Special Interest Group on Computer Science Education)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J688", } @Misc{Brunschen:2007:SSE, author = "Christian Brunschen", title = "{SMILemu}: The {SMIL} Emulator: Version 1.2", howpublished = "Web site", day = "30", month = aug, year = "2007", bibdate = "Tue Nov 20 10:27:23 2012", bibsource = "https://www.math.utah.edu/pub/bibnet/authors/v/von-neumann-john.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "SMIL (Siffermaskinen i Lund = Number Machine in Lund) was an early Swedish computer introduced in 1956, and in operation until 1970, that was based on John von Neumann's 1952 IAS machine that was designed from 1945 to 1951, and was operational until 1958.", URL = "http://en.wikipedia.org/wiki/IAS_computer; http://en.wikipedia.org/wiki/SMIL_%28computer%29; http://video.ldc.lu.se/smil-50.htm; http://www.smilemu.org/", acknowledgement = ack-nhfb, lastaccessed = "20 November 2012", } @Book{Buytaert:2007:BDS, editor = "Kris Buytaert and others", title = "Best damn server virtualization book period: including {Vmware}, {Xen}, and {Microsoft Virtual Server}", publisher = pub-SYNGRESS, address = pub-SYNGRESS:adr, pages = "xxviii + 931", year = "2007", ISBN = "1-59749-217-5 (paperback)", ISBN-13 = "978-1-59749-217-1 (paperback)", LCCN = "QA76.9.C55 B475 2007", bibdate = "Mon Sep 13 11:21:54 MDT 2010", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.loc.gov:7090/Voyager", acknowledgement = ack-nhfb, subject = "Client/server computing", } @Article{Carpenter:2007:HVA, author = "Matthew Carpenter and Tom Liston and Ed Skoudis", title = "Hiding Virtualization from Attackers and Malware", journal = j-IEEE-SEC-PRIV, volume = "5", number = "3", pages = "62--65", month = may # "\slash " # jun, year = "2007", CODEN = "????", DOI = "https://doi.org/10.1109/MSP.2007.63", ISSN = "1540-7993 (print), 1558-4046 (electronic)", ISSN-L = "1540-7993", bibdate = "Thu Aug 2 17:50:44 MDT 2007", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Security and Privacy", } @Article{Casey:2007:OIB, author = "Kevin Casey and M. Anton Ertl and David Gregg", title = "Optimizing indirect branch prediction accuracy in virtual machine interpreters", journal = j-TOPLAS, volume = "29", number = "6", pages = "37:1--37:36", month = oct, year = "2007", CODEN = "ATPSDT", DOI = "https://doi.org/10.1145/1286821.1286828", ISSN = "0164-0925 (print), 1558-4593 (electronic)", ISSN-L = "0164-0925", bibdate = "Wed Jun 11 19:22:40 MDT 2008", bibsource = "http://www.acm.org/pubs/contents/journals/toplas/; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, articleno = "37", fjournal = "ACM Transactions on Programming Languages and Systems", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J783", } @Article{Chang:2007:VMS, author = "Da-Wei Chang and Cheng-En Hsieh and Yan-Pai Chen and Kwo-Cheng Chiu", title = "Virtual machine support for zero-loss {Internet} service recovery and upgrade", journal = j-SPE, volume = "37", number = "13", pages = "1349--1376", day = "10", month = nov, year = "2007", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/spe.808", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Wed Oct 17 18:33:16 MDT 2007", bibsource = "http://www.interscience.wiley.com/jpages/0038-0644; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www3.interscience.wiley.com/journalfinder.html", acknowledgement = ack-nhfb, fjournal = "Software---Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", onlinedate = "12 Mar 2007", } @Article{Chen:2007:DGS, author = "Haibo Chen and Jieyun Chen and Wenbo Mao and Fei Yan", title = "{Daonity} --- Grid security from two levels of virtualization", journal = j-INFO-SEC-TECH-REP, volume = "12", number = "3", pages = "123--138", month = "????", year = "2007", CODEN = "ISTRFR", DOI = "https://doi.org/10.1016/j.istr.2007.05.005", ISSN = "1363-4127 (print), 1873-605X (electronic)", ISSN-L = "1363-4127", bibdate = "Sun May 8 07:58:37 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/infosectechrep.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1363412707000258", acknowledgement = ack-nhfb, ajournal = "Info. Sec. Tech. Rep.", fjournal = "Information Security Technical Report", journal-URL = "https://www.sciencedirect.com/journal/information-security-technical-report", } @Article{Ciabrini:2007:SVS, author = "Damien Ciabrini", title = "Stack virtualization for source level debugging", journal = j-SPE, volume = "37", number = "7", pages = "693--725", month = jun, year = "2007", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/spe.782", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Wed Oct 17 18:33:15 MDT 2007", bibsource = "http://www.interscience.wiley.com/jpages/0038-0644; https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www3.interscience.wiley.com/journalfinder.html", acknowledgement = ack-nhfb, fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", onlinedate = "2 Nov 2006", } @Article{Contreras:2007:XPP, author = "Gilberto Contreras and Margaret Martonosi and Jinzhang Peng and Guei-Yuan Lueh and Roy Ju", title = "The {XTREM} power and performance simulator for the {Intel XScale} core: {Design} and experiences", journal = j-TECS, volume = "6", number = "1", pages = "4:1--4:??", month = feb, year = "2007", CODEN = "????", DOI = "https://doi.org/10.1145/1210268.1210272", ISSN = "1539-9087 (print), 1558-3465 (electronic)", ISSN-L = "1539-9087", bibdate = "Thu Jun 12 15:20:58 MDT 2008", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Managing power concerns in microprocessors has become a pressing research problem across the domains of computer architecture, CAD, and compilers. As a result, several parameterized cycle-level power simulators have been introduced. While these simulators can be quite useful for microarchitectural studies, their generality limits how accurate they can be for any one chip family. Furthermore, their hardware focus means that they do not explicitly enable studying the interaction of different software layers, such as Java applications and their underlying runtime system software. This paper describes and evaluates XTREM, a power-simulation tool tailored for the Intel XScale microarchitecture. In building XTREM, our goals were to develop a microarchitecture simulator that, while still offering size parameterizations for cache and other structures, more accurately reflected a realistic processor pipeline. We present a detailed set of validations based on multimeter power measurements and hardware performance counter sampling. XTREM exhibits an average performance error of only 6.5\% and an even smaller average power error: 4\%. The paper goes on to present an application study enabled by the simulator. Namely, we use XTREM to produce an energy consumption breakdown for Java CDC and CLDC applications. Our simulator measurements indicate that a large percentage of the total energy consumption (up to 35\%) is devoted to the virtual machine's support functions.", acknowledgement = ack-nhfb, articleno = "4", fjournal = "ACM Transactions on Embedded Computing Systems", journal-URL = "http://portal.acm.org/browse_dl.cfm?&idx=J840", keywords = "Intel XScale technology; Java; power measurements; power modeling", } @TechReport{Cox:2007:REM, author = "Russ Cox", title = "Regular Expression Matching Can Be Simple And Fast", type = "Report", institution = "swtch.com", address = "Cambridge, MA, USA", month = jan, year = "2007", bibdate = "Tue Mar 27 11:39:17 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/plan9.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "See also \cite{Thompson:1968:PTR,Kernighan:1999:REL,Cox:2009:REM,Cox:2010:REM,Cox:2012:REM}", URL = "http://swtch.com/~rsc/regexp/regexp1.html", acknowledgement = ack-nhfb, } @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/virtual-machines.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 = "Operating Systems Review", keywords = "compiler; memory safety; operating systems; security; type safety; typed assembly language; virtual machine", } @Book{Crosby:2007:VXI, editor = "Simon Crosby and Juan R. Garcia and David E. Williams", title = "Virtualization with {Xen}: including {XenEnterprise}, {XenServer}, and {XenExpress}", publisher = pub-SYNGRESS, address = pub-SYNGRESS:adr, pages = "xx + 364", year = "2007", ISBN = "0-08-055393-1 (electronic), 1-59749-167-5", ISBN-13 = "978-0-08-055393-1 (electronic), 978-1-59749-167-9", LCCN = "QA76.9.V5 V57 2007eb", bibdate = "Mon Sep 13 11:22:13 MDT 2010", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, subject = "Virtual computer systems; Virtual LANs; XEN3", } @Article{Du:2007:SSI, author = "Wenliang Du and Zhouxuan Teng and Ronghua Wang", title = "{SEED}: a suite of instructional laboratories for computer {SEcurity EDucation}", journal = j-SIGCSE, volume = "39", number = "1", pages = "486--490", month = mar, year = "2007", CODEN = "SIGSD3", DOI = "https://doi.org/10.1145/1227504.1227474", ISSN = "0097-8418 (print), 2331-3927 (electronic)", ISSN-L = "0097-8418", bibdate = "Sat Nov 17 16:57:32 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/minix.bib; https://www.math.utah.edu/pub/tex/bib/sigcse2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "To provide students with hands-on exercises in computer security education, we have developed a laboratory environment (SEED) for computer security education. It is based on VMware, Minix, and Linux, all of which are free for educational uses. Based on this environment, we have developed ten labs, covering a wide range of security principles. We have used these labs in our three courses in the last four years. This paper presents our SEED lab environment, SEED labs, and our evaluation results.", acknowledgement = ack-nhfb, fjournal = "SIGCSE Bulletin (ACM Special Interest Group on Computer Science Education)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J688", } @Article{Garfinkel:2007:WVC, author = "Tal Garfinkel and Andrew Warfield", title = "What Virtualization Can Do for Security", journal = j-LOGIN, volume = "32", number = "6", pages = "??--??", month = dec, year = "2007", CODEN = "LOGNEM", ISSN = "1044-6397", ISSN-L = "1044-6397", bibdate = "Fri Dec 7 11:34:32 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/usenix2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; https://www.usenix.org/publications/login", URL = "https://www.usenix.org/publications/login/december-2007-volume-32-number-6/what-virtualization-can-do-security", acknowledgement = ack-nhfb, fjournal = ";login: the USENIX Association newsletter", } @Article{Goth:2007:VOT, author = "Greg Goth", title = "Virtualization: Old Technology Offers Huge New Potential", journal = j-IEEE-DISTRIB-SYST-ONLINE, volume = "8", number = "2", pages = "??--??", month = feb, year = "2007", CODEN = "????", ISSN = "1541-4922 (print), 1558-1683 (electronic)", ISSN-L = "1541-4922", bibdate = "Mon Aug 30 23:14:34 MDT 2010", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeedistribsystonline.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://csdl.computer.org/comp/mags/ds/2007/02/o2003.pdf", acknowledgement = ack-nhfb, fjournal = "IEEE Distributed Systems Online", } @Book{Hammersley:2007:PVS, author = "Eric Hammersley", title = "{Professional VMware Server}", publisher = pub-WILEY, address = pub-WILEY:adr, pages = "xviii + 437", year = "2007", ISBN = "0-470-07988-6", ISBN-13 = "978-0-470-07988-1", LCCN = "QA76.76.O63 H344637 2007", bibdate = "Sat Oct 14 17:21:39 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.loc.gov:7090/Voyager", URL = "http://www.loc.gov/catdir/enhancements/fy0741/2006033472-b.html; http://www.loc.gov/catdir/enhancements/fy0741/2006033472-d.html; http://www.loc.gov/catdir/toc/ecip072/2006033472.html", acknowledgement = ack-nhfb, subject = "VMware; Operating systems (Computers); Virtual computer systems", } @Article{Hand:2007:HVX, author = "Steven Hand and Andrew Warfield and Keir Fraser", title = "Hardware Virtualization with {Xen}", journal = j-LOGIN, volume = "32", number = "1", pages = "??--??", month = feb, year = "2007", CODEN = "LOGNEM", ISSN = "1044-6397", ISSN-L = "1044-6397", bibdate = "Fri Dec 7 11:34:27 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/usenix2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; https://www.usenix.org/publications/login", URL = "https://www.usenix.org/publications/login/february-2007-volume-32-number-1/hardware-virtualization-xen", acknowledgement = ack-nhfb, fjournal = ";login: the USENIX Association newsletter", } @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/virtual-machines.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 = "Operating Systems Review", } @Book{Heege:2007:ECC, author = "Marcus Heege", title = "Expert {C++\slash CLI}: {.NET} for {Visual C++} programmers", publisher = pub-APRESS, address = pub-APRESS:adr, pages = "xvii + 330", year = "2007", ISBN = "1-59059-756-7", ISBN-13 = "978-1-59059-756-9", LCCN = "QA76.73.C153 H44 2007", bibdate = "Mon May 17 09:04:37 MDT 2010", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", series = "The expert's voice in .NET; Books for professionals by professionals", acknowledgement = ack-nhfb, subject = "C++/CLI (Computer program language); C++ (Computer program language); Microsoft .NET", } @Article{Henzinger:2007:EMP, author = "Thomas A. Henzinger and Christoph M. Kirsch", title = "The embedded machine: {Predictable}, portable real-time code", journal = j-TOPLAS, volume = "29", number = "6", pages = "33:1--33:29", month = oct, year = "2007", CODEN = "ATPSDT", DOI = "https://doi.org/10.1145/1286821.1286824", ISSN = "0164-0925 (print), 1558-4593 (electronic)", ISSN-L = "0164-0925", bibdate = "Wed Jun 11 19:22:40 MDT 2008", bibsource = "http://www.acm.org/pubs/contents/journals/toplas/; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "The Embedded Machine is a virtual machine that mediates in real time the interaction between software processes and physical processes. It separates the compilation of embedded programs into two phases. The first phase, the platform-independent compiler phase, generates E code (code executed by the Embedded Machine), which supervises the timing, not the scheduling of, application tasks relative to external events such as clock ticks and sensor interrupts. E code is portable and, given an input behavior, exhibits predictable (i.e., deterministic) timing and output behavior. The second phase, the platform-dependent compiler phase, checks the time safety of the E code, that is, whether platform performance (determined by the hardware) and platform utilization (determined by the scheduler of the operating system) enable its timely execution. We have used the Embedded Machine to compile and execute high-performance control applications written in Giotto, such as the flight control system of an autonomous model helicopter.", acknowledgement = ack-nhfb, articleno = "33", fjournal = "ACM Transactions on Programming Languages and Systems", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J783", } @Book{Juola:2007:PCO, author = "Patrick Juola", title = "Principles of computer organization and assembly language: using the {Java Virtual Machine}", publisher = "Pearson/Prentice Hall", address = "Upper Saddle River, NJ, USA", pages = "xv + 317", year = "2007", ISBN = "0-13-148683-7 (paperback)", ISBN-13 = "978-0-13-148683-6 (paperback)", LCCN = "QA76.9.C643 J96 2007", bibdate = "Thu Jan 21 14:01:37 MST 2010", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.loc.gov:7090/Voyager", URL = "http://www.loc.gov/catdir/toc/ecip073/2006034154.html", acknowledgement = ack-nhfb, subject = "computer organization; assembler language (computer program language); Java Virtual Machine", } @MastersThesis{Karcher:2007:VDX, author = "Ren{\'e} Karcher", title = "{Virtualisierte DMZ auf Xen-Basis: OpenQRM und Xen}", type = "Diplomarbeit", school = "Fachhochschule f{\"u}r Oekonomie und Management", address = "Essen, Germany", year = "2007", ISBN = "3-8366-6199-3", ISBN-13 = "978-3-8366-6199-7", bibdate = "Mon Sep 13 11:43:19 2010", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, } @Article{Kim:2007:VPR, author = "Hyesoon Kim and Jos{\'e} A. Joao and Onur Mutlu and Chang Joo Lee and Yale N. Patt and Robert Cohn", title = "{VPC} prediction: reducing the cost of indirect branches via hardware-based dynamic devirtualization", journal = j-COMP-ARCH-NEWS, volume = "35", number = "2", pages = "424--435", month = may, year = "2007", CODEN = "CANED2", DOI = "https://doi.org/10.1145/1250662.1250715", ISSN = "0163-5964 (ACM), 0884-7495 (IEEE)", ISSN-L = "0163-5964", bibdate = "Tue Jun 17 11:48:43 MDT 2008", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigarch.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Indirect branches have become increasingly common in modular programs written in modern object-oriented languages and virtual machine based runtime systems. Unfortunately, the prediction accuracy of indirect branches has not improved as much as that of conditional branches. Furthermore, previously proposed indirect branch predictors usually require a significant amount of extra hardware storage and complexity, which makes them less attractive to implement.\par This paper proposes a new technique for handling indirect branches, called Virtual Program Counter (VPC) prediction. The key idea of VPC prediction is to treat a single indirect branch as multiple virtual conditional branches in hardware for prediction purposes. Our technique predicts each of the virtual conditional branches using the existing conditional branch prediction hardware. Thus, no separate storage structure is required for predicting indirect branch targets.\par Our evaluation shows that VPC prediction improves average performance by 26.7\% compared to a commonly-used branch target buffer based predictor on 12 indirect branch intensive applications. VPC prediction achieves the performance improvement provided by at least a 12KB (and usually a 192KB) tagged target cache predictor on half of the examined applications. We show that VPC prediction can be used with any existing conditional branch prediction mechanism and that the accuracy of VPC prediction improves when a more accurate conditional branch predictor is used.", acknowledgement = ack-nhfb, fjournal = "ACM SIGARCH Computer Architecture News", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89", keywords = "devirtualization; indirect branch prediction; virtual functions", } @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/virtual-machines.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 = "Operating Systems Review", keywords = "desktop search; virtualization", } @Article{Laureano:2007:PHB, author = "M. Laureano and C. Maziero and E. Jamhour", title = "Protecting host-based intrusion detectors through virtual machines", journal = j-COMP-NET-AMSTERDAM, volume = "51", number = "5", pages = "1275--1283", day = "11", month = apr, year = "2007", CODEN = "????", ISSN = "1389-1286 (print), 1872-7069 (electronic)", ISSN-L = "1389-1286", bibdate = "Sat Apr 2 08:42:17 MDT 2011", bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www.sciencedirect.com/science/journal/13891286", acknowledgement = ack-nhfb, fjournal = "Computer Networks", journal-URL = "http://www.sciencedirect.com/science/journal/13891286", } @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/virtual-machines.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 = "Operating Systems Review", keywords = "efficient bytecode representation; query processing; SwissQM; virtual machine; wireless sensor networks", } @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/virtual-machines.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 = "Operating Systems Review", keywords = "power management; virtualization", } @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/virtual-machines.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 = "Operating Systems Review", keywords = "application QoS; control theory; data center; resource utilization; server consolidation; virtualization", } @TechReport{Padala:2007:PEV, author = "Pradeep Padala and Xiaoyun Zhu and Zhikui Wang and Sharad Singhal and Kang G. Shin", title = "Performance Evaluation of Virtualization Technologies for Server Consolidation", type = "Technical Report", number = "HPL-2007-59", institution = "Enterprise Systems and Software Laboratory, HP Laboratories", address = "Palo Alto, CA, USA", day = "11", month = apr, year = "2007", bibdate = "Tue May 15 15:09:57 2007", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.hpl.hp.com/techreports/2007/HPL-2007-59.pdf", abstract = "Server consolidation has become an integral part of IT planning to reduce cost and improve efficiency in today's enterprise data centers. The advent of virtualization allows consolidation of multiple applications into virtual containers hosted on a single or multiple physical servers. However, this poses new challenges, including choosing the right virtualization technology and consolidation configuration for a particular set of applications. In this paper, we evaluate two representative virtualization technologies, Xen and OpenVZ, in various configurations. We consolidate one or more multi-tiered systems onto one or two nodes and drive the system with an auction workload called RUBiS. We compare both technologies with a base system in terms of application performance, resource consumption, scalability, low-level system metrics like cache misses and virtualization-specific metrics like Domain-0 consumption in Xen. Our experiments indicate that the average response time can increase by over 400\% in Xen and only a modest 100\% in OpenVZ as the number of application instances grows from one to four. This large discrepancy is caused by the higher virtualization overhead in Xen, which is likely due to higher L2 cache misses and misses per instruction. A similar trend is observed in CPU consumptions of virtual containers. We present an overhead analysis with kernel-symbol-specific information generated by Oprofile.", acknowledgement = ack-nhfb, } @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/virtual-machines.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 = "Operating Systems Review", keywords = "information flow; layering; mandatory access control; policy; security; virtualization", } @Article{Permandla:2007:TSP, author = "Pratibha Permandla and Michael Roberson and Chandrasekhar Boyapati", title = "A type system for preventing data races and deadlocks in the {Java Virtual Machine} language: 1", journal = j-SIGPLAN, volume = "42", number = "7", pages = "10--10", month = jul, year = "2007", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/1254766.1254768", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jun 18 10:57:50 MDT 2008", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/multithreading.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "In previous work on SafeJava we presented a type system extension to the Java source language that statically prevents data races and deadlocks in multithreaded programs. SafeJava is expressive enough to support common programming patterns, its type checking is fast and scalable, and it requires little programming overhead. SafeJava thus offers a promising approach for making multithreaded programs more reliable. This paper presents a corresponding type system extension for the Java virtual machine language (JVML). We call the resulting language SafeJVML. Well-typed SafeJVML programs are guaranteed to be free of data races and deadlocks. Designing a corresponding type system for JVML is important because most Java code is shipped in the JVML format. Designing a corresponding type system for JVML is nontrivial because of important differences between Java and JVML. In particular, the absence of block structure in JVML programs and the fact that they do not use named local variables the way Java programs do make the type systems for Java and JVML significantly different. For example, verifying absence of races and deadlocks in JVML programs requires performing an alias analysis, something that was not necessary for verifying absence of races and deadlocks in Java programs. This paper presents static and dynamic semantics for Safe JVML. It also includes a proof that the SafeJVML type system is sound and that it prevents data races and deadlocks. To the best of our knowledge, this is the first type system for JVML that statically ensures absence of synchronization errors.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", keywords = "data races; deadlocks; ownership types; SafeJava", } @Article{Quetier:2007:SCF, author = "Benjamin Qu{\'e}tier and Vincent Neri and Franck Cappello", title = "Scalability Comparison of Four Host Virtualization Tools", journal = j-J-GRID-COMP, volume = "5", number = "1", pages = "83--98", month = mar, year = "2007", CODEN = "????", DOI = "https://doi.org/10.1007/s10723-006-9052-6", ISSN = "1570-7873 (print), 1572-9184 (electronic)", ISSN-L = "1570-7873", bibdate = "Wed Jul 9 17:01:30 MDT 2008", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=1570-7873&volume=5&issue=1; https://www.math.utah.edu/pub/tex/bib/jgridcomp.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=1570-7873&volume=5&issue=1&spage=83", acknowledgement = ack-nhfb, fjournal = "Journal of Grid Computing", journal-URL = "http://link.springer.com/journal/10723", keywords = "Key words; overhead evaluation; performance comparison; scalability; virtual machines", } @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; https://www.math.utah.edu/pub/tex/bib/virtual-machines.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", } @Article{Roussos:2007:SVG, author = "Kostadis Roussos", title = "Storage virtualization gets smart", journal = j-QUEUE, volume = "5", number = "6", pages = "38--44", month = sep, year = "2007", CODEN = "AQCUAE", DOI = "https://doi.org/10.1145/1317394.1317404", ISSN = "1542-7730 (print), 1542-7749 (electronic)", ISSN-L = "1542-7730", bibdate = "Fri Jun 20 11:17:39 MDT 2008", bibsource = "https://www.math.utah.edu/pub/tex/bib/queue.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "The days of overprovisioned, underutilized storage resources might soon become a thing of the past.", acknowledgement = ack-nhfb, fjournal = "ACM Queue: Tomorrow's Computing Today", } @Book{Rule:2007:HCC, author = "David Rule", title = "How to Cheat at Configuring {VMware ESX Server}", publisher = pub-SYNGRESS, address = pub-SYNGRESS:adr, pages = "xvii + 372", year = "2007", ISBN = "1-59749-194-2", ISBN-13 = "978-1-59749-194-5", LCCN = "QA76.9.V5 H69 2007", bibdate = "Mon May 17 09:03:07 MDT 2010", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.loc.gov:7090/Voyager", URL = "http://www.sciencedirect.com/science/book/9781597491945", abstract = "This book will detail the default and custom installation of VMwares ESX server as well as basic and advanced virtual machine configurations. It will then walk the reader through post installation configurations including installation and configuration of VirtualCenter. From here, readers will learn to efficiently create and deploy virtual machine templates. Best practices for securing and backing up your virtual environment are also provided. The book concludes with a series of handy, time-saving command and configuration for: bash shell keystrokes, Linux commands, configuration files, common/proc files, VMware ESX commands, and troubleshooting.", acknowledgement = ack-nhfb, subject = "VMware; Operating systems (Computers); Virtual computer systems", tableofcontents = "Chapter 1: VirtualCenter Overview \\ Chapter 2: ESX Installation \\ Chapter 3: ESX Post Install Configuration \\ Chapter 4: Installing VirtualCenter -- Chapter 5: VirtualCenter Configuration \\ Chapter 6: Creating a new virtual server \\ Chapter 7: Creating Virtual Machine Templates \\ Chapter 8: Deploying Virtual Machines from templates \\ Chapter 9: Security Model \\ Chapter 10: Backup Process \\ Chapter 11: Best Practices \\ Chapter 12: Updating the ESX operating system. \\ Chapter 13: ESX Command and configuration Tips..", } @Article{Sedighi:2007:EV, author = "Art Sedighi", title = "Editorial: Virtualization", journal = j-SCPE, volume = "8", number = "2", pages = "i--ii", month = jun, year = "2007", CODEN = "????", ISSN = "1895-1767", bibdate = "Thu Sep 2 11:55:11 MDT 2010", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www.scpe.org/content/8/2.toc", URL = "http://www.scpe.org/vols/vol08/no2/vol08no2editorial.html", acknowledgement = ack-nhfb, } @Book{Sivakumar:2007:CCA, author = "Nishant Sivakumar", title = "{C++\slash CLI} in action", publisher = pub-MANNING, address = pub-MANNING:adr, pages = "xxiii + 391", year = "2007", ISBN = "1-932394-81-8 (paperback)", ISBN-13 = "978-1-932394-81-8 (paperback)", LCCN = "QA76.73.C153 S52 2007", bibdate = "Mon May 17 09:04:37 MDT 2010", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, subject = "C++ (Computer program language)", } @Article{Skapinetz:2007:VBT, author = "Kevin Skapinetz", title = "Virtualisation as a blackhat tool", journal = j-NETWORK-SECURITY, volume = "2007", number = "10", pages = "4--7", month = oct, year = "2007", CODEN = "NTSCF5", DOI = "https://doi.org/10.1016/S1353-4858(07)70092-2", ISSN = "1353-4858 (print), 1872-9371 (electronic)", ISSN-L = "1353-4858", bibdate = "Mon Dec 4 16:59:44 MST 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/network-security.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1353485807700922", acknowledgement = ack-nhfb, fjournal = "Network Security", journal-URL = "https://www.sciencedirect.com/journal/network-security", } @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/virtual-machines.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 = "Operating Systems Review", keywords = "alternative; container; hypervisor; Linux-VServer; operating; system; virtualization; Xen", } @Book{Sprang:2007:XVL, editor = "Henning Sprang", title = "{Xen: Virtualisierung unter Linux}. ({German}) [{Xen}: Virtualization under {Linux}]", publisher = "Open Source Press", address = "M{\"u}nchen, Germany", pages = "350", year = "2007", ISBN = "3-937514-29-5", ISBN-13 = "978-3-937514-29-1", LCCN = "????", bibdate = "Mon May 17 09:05:00 MDT 2010", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://deposit.ddb.de/cgi-bin/dokserv?id=2809360", acknowledgement = ack-nhfb, language = "German", subject = "Linux; Xen 3", } @Article{Srikrishnan:2007:SFA, author = "J. Srikrishnan and S. Amann and G. Banzhaf and F. W. Brice and R. Dugan and G. R. Frazier and G. P. Kuch and J. Leopold", title = "Sharing {FCP} adapters through virtualization", journal = j-IBM-JRD, volume = "51", number = "1/2", pages = "103--118", month = jan # "\slash " # mar, year = "2007", CODEN = "IBMJAE", ISSN = "0018-8646 (print), 2151-8556 (electronic)", ISSN-L = "0018-8646", bibdate = "Fri Feb 9 20:31:06 MST 2007", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www.research.ibm.com/journal/", URL = "http://www.research.ibm.com/journal/rd/511/srikrishnan.html", abstract = "The IBM System z9e and its predecessors pioneered server virtualization, including the sharing of data storage subsystems among the virtual servers of a host computer using the channel- sharing capabilities of FICON channels in Fibre Channel (FC) fabrics. Now industry-standard Small Computer System Interface (SCSI) devices in storage area networks must be shared among host computers using the Fibre Channel Protocol (FCP), and this has been problematic with virtual servers in a host computer. To apply the power of server virtualization to this environment, the IBM System z9 implements a new FC standard called N_Port Identifier Virtualization (NPIV). IBM invented NPIV and offered it as a standard to enable the sharing of host adapters in IBM servers and FC fabrics. With NPIV, a host FC adapter is shared in such a way that each virtual adapter is assigned to a virtual server and is separately identifiable within the fabric. Connectivity and access privileges within the fabric are controlled by identification of each virtual adapter and, hence, the virtual server using each virtual adapter. This paper describes the problem prior to the development of NPIV, the concept of NPIV, and the first implementation of this technique in the FCP channel of the IBM System z9.", acknowledgement = ack-nhfb, fjournal = "IBM Journal of Research and Development", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520", ordernumber = "????", } @Article{Stanik:2007:NVR, author = "John Stanik", title = "News 2.0: Virtualization Reconsidered; The Power of {PS3}; {Anti-P2P} Software Targets Universities", journal = j-QUEUE, volume = "5", number = "3", pages = "10--10", month = apr, year = "2007", CODEN = "AQCUAE", DOI = "https://doi.org/10.1145/1242489.1242493", ISSN = "1542-7730 (print), 1542-7749 (electronic)", ISSN-L = "1542-7730", bibdate = "Fri Jun 20 11:15:55 MDT 2008", bibsource = "https://www.math.utah.edu/pub/tex/bib/queue.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Taking a second look at the news so you don't have to", acknowledgement = ack-nhfb, fjournal = "ACM Queue: Tomorrow's Computing Today", } @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/virtual-machines.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 = "Operating Systems Review", } @Article{Syropoulos:2007:PMV, author = "Apostolos Syropoulos", title = "{$ \Pi $} machines: virtual machines realizing graph structured transition {P} systems", journal = j-SIGPLAN, volume = "42", number = "12", pages = "15--22", month = dec, year = "2007", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/1341752.1341754", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jun 18 11:02:09 MDT 2008", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "P systems is a model of computation inspired by the way cells live and function. A typical P system consists of nested compartments surrounded by porous membranes, which contain data that are transformed by transformation rules. P systems can be simulated by a distributed computing system, where each compartment of a given system is simulated by a (remote) process, each running on a different node. By adopting a more 'liberal' membrane structure where compartments do not necessarily form a tree-structure but a graph-structure, we get a more general model of computation, which we call graph structured P systems. Any instance of the new model can be implemented by a network of virtual machines, called $ \pi $ machines, where each machine is able to implement the functionality of any simple compartment.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", keywords = "distributed computing; graph structured P systems; virtual machines", } @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/virtual-machines.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 = "Operating Systems Review", } @Article{Venstermans:2007:JOH, author = "Kris Venstermans and Lieven Eeckhout and Koen {De Bosschere}", title = "{Java} object header elimination for reduced memory consumption in 64-bit virtual machines", journal = j-TACO, volume = "4", number = "3", pages = "17:1--17:??", month = sep, year = "2007", CODEN = "????", DOI = "https://doi.org/10.1145/1275937.1275941", ISSN = "1544-3566 (print), 1544-3973 (electronic)", ISSN-L = "1544-3566", bibdate = "Mon Jun 16 11:41:20 MDT 2008", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/taco.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Memory performance is an important design issue for contemporary computer systems given the huge processor/memory speed gap. This paper proposes a space-efficient Java object model for reducing the memory consumption of 64-bit Java virtual machines. We completely eliminate the object header through typed virtual addressing (TVA) or implicit typing. TVA encodes the object type in the object's virtual address by allocating all objects of a given type in a contiguous memory segment. This allows for removing the type information as well as the status field from the object header. Whenever type and status information is needed, masking is applied to the object's virtual address for obtaining an offset into type and status information structures. Unlike previous work on implicit typing, we apply TVA to a selected number of frequently allocated object types, hence, the name selective TVA (STVA); this limits the amount of memory fragmentation. In addition to applying STVA, we also compress the type information block (TIB) pointers for all objects that do not fall under TVA. We implement the space-efficient Java object model in the 64-bit version of the Jikes RVM on an AIX IBM platform and compare its performance against the traditionally used Java object model using a multitude of Java benchmarks. We conclude that the space-efficient Java object model reduces memory consumption by on average 15\% (and up to 45\% for some benchmarks). About one-half the reduction comes from TIB pointer compression; the other one-half comes from STVA. In terms of performance, the space-efficient object model generally does not affect performance; however, for some benchmarks we observe statistically significant performance speedups, up to 20\%.", acknowledgement = ack-nhfb, articleno = "17", fjournal = "ACM Transactions on Architecture and Code Optimization (TACO)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J924", keywords = "64-bit implementation; implicit typing; Java object model; typed virtual addressing; Virtual machine", } @Book{Warnke:2007:QVC, author = "Robert Warnke and Thomas Ritzau", title = "{QEMU virtuelle Computer f{\"u}r viele Betriebssysteme; QEMU Version 0.9.0}. ({German}) [{QEMU} virtual computer for many operating systems]", publisher = "Books on Demand GmbH", address = "Norderstedt", pages = "292", year = "2007", ISBN = "3-8370-0876-2", ISBN-13 = "978-3-8370-0876-0", LCCN = "????", bibdate = "Mon May 17 09:07:48 MDT 2010", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://d-nb.info/986260371/04", acknowledgement = ack-nhfb, language = "German", subject = "Qemu", } @Book{Williams:2007:VXI, author = "David E. Williams and Juan R. Garcia", title = "Virtualization with {Xen}: including {XenEnterprise}, {XenServer}, and {XenExpress}", publisher = pub-SYNGRESS, address = pub-SYNGRESS:adr, pages = "xx + 364", year = "2007", ISBN = "1-59749-167-5", ISBN-13 = "978-1-59749-167-9", LCCN = "QA76.9.V5 W55 2007", bibdate = "Mon May 17 09:05:00 MDT 2010", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.loc.gov/catdir/enhancements/fy0745/2007278278-d.html", abstract = "Complete Coverage of Xen, Including Version 3.2. Virtualization with Xen is the first book to demonstrate to readers how to install, administer, and maintain a virtual infrastructure based on XenSources latest release, Xen 3.2. It discusses best practices for setting up a Xen environment correctly the first time, maximizing the utilization of server assets while taking advantage of the fastest and most secure enterprise-grade paravirtualization architecture. It covers both basic and advanced topics, such as planning and installation, physical-to-virtual migrations, virtual machine provisioning, resource management, and monitoring and troubleshooting guests and Xen hosts.", acknowledgement = ack-nhfb, subject = "Virtual computer systems; Virtual LANs; Xen 3", } @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/virtual-machines.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 = "Operating Systems Review", } @Article{Zhang:2007:DIB, author = "Guangyan Zhang and Jiwu Shu and Wei Xue and Weimin Zheng", title = "Design and Implementation of an Out-of-Band Virtualization System for Large {SANs}", journal = j-IEEE-TRANS-COMPUT, volume = "56", number = "12", pages = "1654--1665", month = dec, year = "2007", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.2007.70765", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Mon Jul 4 15:03:42 MDT 2011", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4358222", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Computers", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", } @Article{Zhao:2007:UVM, author = "Xin Zhao and Kevin Borders and Atul Prakash", title = "Using a virtual machine to protect sensitive {Grid} resources", journal = j-CCPE, volume = "19", number = "14", pages = "1917--1935", day = "25", month = sep, year = "2007", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.1134", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Mon Dec 5 10:08:16 MST 2011", bibsource = "http://www.interscience.wiley.com/jpages/1532-0626; https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Concurrency and Computation: Prac\-tice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", onlinedate = "14 Nov 2006", } @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/virtual-machines.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 = "Operating Systems Review", keywords = "integrity; isolation; mandatory access control; security; virtual trusted platform module; virtualization", } @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/virtual-machines.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 = "Operating Systems Review", keywords = "AMD; hypervisor; memory management; nested paging; page walk caching; TLB; virtual machine monitor; virtualization", } @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/virtual-machines.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 = "Operating Systems Review", keywords = "checkpoint; mobility; reliability; restart; security; survivability; virtualization", } @Article{Bonardi:2008:PEM, author = "Alain Bonardi and J{\'e}rome Barth{\'e}lemy", title = "The preservation, emulation, migration, and virtualization of live electronics for performing arts: an overview of musical and technical issues", journal = j-JOCCH, volume = "1", number = "1", pages = "6:1--6:??", month = jun, year = "2008", CODEN = "????", DOI = "https://doi.org/10.1145/1367080.1367086", ISSN = "1556-4673 (print), 1556-4711 (electronic)", ISSN-L = "1556-4711", bibdate = "Sat Jan 15 17:48:24 MST 2011", bibsource = "http://www.acm.org/pubs/contents/journals/jocch/; https://www.math.utah.edu/pub/tex/bib/jocch.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, articleno = "6", fjournal = "Journal on Computing and Cultural Heritage (JOCCH)", } @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/virtual-machines.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 = "Operating Systems Review", keywords = "caches; memory hierarchy; metadata; predictor virtualization", } @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/virtual-machines.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 = "Operating Systems Review", } @Article{Carbone:2008:TV, author = "Martim Carbone and Diego Zamboni and Wenke Lee", title = "Taming Virtualization", journal = j-IEEE-SEC-PRIV, volume = "6", number = "1", pages = "65--67", month = jan # "\slash " # feb, year = "2008", CODEN = "????", DOI = "https://doi.org/10.1109/MSP.2008.24", ISSN = "1540-7993 (print), 1558-4046 (electronic)", ISSN-L = "1540-7993", bibdate = "Thu Jul 3 12:03:38 MDT 2008", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Security and Privacy", } @Article{Chen:2008:OVBa, 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-COMP-ARCH-NEWS, volume = "36", number = "1", pages = "2--13", month = mar, year = "2008", CODEN = "CANED2", DOI = "https://doi.org/10.1145/1346281.1346284", ISSN = "0163-5964 (print), 1943-5851 (electronic)", ISSN-L = "0163-5964", bibdate = "Tue Jun 17 11:51:35 MDT 2008", bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.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 SIGARCH Computer Architecture News", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89", keywords = "cloaking; hypervisors; memory protection; multi-shadowing; operating systems; virtual machine monitors; VMM", } @Article{Chen:2008:OVBb, 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/cryptography2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.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 = "Operating Systems Review", keywords = "cloaking; hypervisors; memory protection; multi-shadowing; operating systems; virtual machine monitors; VMM", } @Article{Chen:2008:OVBc, 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-SIGPLAN, volume = "43", number = "3", pages = "2--13", month = mar, year = "2008", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/1346281.1346284", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jun 18 11:03:40 MDT 2008", bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.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 SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", keywords = "cloaking; hypervisors; memory protection; multi-shadowing; operating systems; virtual machine monitors; VMM", } @Book{Chisnall:2008:DGX, author = "David Chisnall", title = "The Definitive Guide to the {Xen} Hypervisor", publisher = pub-PH, address = pub-PH:adr, pages = "xx + 286", year = "2008", ISBN = "0-13-234971-X", ISBN-13 = "", LCCN = "QA76.9.V5 C427 2008", bibdate = "Tue Aug 5 19:11:08 MDT 2008", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/queue.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.loc.gov:7090/Voyager", series = "Prentice Hall open source software development series", acknowledgement = ack-nhfb, subject = "computer organization; parallel processing (electronic computers); virtual computer systems; Xen (electronic resource); Xen 3", tableofcontents = "I The Xen Virtual Machine / 1 \\ 1 The State of Virtualization / 3 \\ 1.1 What Is Virtualization? / 3 \\ 1.1.1 CPU Virtualization / 4 \\ 1.1.2 I/O Virtualization / 5 \\ 1.2 Why Virtualize? / 7 \\ 1.3 The First Virtual Machine / 8 \\ 1.4 The Problem of x86 / 9 \\ 1.5 Some Solutions / 9 \\ 1.5.1 Binary Rewriting / 10 \\ 1.5.2 Paravirtualization / 10 \\ 1.5.3 Hardware-Assisted Virtualization / 13 \\ 1.6 The Xen Philosophy / 15 \\ 1.6.1 Separation of Policy and Mechanism / 15 \\ 1.6.2 Less Is More / 15 \\ 1.7 The Xen Architecture / 16 \\ 1.7.1 The Hypervisor, the OS, and the Applications / 16 \\ 1.7.2 The Rl6e of Domain 0 / 19 \\ 1.7.3 Unprivileged Domains / 22 \\ 1.7.4 HVM Domains / 22 \\ 1.7.5 Xen Configurations / 23 \\ 2 Exploring the Xen Virtual Architecture / 27 \\ 2.1 Booting as a Paravirtualized Guest / 27 \\ 2.2 Restricting Operations with Privilege Rings / 28 \\ 2.3 Replacing Privileged Instructions with Hypercalls / 30 \\ 2.4 Exploring the Xen Event Model / 33 \\ 2.5 Communicating with Shared Memory / 34 \\ 2.6 Split Device Driver Model / 35 \\ 2.7 The VM Lifecycle / 37 \\ 2.8 Exercise: The Simplest Xen Kernel / 38 \\ 2.8.1 The Guest Entry Point / 40 \\ 2.8.2 Putting It All Together / 43 \\ 3 Understanding Shared Info Pages / 47 \\ 3.1 Retrieving Boot Time Info / 47 \\ 3.2 The Shared Info Page / 51 \\ 3.3 Time Keeping in Xen / 53 \\ 3.4 Exercise: Implementing gettimeofday() / 54 \\ 4 Using Grant Tables / 59 \\ 4.1 Sharing Memory / 59 \\ 4.1.1 Mapping a Page Frame / 61 \\ 4.1.2 Transferring Data between Domains / 63 \\ 4.2 Device I/O Rings / 65 \\ 4.3 Granting and Revoking Permissions / 66 \\ 4.4 Exercise: Mapping a Granted Page / 69 \\ 4.5 Exercise: Sharing Memory between VMs / 71 \\ 5 Understanding Xen Memory Management / 75 \\ 5.1 Managing Memory with x86 / 75 \\ 5.2 Pseudo-Physical Memory Model / 78 \\ 5.3 Segmenting on 32-bit x86 / 80 \\ 5.4 Using Xen Memory Assists / 82 \\ 5.5 Controlling Memory Usage with the Balloon Driver / 84 \\ 5.6 Other Memory Operations / 86 \\ 5.7 Updating the Page Tables / 89 \\ 5.7.1 Creating a New VM Instance / 93 \\ 5.7.2 Handling a Page Fault / 94 \\ 5.7.3 Suspend, Resume, and Migration / 94 \\ 5.8 Exercise: Mapping the Shared Info Page / 95 \\ II Device I/O / 97 \\ 6 Understanding Device Drivers / 99 \\ 6.1 The Split Driver Model / 100 \\ 6.2 Moving Drivers out of Domain 0 / 102 \\ 6.3 Understanding Shared Memory Ring Buffers / 103 \\ 6.3.1 Examining the Xen Implementation / 105 \\ 6.3.2 Ordering Operations with Memory Barriers / 107 \\ 6.4 Connecting Devices with XenBus / 109 \\ 6.5 Handling Notifications from Events / 111 \\ 6.6 Configuring via the XenStore / 112 \\ 6.7 Exercise: The Console Device / 112 \\ 7 Using Event Channels / 119 \\ 7.1 Events and Interrupts / 119 \\ 7.2 Handling Traps / 120 \\ 7.3 Event Types / 123 \\ 7.4 Requesting Events / 124 \\ 7.5 Binding an Event Channel to a VCPU / 127 \\ 7.6 Operations on Bound Channels / 128 \\ 7.7 Getting a Channel's Status / 129 \\ 7.8 Masking Events / 130 \\ 7.9 Events and Scheduling / 132 \\ 7.10 Exercise: A Full Console Driver / 133 \\ 8 Looking through the XenStore / 141 \\ 8.1 The XenStore Interface / 141 \\ 8.2 Navigating the XenStore / 142 \\ 8.3 The XenStore Device / 145 \\ 8.4 Reading and Writing a Key / 147 \\ 8.4.1 The Userspace Way / 148 \\ 8.4.2 From the Kernel / 150 \\ 8.5 Other Operations / 158 \\ 9 Supporting the Core Devices / 161 \\ 9.1 The Virtual Block Device Driver / 161 \\ 9.1.1 Setting Up the Block Device / 162 \\ 9.1.2 Data Transfer / 165 \\ 9.2 Using Xen Networking / 169 \\ 9.2.1 The Virtual Network Interface Driver / 169 \\ 9.2.2 Setting Up the Virtual Interface / 169 \\ 9.2.3 Sending and Receiving / 170 \\ 9.2.4 NetChannel2 / 174 \\ 10 Other Xen Devices / 177 \\ 10.1 CD Support / 177 \\ 10.2 Virtual Frame Buffer / 178 \\ 10.3 The TPM Driver / 183 \\ 10.4 Native Hardware / 184 \\ 10.4.1 PCI Support / 184 \\ 10.4.2 USB Devices / 186 \\ 10.5 Adding a New Device Type / 187 \\ 10.5.1 Advertising the Device / 187 \\ 10.5.2 Setting Up Ring Buffers / 188 \\ 10.5.3 Difficulties / 189 \\ 10.5.4 Accessing the Device / 191 \\ 10.5.5 Designing the Back End / 191 \\ III Xen Internals / 195 \\ 11 The Xen API / 197 \\ 11.1 XM L-RPC / 198 \\ 11.1.1 XML-RPC Data Types / 198 \\ 11.1.2 Remote Procedure Calls / 199 \\ 11.2 Exploring the Xen Interface Hierarchy / 200 \\ 11.3 The Xen API Classes / 201 \\ 11.3.1 The C Bindings / 203 \\ 11.4 The Function of Xend / 206 \\ 11.5 Xm Command Line / 208 \\ 11.6 Xen CIM Providers / 209 \\ 11.7 Exercise: Enumerating Running VMs / 210 \\ 11.8 Sum m ary / 215 \\ 12 Virtual Machine Scheduling / 217 \\ 12.1 Overview of the Scheduler Interface / 218 \\ 12.2 Historical Schedulers / 219 \\ 12.2.1 SEDF / 221 \\ 12.2.2 Credit Scheduler / 222 \\ 12.3 Using the Scheduler API / 224 \\ 12.3.1 Running a Scheduler / 225 \\ 12.3.2 Domain 0 Interaction / 228 \\ 12.4 Exercise: Adding a New Scheduler / 229 \\ 12.5 Summary / 233 \\ 13 HVM Support / 235 \\ 13.1 Running Unmodified Operating Systems / 235 \\ 13.2 Intel VT-x and AMD SVM / 237 \\ 13.3 HVM Device Support / 239 \\ 13.4 Hybrid Virtualization / 240 \\ 13.5 Emulated BIOS / 244 \\ 13.6 Device Models and Legacy I/O Emulation / 245 \\ 13.7 Paravirtualized I/O / 246 \\ 13.8 HVM Support in Xen / 248 \\ 14 Future Directions / 253 \\ 14.1 Real to Virtual, and Back Again / 253 \\ 14.2 Emulation and Virtualization / 254 \\ 14.3 Porting Efforts / 255 \\ 14.4 The Desktop / 257 \\ 14.5 Power Management / 259 \\ 14.6 The Domain 0 Question / 261 \\ 14.7 Stub Domains / 263 \\ 14.8 New Devices / 264 \\ 14.9 Unusual Architectures / 265 \\ 14.10 The Big Picture / 267 \\ IV Appendix / 271 \\ PV Guest Porting Cheat Sheet / 273 \\ A.1 Domain Builder / 273 \\ A.2 Boot Environment / 274 \\ A.3 Setting Up the Virtual IDT / 274 \\ A.4 Page Table Management / 275 \\ A.5 Drivers / 276 \\ A.6 Domain 0 Responsibilities / 276 \\ A.7 Efficiency / 277 \\ A.8 Summary / 278", } @Article{Choi:2008:SHM, author = "Yoonseo Choi and Hwansoo Han", title = "Shared heap management for memory-limited {Java} virtual machines", journal = j-TECS, volume = "7", number = "2", pages = "13:1--13:??", month = feb, year = "2008", CODEN = "????", DOI = "https://doi.org/10.1145/1331331.1331337", ISSN = "1539-9087 (print), 1558-3465 (electronic)", ISSN-L = "1539-9087", bibdate = "Thu Jun 12 15:22:00 MDT 2008", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "One scarce resource in embedded systems is memory. Multitasking makes the lack of memory problem even worse. Most current embedded systems, which do not provide virtual memory, simply divide physical memory and evenly assign contiguous memory chunks to multiple applications. Such simple memory management can frequently cause the lack of available memory for some applications, while others are not using the full amount of assigned memory. To overcome inefficiency in current memory management, we present an efficient heap management scheme that allows multiple applications to share heap space. To reduce overall heap memory usage, applications adaptively acquire subheaps out of shared pool of memory and release surplus subheaps to shared pool. As a result, applications see noncontiguous multiple subheaps as a heap in their address space. We target Java applications to implement our heap-sharing scheme in the KVM from Sun Microsystems. To protect fragmented heap space with a limited number of regions in memory protection unit (MPU), we maintain only a limited number of subheaps. We experimentally evaluate our heap management scheme with J2ME MIDP applications. Our static and dynamic schemes reduce heap memory usage, on average, by 30 and 27\%, respectively. For both schemes, overheads are kept low. The execution times in our schemes are increased only by 0.01\% for static scheme and 0.35\% for dynamic scheme, on average.", acknowledgement = ack-nhfb, articleno = "13", fjournal = "ACM Transactions on Embedded Computing Systems", journal-URL = "http://portal.acm.org/browse_dl.cfm?&idx=J840", keywords = "dynamic memory management; garbage collection; heap sharing; memory protection unit", } @Article{Conte:2008:NHA, author = "Alberto Conte and Sylvaine Kerboeuf and Laurent Thomas", title = "Network-hosted avatar: {User}-terminal virtualization in the network", journal = j-BELL-LABS-TECH-J, volume = "13", number = "2", pages = "117--126", month = "Summer", year = "2008", CODEN = "BLTJFD", DOI = "https://doi.org/10.1002/bltj.20307", ISSN = "1089-7089 (print), 1538-7305 (electronic)", ISSN-L = "1089-7089", bibdate = "Fri Nov 26 17:31:41 MST 2010", bibsource = "https://www.math.utah.edu/pub/tex/bib/bstj2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Bell Labs Technical Journal", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1538-7305/issues/", onlinedate = "18 Aug 2008", } @Article{Creeger:2008:CVR, author = "Mache Creeger", title = "{CTO} virtualization roundtable, part {II}", journal = j-CACM, volume = "51", number = "12", pages = "43--49", month = dec, year = "2008", CODEN = "CACMA2", DOI = "https://doi.org/10.1145/1409360.1409375", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Dec 8 13:50:15 MST 2008", bibsource = "http://www.acm.org/pubs/contents/journals/cacm/; https://www.math.utah.edu/pub/tex/bib/cacm2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "When it comes to virtualization platforms, experts say focus first on the services to be delivered.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79", } @Article{Creeger:2008:PCR, author = "Mache Creeger", title = "Practice: {CTO} roundtable on virtualization", journal = j-CACM, volume = "51", number = "11", pages = "47--53", month = nov, year = "2008", CODEN = "CACMA2", DOI = "https://doi.org/10.1145/1400214.1400229", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Thu Oct 23 14:29:44 MDT 2008", bibsource = "http://www.acm.org/pubs/contents/journals/cacm/; https://www.math.utah.edu/pub/tex/bib/cacm2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Virtualization technology is hot again, but for the right reasons?", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79", } @Manual{DELUG:2008:VKB, title = "{Vmknoppix 2008 05 19: auf Knoppix basierende Live-Distribution mit integrierten Virtualisierungssystemen wie Xen, KVM, Virtualbox oder Qemu}", organization = "{Deutsche Linux-User-Group}", address = "M{\"u}nchen, Germany", year = "2008", bibdate = "Mon Sep 13 11:45:37 2010", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "One CD-ROM.", acknowledgement = ack-nhfb, } @Article{Deng:2008:CCV, author = "Yi Deng and S. Masoud Sadjadi and Peter J. Clarke and Vagelis Hristidis and Raju Rangaswami and Yingbo Wang", title = "{CVM} --- a communication virtual machine", journal = j-J-SYST-SOFTW, volume = "81", number = "10", pages = "1640--1662", month = oct, year = "2008", CODEN = "JSSODM", ISSN = "0164-1212 (print), 1873-1228 (electronic)", ISSN-L = "0164-1212", bibdate = "Tue Sep 7 07:27:04 MDT 2010", bibsource = "https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www.sciencedirect.com/science/journal/01641212", acknowledgement = ack-nhfb, fjournal = "The Journal of systems and software", journal-URL = "http://www.sciencedirect.com/science/journal/01641212", } @Article{Drepper:2008:CV, author = "Ulrich Drepper", title = "The cost of virtualization", journal = j-QUEUE, volume = "6", number = "1", pages = "28--35", month = jan, year = "2008", CODEN = "AQCUAE", DOI = "https://doi.org/10.1145/1348583.1348591", ISSN = "1542-7730 (print), 1542-7749 (electronic)", ISSN-L = "1542-7730", bibdate = "Fri Jun 20 11:18:20 MDT 2008", bibsource = "https://www.math.utah.edu/pub/tex/bib/queue.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Software developers need to be aware of the compromises they face when using virtualization technology.", acknowledgement = ack-nhfb, fjournal = "ACM Queue: Tomorrow's Computing Today", keywords = "virtual machines", } @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/virtual-machines.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 = "Operating Systems Review", } @Article{Flich:2008:LBD, author = "J. Flich and J. Duato", title = "Logic-Based Distributed Routing for {NoCs}", journal = j-IEEE-COMPUT-ARCHIT-LETT, volume = "7", number = "1", pages = "13--16", month = jan, year = "2008", CODEN = "????", DOI = "https://doi.org/10.1109/L-CA.2007.16", ISSN = "1556-6056 (print), 1556-6064 (electronic)", ISSN-L = "1556-6056", bibdate = "Fri Jun 21 05:49:19 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeecomputarchitlett.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "The design of scalable and reliable interconnection networks for multicore chips (NoCs) introduces new design constraints like power consumption, area, and ultra low latencies. Although 2D meshes are usually proposed for NoCs, heterogeneous cores, manufacturing defects, hard failures, and chip virtualization may lead to irregular topologies. In this context, efficient routing becomes a challenge. Although switches can be easily configured to support most routing algorithms and topologies by using routing tables, this solution does not scale in terms of latency and area. We propose a new circuit that removes the need for using routing tables. The new mechanism, referred to as logic-based distributed routing (LBDR), enables the implementation in NoCs of many routing algorithms for most of the practical topologies we might find in the near future in a multicore chip. From an initial topology and routing algorithm, a set of three bits per switch output port is computed. By using a small logic block, LHDR mimics (demonstrated by evaluation) the behavior of routing algorithms implemented with routing tables. This result is achieved both in regular and irregular topologies. Therefore, LBDR removes the need for using routing tables for distributed routing, thus enabling flexible, fast and power-efficient routing in NoCs.", acknowledgement = ack-nhfb, fjournal = "IEEE Computer Architecture Letters", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=10208", keywords = "chip virtualization; circuit reliability; Circuit topology; Delay; Energy consumption; heterogeneous cores; interconnection network reliability; interconnections; logic circuits; logic-based distributed routing; Manufacturing; manufacturing defects; Multi-core/single-chip multiprocessors; Multicore processing; Multiprocessor interconnection networks; network routing; network topology; Network topology; Network-on-a-chip; network-on-chip; networks for multicore chips; NoC; On-chip interconnection networks; Routing; Switches", } @Article{Flich:2008:PNV, author = "J. Flich and S. Rodrigo and J. Duato and T. S{\o}dring and {\AA}. G. Solheim and T. Skeie and O. Lysne", title = "On the Potential of {NoC} Virtualization for Multicore Chips", journal = j-SCPE, volume = "9", number = "3", pages = "165--177", month = sep, year = "2008", CODEN = "????", ISSN = "1895-1767", bibdate = "Thu Sep 2 11:55:11 MDT 2010", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www.scpe.org/content/9/3.toc", URL = "http://www.scpe.org/vols/vol09/no3/SCPE_9_3_02.pdf; http://www.scpe.org/vols/vol09/no3/SCPE_9_3_02.zip", acknowledgement = ack-nhfb, } @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/virtual-machines.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 = "Operating Systems Review", } @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/virtual-machines.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 = "Operating Systems Review", } @Article{Gaspar:2008:RVC, author = "Alessio Gaspar and Sarah Langevin and William Armitage and R. Sekar and T. Daniels", title = "The role of virtualization in computing education", journal = j-SIGCSE, volume = "40", number = "1", pages = "131--132", month = mar, year = "2008", CODEN = "SIGSD3", DOI = "https://doi.org/10.1145/1352322.1352181", ISSN = "0097-8418 (print), 2331-3927 (electronic)", ISSN-L = "0097-8418", bibdate = "Sat Nov 17 15:44:10 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigcse2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "Proceedings of SIGCSE 08.", abstract = "Over the past years, many problems related to the system administration of laboratories for undergraduate system-oriented courses have found elegant solutions in the deployment of virtualization suites. This technological advance enabled these courses to switch from a mostly descriptive content to learning activities which engage students in hands-on, authentic, problem-based learning. Since this type of activity requires students to be administrators of their own virtual machines (VM) or even virtual networks, the experience gained is intrinsically authentic. The potential impact on student learning, as compared to simulation or lecture only based setups is worth investigating for laboratories in operating systems, networking, computer security, system administration, etc. We propose to review the increasingly important role that virtualization is playing in computing education from 2 perspectives; (1) Classrooms' system administration and technological advances which support the development of new pedagogies (2) Pedagogical advances which instructors can now implement thanks to these technologies and their impact on students learning from either quantitative or qualitative perspectives The presenters will share their experience leading the Xen Worlds, V-NetLab and SOFTICE projects.", acknowledgement = ack-nhfb, fjournal = "SIGCSE Bulletin (ACM Special Interest Group on Computer Science Education)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J688", } @Article{Goldweber:2008:VEE, author = "Michael Goldweber and Renzo Davoli", title = "{VDE}: an emulation environment for supporting computer networking courses", journal = j-SIGCSE, volume = "40", number = "3", pages = "138--142", month = sep, year = "2008", CODEN = "SIGSD3", DOI = "https://doi.org/10.1145/1597849.1384310", ISSN = "0097-8418 (print), 2331-3927 (electronic)", ISSN-L = "0097-8418", bibdate = "Sat Nov 17 15:44:14 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigcse2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "Proceedings of ITiCSE '08.", abstract = "Emulators have long been a valuable tool in teaching. Particularly in the OS course, emulators have allowed students to experiment meaningfully with different machine architectures. Furthermore, many such tools run in user-mode, allowing students to operate as system administrators without the concomitant security risks. Virtual Distributed Ethernet (VDE) is a system which emulates, in user-mode, all aspects of an internet, including switches, routers, communication lines, etc, in a completely realistic manner, consistent with the operation of such artifacts in the real world. VDE's can be implemented on a single computer, spread over several machines on the same LAN or scattered across the Internet. A VDE can interoperate with both real systems (via standard virtual interface/connectivity tools) and several virtual machine environments, support encryption, and actually run fast enough to support real applications. Furthermore, a VDE can interface/interoperate with real networks. VDN's have proven highly effective in supporting both undergraduate and graduate networking courses, and a wide range of student experiments and projects.", acknowledgement = ack-nhfb, fjournal = "SIGCSE Bulletin (ACM Special Interest Group on Computer Science Education)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J688", } @Book{Haletky:2008:VES, author = "Edward Haletky", title = "{VMware ESX} server in the enterprise: planning and securing virtualization servers", publisher = pub-PH, address = pub-PH:adr, pages = "xxiv + 551", year = "2008", ISBN = "0-13-230207-1 (paperback)", ISBN-13 = "978-0-13-230207-4 (paperback)", LCCN = "QA76.9.V5 H35 2008", bibdate = "Thu Jan 21 14:12:27 MST 2010", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.loc.gov:7090/Voyager", URL = "http://www.loc.gov/catdir/toc/ecip083/2007044443.html", acknowledgement = ack-nhfb, subject = "Virtual computer systems; Security measures; VMware; Operating systems (Computers)", tableofcontents = "System considerations \\ Version comparison \\ Installation \\ Auditing, monitoring, and securing \\ Storage with ESX \\ Effects on operations \\ Networking \\ Configuring ESX from a host connection \\ Configuring ESX from virtual center or host \\ Virtual machines \\ Dynamic resource load balancing \\ Disaster recovery and backup \\ The future of virtualization \\ Appendix A: Security script \\ Appendix B: ESX version 3 text installation \\ Appendix C: ESX version 3 graphical installation.", } @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/virtual-machines.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 = "Operating Systems Review", keywords = "digital forensics; virtual introspection; virtual machine monitor; VIX", } @MastersThesis{Hinkelmann:2008:EKM, author = "Matthias Hinkelmann", title = "{Evaluation von KVM als m{\"o}glichen Ersatz f{\"u}r XEN (MI08)}", type = "{Bachelor} Thesis", school = "Hochschule", address = "Stuttgart, Germany", pages = "85", year = "2008", bibdate = "Mon Sep 13 11:51:28 2010", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, } @Book{Hogenson:2008:FCC, author = "Gordon Hogenson", title = "Foundations of {C++\slash CLI}: the {Visual C++} Language for {.NET 3.5}", publisher = pub-APRESS, address = pub-APRESS:adr, year = "2008", DOI = "https://doi.org/10.1007/978-1-4302-1024-5", ISBN = "1-4302-1024-9, 1-4302-1023-0", ISBN-13 = "978-1-4302-1024-5, 978-1-4302-1023-8", LCCN = "QA76.73.C153 H54 2008eb", bibdate = "Mon May 17 09:04:37 MDT 2010", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, subject = "C++ (Computer program language)", } @Article{Hu:2008:SVO, author = "Wenjin Hu and Todd Deshane and Jeanna Matthews", title = "{Solaris} Virtualization Options", journal = j-LOGIN, volume = "33", number = "5", pages = "??--??", month = oct, year = "2008", CODEN = "LOGNEM", ISSN = "1044-6397", ISSN-L = "1044-6397", bibdate = "Fri Dec 7 11:34:36 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/usenix2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; https://www.usenix.org/publications/login", URL = "https://www.usenix.org/publications/login/october-2008-volume-33-number-5/solaris-virtualization-options", acknowledgement = ack-nhfb, fjournal = ";login: the USENIX Association newsletter", } @Book{Hudson:2008:FU, author = "Andrew Hudson and Paul Hudson", title = "{Fedora 7} unleashed", publisher = pub-SAMS, address = pub-SAMS:adr, pages = "xxix + 903", year = "2008", ISBN = "0-672-32942-5", ISBN-13 = "978-0-672-32942-5", LCCN = "QA76.76.O63 H794 2008", bibdate = "Mon Sep 13 11:21:54 MDT 2010", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.loc.gov:7090/Voyager", URL = "http://www.loc.gov/catdir/toc/ecip0723/2007030725.html", acknowledgement = ack-nhfb, subject = "Linux; Operating systems (Computers)", tableofcontents = "Introduction \\ Part I. Installation and configuration \\ Installing Fedora \\ Fedora quick start \\ Working with GNOME \\ Command line quickstart \\ Part II. Desktop Fedora \\ On the Internet \\ Productivity applications \\ Multimedia \\ Printing with Fedora \\ Games \\ Part III. System administration \\ Managing users \\ Automating tasks \\ System-monitoring tools \\ Backing up \\ Networking \\ Remote access with SSH \\ Xen \\ Part IV. Fedors as a server \\ Apache web server management \\ Administering database services \\ File and print \\ Remote file serving with FTP \\ Handling electronic mail \\ Setting up a proxy server \\ Managing DNS \\ LDAP \\ Part V. Programming Linux \\ Using Perl \\ Working with Python \\ Writing PHP scripts \\ C/C++ programming tools for Fedora \\ Mono \\ Part VI. Fedora housekeeping \\ Securing your machines \\ Performance tuning \\ Command Line masterclass \\ Writing and executing a shell script \\ Advanced software management \\ Managing the file software \\ Kernel and module management \\ Part VII. Appendix \\ A. The history of the Red Hat and Fedora \\ B. Installation resources \\ C. Fedora and Linux Internet resources", } @Article{Hulaas:2008:PTL, author = "Jarle Hulaas and Walter Binder", title = "Program transformations for light-weight {CPU} accounting and control in the {Java Virtual Machine}", journal = j-HIGHER-ORDER-SYMB-COMPUT, volume = "21", number = "1--2", pages = "119--146", month = jun, year = "2008", CODEN = "LSCOEX", DOI = "https://doi.org/10.1007/s10990-008-9026-4", ISSN = "1388-3690 (print), 2212-0793 (electronic)", ISSN-L = "1388-3690", bibdate = "Wed Jul 9 12:34:46 MDT 2008", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=1388-3690&volume=21&issue=1; https://www.math.utah.edu/pub/tex/bib/higherordersymbcomput.bib; https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=1388-3690&volume=21&issue=1&spage=119", acknowledgement = ack-nhfb, fjournal = "Higher-Order and Symbolic Computation", keywords = "Bytecode engineering; Java; Program transformations; Resource management", } @Article{Inoue:2008:PVS, author = "Hiroaki Inoue and Junji Sakai and Masato Edahiro", title = "Processor virtualization for secure mobile terminals", journal = j-TODAES, volume = "13", number = "3", pages = "48:1--48:??", month = jul, year = "2008", CODEN = "ATASFO", DOI = "https://doi.org/10.1145/1367045.1367057", ISSN = "1084-4309 (print), 1557-7309 (electronic)", ISSN-L = "1084-4309", bibdate = "Tue Aug 5 18:41:27 MDT 2008", bibsource = "http://www.acm.org/pubs/contents/journals/todaes/; https://www.math.utah.edu/pub/tex/bib/todaes.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "We propose a processor virtualization architecture, VIRTUS, to provide a dedicated domain for preinstalled applications and virtualized domains for downloaded native applications. With it, security-oriented next-generation mobile terminals can provide any number of domains for native applications. VIRTUS features three new technologies, namely, VMM asymmetrization, dynamic interdomain communication (IDC), and virtualization-assist logic, and it is first in the world to virtualize an ARM-based multiprocessor. Evaluations have shown that VMM asymmetrization results in significantly less performance degradation and LOC increase than do other VMMs. Further, dynamic IDC overhead is low enough, and virtualization-assist logic can be implemented in a sufficiently small area.", acknowledgement = ack-nhfb, articleno = "48", fjournal = "ACM Transactions on Design Automation of Electronic Systems (TODAES)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J776", keywords = "multiprocessor; processor virtualization", } @Article{Jansen:2008:SVC, author = "Sam Jansen and Anthony McGregor", title = "Static virtualization of {C} source code", journal = j-SPE, volume = "38", number = "4", pages = "397--416", day = "10", month = apr, year = "2008", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/spe.836", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Wed Mar 17 09:55:28 MDT 2010", bibsource = "http://www.interscience.wiley.com/jpages/0038-0644; https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www3.interscience.wiley.com/journalfinder.html", acknowledgement = ack-nhfb, fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", onlinedate = "Jun 28 2007 3:31AM", } @Article{Karger:2008:VVM, author = "Paul A. Karger and David R. Safford", title = "Virtualization: {I/O} for Virtual Machine Monitors: Security and Performance Issues", journal = j-IEEE-SEC-PRIV, volume = "6", number = "5", pages = "16--23", month = sep # "\slash " # oct, year = "2008", CODEN = "????", DOI = "https://doi.org/10.1109/MSP.2008.119", ISSN = "1540-7993 (print), 1558-4046 (electronic)", ISSN-L = "1540-7993", bibdate = "Thu Jul 2 10:02:21 MDT 2009", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Security and Privacy", } @Article{King:2008:GEI, author = "Samuel T. King and Sean W. Smith", title = "{Guest Editors}' Introduction: Virtualization and Security: Back to the Future", journal = j-IEEE-SEC-PRIV, volume = "6", number = "5", pages = "15--15", month = sep # "\slash " # oct, year = "2008", CODEN = "????", DOI = "https://doi.org/10.1109/MSP.2008.136", ISSN = "1540-7993 (print), 1558-4046 (electronic)", ISSN-L = "1540-7993", bibdate = "Thu Jul 2 10:02:21 MDT 2009", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Security and Privacy", } @Book{Kissell:2008:TCV, author = "Joe Kissell", title = "Take control of {VMware Fusion 2}", publisher = pub-ORA-MEDIA, address = pub-ORA-MEDIA:adr, pages = "????", year = "2008", ISBN = "1-933671-49-1", ISBN-13 = "978-1-933671-49-9", LCCN = "QA76.76.O63 K57 2008", bibdate = "Sat Nov 13 10:18:21 MST 2010", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; prodorbis.library.yale.edu:7090/voyager", series = "Take control", acknowledgement = ack-nhfb, subject = "Microsoft Windows (Computer file); VMware; Macintosh (Computer); Operating systems (Computers)", } @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/virtual-machines.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 = "Operating Systems Review", keywords = "data protection; traffic interception; trusted data path", } @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/virtual-machines.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 = "Operating Systems Review", keywords = "application server; Java; memory management; reliability", } @Article{Loveland:2008:LVO, author = "Scott Loveland and Eli M. Dow and Frank LeFevre and Duane Beyer and Philip F. Chan", title = "Leveraging virtualization to optimize high-availability system configurations", journal = j-IBM-SYS-J, volume = "47", number = "4", pages = "591--604", month = "????", year = "2008", CODEN = "IBMSA7", ISSN = "0018-8670", bibdate = "Wed Nov 26 15:54:41 MST 2008", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www.research.ibm.com/journal/", URL = "http://www.research.ibm.com/journal/sj/474/loveland.pdf", acknowledgement = ack-nhfb, fjournal = "IBM Systems Journal", } @Book{Lowe:2008:VID, author = "William J. Lowe", title = "{VMware} infrastructure 3 for dummies", publisher = pub-WILEY, address = pub-WILEY:adr, pages = "xviii + 335", year = "2008", ISBN = "0-470-27793-9", ISBN-13 = "978-0-470-27793-5", LCCN = "????", bibdate = "Mon May 17 09:03:07 MDT 2010", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, subject = "VMware; Operating systems (Computers); Virtual computer systems", } @Book{Marcy:2008:DRP, author = "Herv{\'e} Marcy", title = "{Disaster-Recovery Programm mit Xen auf Linux Servern [Elektronische Ressource]: Design und Implementierung eines DRP f{\"u}r Xen-virtualisierte Linux-Server im Falle eines kompletten Ausfalls eines Rechenzentrums}", publisher = "Verlag Dr. M{\"u}ller", address = "Saarbr{\"u}cken, Germany", pages = "????", year = "2008", ISBN = "3-639-09099-3", ISBN-13 = "978-3-639-09099-4", LCCN = "????", bibdate = "Mon Sep 13 11:47:46 2010", bibsource = "Archivserver der Deutschen Nationalbibliothek; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www.vdm-verlag.de", acknowledgement = ack-nhfb, } @Book{Matthews:2008:RXH, editor = "Jeanna Matthews and Eli M. Dow and Todd Deshane and Wenjin Hu and Jeremy Bongio and Patrick F. Wilbur and Brendan Johnson", title = "Running {Xen}: a hands-on guide to the art of virtualization", publisher = pub-PH, address = pub-PH:adr, pages = "xxxiii + 586", year = "2008", ISBN = "0-13-207467-2, 0-13-234966-3 (paperback)", ISBN-13 = "978-0-13-207467-4, 978-0-13-234966-6 (paperback)", LCCN = "QA76.9.V5 R86 2008", bibdate = "Thu Jan 21 14:12:09 MST 2010", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.loc.gov:7090/Voyager", URL = "http://www.loc.gov/catdir/toc/ecip087/2007052439.html", acknowledgement = ack-nhfb, subject = "Xen (Electronic resource); Virtual computer systems; Computer organization; Parallel processing (Electronic computers)", tableofcontents = "Chapter 1: Xen-Background and Virtualization Basics \\ Chapter 2: A Quick Tour with the Xen LiveCD \\ Chapter 3: The Xen Hypervisor \\ Chapter 4: Hardware Requirements and Installation of Xen Domain0 \\ Chapter 5: Using Prebuilt Guest Images \\ Chapter 6: Managing Unprivileged Domains \\ Chapter 7: Populating Guest Images \\ Chapter 8: Storing Guest Images \\ Chapter 9: Device Virtualization and Management \\ Chapter 10: Network Configuration \\ Chapter 11: Securing a Xen System \\ Chapter 12: Managing Guest Resources \\ Chapter 13: Guest Save, Restore and Live Migration \\ Chapter 14: An Overview of Xen Enterprise Management Tools \\ Appendix A: Resources \\ Appendix B: The xm Command \\ Appendix C: The xend Configuration Options \\ Appendix D: Guest Configuration Options \\ Appendix E: Xen Performance Evaluation Index", } @Book{McCain:2008:MVI, author = "Chris McCain", title = "Mastering {VMware Infrastructure 3}", publisher = "Wiley Technology Publishing", address = "Indianapolis, IN, USA", pages = "xxi + 554", year = "2008", ISBN = "0-470-18313-6 (paperback)", ISBN-13 = "978-0-470-18313-7 (paperback)", LCCN = "QA76.76.O63 M37483 2008", bibdate = "Mon May 17 09:03:07 MDT 2010", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.loc.gov/catdir/enhancements/fy0805/2007045713-d.html; http://www.loc.gov/catdir/enhancements/fy0805/2007045713-t.html; http://www.loc.gov/catdir/enhancements/fy0829/2007045713-b.html", abstract = "This title offers a strong design component followed by an in-depth looks at the day-to-day tasks that make virtualization a key technology for any enterprise. Topics include creating and managing virtual networks, creating and managing storage devices, migrating and importing virtual machines, and protecting data.", acknowledgement = ack-nhfb, subject = "VMware; operating systems (computers); virtual computer systems", tableofcontents = "1. Introducing VMware Infrastructure 3. \\ 2. Installing and Planning ESX Server. \\ 3. Creating and Managing Virtual Networks. \\ 4. Creating and Managing Storage Devices. \\ 5. Installing and Configuring VirtualCenter 2.0. \\ 6. Creating and Managing Virtual Machines. \\ 7. Migrating and Importing Virtual Machines. \\ 8. Configuring and Managing Virtual Infrastructure Access Controls. \\ 9. Managing and Monitoring Resource Access. \\ 10. High Availability and Business Continuity. \\ 11. Monitoring Virtual Infrastructure Performance. \\ 12. Securing A Virtual Infrastructure. \\ 13. Virtual infrastructure 3 best practices", } @Article{McDermott:2008:REX, author = "J. McDermott and J. Kirby and B. Montrose and T. Johnson and M. Kang", title = "Re-engineering {Xen} internals for higher-assurance security", journal = j-INFO-SEC-TECH-REP, volume = "13", number = "1", pages = "17--24", month = "????", year = "2008", CODEN = "ISTRFR", DOI = "https://doi.org/10.1016/j.istr.2008.01.001", ISSN = "1363-4127 (print), 1873-605X (electronic)", ISSN-L = "1363-4127", bibdate = "Sun May 8 07:58:38 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/infosectechrep.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1363412708000022", acknowledgement = ack-nhfb, ajournal = "Info. Sec. Tech. Rep.", fjournal = "Information Security Technical Report", journal-URL = "https://www.sciencedirect.com/journal/information-security-technical-report", } @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/virtual-machines.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 = "Operating Systems Review", keywords = "network storage; snapshot; virtualization", } @Book{Morimoto:2008:WSH, author = "Rand Morimoto and Jeff Guillet", title = "{Windows Server 2008 Hyper-V} unleashed", publisher = pub-SAMS, address = pub-SAMS:adr, pages = "xv + 459", year = "2008", ISBN = "0-672-33028-8", ISBN-13 = "978-0-672-33028-5", LCCN = "QA76.9.V5 M656 2009", bibdate = "Mon May 17 09:06:20 MDT 2010", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, remark = "Includes coverage of System Center Virtual Machine Manager 2008", subject = "Microsoft Windows server Hyper-V; Virtual computer systems", } @Article{Nance:2008:VMI, author = "Kara Nance and Matt Bishop and Brian Hay", title = "Virtual Machine Introspection: Observation or Interference?", journal = j-IEEE-SEC-PRIV, volume = "6", number = "5", pages = "32--37", month = sep # "\slash " # oct, year = "2008", CODEN = "????", DOI = "https://doi.org/10.1109/MSP.2008.134", ISSN = "1540-7993 (print), 1558-4046 (electronic)", ISSN-L = "1540-7993", bibdate = "Thu Jul 2 10:02:21 MDT 2009", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Security and Privacy", } @Article{Oi:2008:LVA, author = "Hitoshi Oi", title = "Local variable access behavior of a hardware-translation based {Java} virtual machine", journal = j-J-SYST-SOFTW, volume = "81", number = "11", pages = "2059--2068", month = nov, year = "2008", CODEN = "JSSODM", ISSN = "0164-1212 (print), 1873-1228 (electronic)", ISSN-L = "0164-1212", bibdate = "Tue Sep 7 07:27:04 MDT 2010", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www.sciencedirect.com/science/journal/01641212", acknowledgement = ack-nhfb, fjournal = "The Journal of systems and software", journal-URL = "http://www.sciencedirect.com/science/journal/01641212", } @Book{Parziale:2008:ZVL, editor = "Lydia Parziale and others", title = "{z\slash VM} and {Linux} on {IBM System z}: the virtualization cookbook for {RHEL 5.2}", number = "SG24-7492-00", publisher = pub-IBM, address = pub-IBM:adr, pages = "xvi + 250", year = "2008", ISBN = "0-7384-3181-8", ISBN-13 = "978-0-7384-3181-9", LCCN = "QA76.76.O63 Z867 2008", bibdate = "Thu Jan 21 14:12:53 MST 2010", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.loc.gov:7090/Voyager", series = "IBM redbooks", URL = "http://proquest.safaribooksonline.com/?fpi=0738431818", acknowledgement = ack-nhfb, subject = "z/VM; Linux; Operating systems (Computers)", } @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/virtual-machines.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 = "Operating Systems Review", } @Article{Perez:2008:VHB, author = "Ronald Perez and Leendert van Doorn and Reiner Sailer", title = "Virtualization and Hardware-Based Security", journal = j-IEEE-SEC-PRIV, volume = "6", number = "5", pages = "24--31", month = sep # "\slash " # oct, year = "2008", CODEN = "????", DOI = "https://doi.org/10.1109/MSP.2008.135", ISSN = "1540-7993 (print), 1558-4046 (electronic)", ISSN-L = "1540-7993", bibdate = "Thu Jul 2 10:02:21 MDT 2009", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Security and Privacy", } @Article{Prokopski:2008:APC, author = "Gregory B. Prokopski and Clark Verbrugge", title = "Analyzing the performance of code-copying virtual machines", journal = j-SIGPLAN, volume = "43", number = "10", pages = "403--422", month = sep, year = "2008", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/1449955.1449796", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Oct 22 09:57:37 MDT 2008", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Many popular programming languages use interpreter-based execution for portability, supporting dynamic or reflective properties, and ease of implementation. {\em Code-copying\/} is an optimization technique for interpreters that reduces the performance gap between interpretation and {\em JIT\/} compilation, offering significant speedups over direct-threading interpretation. Due to varying language features and virtual machine design, however, not all languages benefit from codecopying to the same extent. We consider here properties of interpreted languages, and in particular bytecode and virtual machine construction that enhance or reduce the impact of code-copying. We implemented code-copying and compared performance with the original direct-threading virtual machines for three languages, Java (SableVM), OCaml, and Ruby (Yarv), examining performance on three different architectures, ia32 (Pentium 4), x86\_64 (AMD64) and PowerPC (G5). Best speedups are achieved on ia32 by OCaml (maximum 4.88 times, 2.81 times on average), where a small and simple bytecode design facilitates improvements to branch prediction brought by code-copying. Yarv only slightly improves over direct-threading; large working sizes of bytecodes, and a relatively small fraction of time spent in the actual interpreter loop both limit the application of codecopying and its overall net effect. We are able to show that simple ahead of time analysis of VM and execution properties can help determine the suitability of code-copying for a particular VM before an implementation of code-copying is even attempted.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", keywords = "branch prediction; code-copying; compiler optimization; dynamic analysis; performance; virtual machines", } @Book{Radonic:2008:XAK, author = "Andrej Radonic and Thomas Halinka and Frank Meyer", title = "{XEN 3.2: aufsetzen, konfigurieren, betreiben}", publisher = "Franzis-Verlag", address = "Poing, Germany", edition = "Second", pages = "499", year = "2008", ISBN = "3-7723-7247-3", ISBN-13 = "978-3-7723-7247-6", LCCN = "????", bibdate = "Mon Sep 13 11:22:13 MDT 2010", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", series = "Franzis Professional Series", acknowledgement = ack-nhfb, } @Article{Rixner:2008:NVB, author = "Scot Rixner", title = "Network virtualization: breaking the performance barrier", journal = j-QUEUE, volume = "6", number = "1", pages = "36--ff", month = jan, year = "2008", CODEN = "AQCUAE", DOI = "https://doi.org/10.1145/1348583.1348592", ISSN = "1542-7730 (print), 1542-7749 (electronic)", ISSN-L = "1542-7730", bibdate = "Fri Jun 20 11:18:20 MDT 2008", bibsource = "https://www.math.utah.edu/pub/tex/bib/queue.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Shared I/O in virtualization platforms has come a long way, but performance concerns remain.", acknowledgement = ack-nhfb, fjournal = "ACM Queue: Tomorrow's Computing Today", keywords = "virtual machines", } @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/virtual-machines.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 = "Operating Systems Review", keywords = "I/O; KVM; lguest; Linux; ring buffer; virtio; virtio_pci; virtualization; vring", } @MastersThesis{Seecker:2008:EGS, author = "Robert Seecker", title = "{Erstellung einer geh{\"a}rteten Systemarchitecktur mit der Virtualisierungsl{\"o}sung Xen zur Konsolidierung von Kundenserversystemen in einem Rechenzentrum}", type = "{Bachelor} Thesis", school = "Fachhochschule", address = "Stralsund, Germany", pages = "vii + 86", year = "2008", bibdate = "Mon Sep 13 11:41:23 2010", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, } @Article{Seeling:2008:L, author = "Patrick Seeling", title = "Labs@Home", journal = j-SIGCSE, volume = "40", number = "4", pages = "75--77", month = dec, year = "2008", CODEN = "SIGSD3", DOI = "https://doi.org/10.1145/1473195.1473225", ISSN = "0097-8418 (print), 2331-3927 (electronic)", ISSN-L = "0097-8418", bibdate = "Sat Nov 17 15:44:17 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigcse2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "In this publication, we introduce the Labs@Home framework, which enables students to conduct laboratory elements of courses on their personal computing equipment. A major benefit of this approach is that students are able to progress through assignments at a time and pace of their choice, before submitting the results to the instructor for review. The introduced framework is based on capturing differences between versions of the virtual machines and exchanging these between instructor and students. We are currently implementing several parts of the framework and expect to evaluate its implementation in the near future.", acknowledgement = ack-nhfb, fjournal = "SIGCSE Bulletin (ACM Special Interest Group on Computer Science Education)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J688", } @Article{Shi:2008:VMS, author = "Yunhe Shi and Kevin Casey and M. Anton Ertl and David Gregg", title = "Virtual machine showdown: {Stack} versus registers", journal = j-TACO, volume = "4", number = "4", pages = "2:1--2:??", month = jan, year = "2008", CODEN = "????", DOI = "https://doi.org/10.1145/1328195.1328197", ISSN = "1544-3566 (print), 1544-3973 (electronic)", ISSN-L = "1544-3566", bibdate = "Mon Jun 16 11:41:35 MDT 2008", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/taco.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Virtual machines (VMs) enable the distribution of programs in an architecture-neutral format, which can easily be interpreted or compiled. A long-running question in the design of VMs is whether a stack architecture or register architecture can be implemented more efficiently with an interpreter. We extend existing work on comparing virtual stack and virtual register architectures in three ways. First, our translation from stack to register code and optimization are much more sophisticated. The result is that we eliminate an average of more than 46\% of executed VM instructions, with the bytecode size of the register machine being only 26\% larger than that of the corresponding stack one. Second, we present a fully functional virtual-register implementation of the Java virtual machine (JVM), which supports Intel, AMD64, PowerPC and Alpha processors. This register VM supports inline-threaded, direct-threaded, token-threaded, and switch dispatch. Third, we present experimental results on a range of additional optimizations such as register allocation and elimination of redundant heap loads. On the AMD64 architecture the register machine using switch dispatch achieves an average speedup of 1.48 over the corresponding stack machine. Even using the more efficient inline-threaded dispatch, the register VM achieves a speedup of 1.15 over the equivalent stack-based VM.", acknowledgement = ack-nhfb, articleno = "2", fjournal = "ACM Transactions on Architecture and Code Optimization (TACO)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J924", keywords = "interpreter; register architecture; stack architecture; virtual machine", } @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/virtual-machines.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 = "Operating Systems Review", } @Book{Subramaniam:2008:PST, author = "Venkat Subramaniam", title = "Programming {Scala}: tackle multicore complexity on the {JVM}", publisher = "Pragmatic Bookshelf", address = "Raleigh, NC, USA", pages = "x + 221", year = "2008", ISBN = "1-934356-31-X (paperback)", ISBN-13 = "978-1-934356-31-9 (paperback)", LCCN = "QA76.73.J38 S83 2008", bibdate = "Thu Jan 21 14:00:30 MST 2010", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.loc.gov:7090/Voyager", acknowledgement = ack-nhfb, subject = "Scala (Computer program language); Java virtual machine; Java (Computer program language)", } @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/virtual-machines.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 = "Operating Systems Review", } @Article{Thomas:2008:DHF, author = "Ga{\"e}l Thomas and Nicolas Geoffray and Charles Cl{\'e}ment and Bertil Folliot", title = "Designing highly flexible virtual machines: the {JnJVM} experience", journal = j-SPE, volume = "38", number = "15", pages = "1643--1675", day = "??", month = dec, year = "2008", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/spe.887", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Wed Mar 17 09:55:32 MDT 2010", bibsource = "http://www.interscience.wiley.com/jpages/0038-0644; https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www3.interscience.wiley.com/journalfinder.html", acknowledgement = ack-nhfb, fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", onlinedate = "Jun 6 2008 6:18AM", } @Book{Thorns:2008:VBK, editor = "Fabian Thorns", title = "{Das Virtualisierungs-Buch: [Konzepte, Techniken und L{\"o}sungen: VMware, MS, Parallels, Xen u.v.a.]}", publisher = "Computer- und Literatur-Verlag", address = "B{\"o}blingen, Germany", edition = "Second", pages = "799", year = "2008", ISBN = "3-936546-56-8", ISBN-13 = "978-3-936546-56-9", LCCN = "????", bibdate = "Mon Sep 13 11:39:30 MDT 2010", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.gbv.de:20011/gvk", acknowledgement = ack-nhfb, } @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; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGOPS Operating Systems Review", } @Article{Vaughan-Nichols:2008:VSS, author = "Steven J. Vaughan-Nichols", title = "Virtualization Sparks Security Concerns", journal = j-COMPUTER, volume = "41", number = "8", pages = "13--15", month = aug, year = "2008", CODEN = "CPTRB4", DOI = "https://doi.org/10.1109/MC.2008.312", ISSN = "0018-9162 (print), 1558-0814 (electronic)", ISSN-L = "0018-9162", bibdate = "Tue Aug 12 18:24:27 MDT 2008", bibsource = "https://www.math.utah.edu/pub/tex/bib/computer2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Computer", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2", } @Book{vonHagen:2008:PXV, author = "William von Hagen", title = "Professional {Xen} virtualization", publisher = pub-WILEY, address = pub-WILEY:adr, pages = "xxiii + 405", year = "2008", ISBN = "0-470-13811-4 (paperback), 0-470-28918-X (electronic)", ISBN-13 = "978-0-470-13811-3 (paperback), 978-0-470-28918-1 (electronic)", LCCN = "QA76.9.V5 V665 2008", bibdate = "Thu Jan 21 14:12:19 MST 2010", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.loc.gov:7090/Voyager", URL = "http://www.loc.gov/catdir/enhancements/fy0806/2007049359-d.html; http://www.loc.gov/catdir/enhancements/fy0806/2007049359-t.html; http://www.loc.gov/catdir/enhancements/fy0809/2007049359-b.html", acknowledgement = ack-nhfb, subject = "Virtual computer systems; Open source software", xxpages = "xxiii + 408", } @Article{Wang:2008:PEV, author = "Lizhe Wang and Marcel Kunze and Jie Tao", title = "Performance evaluation of virtual machine-based {Grid} workflow system", journal = j-CCPE, volume = "20", number = "15", pages = "1759--1771", month = oct, year = "2008", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.1328", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Mon Dec 5 10:08:27 MST 2011", bibsource = "http://www.interscience.wiley.com/jpages/1532-0626; https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Concurrency and Computation: Prac\-tice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", onlinedate = "6 Jun 2008", } @Article{Wang:2008:VBA, author = "Xiaoying Wang and Zhihui Du and Yinong Chen and Sanli Li", title = "Virtualization-based autonomic resource management for multi-tier {Web} applications in shared data center", journal = j-J-SYST-SOFTW, volume = "81", number = "9", pages = "1591--1608", month = sep, year = "2008", CODEN = "JSSODM", ISSN = "0164-1212 (print), 1873-1228 (electronic)", ISSN-L = "0164-1212", bibdate = "Tue Sep 7 07:27:04 MDT 2010", bibsource = "https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www.sciencedirect.com/science/journal/01641212", acknowledgement = ack-nhfb, fjournal = "The Journal of systems and software", journal-URL = "http://www.sciencedirect.com/science/journal/01641212", } @Book{Warnke:2008:QVC, author = "Robert Warnke and Thomas Ritzau", title = "{QEMU: virtuelle Computer f{\"u}r viele Betriebssysteme; QEMU Version 0.9.1}", publisher = "Books on Demand GmbH", address = "Norderstedt, Germany", pages = "300", year = "2008", ISBN = "3-8370-0876-2", ISBN-13 = "978-3-8370-0876-0", LCCN = "????", bibdate = "Mon May 17 09:07:48 MDT 2010", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://d-nb.info/986260371/04", acknowledgement = ack-nhfb, subject = "Qemu", } @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/virtual-machines.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 = "Operating Systems Review", keywords = "compaction; concurrent; parallel; virtual memory", } @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/virtual-machines.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 = "Operating Systems Review", keywords = "legacy reuse; secure file system; virtualization", } @Article{Adeshiyan:2009:UVH, author = "T. Adeshiyan and C. R. Attanasio and E. M. Farr and R. E. Harper and D. Pelleg and C. Schulz and L. F. Spainhower and P. Ta-Shma and L. A. Tomek", title = "Using virtualization for high availability and disaster recovery", journal = j-IBM-JRD, volume = "53", number = "4", pages = "??--??", month = "????", year = "2009", CODEN = "IBMJAE", ISSN = "0018-8646 (print), 2151-8556 (electronic)", ISSN-L = "0018-8646", bibdate = "Sat May 1 17:44:14 MDT 2010", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www.research.ibm.com/journal/", URL = "http://www.research.ibm.com/journal/abstracts/rd/534/adeshiyan.html", acknowledgement = ack-nhfb, articleno = "8", fjournal = "IBM Journal of Research and Development", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520", } @Article{Anderson:2009:XWL, author = "Benjamin R. Anderson and Amy K. Joines and Thomas E. Daniels", title = "{Xen} worlds: leveraging virtualization in distance education", journal = j-SIGCSE, volume = "41", number = "3", pages = "293--297", month = sep, year = "2009", CODEN = "SIGSD3", DOI = "https://doi.org/10.1145/1595496.1562967", ISSN = "0097-8418 (print), 2331-3927 (electronic)", ISSN-L = "0097-8418", bibdate = "Sat Nov 17 15:44:23 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigcse2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "Proceedings of ITiCSE '09.", abstract = "The Xen Worlds project at Iowa State University was designed to provide a virtualized lab environment for the Information Assurance program. The large number of off-campus students, and a desire for high levels of security, drove many of the requirements for the Xen Worlds environment. Some of the requirements established for the project were: The environment needed to be equally accessible and easy to use for both on- and off-campus students. It needed to be isolated from the outside world and other students. The system had to be equally usable for students with limited computing and network resources. Costs had to be kept to a minimum. The Xen Worlds environment has now been used to support several courses at both the undergraduate and graduate level. This virtual environment was equally accessible to on- and off-campus students on a 24/7 basis and supported numerous assignments in support of established curriculum requirements. Finally, surveys of students who used the Xen Worlds environment show that students have a favorable view of the project and view it as a useful and convenient learning tool.", acknowledgement = ack-nhfb, fjournal = "SIGCSE Bulletin (ACM Special Interest Group on Computer Science Education)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J688", } @Book{Aprea:2009:HVS, author = "Jean-Fran{\c{c}}ois Apr{\'e}a", title = "{Hyper-V} et {SC Virtual Machine Manager}: technologie de virtualisation sous {Windows Server 2008 R2}. ({French}). [{Hyper-V} and {SC Virtual Machine Manager}: virtualization technology under {Windows Server 2008 R2}]", publisher = "{\'E}ditions ENI", address = "Saint Herblain, France", pages = "537", year = "2009", ISBN = "2-7460-5061-7", ISBN-13 = "978-2-7460-5061-7", LCCN = "????", bibdate = "Mon May 17 09:06:20 MDT 2010", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", series = "Expert IT", acknowledgement = ack-nhfb, language = "French", subject = "Virtualisation. Virtual systems. Microsoft Windows Server 2008 (computer operating system)", } @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/virtual-machines.bib", abstract = "Virtualization brings exibility 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 = "Operating Systems Review", keywords = "key management; storage; TCG; virtualization", } @Book{Becker:2009:VIA, author = "Dirk Becker", title = "{VirtualBox Installation, Anwendung, Praxis}. ({German}) [{VirtualBox} Installation, Use, and Practice]", publisher = "Galileo Press", address = "Bonn, Germany", pages = "321", year = "2009", ISBN = "3-8362-1374-5", ISBN-13 = "978-3-8362-1374-5", LCCN = "????", bibdate = "Mon May 17 09:06:33 MDT 2010", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", series = "Galileo computing", URL = "http://d-nb.info/993523552/04; http://www.galileocomputing.de", acknowledgement = ack-nhfb, language = "German", remark = "Von den Grundlagen bis zum praktischen Einsatz; Troubleshooting, Migration und Kommandozeile; f{\"u}r Ein- und Umsteiger geeignet; ab Version 3", subject = "VirtualBox", } @Article{Bertels:2009:EMM, author = "Peter Bertels and Wim Heirman and Erik D'Hollander and Dirk Stroobandt", title = "Efficient memory management for hardware accelerated {Java Virtual Machines}", journal = j-TODAES, volume = "14", number = "4", pages = "48:1--48:??", month = aug, year = "2009", CODEN = "ATASFO", DOI = "https://doi.org/10.1145/1562514.1562516", ISSN = "1084-4309 (print), 1557-7309 (electronic)", ISSN-L = "1084-4309", bibdate = "Thu Aug 27 14:38:55 MDT 2009", bibsource = "http://www.acm.org/pubs/contents/journals/todaes/; https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/todaes.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Application-specific hardware accelerators can significantly improve a system's performance. In a Java-based system, we then have to consider a hybrid architecture that consists of a Java Virtual Machine running on a general-purpose processor connected to the hardware accelerator. In such a hybrid architecture, data communication between the accelerator and the general-purpose processor can incur a significant cost, which may even annihilate the original performance improvement of adding the accelerator. A careful layout of the data in the memory structure is therefore of major importance to maintain the acceleration performance benefits.\par This article addresses the reduction of the communication cost in a distributed shared memory consisting of the main memory of the processor and the accelerator's local memory, which are unified in the Java heap. Since memory access times are highly nonuniform, a suitable allocation of objects in either main memory or the accelerator's local memory can significantly reduce the communication cost. We propose several techniques for finding the optimal location for each Java object's data, either statically through profiling or dynamically at runtime. We show how we can reduce communication cost by up to 86\% for the SPECjvm and DaCapo benchmarks. We also show that the best strategy is application dependent and also depends on the relative cost of remote versus local accesses. For a relative cost higher than 10, a self-learning dynamic approach often results in the best performance.", acknowledgement = ack-nhfb, articleno = "48", fjournal = "ACM Transactions on Design Automation of Electronic Systems (TODAES)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J776", keywords = "Dynamic memory management; hardware acceleration; Java Virtual Machine", } @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/virtual-machines.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 = "Operating Systems Review", keywords = "hardware performance event counters; virtual machines", } @Book{Cerling:2009:MMV, author = "Tim Cerling and Jeff Buller and Chuck Enstall and Richard Ruiz", title = "Mastering {Microsoft} virtualization", publisher = pub-WILEY, address = pub-WILEY:adr, pages = "576 (est.)", year = "2009", ISBN = "0-470-44958-6", ISBN-13 = "978-0-470-44958-5", LCCN = "QA76.9.V5 M36 2009", bibdate = "Thu Jan 21 14:12:35 MST 2010", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.loc.gov:7090/Voyager", acknowledgement = ack-nhfb, subject = "Microsoft Windows server Hyper-V; Virtual computer systems", } @TechReport{Cox:2009:REM, author = "Russ Cox", title = "Regular Expression Matching: the Virtual Machine Approach", type = "Report", institution = "swtch.com", address = "Cambridge, MA, USA", month = dec, year = "2009", bibdate = "Tue Mar 27 11:39:17 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/plan9.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "See also \cite{Thompson:1968:PTR,Kernighan:1999:REL,Cox:2007:REM,Cox:2010:REM,Cox:2012:REM}", URL = "http://swtch.com/~rsc/regexp/regexp2.html", acknowledgement = ack-nhfb, } @Article{Creeger:2009:CRV, author = "Mache Creeger", title = "{CTO} roundtable: Virtualization: Part One", journal = j-QUEUE, volume = "7", number = "1", pages = "26--35", month = jan, year = "2009", CODEN = "AQCUAE", DOI = "https://doi.org/10.1145/1508211.1508219", ISSN = "1542-7730 (print), 1542-7749 (electronic)", ISSN-L = "1542-7730", bibdate = "Tue Feb 24 11:19:58 MST 2009", bibsource = "https://www.math.utah.edu/pub/tex/bib/queue.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "CTOs from key players in the virtualization market examine current trends in virtualization and how IT managers can make the most effective use of it.", acknowledgement = ack-nhfb, fjournal = "ACM Queue: Tomorrow's Computing Today", } @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/virtual-machines.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 = "Operating Systems Review", keywords = "open trusted computing; TCG; TPM; trusted virtualization", } @Article{Desai:2009:AIC, author = "Aniruddha Desai and Jugdutt Singh", title = "Architecture Independent Characterization of Embedded {Java} Workloads", journal = j-IEEE-COMPUT-ARCHIT-LETT, volume = "8", number = "1", pages = "29--32", month = jan # "\slash " # jun, year = "2009", CODEN = "????", DOI = "https://doi.org/10.1109/L-CA.2009.7", ISSN = "1556-6056 (print), 1556-6064 (electronic)", ISSN-L = "1556-6056", bibdate = "Thu Jun 20 17:18:18 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeecomputarchitlett.bib; https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "This paper presents architecture independent characterization of embedded Java workloads based on the industry standard GrinderBench benchmark which includes different classes of real world embedded Java applications. This work is based on a custom built embedded Java Virtual Machine (JVM) simulator specifically designed for embedded JVM modeling and embodies domain specific details such as thread scheduling, algorithms used for native CLDC APIs and runtime data structures optimized for use in embedded systems. The results presented include dynamic execution characteristics, dynamic bytecode instruction mix, application and API workload distribution, Object allocation statistics, instruction-set coverage, memory usage statistics and method code and stack frame characteristics.", acknowledgement = ack-nhfb, affiliation = "Desai, A (Reprint Author), La Trobe Univ, Bundoora, Vic 3086, Australia. Desai, Aniruddha; Singh, Jugdutt, La Trobe Univ, Bundoora, Vic 3086, Australia.", author-email = "desai@ieee.org", da = "2019-06-20", doc-delivery-number = "V17GC", fjournal = "IEEE Computer Architecture Letters", journal-iso = "IEEE Comput. Archit. Lett.", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=10208", keywords = "Embedded Systems; Java; Java bytecode; Workload Characterization", number-of-cited-references = "8", research-areas = "Computer Science", times-cited = "0", unique-id = "Desai:2009:AIC", web-of-science-categories = "Computer Science, Hardware \& Architecture", } @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; https://www.math.utah.edu/pub/tex/bib/virtual-machines.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", keywords = "GPU; I/O virtualization; virtual device", } @Article{Fagen:2009:VEN, author = "Wade A. Fagen and Jo{\~a}o W. Cangussu and Ram Dantu", title = "A virtual environment for network testing", journal = j-J-NETW-COMPUT-APPL, volume = "32", number = "1", pages = "184--214", month = jan, year = "2009", CODEN = "JNCAF3", ISSN = "1084-8045 (print), 1095-8592 (electronic)", ISSN-L = "1084-8045", bibdate = "Wed Jan 28 15:43:25 MST 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S108480450800026X", acknowledgement = ack-nhfb, ajournal = "J. Netw. Comput. Appl.", fjournal = "Journal of Network and Computer Applications", journal-URL = "http://www.sciencedirect.com/science/journal/10848045", } @Book{Fischer:2009:XUH, author = "Marcus Fischer", title = "{Xen das umfassende Handbuch}. ({German}) [{Xen}, the Complete Handbook]", publisher = "Galileo Press", address = "Bonn, Germany", pages = "547", year = "2009", ISBN = "3-8362-1118-1", ISBN-13 = "978-3-8362-1118-5", LCCN = "????", bibdate = "Mon May 17 09:05:00 MDT 2010", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", series = "Galileo computing", URL = "http://d-nb.info/986059226/04; http://deposit.d-nb.de/cgi-bin/dokserv?id=3015256; http://www.galileocomputing.de/", acknowledgement = ack-nhfb, language = "German", remark = "Inkl. {KVM}; von den Grundlagen bis zur Administration; Backup, Troubleshooting, Migration; mit Konfigurationsbeispielen und Befehlsreferenz; inkl. Xen-Live-{CD}", subject = "XEN3", } @Book{Fraser:2009:PVC, author = "Stephen Fraser", title = "{Pro Visual C++\slash CLI} and the {.NET 3.5} Platform", publisher = pub-APRESS, address = pub-APRESS:adr, pages = "xxx + 1048", year = "2009", ISBN = "1-4302-1053-2 (paperback), 1-4302-1054-0 (electronic)", ISBN-13 = "978-1-4302-1053-5 (paperback), 978-1-4302-1054-2 (electronic)", LCCN = "QA76.73.C153 F735 2009", bibdate = "Mon May 17 09:04:37 MDT 2010", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", series = "Expert's voice in .NET", acknowledgement = ack-nhfb, remark = "The C++/CLI language -- .NET framework development in C++/CLI -- Unsafe/unmanaged C++/CLI", subject = "C++/CLI (Computer program language); Microsoft .NET; Microsoft .NET", } @Article{Galvin:2009:PATb, author = "Peter Baer Galvin", title = "{Pete}'s All Things {Sun}: The {Sun} Virtualization Guide", journal = j-LOGIN, volume = "34", number = "2", pages = "??--??", month = apr, year = "2009", CODEN = "LOGNEM", ISSN = "1044-6397", ISSN-L = "1044-6397", bibdate = "Fri Dec 7 11:34:39 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/usenix2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; https://www.usenix.org/publications/login", URL = "https://www.usenix.org/publications/login/april-2009-volume-34-number-2/petes-all-things-sun-sun-virtualization-guide", acknowledgement = ack-nhfb, fjournal = ";login: the USENIX Association newsletter", } @Article{Galvin:2009:PATe, author = "Peter Baer Galvin", title = "{Pete}'s All Things {Sun}: {VMware vSphere 4} vs. {Microsoft Hyper-V R2}", journal = j-LOGIN, volume = "34", number = "5", pages = "58--67", month = oct, year = "2009", CODEN = "LOGNEM", ISSN = "1044-6397", ISSN-L = "1044-6397", bibdate = "Fri Dec 7 11:34:41 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/usenix2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; https://www.usenix.org/publications/login", URL = "https://www.usenix.org/publications/login/october-2009-volume-34-number-5/petes-all-things-sun-vmware-vsphere-4-vs", acknowledgement = ack-nhfb, fjournal = ";login: the USENIX Association newsletter", } @Article{Gupta:2009:DE, author = "Diwaker Gupta and Sangmin Lee and Michael Vrable and Stefan Savage and Alex C. Snoeren and George Varghese and Geoffrey M. Voelker and Amin Vahdat", title = "Difference Engine", journal = j-LOGIN, volume = "34", number = "2", pages = "24--31", month = apr, year = "2009", CODEN = "LOGNEM", ISSN = "1044-6397", ISSN-L = "1044-6397", bibdate = "Fri Dec 7 11:34:39 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/usenix2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; https://www.usenix.org/publications/login", URL = "https://www.usenix.org/publications/login/april-2009-volume-34-number-2/difference-engine", acknowledgement = ack-nhfb, fjournal = ";login: the USENIX Association newsletter", keywords = "virtual machine", } @Book{Haletky:2009:VVV, author = "Edward Haletky", title = "{VMware vSphere} and virtual infrastructure security: securing the virtual environment", publisher = pub-PH, address = pub-PH:adr, pages = "xxx + 521", year = "2009", ISBN = "0-13-715800-9 (paperback)", ISBN-13 = "978-0-13-715800-3 (paperback)", LCCN = "QA76.9.V5 H36 2009", bibdate = "Mon May 17 09:03:07 MDT 2010", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, subject = "VMware vSphere; Virtual computer systems; Security measures; Cloud computing; Computer security", } @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; https://www.math.utah.edu/pub/tex/bib/virtual-machines.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", keywords = "operating systems; post-copy; process migration; virtual machines; Xen", } @Book{Ilgenfritz:2009:VCP, author = "Merle Ilgenfritz and John Ilgenfritz and John Powell and Steven Baca", title = "{VMware} certified professional test prep", publisher = pub-CRC, address = pub-CRC:adr, pages = "xxi + 867", year = "2009", ISBN = "1-4200-6599-8", ISBN-13 = "978-1-4200-6599-2", LCCN = "QA76.3 .I56 2009eb", bibdate = "Mon May 17 09:03:07 MDT 2010", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.engnetbase.com/ejournals/books/book\%5Fsummary/summary.asp?id=7409", acknowledgement = ack-nhfb, subject = "VMware; Electronic data processing personnel; Certification; Virtual computer systems; Examinations; Study guides", } @Book{Joos:2009:MWS, author = "Thomas Joos", title = "{Microsoft Windows Server 2008 --- das Handbuch}. (German) {Microsoft Windows Server 2008 --- the Handbook}", publisher = "Microsoft Press", address = "Unterschlei{\ss}heim", edition = "Second", pages = "1356", year = "2009", ISBN = "3-86645-130-X", ISBN-13 = "978-3-86645-130-8", LCCN = "????", bibdate = "Mon May 17 09:06:20 MDT 2010", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://deposit.d-nb.de/cgi-bin/dokserv?id=3161715", acknowledgement = ack-nhfb, language = "German", remark = "Insider-Wissen - praxisnah und kompetent; ber{\"u}cksichtigt Hyper-V. ({German}) [Insider knowledge: covers Hyper-V]", subject = "Windows Server 2008; Microsoft Windows server; Operating systems (Computers); Windows Server 2008", } @Article{Kagawa:2009:WWB, author = "Koji Kagawa", title = "{WAPPEN}: a {Web}-based application framework for programming and its {\tt bison\slash flex} plug-in", journal = j-SIGCSE, volume = "41", number = "3", pages = "383--383", month = sep, year = "2009", CODEN = "SIGSD3", DOI = "https://doi.org/10.1145/1595496.1563025", ISSN = "0097-8418 (print), 2331-3927 (electronic)", ISSN-L = "0097-8418", bibdate = "Sat Nov 17 15:44:23 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigcse2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "Proceedings of ITiCSE '09.", abstract = "This poster presents an Eclipse RCP-based application framework named Wappen for learning programming, and especially, its plugin for Bison and Flex. In courses such as compiler construction and programming languages, learners have to use multiple languages. Time and effort spent by learners on installation and configuration of programming environments are not negligible. Wappen provides an infrastructure on which teachers can arrange simple Web-based programming environments for various programming languages by writing plug-ins. Wappen for Oolong has been successfully used in our compiler construction lab, where Oolong is an assembly language for the Java Virtual Machine. This poster introduces Wappen for Bison/Flex that tries to help learners avoid pitfalls of Bison/Flex in some respects. It is planned to be put into practical use in our compiler construction lab this year.", acknowledgement = ack-nhfb, fjournal = "SIGCSE Bulletin (ACM Special Interest Group on Computer Science Education)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J688", } @Book{Kappel:2009:MVH, author = "Jason Kappel and Toby J. Velte and Anthony T. Velte", title = "{Microsoft} virtualization with {Hyper-V}", publisher = pub-MCGRAW-HILL, address = pub-MCGRAW-HILL:adr, pages = "xviii + 430", year = "2009", ISBN = "0-07-161403-6", ISBN-13 = "978-0-07-161403-0", LCCN = "QA76.9.V5 K37 2009", bibdate = "Thu Jan 21 14:12:44 MST 2010", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.loc.gov:7090/Voyager", acknowledgement = ack-nhfb, subject = "Microsoft Windows server Hyper-V; Virtual computer systems; Systems migration", tableofcontents = "Virtualization overview \\ Planning and installation \\ Configuring Hyper-V components \\ Planning and designing Systems Center Virtual Machine Manager 2008 \\ Installing and configuring Systems Center Virtual Machine Manager 2008 \\ Configuring Systems Center Virtual Machine Manager 2008 \\ Creating and managing virtual machines \\ Managing your virtual machines \\ Backing up, restoring, and disaster recovery for your virtual machines \\ Monitoring your virtual solution \\ Hyper-V security \\ Virtual desktop infrastructure \\ Third-party visualization tools for Hyper-V \\ Windows Server 2008 Hyper-V command-line reference", } @Book{Kelbley:2009:WSH, author = "John Kelbley and Mike Sterling and Allen Stewart", title = "{Windows Server 2008 Hyper-V}: insiders guide to {Microsoft}'s {Hypervisor}", publisher = pub-WILEY, address = pub-WILEY:adr, pages = "xxii + 361", year = "2009", ISBN = "0-470-50398-X (electronic), 0-470-44096-1 (paperback)", ISBN-13 = "978-0-470-50398-0 (electronic), 978-0-470-44096-4 (paperback)", LCCN = "QA76.9.V5 K45 2009eb", bibdate = "Mon May 17 09:06:20 MDT 2010", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.books24x7.com/marc.asp?bookid=31993", acknowledgement = ack-nhfb, remark = "Title from title screen.", subject = "Microsoft Windows Server Hyper-V; virtual computer systems", } @Book{Khnaser:2009:VVC, author = "Elias N. Khnaser", title = "{VCP: VMware Certified Professional}", publisher = pub-QUE, address = pub-QUE:adr, pages = "xv + 316", year = "2009", ISBN = "0-7897-3805-8 (paperback)", ISBN-13 = "978-0-7897-3805-9 (paperback)", LCCN = "QA76.3 .K495 2009", bibdate = "Mon May 17 09:03:07 MDT 2010", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "Includes CD-ROM.", series = "Exam cram", acknowledgement = ack-nhfb, subject = "VMware; electronic data processing personnel; certification; virtual computer systems; examinations; study guides", } @Article{Kroeker:2009:EV, author = "Kirk L. Kroeker", title = "The evolution of virtualization", journal = j-CACM, volume = "52", number = "3", pages = "18--20", month = mar, year = "2009", CODEN = "CACMA2", DOI = "https://doi.org/10.1145/1467247.1467253", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Wed Feb 25 09:20:24 MST 2009", bibsource = "http://www.acm.org/pubs/contents/journals/cacm/; https://www.math.utah.edu/pub/tex/bib/cacm2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Virtualization is moving out of the data center and making inroads with mobile computing, security, and software delivery.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79", } @Book{Larisch:2009:PMH, author = "Dirk Larisch", title = "{Praxisbuch Microsoft Hyper-V: Installation, Konfiguration und Systemverwaltung von Hyper-V f{\"u}r Windows Server 2008 und Hyper-V Server}. ({German}) [{Microsoft Hyper-V} Practice Book: Installation, Configuration, and Systems Management of {Hyper-V} for {Windows Server 2008} and {Hyper-V Server}]", publisher = pub-CARL-HANSER, address = pub-CARL-HANSER:adr, pages = "500", year = "2009", ISBN = "3-446-41687-0", ISBN-13 = "978-3-446-41687-1", LCCN = "????", bibdate = "Mon May 17 09:06:20 MDT 2010", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://deposit.d-nb.de/cgi-bin/dokserv?id=3200334", acknowledgement = ack-nhfb, language = "German", subject = "Hyper-V", } @Book{Larson:2009:WSHa, author = "Robert Larson and Janique Carbone", title = "{Windows Server 2008 Hyper-V} resource kit", publisher = pub-MICROSOFT, address = pub-MICROSOFT:adr, pages = "xxxv + 744", year = "2009", ISBN = "0-7356-2517-4", ISBN-13 = "978-0-7356-2517-4", LCCN = "QA76.9.V5 L37 2009", bibdate = "Mon May 17 09:06:20 MDT 2010", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://proquest.safaribooksonline.com/9780735625174", acknowledgement = ack-nhfb, subject = "Microsoft Windows server Hyper-V; Virtual computer systems", } @Book{Larson:2009:WSHb, author = "Robert Larson and Janique Carbone", title = "{Windows Server 2008 Hyper-V --- die technische Referenz: [Insiderinformationen und n{\"u}tzliche Tools direkt von der Quelle]}: [{Windows Server 2008 Hyper-V}: the technical reference --- insider information and useful tools --- direct from the source]", publisher = "Microsoft Press", address = "Unterschlei{\ss}heim, Germany", pages = "xxviii + 739", year = "2009", ISBN = "3-86645-926-2", ISBN-13 = "978-3-86645-926-7", LCCN = "????", bibdate = "Mon May 17 09:06:20 MDT 2010", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, language = "German", subject = "Hyper-V", } @Book{Lowe:2009:MVV, author = "Scott Lowe", title = "Mastering {VMware vSphere 4}", publisher = pub-SYBEX, address = pub-SYBEX:adr, pages = "xxi + 673", year = "2009", ISBN = "0-470-48138-2", ISBN-13 = "978-0-470-48138-7", LCCN = "QA76.9.V5 L67 2009", bibdate = "Tue Sep 1 14:40:07 MDT 2009", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; melvyl.cdlib.org:210/CDL90", series = "Sybex serious skills", abstract = "Update to the bestselling book on VMWare Infrastructure. This update to the bestselling book on VMWare Infrastructure 3, Mastering VMware TBD will prove to be indispensible to anyone using the market-leading virtualization software. As part of the highly acclaimed Mastering series from Sybex, this guide offers a comprehensive look at VMware technology, how to implement it, and how to make the most of what it offers. Shows how VMware Infrastructure saves on hardware costs while maximizing capacity. Demonstrates how to work with virtual machines, reducing a company's carbon footprint within its data center. Helps maximize the technology. Reinforces understanding of VMware Infrastructure through real-world examples. Now that virtualization is a key cost-saving strategy, Mastering VMware is the strategic guide you need to maximize the opportunities", acknowledgement = ack-nhfb, subject = "VMware; Virtual computer systems", } @Book{Marshall:2009:VEE, author = "David (David W.) Marshall and Stephen S. Beaver and Jason W. McCarty", title = "{VMware ESX} essentials in the virtual data center", publisher = pub-CRC, address = pub-CRC:adr, pages = "xiv + 237", year = "2009", ISBN = "1-4200-7027-4", ISBN-13 = "978-1-4200-7027-9", LCCN = "QA76.76.O63 M3647 2009", bibdate = "Mon May 17 09:03:07 MDT 2010", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, subject = "VMware; operating systems (computers); virtual computer systems", } @Article{Mattsson:2009:RSV, author = "Ulf Mattsson", title = "Real security for virtual machines", journal = j-NETWORK-SECURITY, volume = "2009", number = "4", pages = "15--17", month = apr, year = "2009", CODEN = "NTSCF5", DOI = "https://doi.org/10.1016/S1353-4858(09)70041-8", ISSN = "1353-4858 (print), 1872-9371 (electronic)", ISSN-L = "1353-4858", bibdate = "Mon Dec 4 17:00:03 MST 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/network-security.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1353485809700418", acknowledgement = ack-nhfb, fjournal = "Network Security", journal-URL = "https://www.sciencedirect.com/journal/network-security", } @Article{Menon:2009:TSA, author = "Aravind Menon and Simon Schubert and Willy Zwaenepoel", title = "{TwinDrivers}: semi-automatic derivation of fast and safe hypervisor network drivers from guest {OS} drivers", journal = j-COMP-ARCH-NEWS, volume = "37", number = "1", pages = "301--312", month = mar, year = "2009", CODEN = "CANED2", DOI = "https://doi.org/10.1145/2528521.1508279", ISSN = "0163-5964 (print), 1943-5851 (electronic)", ISSN-L = "0163-5964", bibdate = "Thu Sep 4 07:47:19 MDT 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigarch.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "In a virtualized environment, device drivers are often run inside a virtual machine (VM) rather than in the hypervisor, for reasons of safety and reduction in software engineering effort. Unfortunately, this approach results in poor performance for I/O-intensive devices such as network cards. The alternative approach of running device drivers directly in the hypervisor yields better performance, but results in the loss of safety guarantees for the hypervisor and incurs additional software engineering costs. In this paper we present TwinDrivers, a framework which allows us to semi-automatically create safe and efficient hypervisor drivers from guest OS drivers. The hypervisor driver runs directly in the hypervisor, but its data resides completely in the driver VM address space. A Software Virtual Memory mechanism allows the driver to access its VM data efficiently from the hypervisor running in any guest context, and also protects the hypervisor from invalid memory accesses from the driver. An upcall mechanism allows the hypervisor to largely reuse the driver support infrastructure present in the VM. The TwinDriver system thus combines most of the performance benefits of hypervisor-based driver approaches with the safety and software engineering benefits of VM-based driver approaches. Using the TwinDrivers hypervisor driver, we are able to improve the guest domain networking throughput in Xen by a factor of 2.4 for transmit workloads, and 2.1 for receive workloads, both in CPU-scaled units, and achieve close to 64-67 of native Linux throughput.", acknowledgement = ack-nhfb, fjournal = "ACM SIGARCH Computer Architecture News", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89", remark = "ASPLOS 2009 conference proceedings.", } @Article{Mlynski:2009:IIP, author = "Maciej Mlynski", title = "The influence of the {IBM pSeries} servers virtualization mechanism on dynamic resource allocation in {AIX 5L}", journal = j-SCPE, volume = "10", number = "2", pages = "189--199", month = jun, year = "2009", CODEN = "????", ISSN = "1895-1767", bibdate = "Thu Sep 2 11:55:11 MDT 2010", bibsource = "https://www.math.utah.edu/pub/tex/bib/unix.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www.scpe.org/content/10/2.toc", URL = "http://www.scpe.org/vols/vol10/no2/SCPE_10_2_05.pdf; http://www.scpe.org/vols/vol10/no2/SCPE_10_2_05.zip", acknowledgement = ack-nhfb, } @Book{Morimoto:2009:WSH, author = "Rand Morimoto and Jeff Guillet", title = "{Windows Server 2008 Hyper-V} unleashed", publisher = pub-SAMS, address = pub-SAMS:adr, pages = "xv + 459", year = "2009", ISBN = "0-7686-8567-2, 0-672-33028-8", ISBN-13 = "978-0-7686-8567-1, 978-0-672-33028-5", LCCN = "QA76.9.V5 M656 2009", bibdate = "Mon May 17 09:06:20 MDT 2010", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://proquest.safaribooksonline.com/9780768685671", acknowledgement = ack-nhfb, subject = "Microsoft Windows server Hyper-V; Virtual computer systems", } @Article{Ortin:2009:EVM, author = "Francisco Ortin and Jose Manuel Redondo and J. Baltasar Garc{\'\i}a Perez-Schofield", title = "Efficient virtual machine support of runtime structural reflection", journal = j-SCI-COMPUT-PROGRAM, volume = "74", number = "10", pages = "836--860", day = "15", month = aug, year = "2009", CODEN = "SCPGD4", ISSN = "0167-6423 (print), 1872-7964 (electronic)", ISSN-L = "0167-6423", bibdate = "Fri Apr 1 18:39:29 MDT 2011", bibsource = "https://www.math.utah.edu/pub/tex/bib/scicomputprogram.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www.sciencedirect.com/science/journal/01676423", acknowledgement = ack-nhfb, fjournal = "Science of Computer Programming", journal-URL = "http://www.sciencedirect.com/science/journal/01676423", } @Book{Picht:2009:XKI, author = "Hans-Joachim Picht and Sebastian Ott", title = "{Xen Kochbuch: intelligente Virtualisierungsl{\"o}sungen mit XEN 3}", publisher = pub-ORA, address = pub-ORA:adr, pages = "xix + 461", year = "2009", ISBN = "3-89721-729-5", ISBN-13 = "978-3-89721-729-4", LCCN = "????", bibdate = "Mon Sep 13 11:37:34 MDT 2010", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.gbv.de:20011/gvk", price = "EUR 44.90", URL = "http://www.gbv.de/dms/ilmenau/toc/572426836.PDF", acknowledgement = ack-nhfb, } @Book{Ruest:2009:VBG, author = "Danielle Ruest and Nelson Ruest", title = "Virtualization: a beginner's guide", publisher = pub-MCGRAW-HILL, address = pub-MCGRAW-HILL:adr, pages = "xx + 442", year = "2009", ISBN = "0-07-161401-X", ISBN-13 = "978-0-07-161401-6", LCCN = "QA76.9.V5 R88 2009", bibdate = "Thu Jan 21 14:13:02 MST 2010", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.loc.gov:7090/Voyager", series = "Network professional's library", acknowledgement = ack-nhfb, subject = "Virtual computer systems", } @Article{Schocken:2009:VMA, author = "Shimon Schocken", title = "Virtual machines: abstraction and implementation", journal = j-SIGCSE, volume = "41", number = "3", pages = "203--207", month = sep, year = "2009", CODEN = "SIGSD3", DOI = "https://doi.org/10.1145/1595496.1562943", ISSN = "0097-8418 (print), 2331-3927 (electronic)", ISSN-L = "0097-8418", bibdate = "Sat Nov 17 15:44:23 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigcse2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "Proceedings of ITiCSE '09.", abstract = "Various forms of virtualization play key roles in the construction and usage of diverse system artifacts ranging from modern compilers to hardware migration to mobile computing. Virtualization is also a powerful concept on cognitive grounds, requiring considerable abstraction skills and modeling abilities. We present a methodology, a software tool, and a set of instructional resources designed to expose students to virtual machines, focusing on both abstraction and implementation issues. An early version of our methodology appeared in a book form [4] in which we describe how to build a complete computer system --- hardware and software --- in one semester. Recently we've re-written our VM emulation software and consolidated all our VM materials into a web site that supports a stand-alone module on virtual machines [5]. This module can be plugged into many system-oriented CS courses. All the resources that we present are freely available in open source and are presently used successfully in several universities.", acknowledgement = ack-nhfb, fjournal = "SIGCSE Bulletin (ACM Special Interest Group on Computer Science Education)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J688", } @Article{Silva:2009:UVI, author = "L. M. Silva and J. Alonso and J. Torres", title = "Using Virtualization to Improve Software Rejuvenation", journal = j-IEEE-TRANS-COMPUT, volume = "58", number = "11", pages = "1525--1538", month = nov, year = "2009", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.2009.119", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Mon Jul 4 11:37:44 MDT 2011", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5184821", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Computers", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", } @Book{Spinellis:2009:BA, editor = "Diomidis Spinellis and Georgios Gousios", title = "Beautiful architecture", publisher = pub-ORA-MEDIA, address = pub-ORA-MEDIA:adr, pages = "xix + 404", year = "2009", ISBN = "0-596-15578-6", ISBN-13 = "978-0-596-15578-0", LCCN = "QA76.754 .B43 2009", bibdate = "Mon May 17 09:05:00 MDT 2010", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://proquest.safaribooksonline.com/9780596155780", acknowledgement = ack-nhfb, remark = "What is architecture / by John Klein and David Weiss \\ A tale of two systems: a modern-day software fable / by Pete Goodliffe \\ Architecting for scale / by Jim Waldo \\ Making memories / by Michael Nygard \\ Resource-oriented architectures: being ``in the web'' / by Brian Sletten \\ Data grows up: the architecture of the Facebook platform / by Dave Fetterman \\ Xen and the beauty of virtualization / by Derek Murray and Keir Fraser \\ Guardian: a fault-tolerant operating system environment / by Greg Lehey \\ JPC: an X86 PC emulator in pure Java / by Rhys Newman and Christopher Dennis \\ The strength of metacircular virtual machines: JIKES RVM / by Ian Rogers and Dave Grove \\ GNU EMACS: creeping featurism is a strength / by Jim Blandy \\ When the bazaar sets out to build cathedrals / by Till Adam and Mirko Boehm \\ Software architecture: object-oriented versus functional / by Bertrand Meyer \\ Reading the classics / by Panagiotis Louridas.", subject = "computer software; development; software engineering; computer architecture; software architecture", } @Article{Sridevi:2009:NAE, author = "R. Sridevi and A. Damodaram and S. V. L. Narasimham", title = "A novel architecture for enhanced security through virtualisation and spoofing", journal = j-NETWORK-SECURITY, volume = "2009", number = "9", pages = "12--16", month = sep, year = "2009", CODEN = "NTSCF5", DOI = "https://doi.org/10.1016/S1353-4858(09)70100-X", ISSN = "1353-4858 (print), 1872-9371 (electronic)", ISSN-L = "1353-4858", bibdate = "Mon Dec 4 17:00:08 MST 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/network-security.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S135348580970100X", acknowledgement = ack-nhfb, fjournal = "Network Security", journal-URL = "https://www.sciencedirect.com/journal/network-security", } @Book{Stagner:2009:PHV, author = "Harley Stagner and Jon Rolfe and Greg Shields", title = "Pro {Hyper-V}", publisher = pub-APRESS, address = pub-APRESS:adr, pages = "xxii + 425", year = "2009", ISBN = "1-4302-1908-4, 1-4302-1909-2 (electronic)", ISBN-13 = "978-1-4302-1908-8, 978-1-4302-1909-5 (electronic)", LCCN = "QA76.9.V5 S83 2009", bibdate = "Thu Jan 21 14:13:11 MST 2010", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.loc.gov:7090/Voyager", series = "Expert's voice in virtualization", acknowledgement = ack-nhfb, subject = "Microsoft Windows server Hyper-V; Virtual computer systems", } @Article{Tickoo:2009:MVM, author = "Omesh Tickoo and Ravi Iyer and Ramesh Illikkal and Don Newell", title = "Modeling virtual machine performance: challenges and approaches", journal = j-SIGMETRICS, volume = "37", number = "3", pages = "55--60", month = dec, year = "2009", CODEN = "????", DOI = "https://doi.org/10.1145/1710115.1710126", ISSN = "0163-5999 (print), 1557-9484 (electronic)", ISSN-L = "0163-5999", bibdate = "Wed Aug 25 07:34:40 MDT 2010", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigmetrics.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Data centers are increasingly employing virtualization and consolidation as a means to support a large number of disparate applications running simultaneously on server platforms. However, server platforms are still being designed and evaluated based on performance modeling of a single highly parallel application or a set of homogeneous work-loads running simultaneously. Since most future datacenters are expected to employ server virtualization, this paper takes a look at the challenges of modeling virtual machine (VM) performance on a datacenter server. Based on vConsolidate (a server virtualization benchmark) and latest multi-core servers, we show that the VM modeling challenge requires addressing three key problems: (a) modeling the contention of visible resources (cores, memory capacity, I/O devices, etc), (b) modeling the contention of invisible resources (shared microarchitecture resources, shared cache, shared memory bandwidth, etc) and (c) modeling overheads of virtual machine monitor (or hypervisor) implementation. We take a first step to addressing this problem by describing a VM performance modeling approach and performing a detailed case study based on the vConsolidate benchmark. We conclude by outlining outstanding problems for future work.", acknowledgement = ack-nhfb, fjournal = "ACM SIGMETRICS Performance Evaluation Review", journal-URL = "http://portal.acm.org/toc.cfm?id=J618", keywords = "CMP; consolidation; measurement; modeling; performance analysis; servers; virtualization", } @MastersThesis{vanderKouwe:2009:PQV, author = "Erik van der Kouwe", title = "Porting the {QEMU} Virtualization Software to {MINIX 3}", type = "{Master}'s thesis", school = "????", address = "????", pages = "????", month = "????", year = "2009", bibdate = "Fri Oct 24 08:59:21 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/minix.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.few.vu.nl/%7Evdkouwe/doc/msc-thesis-cs-presentation-erik-van-der-kouwe.pdf; http://www.minix3.org/theses/kouwe-qemu.pdf", acknowledgement = ack-nhfb, } @Article{Wein:2009:VGT, author = "Joel Wein and Kirill Kourtchikov and Yan Cheng and Ron Gutierez and Roman Khmelichek and Matthew Topol and Chris Sherman", title = "Virtualized games for teaching about distributed systems", journal = j-SIGCSE, volume = "41", number = "1", pages = "246--250", month = mar, year = "2009", CODEN = "SIGSD3", DOI = "https://doi.org/10.1145/1539024.1508955", ISSN = "0097-8418 (print), 2331-3927 (electronic)", ISSN-L = "0097-8418", bibdate = "Sat Nov 17 15:44:19 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigcse2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "Proceedings of SIGCSE '09.", abstract = "Complex distributed systems are increasingly important in modern computer science, yet many undergraduate curricula do not give students the opportunity to develop the skill sets necessary to grapple with the complexity of such systems. We have developed and integrated into an undergraduate elective course on parallel and distributed computing a teaching tool that may help students develop these skill sets. The tool uses virtualization to ease the burden of resourcing and configuring complex systems for student study, and creates varied ``firefighting'' gaming scenarios in which students compete to keep the system up and running in the presence of multiple issues. Preliminary experience indicates that (1) students find the tool engaging and (2) it is a manageable way in which to give students a novel perspective on interaction with complex distributed systems.", acknowledgement = ack-nhfb, fjournal = "SIGCSE Bulletin (ACM Special Interest Group on Computer Science Education)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J688", } @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/virtual-machines.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 = "Operating Systems Review", } @Article{Williams:2009:STD, author = "Daniel Williams and Wei Hu and Jack W. Davidson and Jason D. Hiser and John C. Knight and Anh Nguyen-Tuong", title = "Security through Diversity: Leveraging Virtual Machine Technology", journal = j-IEEE-SEC-PRIV, volume = "7", number = "1", pages = "26--33", month = jan # "\slash " # feb, year = "2009", CODEN = "????", DOI = "https://doi.org/10.1109/MSP.2009.18", ISSN = "1540-7993 (print), 1558-4046 (electronic)", ISSN-L = "1540-7993", bibdate = "Thu Jul 2 10:02:21 MDT 2009", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Security and Privacy", } @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; https://www.math.utah.edu/pub/tex/bib/virtual-machines.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", keywords = "consolidation; page sharing; virtualization", } @Article{Wood:2009:SBB, author = "Timothy Wood and Prashant Shenoy and Arun Venkataramani and Mazin Yousif", title = "{Sandpiper}: {Black}-box and gray-box resource management for virtual machines", journal = j-COMP-NET-AMSTERDAM, volume = "53", number = "17", pages = "2923--2938", day = "3", month = dec, year = "2009", CODEN = "????", ISSN = "1389-1286 (print), 1872-7069 (electronic)", ISSN-L = "1389-1286", bibdate = "Sat Apr 2 08:42:35 MDT 2011", bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www.sciencedirect.com/science/journal/13891286", acknowledgement = ack-nhfb, fjournal = "Computer Networks", journal-URL = "http://www.sciencedirect.com/science/journal/13891286", } @Article{Yermolovich:2009:ODL, author = "Alexander Yermolovich and Christian Wimmer and Michael Franz", title = "Optimization of dynamic languages using hierarchical layering of virtual machines", journal = j-SIGPLAN, volume = "44", number = "12", pages = "79--88", month = dec, year = "2009", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/1640134.1640147", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Aug 31 22:04:07 MDT 2010", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Creating an interpreter is a simple and fast way to implement a dynamic programming language. With this ease also come major drawbacks. Interpreters are significantly slower than compiled machine code because they have a high dispatch overhead and cannot perform optimizations. To overcome these limitations, interpreters are commonly combined with just-in-time compilers to improve the overall performance. However, this means that a just-in-time compiler has to be implemented for each language.\par We explore the approach of taking an interpreter of a dynamic language and running it on top of an optimizing trace-based virtual machine, i.e., we run a {\em guest VM\/} on top of a {\em host VM}. The host VM uses trace recording to observe the guest VM executing the application program. Each recorded trace represents a sequence of guest VM bytecodes corresponding to a given execution path through the application program. The host VM optimizes and compiles these traces to machine code, thus eliminating the need for a custom just-in-time compiler for the guest VM. The guest VM only needs to provide basic information about its interpreter loop to the host VM.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", keywords = "actionscript; dynamic languages; hierarchical virtual machines; Lua; trace compilation", } @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; https://www.math.utah.edu/pub/tex/bib/virtual-machines.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", keywords = "LRU histogram; memory balancing; virtual machine", } @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/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Operating Systems Review", } @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/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Operating Systems Review", } @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/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Operating Systems Review", } @Article{Berl:2010:NVE, author = "Andreas Berl and Nicholas Race and Johnathan Ishmael and Hermann de Meer", title = "Network virtualization in energy-efficient office environments", journal = j-COMP-NET-AMSTERDAM, volume = "54", number = "16", pages = "2856--2868", day = "15", month = nov, year = "2010", CODEN = "????", ISSN = "1389-1286 (print), 1872-7069 (electronic)", ISSN-L = "1389-1286", bibdate = "Sat Apr 2 08:42:41 MDT 2011", bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www.sciencedirect.com/science/journal/13891286", acknowledgement = ack-nhfb, fjournal = "Computer Networks", journal-URL = "http://www.sciencedirect.com/science/journal/13891286", } @Article{Bledsoe:2010:VLO, author = "Greg Bledsoe", title = "Virtualization the {Linux\slash OSS} way", journal = j-LINUX-J, volume = "2010", number = "198", pages = "6:1--6:??", month = oct, year = "2010", CODEN = "LIJOFX", ISSN = "1075-3583 (print), 1938-3827 (electronic)", ISSN-L = "1075-3583", bibdate = "Tue Nov 23 11:41:56 MST 2010", bibsource = "https://www.math.utah.edu/pub/tex/bib/linux-journal.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, articleno = "6", fjournal = "Linux Journal", journal-URL = "http://portal.acm.org/citation.cfm?id=J508", } @Book{Boddenberg:2010:WSR, author = "Ulrich B. Boddenberg", title = "{Windows Server 2008 R2 das umfassende Handbuch}. ({German}) [Windows Server 2008 {R2}: the Complete Handbook]", publisher = "Galileo Press", address = "Bonn, Germany", edition = "Third", pages = "1410", year = "2010", ISBN = "3-8362-1528-4", ISBN-13 = "978-3-8362-1528-2", LCCN = "????", bibdate = "Mon May 17 09:06:20 MDT 2010", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", series = "Galileo computing", URL = "http://www.galileocomputing.de/", acknowledgement = ack-nhfb, language = "German", remark = "Konzeption, Installation und Konfiguration; Anwendungsszenarien und praxisrelevante L{\"o}sungen; inkl. Active Directory, Zertifikatdienste, Windows 7-Integration; inkl. Hyper-V Boddenberg", subject = "Windows Server 2008", } @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; https://www.math.utah.edu/pub/tex/bib/virtual-machines.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", } @Article{Campanoni:2010:HFP, author = "Simone Campanoni and Giovanni Agosta and Stefano Crespi Reghizzi and Andrea Di Biagio", title = "A highly flexible, parallel virtual machine: design and experience of {ILDJIT}", journal = j-SPE, volume = "40", number = "2", pages = "177--207", day = "??", month = feb, year = "2010", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/spe.950", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Wed Mar 17 10:16:22 MDT 2010", bibsource = "http://www.interscience.wiley.com/jpages/0038-0644; https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www3.interscience.wiley.com/journalfinder.html", acknowledgement = ack-nhfb, fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", onlinedate = "Jan 14 2010 4:49AM", } @Article{Chafi:2010:LVH, author = "Hassan Chafi and Zach DeVito and Adriaan Moors and Tiark Rompf and Arvind K. Sujeeth and Pat Hanrahan and Martin Odersky and Kunle Olukotun", title = "Language virtualization for heterogeneous parallel computing", journal = j-SIGPLAN, volume = "45", number = "10", pages = "835--847", month = oct, year = "2010", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/1932682.1869527", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jan 26 15:13:46 MST 2011", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @Article{Chow:2010:MSR, author = "Jim Chow and Dominic Lucchetti and Tal Garfinkel and Geoffrey Lefebvre and Ryan Gardner and Joshua Mason and Sam Small and Peter M. Chen", title = "Multi-stage replay with {Crosscut}", journal = j-SIGPLAN, volume = "45", number = "7", pages = "13--24", month = jul, year = "2010", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/1837854.1736002", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Oct 8 17:55:01 MDT 2010", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Deterministic record-replay has many useful applications, ranging from fault tolerance and forensics to reproducing and diagnosing bugs. When choosing a record-replay solution, the system administrator must choose a priori how comprehensively to record the execution and at what abstraction level to record it. Unfortunately, these choices may not match well with how the recording is eventually used. A recording may contain too little information to support the end use of replay, or it may contain more sensitive information than is allowed to be shown to the end user of replay. Similarly, fixing the abstraction level at the time of recording often leads to a semantic mismatch with the end use of replay.\par This paper describes how to remedy these problems by adding customizable replay stages to create special-purpose logs for the end users of replay. Our system, called Crosscut, allows replay logs to be 'sliced' along time and abstraction boundaries. Using this approach, users can create slices that include only the processes, applications, or components of interest, excluding parts that handle sensitive data. Users can also retarget the abstraction level of the replay log to higher-level platforms, such as Perl or Valgrind. Execution can then be augmented with additional analysis code at replay time, without disturbing the replayed components in the slice. Crosscut thus uses replay itself to transform logs into a more efficient, secure, and usable form for replay-based applications.\par Our current Crosscut prototype builds on VMware Workstation's record-replay capabilities, and supports a variety of different replay environments. We show how Crosscut can create slices of only the parts of the computation of interest and thereby avoid leaking sensitive information, and we show how to retarget the abstraction level of the log to enable more convenient use during replay debugging.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", keywords = "design; experimentation; performance; replay; security; virtual machines", } @Article{Chowdhury:2010:SNV, author = "N. M. Mosharaf Kabir Chowdhury and Raouf Boutaba", title = "A survey of network virtualization", journal = j-COMP-NET-AMSTERDAM, volume = "54", number = "5", pages = "862--876", day = "8", month = apr, year = "2010", CODEN = "????", ISSN = "1389-1286 (print), 1872-7069 (electronic)", ISSN-L = "1389-1286", bibdate = "Sat Apr 2 08:42:37 MDT 2011", bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www.sciencedirect.com/science/journal/13891286", acknowledgement = ack-nhfb, fjournal = "Computer Networks", journal-URL = "http://www.sciencedirect.com/science/journal/13891286", } @Article{Cohen:2010:VS, author = "Fred Cohen", title = "The Virtualization Solution", journal = j-IEEE-SEC-PRIV, volume = "8", number = "3", pages = "60--63", month = may # "\slash " # jun, year = "2010", CODEN = "????", DOI = "https://doi.org/10.1109/MSP.2010.108", ISSN = "1540-7993 (print), 1558-4046 (electronic)", ISSN-L = "1540-7993", bibdate = "Wed May 26 15:44:06 2010", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Security and Privacy", } @Article{Courbot:2010:EBD, author = "Alexandre Courbot and Gilles Grimaud and Jean-Jacques Vandewalle", title = "Efficient off-board deployment and customization of virtual machine-based embedded systems", journal = j-TECS, volume = "9", number = "3", pages = "21:1--21:??", month = feb, year = "2010", CODEN = "????", ISSN = "1539-9087 (print), 1558-3465 (electronic)", ISSN-L = "1539-9087", bibdate = "Mon Mar 15 18:41:02 MDT 2010", bibsource = "https://www.math.utah.edu/pub/tex/bib/tecs.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, articleno = "21", fjournal = "ACM Transactions on Embedded Computing Systems", journal-URL = "http://portal.acm.org/browse_dl.cfm?&idx=J840", } @TechReport{Cox:2010:REM, author = "Russ Cox", title = "Regular Expression Matching in the Wild", type = "Report", institution = "swtch.com", address = "Cambridge, MA, USA", month = mar, year = "2010", bibdate = "Tue Mar 27 11:39:17 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/plan9.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "See also \cite{Thompson:1968:PTR,Kernighan:1999:REL,Cox:2007:REM,Cox:2009:REM,Cox:2012:REM}", URL = "http://swtch.com/~rsc/regexp/regexp3.html", acknowledgement = ack-nhfb, } @Article{Creeger:2010:MEA, author = "Mache Creeger", title = "Moving to the Edge: An {ACM CTO} Roundtable on Network Virtualization", journal = j-QUEUE, volume = "8", number = "7", pages = "20", month = jul, year = "2010", CODEN = "AQCUAE", ISSN = "1542-7730 (print), 1542-7749 (electronic)", ISSN-L = "1542-7730", bibdate = "Sat Oct 2 17:56:54 MDT 2010", bibsource = "https://www.math.utah.edu/pub/tex/bib/queue.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "ACM Queue: Tomorrow's Computing Today", } @Article{Creeger:2010:MEC, author = "Mache Creeger", title = "Moving to the edge: a {CTO} roundtable on network virtualization", journal = j-CACM, volume = "53", number = "8", pages = "55--62", month = aug, year = "2010", CODEN = "CACMA2", DOI = "https://doi.org/10.1145/1787234.1787251", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Tue Aug 3 19:19:03 MDT 2010", bibsource = "http://www.acm.org/pubs/contents/journals/cacm/; https://www.math.utah.edu/pub/tex/bib/cacm2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Leading experts debate how virtualization and clouds impact network service architectures.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79", } @Article{Dhiman:2010:VSE, author = "Gaurav Dhiman and Giacomo Marchetti and Tajana Rosing", title = "{vGreen}: a System for Energy-Efficient Management of Virtual Machines", journal = j-TODAES, volume = "16", number = "1", pages = "6:1--6:??", month = nov, year = "2010", CODEN = "ATASFO", DOI = "https://doi.org/10.1145/1870109.1870115", ISSN = "1084-4309 (print), 1557-7309 (electronic)", ISSN-L = "1084-4309", bibdate = "Thu Dec 9 11:12:21 MST 2010", bibsource = "http://www.acm.org/pubs/contents/journals/todaes/; https://www.math.utah.edu/pub/tex/bib/todaes.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "In this article, we present vGreen, a multitiered software system for energy-efficient virtual machine management in a clustered virtualized environment. The system leverages the use of novel hierarchical metrics that work across the different abstractions in a virtualized environment to capture power and performance characteristics of both the virtual and physical machines. These characteristics are then used to implement policies for scheduling and power management of virtual machines across the cluster.", acknowledgement = ack-nhfb, articleno = "6", fjournal = "ACM Transactions on Design Automation of Electronic Systems", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J776", } @Article{Ejarque:2010:ESV, author = "Jorge Ejarque and Marc de Palol and {\'I}{\~n}igo Goiri and Ferran Juli{\`a} and Jordi Guitart and Rosa M. Badia and Jordi Torres", title = "Exploiting semantics and virtualization for {SLA}-driven resource allocation in service providers", journal = j-CCPE, volume = "22", number = "5", pages = "541--572", day = "10", month = apr, year = "2010", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.1468", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Mon Dec 5 10:08:42 MST 2011", bibsource = "http://www.interscience.wiley.com/jpages/1532-0626; https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Concurrency and Computation: Prac\-tice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", onlinedate = "15 Sep 2009", } @Article{Flouris:2010:EBL, author = "Michail D. Flouris and Renaud Lachaize and Konstantinos Chasapis and Angelos Bilas", title = "Extensible block-level storage virtualization in cluster-based systems", journal = j-J-PAR-DIST-COMP, volume = "70", number = "8", pages = "800--824", month = aug, year = "2010", CODEN = "JPDCER", ISSN = "0743-7315 (print), 1096-0848 (electronic)", ISSN-L = "0743-7315", bibdate = "Wed Sep 1 16:27:29 MDT 2010", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www.sciencedirect.com/science/journal/07437315", acknowledgement = ack-nhfb, fjournal = "Journal of Parallel and Distributed Computing", journal-URL = "http://www.sciencedirect.com/science/journal/07437315", } @Article{Fu:2010:FAR, author = "Song Fu", title = "Failure-aware resource management for high-availability computing clusters with distributed virtual machines", journal = j-J-PAR-DIST-COMP, volume = "70", number = "4", pages = "384--393", month = apr, year = "2010", CODEN = "JPDCER", ISSN = "0743-7315 (print), 1096-0848 (electronic)", ISSN-L = "0743-7315", bibdate = "Wed Sep 1 16:27:28 MDT 2010", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www.sciencedirect.com/science/journal/07437315", acknowledgement = ack-nhfb, fjournal = "Journal of Parallel and Distributed Computing", journal-URL = "http://www.sciencedirect.com/science/journal/07437315", } @Misc{Green:2010:SUS, author = "David Green", title = "The {Sydney University SILLIAC}", howpublished = "Web site", day = "14", month = aug, year = "2010", bibdate = "Tue Nov 20 11:17:49 2012", bibsource = "https://www.math.utah.edu/pub/bibnet/authors/v/von-neumann-john.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "The SILLIAC was the first computer installed at Sydney University, and was operational from 1956 to 1968. The Web site links to the SILLIAC Emulator, a C program for Microsoft Windows.", URL = "http://members.iinet.net.au/~dgreen/silliac.html", acknowledgement = ack-nhfb, remark = "The SILLIAC was based on von Neumann's IAS machine.", } @Article{Gupta:2010:DEH, author = "Diwaker Gupta and Sangmin Lee and Michael Vrable and Stefan Savage and Alex C. Snoeren and George Varghese and Geoffrey M. Voelker and Amin Vahdat", title = "Difference engine: harnessing memory redundancy in virtual machines", journal = j-CACM, volume = "53", number = "10", pages = "85--93", month = oct, year = "2010", CODEN = "CACMA2", DOI = "https://doi.org/10.1145/1831407.1831429", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Fri Oct 1 21:13:00 MDT 2010", bibsource = "http://www.acm.org/pubs/contents/journals/cacm/; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Virtual machine monitors (VMMs) are a popular platform for Internet hosting centers and cloud-based compute services. By multiplexing hardware resources among virtual machines (VMs) running commodity operating systems, VMMs decrease both the capital outlay and management overhead of hosting centers. Appropriate placement and migration policies can take advantage of statistical multiplexing to effectively utilize available processors. However, main memory is not amenable to such multiplexing and is often the primary bottleneck in achieving higher degrees of consolidation.\par Previous efforts have shown that content-based page sharing provides modest decreases in the memory footprint of VMs running similar operating systems and applications. Our studies show that significant additional gains can be had by leveraging both subpage level sharing (through page patching) and incore memory compression. We build {\em Difference Engine}, an extension to the Xen VMM, to support each of these---in addition to standard copy-on-write full-page sharing---and demonstrate substantial savings across VMs running disparate workloads (up to 65\%). In head-to-head memory-savings comparisons, Difference Engine outperforms VMware ESX server by a factor 1.6--2.5 for heterogeneous workloads. In all cases, the performance overhead of Difference Engine is less than 7\%.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79", } @Article{Haase:2010:SDV, author = "Jan Haase and Andreas Hofmann and Klaus Waldschmidt", title = "A Self Distributing Virtual Machine for Adaptive Multicore Environments", journal = j-INT-J-PARALLEL-PROG, volume = "38", number = "1", pages = "19--37", month = feb, year = "2010", CODEN = "IJPPE5", ISSN = "0885-7458 (print), 1573-7640 (electronic)", ISSN-L = "0885-7458", bibdate = "Wed Sep 1 16:06:48 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=38&issue=1; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0885-7458&volume=38&issue=1&spage=19", acknowledgement = ack-nhfb, fjournal = "International Journal of Parallel Programming", journal-URL = "http://link.springer.com/journal/10766", } @Article{Hahn:2010:UVL, author = "Dongwoon Hahn and Ginnah Lee and Brenton Walker and Matt Beecher and Padma Mundur", title = "Using virtualization and live migration in a scalable mobile wireless testbed", journal = j-SIGMETRICS, volume = "38", number = "3", pages = "21--25", month = dec, year = "2010", CODEN = "????", DOI = "https://doi.org/10.1145/1925019.1925024", ISSN = "0163-5999 (print), 1557-9484 (electronic)", ISSN-L = "0163-5999", bibdate = "Wed Jan 12 17:27:21 MST 2011", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigmetrics.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGMETRICS Performance Evaluation Review", journal-URL = "http://portal.acm.org/toc.cfm?id=J618", } @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/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Operating Systems Review", } @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/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Operating Systems Review", } @Book{Hess:2010:PVS, author = "Kenneth Hess and Amy Newman", title = "Practical Virtualization Solutions: Virtualization from the Trenches", publisher = "Prentice Hall\slash Pearson Education", address = "Upper Saddle River, NJ, USA", pages = "xxiii + 304", year = "2010", ISBN = "0-13-714297-8 (paperback)", ISBN-13 = "978-0-13-714297-2 (paperback)", LCCN = "QA76.9.V5 H47 2010", bibdate = "Thu Jan 21 14:38:30 MST 2010", bibsource = "https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.loc.gov:7090/Voyager", series = "Negus software solutions series", acknowledgement = ack-nhfb, subject = "Virtual computer systems; Management", tableofcontents = "Virtualization basics and techology choices: To virtualize or not to virtualize \\ Comparing virtualization technologies \\ VMware server \\ VMware ESXi \\ Citrix XenServer \\ Microsoft virtual PC \\ Microsoft Hyper-V \\ VirtualBox \\ Applying virtualization: Server virtualization in action \\ Desktop virtualization in action \\ Network and storage virtualization in action \\ Building the virtual infrastructure : hardware's role in virtualization: Form-factor choices and their implications \\ Choosing a vendor \\ Beyond the box \\ From development to production : managing the virtual infrastructure: Laying the foundation : the planning stage \\ Deployment \\ Postproduction : wrapping it up \\ Virtual machine installation", } @Article{Hoang:2010:CAN, author = "Giang Hoang and Chang Bae and John Lange and Lide Zhang and Peter Dinda and Russ Joseph", title = "A Case for Alternative Nested Paging Models for Virtualized Systems", journal = j-IEEE-COMPUT-ARCHIT-LETT, volume = "9", number = "1", pages = "17--20", month = jan # "\slash " # jun, year = "2010", CODEN = "????", DOI = "https://doi.org/10.1109/L-CA.2010.6", ISSN = "1556-6056 (print), 1556-6064 (electronic)", ISSN-L = "1556-6056", bibdate = "Thu Jun 20 17:18:18 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/hash.bib; https://www.math.utah.edu/pub/tex/bib/ieeecomputarchitlett.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Address translation often emerges as a critical performance bottleneck for virtualized systems and has recently been the impetus for hardware paging mechanisms. These mechanisms apply similar translation models for both guest and host address translations. We make an important observation that the model employed to translate from guest physical addresses (GPAs) to host physical addresses (HPAs) is in fact orthogonal to the model used to translate guest virtual addresses (GVAs) to GPAs. Changing this model requires VMM cooperation, but has no implications for guest OS compatibility. As an example, we consider a hashed page table approach for GPA -> HPA translation. Nested paging, widely considered the most promising approach, uses unhashed multi-level forward page tables for both GVA -> GPA and GPA -> HPA translations, resulting in a potential O(n(2)) page walk cost on a TLB miss, for n-level page tables. In contrast, the hashed page table approach results in an expected O(n) cost. Our simulation results show that when a hashed page table is used in the nested level, the performance of the memory system is not worse, and sometimes even better than a nested forward-mapped page table due to reduced page walks and cache pressure. This showcases the potential for alternative paging mechanisms.", acknowledgement = ack-nhfb, affiliation = "Hoang, GA (Reprint Author), Northwestern Univ, Evanston, IL 60208 USA. Hoang, Giang; Bae, Chang; Lange, John; Dinda, Peter; Joseph, Russ, Northwestern Univ, Evanston, IL 60208 USA. Zhang, Lide, Univ Michigan, Ann Arbor, MI 48109 USA.", da = "2019-06-20", doc-delivery-number = "731BP", eissn = "1556-6064", fjournal = "IEEE Computer Architecture Letters", journal-iso = "IEEE Comput. Archit. Lett.", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=10208", keywords = "Computer Architecture; Nested Paging; Virtual Memory; Virtualization", number-of-cited-references = "11", research-areas = "Computer Science", researcherid-numbers = "Joseph, Russell/B-7230-2009 Dinda, Peter/B-7142-2009", times-cited = "5", unique-id = "Hoang:2010:CAN", web-of-science-categories = "Computer Science, Hardware \& Architecture", } @Article{Jin:2010:GTF, author = "Hai Jin and Guofu Xiang and Deqing Zou and Feng Zhao and Min Li and Chen Yu", title = "A guest-transparent file integrity monitoring method in virtualization environment", journal = j-COMPUT-MATH-APPL, volume = "60", number = "2", pages = "256--266", month = jul, year = "2010", CODEN = "CMAPDK", ISSN = "0898-1221 (print), 1873-7668 (electronic)", ISSN-L = "0898-1221", bibdate = "Wed Mar 1 21:50:41 MST 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/computmathappl2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0898122110000180", acknowledgement = ack-nhfb, fjournal = "Computers and Mathematics with Applications", journal-URL = "http://www.sciencedirect.com/science/journal/08981221", } @Article{Jo:2010:TFT, author = "Heeseung Jo and Hwanju Kim and Jae-Wan Jang and Joonwon Lee and Seungryoul Maeng", title = "Transparent Fault Tolerance of Device Drivers for Virtual Machines", journal = j-IEEE-TRANS-COMPUT, volume = "59", number = "11", pages = "1466--1479", month = nov, year = "2010", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.2010.61", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Sun Jul 3 11:52:33 MDT 2011", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5432158", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Computers", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", } @Book{Kelbley:2010:WSR, author = "John Kelbley and Mike Sterling", title = "{Windows Server 2008 R2 Hyper-V}: insiders guide to {Microsoft}'s {Hypervisor}", publisher = pub-WILEY, address = pub-WILEY:adr, pages = "????", year = "2010", ISBN = "0-470-62700-X (paperback)", ISBN-13 = "978-0-470-62700-6 (paperback)", LCCN = "QA76.9.V5 K453 2010", bibdate = "Mon May 17 09:06:20 MDT 2010", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Get the inside scoop on Hyper-V for Windows Server 2008 R2. Virtualization is a top priority for thousands of companies all over the world. Written by an author team that is part of the Windows virtualization group at Microsoft, Windows Server 2008 R2 Hyper-V will walk you through Hyper-V essentials so you can get you up to speed and down to business with Hyper-V. Now fully updated for Windows Server 2008 R2 Hyper-V, you will find additional content on new features and capabilities such as Live Migration and support for 64 Logical Processors (LP). Teaches how to manage virtual machines with the latest System Center tools such as Virtual Machine Manager 2008 R2, Data Protection Manager 2010, and Operations Manager 2007 R2. Covers all of the new functionalities of Windows Server 2008 R2 Hyper-V, including Live Migration, 64 LP support, Processor Compatibility Mode, enhanced processor functionality support, hot-add and remove of storage, TCP Offload support, and VM Queue support. Demonstrates key scenarios for Hyper-V, including server consolidation, testing and development, Business Continuity and Disaster Recovery, and Dynamic IT. Provides step-by-step instructions and examples. This insiders guide will help you get the most out of your hardware and reduce cost with Windows Server 2008 R2 Hyper-V.", acknowledgement = ack-nhfb, subject = "Microsoft Windows server Hyper-V; Virtual computer systems", } @Article{Keller:2010:NVC, author = "Eric Keller and Jakub Szefer and Jennifer Rexford and Ruby B. Lee", title = "{NoHype}: virtualized cloud infrastructure without the virtualization", journal = j-COMP-ARCH-NEWS, volume = "38", number = "3", pages = "350--361", month = jun, year = "2010", CODEN = "CANED2", DOI = "https://doi.org/10.1145/1815961.1816010", ISSN = "0163-5964 (ACM), 0884-7495 (IEEE)", ISSN-L = "0163-5964", bibdate = "Tue Jul 6 14:11:46 MDT 2010", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigarch.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Cloud computing is a disruptive trend that is changing the way we use computers. The key underlying technology in cloud infrastructures is virtualization -- so much so that many consider virtualization to be one of the key features rather than simply an implementation detail. Unfortunately, the use of virtualization is the source of a significant security concern. Because multiple virtual machines run on the same server and since the virtualization layer plays a considerable role in the operation of a virtual machine, a malicious party has the opportunity to attack the virtualization layer. A successful attack would give the malicious party control over the all-powerful virtualization layer, potentially compromising the confidentiality and integrity of the software and data of any virtual machine. In this paper we propose removing the virtualization layer, while retaining the key features enabled by virtualization. Our NoHype architecture, named to indicate the removal of the hypervisor, addresses each of the key roles of the virtualization layer: arbitrating access to CPU, memory, and I/O devices, acting as a network device (e.g., Ethernet switch), and managing the starting and stopping of guest virtual machines. Additionally, we show that our NoHype architecture may indeed be 'no hype' since nearly all of the needed features to realize the NoHype architecture are currently available as hardware extensions to processors and I/O devices.", acknowledgement = ack-nhfb, fjournal = "ACM SIGARCH Computer Architecture News", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89", keywords = "cloud computing; hypervisor; many-core; multi-core; security; system architecture; virtualization", } @Article{Kotsovinos:2010:VBC, author = "Evangelos Kotsovinos", title = "Virtualization: Blessing or Curse?", journal = j-QUEUE, volume = "8", number = "11", pages = "40", month = nov, year = "2010", CODEN = "AQCUAE", DOI = "https://doi.org/10.1145/1874534.1889916", ISSN = "1542-7730 (print), 1542-7749 (electronic)", ISSN-L = "1542-7730", bibdate = "Thu Dec 9 11:55:45 MST 2010", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "ACM Queue: Tomorrow's Computing Today", } @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/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Operating Systems Review", } @Book{Laverick:2010:VVI, author = "Mike Laverick", title = "{VMware vSphere 4} implementation", publisher = pub-MCGRAW-HILL, address = pub-MCGRAW-HILL:adr, pages = "xxviii + 659", year = "2010", ISBN = "0-07-166452-1", ISBN-13 = "978-0-07-166452-3", LCCN = "QA76.9.V5 L39 2010", bibdate = "Mon May 17 09:03:07 MDT 2010", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, subject = "VMware vSphere; Virtual computer systems", } @Article{Liu:2010:VMF, author = "Qian Liu and Chuliang Weng and Minglu Li and Yuan Luo", title = "An In-{VM} Measuring Framework for Increasing Virtual Machine Security in Clouds", journal = j-IEEE-SEC-PRIV, volume = "8", number = "6", pages = "56--62", month = nov # "\slash " # dec, year = "2010", CODEN = "????", DOI = "https://doi.org/10.1109/MSP.2010.143", ISSN = "1540-7993 (print), 1558-4046 (electronic)", ISSN-L = "1540-7993", bibdate = "Wed Dec 15 15:02:36 2010", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Security and Privacy", } @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; https://www.math.utah.edu/pub/tex/bib/virtual-machines.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", } @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/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Operating Systems Review", } @Article{Namjoshi:2010:NOP, author = "Manjiri A. Namjoshi and Prasad A. Kulkarni", title = "Novel online profiling for virtual machines", journal = j-SIGPLAN, volume = "45", number = "7", pages = "133--144", month = jul, year = "2010", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/1735997.1736016", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Oct 8 17:55:01 MDT 2010", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2010.bib; https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Application {\em profiling\/} is a popular technique to improve program performance based on its behavior. {\em Offline\/} profiling, although beneficial for several applications, fails in cases where prior program runs may not be feasible, or if changes in input cause the profile to not match the behavior of the actual program run. Managed languages, like Java and C\\#, provide a unique opportunity to overcome the drawbacks of offline profiling by generating the profile information online during the current program run. Indeed, online profiling is extensively used in current VMs, especially during selective compilation to improve program {\em startup\/} performance, as well as during other feedback-directed optimizations.\par In this paper we illustrate the drawbacks of the current {\em reactive\/} mechanism of online profiling during selective compilation. Current VM profiling mechanisms are slow -- thereby delaying associated transformations, and estimate future behavior based on the program's immediate past -- leading to potential misspeculation that limit the benefits of compilation. We show that these drawbacks produce an average performance loss of over 14.5\% on our set of benchmark programs, over an {\em ideal offline\/} approach that accurately compiles the hot methods early. We then propose and evaluate the potential of a novel strategy to achieve similar performance benefits with an online profiling approach. Our new online profiling strategy uses early determination of loop iteration bounds to predict future method hotness. We explore and present promising results on the potential, feasibility, and other issues involved for the successful implementation of this approach.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", keywords = "java; online profiling; virtual machines", } @Book{Nemeth:2010:ULS, author = "Evi Nemeth and Garth Snyder and Trent R. Hein and Ben Whaley", title = "{UNIX} and {Linux} System Administration Handbook", publisher = pub-PH, address = pub-PH:adr, edition = "Fourth", pages = "xlvii + 1279", year = "2010", ISBN = "0-13-148005-7", ISBN-13 = "978-0-13-148005-6", LCCN = "QA76.76.O63 N45 2010", bibdate = "Mon Sep 27 11:07:42 MDT 2010", bibsource = "https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.loc.gov:7090/Voyager", acknowledgement = ack-nhfb, remark = "Revised edition of \cite{Nemeth:2001:USA}.", subject = "Operating systems (Computers); UNIX (Computer file); Linux", tableofcontents = "Where to start \\ Scripting and the shell \\ Booting and shutting down \\ Access control and rootly powers \\ Controlling processes \\ The filesystem \\ Adding new users \\ Storage \\ Periodic processes \\ Backups \\ Syslog and log files \\ Software installation and management \\ Drivers and the kernal \\ TCP/IP networking \\ Routing \\ Network hardware \\ DNS: The domain name system \\ The network file system \\ Sharing system files \\ Electronic mail \\ Network management and debugging \\ Security \\ Web hosting \\ Virtualization \\ The X window system \\ Printing \\ Data center basics \\ Green IT \\ Performance analysis \\ Cooperating with windows \\ Serial devices and terminals \\ Management, policy, and politics", } @InProceedings{Ristenpart:2010:WGR, author = "Thomas Ristenpart and Scott Yilek", title = "When good randomness goes bad: Virtual machine reset vulnerabilities and hedging deployed cryptography", crossref = "Anonymous:2010:NDS", pages = "??--??", year = "2010", bibdate = "Mon Mar 09 16:01:46 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib; https://www.math.utah.edu/pub/tex/bib/prng.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.isoc.org/isoc/conferences/ndss/10/pdf/15.pdf; http://www.isoc.org/isoc/conferences/ndss/10/proceedings.shtml", abstract = "Random number generators (RNGs) are consistently a weak link in the secure use of cryptography. Routine cryptographic operations such as encryption and signing can fail spectacularly given predictable or repeated randomness, even when using good long-lived key material. This has proved problematic in prior settings when RNG implementation bugs, poor design, or low-entropy sources have resulted in predictable randomness. We investigate a new way in which RNGs fail due to reuse of virtual machine (VM) snapshots. We exhibit such VM reset vulnerabilities in widely-used TLS clients and servers: the attacker takes advantage of (or forces) snapshot replay to compromise sessions or even expose a server's DSA signing key. Our next contribution is a backwards-compatible framework for hedging routine cryptographic operations against bad randomness, thereby mitigating the damage due to randomness failures. We apply our framework to the OpenSSL library and experimentally confirm that it has little overhead.", acknowledgement = ack-nhfb, pagecount = "18", remark = "Cite in \cite[reference 65]{Schneier:2015:SWC}.", } @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/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Operating Systems Review", } @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/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Operating Systems Review", } @Article{Sciampacone:2010:EMS, author = "R. A. Sciampacone and V. Sundaresan and D. Maier and T. Gray-Donald", title = "Exploitation of multicore systems in a {Java} virtual machine", journal = j-IBM-JRD, volume = "54", number = "5", pages = "1:1--1:11", month = "????", year = "2010", CODEN = "IBMJAE", DOI = "https://doi.org/10.1147/JRD.2010.2057911", ISSN = "0018-8646 (print), 2151-8556 (electronic)", ISSN-L = "0018-8646", bibdate = "Sun Feb 20 14:29:19 MST 2011", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www.research.ibm.com/journal/", acknowledgement = ack-nhfb, fjournal = "IBM Journal of Research and Development", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520", } @Article{Scott:2010:SLV, author = "Stephen L. Scott and Geoffroy Vall{\'e}e and Thomas Naughton and Anand Tikotekar and Christian Engelmann and Hong Ong", title = "System-level virtualization research at {Oak Ridge National Laboratory}", journal = j-FUT-GEN-COMP-SYS, volume = "26", number = "3", pages = "304--307", month = mar, year = "2010", CODEN = "FGSEVI", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Sat Sep 11 13:08:16 MDT 2010", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www.sciencedirect.com/science/journal/0167739X", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Seely:2010:BVD, author = "Andrew Seely", title = "Building a Virtual {DNS} Appliance Using {Solaris 10}, {BIND}, and {VMware}", journal = j-LOGIN, volume = "35", number = "3", pages = "27--34", month = jun, year = "2010", CODEN = "LOGNEM", ISSN = "1044-6397", ISSN-L = "1044-6397", bibdate = "Fri Dec 7 10:42:09 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/usenix2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; https://www.usenix.org/publications/login", URL = "https://www.usenix.org/publications/login/june-2010-volume-35-number-3/building-virtual-dns-appliance-using-solaris-10-bind", acknowledgement = ack-nhfb, fjournal = ";login: the USENIX Association newsletter", } @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/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Operating Systems Review", } @Article{Soror:2010:AVM, author = "Ahmed A. Soror and Umar Farooq Minhas and Ashraf Aboulnaga and Kenneth Salem and Peter Kokosielis and Sunil Kamath", title = "Automatic virtual machine configuration for database workloads", journal = j-TODS, volume = "35", number = "1", pages = "7:1--7:??", month = feb, year = "2010", CODEN = "ATDSD3", ISSN = "0362-5915 (print), 1557-4644 (electronic)", ISSN-L = "0362-5915", bibdate = "Mon Mar 15 12:22:52 MDT 2010", bibsource = "http://www.acm.org/pubs/contents/journals/tods/; https://www.math.utah.edu/pub/tex/bib/tods.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, articleno = "7", fjournal = "ACM Transactions on Database Systems", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J777", } @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/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Operating Systems Review", } @Book{Takemura:2010:BXP, author = "Chris Takemura and Luke S. (Luke Seidel) Crawford", title = "The book of {Xen}: a practical guide for the system administrator", publisher = pub-NO-STARCH, address = pub-NO-STARCH:adr, pages = "xxiv + 281", year = "2010", ISBN = "1-59327-186-7", ISBN-13 = "978-1-59327-186-2", LCCN = "QA76.9.V5 C83 2009", bibdate = "Fri Oct 16 10:34:11 MDT 2009", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.loc.gov:7090/Voyager", URL = "http://proquest.safaribooksonline.com/?fpi=9781593271862", acknowledgement = ack-nhfb, subject = "Xen (electronic resource); virtual computer systems; computer organization; parallel processing (electronic computers)", tableofcontents = "Foreword / Paul Vixie \\ Introduction \\ Xen : a high-level overview \\ Getting started \\ Provisioning DomUs \\ Storage with Xen \\ Networking \\ DomU Management : tools and frontends \\ Hosting untrusted users under Xen : lessons from the trenches \\ Beyond Linux : using Xen with other Unix-like OSs \\ Xen migration \\ Profiling and benchmarking under Xen \\ Citrix XenServer : Xen for the enterprise \\ HVM : beyond paravirtualization \\ Xen and Windows \\ Tips \\ Troubleshooting \\ Appendix A : xm reference \\ Appendix B : The structure of the Xen config file", } @Article{Thiruvathukal:2010:VCS, author = "George K. Thiruvathukal and Konrad Hinsen and Konstantin Laufer and Joe Kaylor", title = "Virtualization for Computational Scientists", journal = j-COMPUT-SCI-ENG, volume = "12", number = "4", pages = "52--61", month = jul # "\slash " # aug, year = "2010", CODEN = "CSENFA", DOI = "https://doi.org/10.1109/MCSE.2010.92", ISSN = "1521-9615 (print), 1558-366X (electronic)", ISSN-L = "1521-9615", bibdate = "Tue Jul 27 16:37:11 2010", bibsource = "https://www.math.utah.edu/pub/tex/bib/computscieng.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Computing in Science and Engineering", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5992", } @Book{Troy:2010:VC, author = "Ryan Troy and Matthew Helmke", title = "{VMware} cookbook", publisher = pub-ORA-MEDIA, address = pub-ORA-MEDIA:adr, pages = "xv + 280", year = "2010", ISBN = "0-596-15725-8 (paperback)", ISBN-13 = "978-0-596-15725-8 (paperback)", LCCN = "QA76.9.V5 T76 2010", bibdate = "Mon May 17 09:03:07 MDT 2010", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, remark = "Covers ESX and ESXi.", subject = "VMware; Virtual computer systems", } @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/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Operating Systems Review", } @Book{Victor:2010:OSS, editor = "Jeff Victor and Jeff Savit and Gary Combs and Simon Hayler and Bob Netherton", title = "{Oracle Solaris 10} system virtualization essentials", publisher = pub-PH, address = pub-PH:adr, pages = "384 (est.)", year = "2010", ISBN = "0-13-708188-X (paperback)", ISBN-13 = "978-0-13-708188-2 (paperback)", LCCN = "QA76.9.V5 O73 2010", bibdate = "Thu Sep 9 14:55:54 MDT 2010", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/unix.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, subject = "Solaris (Computer file); Virtual computer systems", tableofcontents = "Introduction to virtualization \\ Hard partitioning : dynamic domains \\ Oracle VM Server for SPARC \\ Oracle Solaris 10 as an x86 guest \\ Oracle VM virtualbox \\ Oracle Solaris containers \\ Choosing a virtualization technology \\ Applying virtualization \\ Virtualization management \\ History of virtualization and architectural evolution", } @Article{Waldspurger:2010:VEM, author = "Carl Waldspurger", title = "A {VM} 'Engine' that makes a difference: technical perspective", journal = j-CACM, volume = "53", number = "10", pages = "84--84", month = oct, year = "2010", CODEN = "CACMA2", DOI = "https://doi.org/10.1145/1831407.1831428", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Fri Oct 1 21:13:00 MDT 2010", bibsource = "http://www.acm.org/pubs/contents/journals/cacm/; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79", } @TechReport{Wang:2010:HLA, author = "Zhi Wang and Xuxian Jiang", title = "{HyperSafe}: a Lightweight Approach to Provide Lifetime Hypervisor Control-Flow Integrity", type = "Report", institution = "Department of Computer Science, North Carolina State University", address = "Raleigh, NC, USA", pages = "16", year = "2010", bibdate = "Mon May 17 08:40:02 2010", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.csc.ncsu.edu/faculty/jiang/pubs/OAKLAND10.pdf", abstract = "Virtualization is being widely adopted in today's computing systems. Its unique security advantages in isolating and introspecting commodity OSes as virtual machines (VMs) have enabled a wide spectrum of applications. However, a common, fundamental assumption is the presence of a trustworthy hypervisor. Unfortunately, the large code base of commodity hypervisors and recent successful hypervisor attacks (e.g., VM escape) seriously question the validity of this assumption. In this paper, we present HyperSafe, a lightweight approach that endows existing Type-I bare-metal hypervisors with a unique self-protection capability to provide lifetime controlflow integrity. Specifically, we propose two key techniques. The first one non-bypassable memory lockdown reliably protects the hypervisor's code and static data from being compromised even in the presence of exploitable memory corruption bugs (e.g., buffer overflows), therefore successfully providing hypervisor code integrity. The second one restricted pointer indexing introduces one layer of indirection to convert the control data into pointer indexes. These pointer indexes are restricted such that the corresponding call/return targets strictly follow the hypervisor control flow graph, hence expanding protection to control-flow integrity. We have built a prototype and used it to protect two open-source Type-I hypervisors: BitVisor and Xen. The experimental results with synthetic hypervisor exploits and benchmarking programs show HyperSafe can reliably enable the hypervisor self-protection and provide the integrity guarantee with a small performance overhead.", acknowledgement = ack-nhfb, } @Article{Weber:2010:EVM, author = "Michael Weber", title = "An embeddable virtual machine for state space generation", journal = j-INT-J-SOFTW-TOOLS-TECHNOL-TRANSFER, volume = "12", number = "2", pages = "97--111", month = may, year = "2010", CODEN = "????", ISSN = "1433-2779 (print), 1433-2787 (electronic)", ISSN-L = "1433-2779", bibdate = "Sat Sep 11 07:13:37 MDT 2010", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=1433-2779&volume=12&issue=2; https://www.math.utah.edu/pub/tex/bib/sttt.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=1433-2779&volume=12&issue=2&spage=97", acknowledgement = ack-nhfb, fjournal = "International Journal on Software Tools for Technology Transfer: STTT", } @Article{Ye:2010:EES, author = "Lei Ye and Gen Lu and Sushanth Kumar and Chris Gniady and John H. Hartman", title = "Energy-efficient storage in virtual machine environments", journal = j-SIGPLAN, volume = "45", number = "7", pages = "75--84", month = jul, year = "2010", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/1735997.1736009", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Oct 8 17:55:01 MDT 2010", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Current trends in increasing storage capacity and virtualization of resources combined with the need for energy efficiency put a challenging task in front of system designers. Previous studies have suggested many approaches to reduce hard disk energy dissipation in native OS environments; however, those mechanisms do not perform well in virtual machine environments because a virtual machine (VM) and the virtual machine monitor (VMM) that runs it have different semantic contexts. This paper explores the disk I/O activities between VMM and VMs using trace driven simulation to understand the I/O behavior of the VM system. Subsequently, this paper proposes three mechanisms to address the isolation between VMM and VMs, and increase the burstiness of hard disk accesses to increase energy efficiency of a hard disk. Compared to standard shutdown mechanisms, with eight VMs the proposed mechanisms reduce disk spin-ups, increase the disk sleep time, and reduce energy consumption by 14.8\% with only 0.5\% increase in execution time. We implemented the proposed mechanisms in Xen and validated our simulation results.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", keywords = "energy management; storage system; virtual machine", } @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/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Operating Systems Review", } @InProceedings{Appuswamy:2011:FMF, author = "Raja Appuswamy and David C. van Moolenbroek and Andrew S. Tanenbaum", editor = "Andr{\'e} Brinkmann and David Pease", booktitle = "{Proceedings of the 27th IEEE Conference on Mass Storage Systems and Technologies (MSST '11), 23--27 May 2011, Denver, CO, USA}", title = "Flexible, Modular File Volume Virtualization in {Loris}", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "1--14", year = "2011", DOI = "????", ISBN = "1-4577-0428-5, 1-4577-0427-7", ISBN-13 = "978-1-4577-0428-4, 978-1-4577-0427-7", LCCN = "TK7895.M4", bibdate = "Fri Oct 24 08:14:23 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/minix.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://ieeexplore.ieee.org/servlet/opac?punumber=5910685; http://www.minix3.org/docs/loris/MSST2011.pdf", acknowledgement = ack-nhfb, pagecount = "14", } @Article{Armstrong:2011:PIC, author = "Django Armstrong and Karim Djemame", title = "Performance Issues in Clouds: an Evaluation of Virtual Image Propagation and {I/O} Paravirtualization", journal = j-COMP-J, volume = "54", number = "6", pages = "836--849", month = jun, year = "2011", CODEN = "CMPJA6", DOI = "https://doi.org/10.1093/comjnl/bxr011", ISSN = "0010-4620 (print), 1460-2067 (electronic)", ISSN-L = "0010-4620", bibdate = "Wed Jun 1 18:54:12 MDT 2011", bibsource = "http://comjnl.oxfordjournals.org/content/54/6.toc; https://www.math.utah.edu/pub/tex/bib/compj2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://comjnl.oxfordjournals.org/content/54/6/836.full.pdf+html", acknowledgement = ack-nhfb, fjournal = "Computer Journal", journal-URL = "http://comjnl.oxfordjournals.org/", onlinedate = "February 18, 2011", } @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; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGOPS Operating Systems Review", } @Article{Bacon:2011:VAH, author = "David F. Bacon", title = "Virtualization in the age of heterogeneous machines", journal = j-SIGPLAN, volume = "46", number = "7", pages = "1--2", month = jul, year = "2011", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2007477.1952684", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Sep 16 10:02:34 MDT 2011", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @Article{Baride:2011:CBS, author = "Srikanth Baride and Kamlesh Dutta", title = "A cloud based software testing paradigm for mobile applications", journal = j-SIGSOFT, volume = "36", number = "3", pages = "1--4", month = may, year = "2011", CODEN = "SFENDP", DOI = "https://doi.org/10.1145/1968587.1968601", ISSN = "0163-5948 (print), 1943-5843 (electronic)", ISSN-L = "0163-5948", bibdate = "Wed Aug 1 17:16:02 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsoft2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "The testing of applications for mobile computing devices is cumbersome due to the bounded computational resources that these devices have and diversity in mobile environments. There are many different types of emulators that have been proposed and used nowadays for this purpose. But these emulators typically cannot emulate: actual network speed and availability, actual device specific content-rendering speed, memory limitation, cache size, CPU speed, and stack size. These emulators are designed for specific platforms, which lack testing of applications on heterogeneous mobile platforms. Cloud Computing has a potential to overcome these challenges by taking up contemporary progress in parallel and distributed systems, virtualization, and software services. Cloud computing empowers us to have adaptable and on-demand network access to a common group of configurable computing resources. In this article, we introduce a cloudbased model that provides solutions to aforesaid challenges. Our model sets up a mobile environment, actual device and platform on the cloud resources for a given system configuration. It also provides software testing services to execute numerous tests automatically according to a given application.", acknowledgement = ack-nhfb, fjournal = "ACM SIGSOFT Software Engineering Notes", journal-URL = "https://dl.acm.org/citation.cfm?id=J728", } @Article{Cecchet:2011:DVD, author = "Emmanuel Cecchet and Rahul Singh and Upendra Sharma and Prashant Shenoy", title = "{Dolly}: virtualization-driven database provisioning for the cloud", journal = j-SIGPLAN, volume = "46", number = "7", pages = "51--62", month = jul, year = "2011", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2007477.1952691", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Sep 16 10:02:34 MDT 2011", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @Article{Deng:2011:CDE, author = "Yuhui Deng and Brandon Pung", title = "Conserving disk energy in virtual machine based environments by amplifying bursts", journal = j-COMPUTING, volume = "91", number = "1", pages = "3--21", month = jan, year = "2011", CODEN = "CMPTA2", ISSN = "0010-485X (print), 1436-5057 (electronic)", ISSN-L = "0010-485X", bibdate = "Tue Sep 6 19:14:13 MDT 2011", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0010-485X&volume=91&issue=1; https://www.math.utah.edu/pub/tex/bib/computing.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0010-485X&volume=91&issue=1&spage=3", acknowledgement = ack-nhfb, fjournal = "Computing", journal-URL = "http://link.springer.com/journal/607", } @Article{Do:2011:CAS, author = "Tien Van Do", title = "Comparison of Allocation Schemes for Virtual Machines in Energy-Aware Server Farms", journal = j-COMP-J, volume = "54", number = "11", pages = "1790--1797", month = nov, year = "2011", CODEN = "CMPJA6", DOI = "https://doi.org/10.1093/comjnl/bxr007", ISSN = "0010-4620 (print), 1460-2067 (electronic)", ISSN-L = "0010-4620", bibdate = "Fri Oct 28 10:35:35 MDT 2011", bibsource = "http://comjnl.oxfordjournals.org/content/54/11.toc; https://www.math.utah.edu/pub/tex/bib/compj2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Computer Journal", journal-URL = "http://comjnl.oxfordjournals.org/", onlinedate = "February 13, 2011", } @Article{Dobre:2011:VBA, author = "Ciprian Dobre and Florin Pop and Valentin Cristea and Ovidiu-Marian Achim", title = "A Virtualization-based Approach to Dependable Service Computing", journal = j-SCPE, volume = "12", number = "3", pages = "337--350", month = sep, year = "2011", CODEN = "????", ISSN = "1895-1767", ISSN-L = "1895-1767", bibdate = "Sat Nov 10 09:03:33 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/scpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www.scpe.org/index.php/scpe/issue/view/96", URL = "http://www.scpe.org/index.php/scpe/article/view/728", acknowledgement = ack-nhfb, remark = "Special Issue: Selected Papers From the 2nd Workshop on Software Services.", } @InProceedings{Dolan-Gavitt:2011:VNS, author = "Brendan Dolan-Gavitt and Tim Leek and Michael Zhivich and Jonathon Giffin and Wenke Lee", booktitle = "{2011 IEEE Symposium on Security and Privacy}", title = "Virtuoso: Narrowing the Semantic Gap in Virtual Machine Introspection", publisher = pub-IEEE, address = pub-IEEE:adr, month = may, year = "2011", DOI = "https://doi.org/10.1109/sp.2011.11", bibdate = "Thu Jul 7 14:53:55 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Introspection has featured prominently in many recent security solutions, such as virtual machine-based intrusion detection, forensic memory analysis, and low-artifact malware analysis. Widespread adoption of these approaches, however, has been hampered by the semantic gap: in order to extract meaningful information about the current state of a virtual machine, detailed knowledge of the guest operating system's inner workings is required. In this paper, we present a novel approach for automatically creating introspection tools for security applications with minimal human effort. By analyzing dynamic traces of small, in-guest programs that compute the desired introspection information, we can produce new programs that retrieve the same information from outside the guest virtual machine. We demonstrate the efficacy of our techniques by automatically generating 17 programs that retrieve security information across 3 different operating systems, and show that their functionality is unaffected by the compromise of the guest system. Our technique allows introspection tools to be effortlessly generated for multiple platforms, and enables the development of rich introspection-based security applications", acknowledgement = ack-nhfb, } @Article{Du:2011:PPV, author = "Jiaqing Du and Nipun Sehrawat and Willy Zwaenepoel", title = "Performance profiling of virtual machines", journal = j-SIGPLAN, volume = "46", number = "7", pages = "3--14", month = jul, year = "2011", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2007477.1952686", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Sep 16 10:02:34 MDT 2011", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @InProceedings{Fagin:2011:IPE, author = "Barry S. Fagin and Dale J. Skrien", editor = "Thomas J. Cortina", booktitle = "{Proceedings of the 42nd ACM Technical Symposium on Computer Science Education (SIGCSE 11)}", title = "{IASSim}: a Programmable Emulator for the {Princeton IAS\slash von Neumann Machine}", publisher = pub-ACM, address = pub-ACM:adr, pages = "359--364", year = "2011", DOI = "https://doi.org/10.1145/1953163.1953271", ISBN = "1-4503-0500-8 (print)", ISBN-13 = "978-1-4503-0500-6 (print)", bibdate = "Fri Nov 16 16:38:13 2012", bibsource = "https://www.math.utah.edu/pub/bibnet/authors/v/von-neumann-john.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "See \cite{Fagin:2012:DSG} for an analysis and debugging of von Neumann's computer programs.", URL = "http://dl.acm.org/citation.cfm?id=1953163; http://www.cs.colby.edu/djskrien/IASSim/", acknowledgement = ack-nhfb, lastaccessed = "17 November 2012", } @Article{Ferrell:2011:DRV, author = "Robert G. Ferrell", title = "{{\tt /dev/random}}: Virtualization: a Dark Proverb", journal = j-LOGIN, volume = "36", number = "5", pages = "??--??", month = oct, year = "2011", CODEN = "LOGNEM", ISSN = "1044-6397", ISSN-L = "1044-6397", bibdate = "Fri Dec 7 10:42:16 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/usenix2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; https://www.usenix.org/publications/login", URL = "https://www.usenix.org/publications/login/october-2011-volume-36-number-5/devrandom-virtualization-dark-proverb", acknowledgement = ack-nhfb, fjournal = ";login: the USENIX Association newsletter", } @Article{Galvin:2011:PATa, author = "Peter Baer Galvin", title = "{Pete}'s All Things {Sun}: Comparing {Solaris} to {RedHat Enterprise} and {AIX} --- Virtualization Features", journal = j-LOGIN, volume = "36", number = "1", pages = "??--??", month = feb, year = "2011", CODEN = "LOGNEM", ISSN = "1044-6397", ISSN-L = "1044-6397", bibdate = "Fri Dec 7 10:42:12 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/usenix2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; https://www.usenix.org/publications/login", URL = "https://www.usenix.org/publications/login/february-2011-volume-36-number-1/petes-all-things-sun-comparing-solaris-redhat", acknowledgement = ack-nhfb, fjournal = ";login: the USENIX Association newsletter", } @Article{Greamo:2011:SVM, author = "Chris Greamo and Anup Ghosh", title = "Sandboxing and Virtualization: Modern Tools for Combating Malware", journal = j-IEEE-SEC-PRIV, volume = "9", number = "2", pages = "79--82", month = mar # "\slash " # apr, year = "2011", CODEN = "????", DOI = "https://doi.org/10.1109/MSP.2011.36", ISSN = "1540-7993 (print), 1558-4046 (electronic)", ISSN-L = "1540-7993", bibdate = "Fri Apr 1 22:34:08 2011", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Security and Privacy", } @Article{Jang:2011:ERC, author = "Jae-Wan Jang and Myeongjae Jeon and Hyo-Sil Kim and Heeseung Jo and Jin-Soo Kim and Seungryoul Maeng", title = "Energy Reduction in Consolidated Servers through Memory-Aware Virtual Machine Scheduling", journal = j-IEEE-TRANS-COMPUT, volume = "60", number = "4", pages = "552--564", month = apr, year = "2011", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.2010.82", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Wed Jun 29 10:26:18 2011", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Computers", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", } @Article{Jin:2011:OLM, author = "Hai Jin and Wei Gao and Song Wu and Xuanhua Shi and Xiaoxin Wu and Fan Zhou", title = "Optimizing the live migration of virtual machine by {CPU} scheduling", journal = j-J-NETW-COMPUT-APPL, volume = "34", number = "4", pages = "1088--1096", month = jul, year = "2011", CODEN = "JNCAF3", ISSN = "1084-8045 (print), 1095-8592 (electronic)", ISSN-L = "1084-8045", bibdate = "Wed Jan 28 15:43:59 MST 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1084804510001116", acknowledgement = ack-nhfb, ajournal = "J. Netw. Comput. Appl.", fjournal = "Journal of Network and Computer Applications", journal-URL = "http://www.sciencedirect.com/science/journal/10848045", } @TechReport{Kazandjieva:2011:SHF, author = "Maria Kazandjieva and Brandon Heller and Omprakash Gnawali and Wanja Hofer and Philip Levis and Christos Kozyrakis", title = "Software or Hardware: The Future of Green Enterprise Computing", type = "Technical Report", number = "CSTR 2011-02", institution = inst-STAN-CS, address = inst-STAN-CS:adr, pages = "13", day = "7", month = jul, year = "2011", bibdate = "Fri Nov 21 07:40:47 MST 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/stanford-cstr.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://hci.stanford.edu/cstr/reports/2011-02.pdf", abstract = "Over the last few years, interest in ``green computing'' has motivated research into energy-saving techniques for enterprise systems, from network proxies and virtual machine migration to the return of thin clients. This paper tries to answer a possibly contentious question: would we be better served by the embarrassingly simple approach of replacing every desktop with a laptop? To answer this question, we use power and utilization data collected from more than 100 devices over durations up to 15 months. We find that choosing the right computing systems --- laptops --- would save more energy than state-of-the-art power management software or thin clients. Furthermore, the marginal savings of applying software techniques on top of laptops is so small that it is probably not worth the trouble.\par When selecting computers, there are many other considerations than just energy, such as computational resources, and price. We find that these factors generally do not reduce the attractiveness of a laptop-based enterprise. We discuss current trends in enterprises today, and how our conclusions might affect their directions, sketching a future of how a cost-efficient enterprise might become a hybrid system entwining laptops and tablets with a computing cloud.", acknowledgement = ack-nhfb, pdfpages = "13", } @Article{Kim:2011:PAP, author = "Kyong Hoon Kim and Anton Beloglazov and Rajkumar Buyya", title = "Power-aware provisioning of virtual machines for real-time {Cloud} services", journal = j-CCPE, volume = "23", number = "13", pages = "1491--1505", day = "10", month = sep, year = "2011", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.1712", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Mon Dec 5 10:08:58 MST 2011", bibsource = "http://www.interscience.wiley.com/jpages/1532-0626; https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", onlinedate = "22 Mar 2011", } @Article{Kim:2011:XEC, author = "Hwanju Kim and Heeseung Jo and Joonwon Lee", title = "{XHive}: Efficient Cooperative Caching for Virtual Machines", journal = j-IEEE-TRANS-COMPUT, volume = "60", number = "1", pages = "106--119", month = jan, year = "2011", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.2010.83", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Wed Jun 29 10:26:18 2011", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Computers", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", } @Article{Kotsovinos:2011:VBC, author = "Evangelos Kotsovinos", title = "Virtualization: blessing or curse?", journal = j-CACM, volume = "54", number = "1", pages = "61--65", month = jan, year = "2011", CODEN = "CACMA2", DOI = "https://doi.org/10.1145/1866739.1866754", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Thu Dec 23 17:45:01 MST 2010", bibsource = "http://www.acm.org/pubs/contents/journals/cacm/; https://www.math.utah.edu/pub/tex/bib/cacm2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79", } @Article{Kourai:2011:FCP, author = "Kenichi Kourai", title = "Fast and correct performance recovery of operating systems using a virtual machine monitor", journal = j-SIGPLAN, volume = "46", number = "7", pages = "99--110", month = jul, year = "2011", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2007477.1952696", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Sep 16 10:02:34 MDT 2011", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @Article{Kousiouris:2011:ESW, author = "George Kousiouris and Tommaso Cucinotta and Theodora Varvarigou", title = "The effects of scheduling, workload type and consolidation scenarios on virtual machine performance and their prediction through optimized artificial neural networks", journal = j-J-SYST-SOFTW, volume = "84", number = "8", pages = "1270--1291", month = aug, year = "2011", CODEN = "JSSODM", ISSN = "0164-1212 (print), 1873-1228 (electronic)", ISSN-L = "0164-1212", bibdate = "Tue Jun 21 10:22:32 MDT 2011", bibsource = "https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www.sciencedirect.com/science/journal/01641212", acknowledgement = ack-nhfb, fjournal = "Journal of Systems and Software", journal-URL = "http://www.sciencedirect.com/science/journal/01641212", } @Article{Lagar-Cavilla:2011:SVM, author = "H. Andr{\'e}s Lagar-Cavilla and Joseph A. Whitney and Roy Bryant and Philip Patchin and Michael Brudno and Eyal de Lara and Stephen M. Rumble and M. Satyanarayanan and Adin Scannell", title = "{SnowFlock}: Virtual Machine Cloning as a First-Class Cloud Primitive", journal = j-TOCS, volume = "29", number = "1", pages = "2:1--2:45", month = feb, year = "2011", CODEN = "ACSYEC", DOI = "https://doi.org/10.1145/1925109.1925111", ISSN = "0734-2071 (print), 1557-7333 (electronic)", ISSN-L = "0734-2071", bibdate = "Mon Feb 28 16:17:43 MST 2011", bibsource = "http://www.acm.org/pubs/contents/journals/tocs/; https://www.math.utah.edu/pub/tex/bib/tocs.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "A basic building block of cloud computing is virtualization. Virtual machines (VMs) encapsulate a user's computing environment and efficiently isolate it from that of other users. VMs, however, are large entities, and no clear APIs exist yet to provide users with programatic, fine-grained control on short time scales. We present SnowFlock, a paradigm and system for cloud computing that introduces VM cloning as a first-class cloud abstraction. VM cloning exploits the well-understood and effective semantics of UNIX fork. We demonstrate multiple usage models of VM cloning: users can incorporate the primitive in their code, can wrap around existing toolchains via scripting, can encapsulate the API within a parallel programming framework, or can use it to load-balance and self-scale clustered servers.", acknowledgement = ack-nhfb, articleno = "2", fjournal = "ACM Transactions on Computer Systems", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J774", } @Article{Lange:2011:MOV, author = "John R. Lange and Kevin Pedretti and Peter Dinda and Patrick G. Bridges and Chang Bae and Philip Soltero and Alexander Merritt", title = "Minimal-overhead virtualization of a large scale supercomputer", journal = j-SIGPLAN, volume = "46", number = "7", pages = "169--180", month = jul, year = "2011", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2007477.1952705", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Sep 16 10:02:34 MDT 2011", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @Article{Lange:2011:SSV, author = "John R. Lange and Peter Dinda", title = "{SymCall}: symbiotic virtualization through {VMM}-to-guest upcalls", journal = j-SIGPLAN, volume = "46", number = "7", pages = "193--204", month = jul, year = "2011", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2007477.1952707", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Sep 16 10:02:34 MDT 2011", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @Article{Le:2011:EMO, author = "Duy Le and Haining Wang", title = "An Effective Memory Optimization for Virtual Machine-Based Systems", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "22", number = "10", pages = "1705--1713", month = nov, year = "2011", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2011.37", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Wed Sep 7 09:02:09 2011", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Parallel and Distributed Systems", journal-URL = "http://www.computer.org/tpds/archives.htm", } @InProceedings{Le:2011:REC, author = "Kien Le and Ricardo Bianchini and Jingru Zhang and Yogesh Jaluria and Jiandong Meng and Thu D. Nguyen", title = "Reducing electricity cost through virtual machine placement in high performance computing clouds", crossref = "Lathrop:2011:SPI", pages = "22:1--22:12", year = "2011", DOI = "https://doi.org/10.1145/2063384.2063413", bibdate = "Fri Dec 16 11:05:47 MST 2011", bibsource = "https://www.math.utah.edu/pub/tex/bib/supercomputing2011.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, articleno = "22", } @Article{Liu:2011:LVM, author = "Haikun Liu and Hai Jin and Xiaofei Liao and Chen Yu and Cheng-Zhong Xu", title = "Live Virtual Machine Migration via Asynchronous Replication and State Synchronization", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "22", number = "12", pages = "1986--1999", month = dec, year = "2011", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2011.86", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Sun Nov 6 08:10:45 2011", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Parallel and Distributed Systems", journal-URL = "http://www.computer.org/tpds/archives.htm", } @Article{Lombardi:2011:SVC, author = "Flavio Lombardi and Roberto Di Pietro", title = "Secure virtualization for cloud computing", journal = j-J-NETW-COMPUT-APPL, volume = "34", number = "4", pages = "1113--1122", month = jul, year = "2011", CODEN = "JNCAF3", ISSN = "1084-8045 (print), 1095-8592 (electronic)", ISSN-L = "1084-8045", bibdate = "Wed Jan 28 15:43:59 MST 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1084804510001062", acknowledgement = ack-nhfb, ajournal = "J. Netw. Comput. Appl.", fjournal = "Journal of Network and Computer Applications", journal-URL = "http://www.sciencedirect.com/science/journal/10848045", } @Book{Lowe:2011:MVV, author = "Scott Lowe", title = "Mastering {VMware vSphere5}", publisher = pub-WILEY, address = pub-WILEY:adr, pages = "xxv + 742", year = "2011", ISBN = "0-470-89080-0 (paperback), 1-118-18010-0 (ebk.), 1-118-18011-9 (ebk.), 1-118-18012-7 (ebk.)", ISBN-13 = "978-0-470-89080-6 (paperback), 978-1-118-18010-5 (e-book), 978-1-118-18011-2 (e-book), 978-1-118-18012-9 (e-book)", LCCN = "QA76.9.V5 L685 2011", bibdate = "Thu Jan 16 12:12:02 MST 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.loc.gov:7090/Voyager", series = "Serious skills", abstract = "Offers a comprehensive look at VMware technology, how to implement it, and how to make the most of what it offers.", acknowledgement = ack-nhfb, subject = "VMware vSphere; Virtual computer systems; Virtualisierung.; VMware vSphere (Computer software); Computer operating systems.; Virtualisierung.", } @Article{McKinley:2011:HPC, author = "Kathryn S. McKinley", title = "How's the parallel computing revolution going?", journal = j-SIGPLAN, volume = "46", number = "8", pages = "123--124", month = aug, year = "2011", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2038037.1941571", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Mon Aug 26 14:04:45 MDT 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "PPoPP '11 Conference proceedings.", abstract = "Two trends changed the computing landscape over the past decade: (1) hardware vendors started delivering chip multiprocessors (CMPs) instead of uniprocessors, and (2) software developers increasingly chose managed languages instead of native languages. Unfortunately, the former change is disrupting the virtuous-cycle between performance improvements and software innovation. Establishing a new parallel performance virtuous cycle for managed languages will require scalable applications executing on scalable Virtual Machine (VM) services, since the VM schedules, monitors, compiles, optimizes, garbage collects, and executes together with the application. This talk describes current progress, opportunities, and challenges for scalable VM services. The parallel computing revolution urgently needs more innovations.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @Article{McMillan:2011:SVM, author = "William W. McMillan", title = "The soul of the virtual machine", journal = j-IEEE-SPECTRUM, volume = "48", number = "7", pages = "44--59", month = jul, year = "2011", CODEN = "IEESAM", DOI = "https://doi.org/10.1109/MSPEC.2011.5910448", ISSN = "0018-9235 (print), 1939-9340 (electronic)", ISSN-L = "0018-9235", bibdate = "Fri Jan 17 18:54:05 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeespectrum2010.bib; https://www.math.utah.edu/pub/tex/bib/java2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Spectrum", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6", keywords = "Ersatz machine code; Java; Java compiler; Java virtual machines; Operating systems; program compilers; Program processors; Programming; virtual machines; Virtual machining; Virtual prototyping", } @Article{Nikolaev:2011:PXF, author = "Ruslan Nikolaev and Godmar Back", title = "{Perfctr-Xen}: a framework for performance counter virtualization", journal = j-SIGPLAN, volume = "46", number = "7", pages = "15--26", month = jul, year = "2011", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2007477.1952687", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Sep 16 10:02:34 MDT 2011", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @Article{Park:2011:FSE, author = "Eunbyung Park and Bernhard Egger and Jaejin Lee", title = "Fast and space-efficient virtual machine checkpointing", journal = j-SIGPLAN, volume = "46", number = "7", pages = "75--86", month = jul, year = "2011", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2007477.1952694", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Sep 16 10:02:34 MDT 2011", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @Article{Parri:2011:RCPa, author = "Jonathan Parri and Daniel Shapiro and Miodrag Bolic and Voicu Groza", title = "Returning Control to the Programmer: {SIMD} Intrinsics for Virtual Machines", journal = j-QUEUE, volume = "9", number = "2", pages = "30", month = feb, year = "2011", CODEN = "AQCUAE", DOI = "https://doi.org/10.1145/1943176.1945954", ISSN = "1542-7730 (print), 1542-7749 (electronic)", ISSN-L = "1542-7730", bibdate = "Fri Mar 4 13:24:32 MST 2011", bibsource = "https://www.math.utah.edu/pub/tex/bib/queue.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "ACM Queue: Tomorrow's Computing Today", } @Article{Parri:2011:RCPb, author = "Jonathan Parri and Daniel Shapiro and Miodrag Bolic and Voicu Groza", title = "Returning control to the programmer: {SIMD} intrinsics for virtual machines", journal = j-CACM, volume = "54", number = "4", pages = "38--43", month = apr, year = "2011", CODEN = "CACMA2", DOI = "https://doi.org/10.1145/1924421.1924437", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Thu Mar 24 13:48:13 MDT 2011", bibsource = "http://www.acm.org/pubs/contents/journals/cacm/; https://www.math.utah.edu/pub/tex/bib/cacm2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79", } @Article{Payer:2011:FGU, author = "Mathias Payer and Thomas R. Gross", title = "Fine-grained user-space security through virtualization", journal = j-SIGPLAN, volume = "46", number = "7", pages = "157--168", month = jul, year = "2011", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2007477.1952703", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Sep 16 10:02:34 MDT 2011", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @Article{Revelle:2011:HVM, author = "Don Revelle", title = "Hypervisors and Virtual Machines: Implementation Insights on the x86 Architecture", journal = j-LOGIN, volume = "36", number = "5", pages = "17--22", month = oct, year = "2011", CODEN = "LOGNEM", ISSN = "1044-6397", ISSN-L = "1044-6397", bibdate = "Fri Dec 7 10:42:16 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/usenix2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; https://www.usenix.org/publications/login", URL = "https://www.usenix.org/publications/login/october-2011-volume-36-number-5/hypervisors-and-virtual-machines-implementation", acknowledgement = ack-nhfb, fjournal = ";login: the USENIX Association newsletter", } @Article{Sewe:2011:CCS, author = "Andreas Sewe and Mira Mezini and Aibek Sarimbekov and Walter Binder", title = "Da capo con {Scala}: design and analysis of a {Scala} benchmark suite for the {Java Virtual Machine}", journal = j-SIGPLAN, volume = "46", number = "10", pages = "657--676", month = oct, year = "2011", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2076021.2048118", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Dec 15 07:46:53 MST 2011", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2010.bib; https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "OOPSLA '11 conference proceedings.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @Article{So-In:2011:VAU, author = "Chakchai So-In and Raj Jain and Subharthi Paul and Jianli Pan", title = "Virtualization architecture using the {ID\slash Locator} split concept for {Future Wireless Networks (FWNs)}", journal = j-COMP-NET-AMSTERDAM, volume = "55", number = "2", pages = "415--430", day = "1", month = feb, year = "2011", CODEN = "????", ISSN = "1389-1286 (print), 1872-7069 (electronic)", ISSN-L = "1389-1286", bibdate = "Sat Apr 2 08:42:43 MDT 2011", bibsource = "https://www.math.utah.edu/pub/bibnet/authors/j/jain-raj.bib; https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www.sciencedirect.com/science/journal/13891286", acknowledgement = ack-nhfb, fjournal = "Computer Networks", journal-URL = "http://www.sciencedirect.com/science/journal/13891286", } @Book{Subramaniam:2011:PCJ, author = "Venkat Subramaniam", title = "Programming concurrency on the {JVM}: mastering synchronization, {STM}, and actors", publisher = "Pragmatic Bookshelf", address = "Dallas, TX", pages = "xvii + 270", year = "2011", ISBN = "1-934356-76-X", ISBN-13 = "978-1-934356-76-0", LCCN = "QA76.73.J38 S8467 2011", bibdate = "Thu Dec 4 08:35:54 MST 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.loc.gov:7090/Voyager", series = "The pragmatic programmers", abstract = "Stop dreading concurrency and start reaping the pure power of modern multicore hardware. Learn how to avoid shared mutable state and how to write safe, elegant, explicit synchronization-free programs in Java or other JVM languages, including Clojure, JRuby, Groovy, or Scala. This book is the first to show you the three prominent concurrency styles: the synchronization model of the JDK, Software Transactional Memory (STM), and actor-based concurrency. You'll learn the benefits of each of these models, when and how to use them, and what their limitations are so you can compare and choose what works best for your applications. Learning to program using concurrency is critical to creating faster, more responsive applications, and now you can leverage the Java platform to bring these applications to high-octane life.", acknowledgement = ack-nhfb, subject = "Java (Computer program language); Java virtual machine; Parallel processing (Electronic computers); Computer multitasking; Computer programming; Systems programming (Computer science)", tableofcontents = "The power and perils of concurrency \\ Strategies for concurrency \\ Modern Java/JDK concurrency \\ Software transactional memory \\ Actor-based concurrency", } @Article{Svard:2011:EDC, author = "Petter Sv{\"a}rd and Benoit Hudzia and Johan Tordsson and Erik Elmroth", title = "Evaluation of delta compression techniques for efficient live migration of large virtual machines", journal = j-SIGPLAN, volume = "46", number = "7", pages = "111--120", month = jul, year = "2011", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2007477.1952698", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Sep 16 10:02:34 MDT 2011", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @Article{Taft:2011:EPP, author = "S. Tucker Taft", title = "Experimenting with {ParaSail}: parallel specification and implementation language", journal = j-SIGADA-LETTERS, volume = "31", number = "3", pages = "11--12", month = dec, year = "2011", CODEN = "AALEE5", DOI = "https://doi.org/10.1145/2070336.2070344", ISSN = "1094-3641 (print), 1557-9476 (electronic)", ISSN-L = "1094-3641", bibdate = "Fri Apr 6 11:01:24 MDT 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigada.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "This tutorial provides an opportunity to experiment with a new language designed to support the safe, secure, and productive development of parallel programs. ParaSail is a new language with pervasive parallelism coupled with extensive compile-time checking of annotations in the form of assertions, preconditions, postconditions, etc. ParaSail does all checking at compile time, and eliminates race conditions, null dereferences, uninitialized data access, numeric overflow, out of bounds indexing, etc. as well as statically checking the truth of all user-written assertions. After a short introduction to the language, attendees will receive a prototype ParaSail compiler and an accompanying ParaSail Virtual Machine interpreter for writing and testing ParaSail programs. The tutorial/workshop will finish with a group discussion and feedback on the experience of using this new language.", acknowledgement = ack-nhfb, fjournal = "ACM SIGADA Ada Letters", } @Article{vanCleeff:2011:IAM, author = "Andr{\'e} van Cleeff and Wolter Pieters and Roel Wieringa and Frits van Tiel", title = "Integrated assessment and mitigation of physical and digital security threats: Case studies on virtualization", journal = j-INFO-SEC-TECH-REP, volume = "16", number = "3--4", pages = "142--149", month = aug, year = "2011", CODEN = "ISTRFR", DOI = "https://doi.org/10.1016/j.istr.2011.08.003", ISSN = "1363-4127 (print), 1873-605X (electronic)", ISSN-L = "1363-4127", bibdate = "Sun May 8 07:58:42 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/infosectechrep.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1363412711000483", acknowledgement = ack-nhfb, ajournal = "Info. Sec. Tech. Rep.", fjournal = "Information Security Technical Report", journal-URL = "https://www.sciencedirect.com/journal/information-security-technical-report", } @Article{Wagner:2011:SJV, author = "Gregor Wagner and Andreas Gal and Michael Franz", title = "``Slimming'' a {Java} virtual machine by way of cold code removal and optimistic partial program loading", journal = j-SCI-COMPUT-PROGRAM, volume = "76", number = "11", pages = "1037--1053", day = "1", month = nov, year = "2011", CODEN = "SCPGD4", ISSN = "0167-6423 (print), 1872-7964 (electronic)", ISSN-L = "0167-6423", bibdate = "Tue Jun 21 10:31:56 MDT 2011", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2010.bib; https://www.math.utah.edu/pub/tex/bib/scicomputprogram.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www.sciencedirect.com/science/journal/01676423", acknowledgement = ack-nhfb, fjournal = "Science of Computer Programming", journal-URL = "http://www.sciencedirect.com/science/journal/01676423", } @Article{Wang:2011:RVM, author = "Kun Wang and Jia Rao and Cheng-Zhong Xu", title = "Rethink the virtual machine template", journal = j-SIGPLAN, volume = "46", number = "7", pages = "39--50", month = jul, year = "2011", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2007477.1952690", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Sep 16 10:02:34 MDT 2011", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @Article{Wang:2011:SHS, author = "Xiaolin Wang and Jiarui Zang and Zhenlin Wang and Yingwei Luo and Xiaoming Li", title = "Selective hardware\slash software memory virtualization", journal = j-SIGPLAN, volume = "46", number = "7", pages = "217--226", month = jul, year = "2011", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2007477.1952710", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Sep 16 10:02:34 MDT 2011", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @Article{Ward:2011:KRC, author = "Bob Ward", title = "{Kuck} Receives {Computer Pioneer Award}; {VMware}'s {Greene} and {Rosenblum} Win {Computer Entrepreneur Award}; Dozens of New {CSDP} and {CSDA} Holders Named", journal = j-COMPUTER, volume = "44", number = "6", pages = "89--91", month = jun, year = "2011", CODEN = "CPTRB4", DOI = "https://doi.org/10.1109/MC.2011.182", ISSN = "0018-9162 (print), 1558-0814 (electronic)", ISSN-L = "0018-9162", bibdate = "Sat Jun 18 09:39:04 2011", bibsource = "https://www.math.utah.edu/pub/tex/bib/computer2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Computer", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2", } @Article{Wei:2011:LPV, author = "Xiaohui Wei and Hongliang Li and Qingnan Guo and Na Jiang and Liang Hu", title = "{LimeVI}: A platform for virtual cluster live migration over {WAN}", journal = j-INT-J-COMPUT-SYST-SCI-ENG, volume = "26", number = "5", pages = "??--??", month = sep, year = "2011", CODEN = "CSSEEI", ISSN = "0267-6192", ISSN-L = "0267-6192", bibdate = "Tue Dec 3 12:04:33 MST 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/computsystscieng.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "International Journal of Computer Systems Science and Engineering", journal-URL = "http://www.crlpublishing.co.uk/csse", } @Article{Wood:2011:CDP, author = "Timothy Wood and K. K. Ramakrishnan and Prashant Shenoy and Jacobus van der Merwe", title = "{CloudNet}: dynamic pooling of cloud resources by live {WAN} migration of virtual machines", journal = j-SIGPLAN, volume = "46", number = "7", pages = "121--132", month = jul, year = "2011", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2007477.1952699", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Sep 16 10:02:34 MDT 2011", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @Article{Xia:2011:VWB, author = "Lei Xia and Sanjay Kumar and Xue Yang and Praveen Gopalakrishnan and York Liu and Sebastian Schoenberg and Xingang Guo", title = "Virtual {WiFi}: bring virtualization from wired to wireless", journal = j-SIGPLAN, volume = "46", number = "7", pages = "181--192", month = jul, year = "2011", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2007477.1952706", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Sep 16 10:02:34 MDT 2011", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @Article{Xiao:2011:HLM, author = "Jing Xiao and Min Zhu", title = "{HyperMonitor}: A lightweight multi-platform monitor based on hardware virtualization", journal = j-INT-J-COMPUT-SYST-SCI-ENG, volume = "26", number = "5", pages = "??--??", month = sep, year = "2011", CODEN = "CSSEEI", ISSN = "0267-6192", ISSN-L = "0267-6192", bibdate = "Tue Dec 3 12:04:33 MST 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/computsystscieng.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "International Journal of Computer Systems Science and Engineering", } @Article{Zhu:2011:OPV, author = "Jun Zhu and Zhefu Jiang and Zhen Xiao and Xiaoming Li", title = "Optimizing the Performance of Virtual Machine Synchronization for Fault Tolerance", journal = j-IEEE-TRANS-COMPUT, volume = "60", number = "12", pages = "1718--1729", month = dec, year = "2011", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.2010.224", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Sun Nov 6 07:52:27 MST 2011", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5629326", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Computers", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", } @Article{Abd-El-Malek:2012:FSV, author = "Michael Abd-El-Malek and Matthew Wachs and James Cipar and Karan Sanghi and Gregory R. Ganger and Garth A. Gibson and Michael K. Reiter", title = "File system virtual appliances: {Portable} file system implementations", journal = j-TOS, volume = "8", number = "3", pages = "9:1--9:??", month = sep, year = "2012", CODEN = "????", DOI = "https://doi.org/10.1145/2339118.2339120", ISSN = "1553-3077 (print), 1553-3093 (electronic)", ISSN-L = "1553-3077", bibdate = "Tue Nov 6 18:17:35 MST 2012", bibsource = "http://www.acm.org/pubs/contents/journals/tos/; https://www.math.utah.edu/pub/tex/bib/tos.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "File system virtual appliances (FSVAs) address the portability headaches that plague file system (FS) developers. By packaging their FS implementation in a virtual machine (VM), separate from the VM that runs user applications, they can avoid the need to port the file system to each operating system (OS) and OS version. A small FS-agnostic proxy, maintained by the core OS developers, connects the FSVA to whatever OS the user chooses. This article describes an FSVA design that maintains FS semantics for unmodified FS implementations and provides desired OS and virtualization features, such as a unified buffer cache and VM migration. Evaluation of prototype FSVA implementations in Linux and NetBSD, using Xen as the virtual machine manager (VMM), demonstrates that the FSVA architecture is efficient, FS-agnostic, and able to insulate file system implementations from OS differences that would otherwise require explicit porting.", acknowledgement = ack-nhfb, articleno = "9", fjournal = "ACM Transactions on Storage", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J960", } @Article{Aguiar:2012:CTF, author = "Alexandra Aguiar and Fabiano Hessel", title = "Current techniques and future trends in embedded system's virtualization", journal = j-SPE, volume = "42", number = "7", pages = "917--944", month = jul, year = "2012", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/spe.1156", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Tue Nov 6 17:14:11 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www3.interscience.wiley.com/journalfinder.html", acknowledgement = ack-nhfb, fjournal = "Software---Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", onlinedate = "29 Jan 2012", } @Article{Ahn:2012:RHA, author = "Jeongseob Ahn and Seongwook Jin and Jaehyuk Huh", title = "Revisiting hardware-assisted page walks for virtualized systems", journal = j-COMP-ARCH-NEWS, volume = "40", number = "3", pages = "476--487", month = jun, year = "2012", CODEN = "CANED2", DOI = "https://doi.org/10.1145/2366231.2337214", ISSN = "0163-5964 (print), 1943-5851 (electronic)", ISSN-L = "0163-5964", bibdate = "Thu Sep 6 10:21:07 MDT 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigarch.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "ISCA '12 conference proceedings.", abstract = "Recent improvements in architectural supports for virtualization have extended traditional hardware page walkers to traverse nested page tables. However, current two-dimensional (2D) page walkers have been designed under the assumption that the usage patterns of guest and nested page tables are similar. In this paper, we revisit the architectural supports for nested page table walks to incorporate the unique characteristics of memory management by hypervisors. Unlike page tables in native systems, nested page table sizes do not impose significant overheads on the overall memory usage. Based on this observation, we propose to use flat nested page tables to reduce unnecessary memory references for nested walks. A competing mechanism to HW 2D page walkers is shadow paging, which duplicates guest page tables but provides direct translations from guest virtual to system physical addresses. However, shadow paging has been suffering from the overheads of synchronization between guest and shadow page tables. The second mechanism we propose is a speculative shadow paging mechanism, called speculative inverted shadow paging, which is backed by non-speculative flat nested page tables. The speculative mechanism provides a direct translation with a single memory reference for common cases, and eliminates the page table synchronization overheads. We evaluate the proposed schemes with the real Xen hypervisor running on a full system simulator. The flat page tables improve a state-of-the-art 2D page walker with a page walk cache and nested TLB by 7\%. The speculative shadow paging improves the same 2D page walker by 14\%.", acknowledgement = ack-nhfb, fjournal = "ACM SIGARCH Computer Architecture News", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89", } @Article{Anderson:2012:MAN, author = "Paul Anderson and Shahriar Bijani and Alexandros Vichos", title = "Multi-agent Negotiation of Virtual Machine Migration Using the Lightweight Coordination Calculus", journal = j-LECT-NOTES-COMP-SCI, volume = "7327", pages = "124--133", year = "2012", CODEN = "LNCSD9", DOI = "https://doi.org/10.1007/978-3-642-30947-2_16", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Wed Dec 19 15:20:08 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/lncs2012e.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer.com/chapter/10.1007/978-3-642-30947-2_16/", acknowledgement = ack-nhfb, book-DOI = "https://doi.org/10.1007/978-3-642-30947-2", book-URL = "http://www.springerlink.com/content/978-3-642-30947-2", fjournal = "Lecture Notes in Computer Science", } @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; https://www.math.utah.edu/pub/tex/bib/virtual-machines.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", } @Article{Begnum:2012:SCO, author = "Kyrre Begnum", title = "Simplified cloud-oriented virtual machine management with {MLN}", journal = j-J-SUPERCOMPUTING, volume = "61", number = "2", pages = "251--266", month = aug, year = "2012", CODEN = "JOSUED", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Fri Oct 26 07:41:46 MDT 2012", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0920-8542&volume=61&issue=2; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0920-8542&volume=61&issue=2&spage=251", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Beloglazov:2012:OOD, author = "Anton Beloglazov and Rajkumar Buyya", title = "Optimal online deterministic algorithms and adaptive heuristics for energy and performance efficient dynamic consolidation of virtual machines in {Cloud} data centers", journal = j-CCPE, volume = "24", number = "13", pages = "1397--1420", day = "10", month = sep, year = "2012", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.1867", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Mon Nov 5 07:44:52 MST 2012", bibsource = "http://www.interscience.wiley.com/jpages/1532-0626; https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", onlinedate = "7 Oct 2011", } @Article{Bruening:2012:TDI, author = "Derek Bruening and Qin Zhao and Saman Amarasinghe", title = "Transparent dynamic instrumentation", journal = j-SIGPLAN, volume = "47", number = "7", pages = "133--144", month = jul, year = "2012", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2365864.2151043", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Sep 6 10:01:03 MDT 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "VEE '12 conference proceedings.", abstract = "Process virtualization provides a virtual execution environment within which an unmodified application can be monitored and controlled while it executes. The provided layer of control can be used for purposes ranging from sandboxing to compatibility to profiling. The additional operations required for this layer are performed clandestinely alongside regular program execution. Software dynamic instrumentation is one method for implementing process virtualization which dynamically instruments an application such that the application's code and the inserted code are interleaved together. DynamoRIO is a process virtualization system implemented using software code cache techniques that allows users to build customized dynamic instrumentation tools. There are many challenges to building such a runtime system. One major obstacle is transparency. In order to support executing arbitrary applications, DynamoRIO must be fully transparent so that an application cannot distinguish between running inside the virtual environment and native execution. In addition, any desired extra operations for a particular tool must avoid interfering with the behavior of the application. Transparency has historically been provided on an ad-hoc basis, as a reaction to observed problems in target applications. This paper identifies a necessary set of transparency requirements for running mainstream Windows and Linux applications. We discuss possible solutions to each transparency issue, evaluate tradeoffs between different choices, and identify cases where maintaining transparency is not practically solvable. We believe this will provide a guideline for better design and implementation of transparent dynamic instrumentation, as well as other similar process virtualization systems using software code caches.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @Article{Bugnion:2012:BVX, author = "Edouard Bugnion and Scott Devine and Mendel Rosenblum and Jeremy Sugerman and Edward Y. Wang", title = "Bringing Virtualization to the x86 Architecture with the Original {VMware} Workstation", journal = j-TOCS, volume = "30", number = "4", pages = "12:1--12:51", month = nov, year = "2012", CODEN = "ACSYEC", DOI = "https://doi.org/10.1145/2382553.2382554", ISSN = "0734-2071 (print), 1557-7333 (electronic)", ISSN-L = "0734-2071", bibdate = "Thu Nov 29 19:34:49 MST 2012", bibsource = "http://www.acm.org/pubs/contents/journals/tocs/; https://www.math.utah.edu/pub/tex/bib/tocs.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "This article describes the historical context, technical challenges, and main implementation techniques used by VMware Workstation to bring virtualization to the x86 architecture in 1999. Although virtual machine monitors (VMMs) had been around for decades, they were traditionally designed as part of monolithic, single-vendor architectures with explicit support for virtualization. In contrast, the x86 architecture lacked virtualization support, and the industry around it had disaggregated into an ecosystem, with different vendors controlling the computers, CPUs, peripherals, operating systems, and applications, none of them asking for virtualization. We chose to build our solution independently of these vendors. As a result, VMware Workstation had to deal with new challenges associated with (i) the lack of virtualization support in the x86 architecture, (ii) the daunting complexity of the architecture itself, (iii) the need to support a broad combination of peripherals, and (iv) the need to offer a simple user experience within existing environments. These new challenges led us to a novel combination of well-known virtualization techniques, techniques from other domains, and new techniques. VMware Workstation combined a hosted architecture with a VMM. The hosted architecture enabled a simple user experience and offered broad hardware compatibility. Rather than exposing I/O diversity to the virtual machines, VMware Workstation also relied on software emulation of I/O devices. The VMM combined a trap-and-emulate direct execution engine with a system-level dynamic binary translator to efficiently virtualize the x86 architecture and support most commodity operating systems. By relying on x86 hardware segmentation as a protection mechanism, the binary translator could execute translated code at near hardware speeds. The binary translator also relied on partial evaluation and adaptive retranslation to reduce the overall overheads of virtualization. Written with the benefit of hindsight, this article shares the key lessons we learned from building the original system and from its later evolution.", acknowledgement = ack-nhfb, articleno = "12", fjournal = "ACM Transactions on Computer Systems", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J774", } @Article{Cao:2012:EEA, author = "Jian Cao and Yihua Wu and Minglu Li", title = "Energy Efficient Allocation of Virtual Machines in Cloud Computing Environments Based on Demand Forecast", journal = j-LECT-NOTES-COMP-SCI, volume = "7296", pages = "137--151", year = "2012", CODEN = "LNCSD9", DOI = "https://doi.org/10.1007/978-3-642-30767-6_12", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Wed Dec 19 15:19:28 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/lncs2012d.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer.com/chapter/10.1007/978-3-642-30767-6_12/", acknowledgement = ack-nhfb, book-DOI = "https://doi.org/10.1007/978-3-642-30767-6", book-URL = "http://www.springerlink.com/content/978-3-642-30767-6", fjournal = "Lecture Notes in Computer Science", } @Article{Cao:2012:YYP, author = "Ting Cao and Stephen M. Blackburn and Tiejun Gao and Kathryn S. McKinley", title = "The yin and yang of power and performance for asymmetric hardware and managed software", journal = j-COMP-ARCH-NEWS, volume = "40", number = "3", pages = "225--236", month = jun, year = "2012", CODEN = "CANED2", DOI = "https://doi.org/10.1145/2366231.2337185", ISSN = "0163-5964 (print), 1943-5851 (electronic)", ISSN-L = "0163-5964", bibdate = "Thu Sep 6 10:21:07 MDT 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigarch.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "ISCA '12 conference proceedings.", abstract = "On the hardware side, asymmetric multicore processors present software with the challenge and opportunity of optimizing in two dimensions: performance and power. Asymmetric multicore processors (AMP) combine general-purpose big (fast, high power) cores and small (slow, low power) cores to meet power constraints. Realizing their energy efficiency opportunity requires workloads with differentiated performance and power characteristics. On the software side, managed workloads written in languages such as C\#, Java, JavaScript, and PHP are ubiquitous. Managed languages abstract over hardware using Virtual Machine (VM) services (garbage collection, interpretation, and/or just-in-time compilation) that together impose substantial energy and performance costs, ranging from 10\% to over 80\%. We show that these services manifest a differentiated performance and power workload. To differing degrees, they are parallel, asynchronous, communicate infrequently, and are not on the application?s critical path. We identify a synergy between AMP and VM services that we exploit to attack the 40\% average energy overhead due to VM services. Using measurements and very conservative models, we show that adding small cores tailored for VM services should deliver, at least, improvements in performance of 13\%, energy of 7\%, and performance per energy of 22\%. The yin of VM services is overhead, but it meets the yang of small cores on an AMP. The yin of AMP is exposed hardware complexity, but it meets the yang of abstraction in managed languages. VM services fulfill the AMP requirement for an asynchronous, non-critical, differentiated, parallel, and ubiquitous workload to deliver energy efficiency. Generalizing this approach beyond system software to applications will require substantially more software and hardware investment, but these results show the potential energy efficiency gains are significant.", acknowledgement = ack-nhfb, fjournal = "ACM SIGARCH Computer Architecture News", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89", } @Article{Carbone:2012:SRM, author = "Martim Carbone and Matthew Conover and Bruce Montague and Wenke Lee", title = "Secure and Robust Monitoring of Virtual Machines through Guest-Assisted Introspection", journal = j-LECT-NOTES-COMP-SCI, volume = "7462", pages = "22--41", year = "2012", CODEN = "LNCSD9", DOI = "https://doi.org/10.1007/978-3-642-33338-5_2", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Wed Dec 19 15:23:06 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/lncs2012h.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer.com/chapter/10.1007/978-3-642-33338-5_2/", acknowledgement = ack-nhfb, book-DOI = "https://doi.org/10.1007/978-3-642-33338-5", book-URL = "http://www.springerlink.com/content/978-3-642-33338-5", fjournal = "Lecture Notes in Computer Science", } @Article{Celesti:2012:VMP, author = "Antonio Celesti and Maria Fazio and Massimo Villari and Antonio Puliafito", title = "Virtual machine provisioning through satellite communications in federated {Cloud} environments", journal = j-FUT-GEN-COMP-SYS, volume = "28", number = "1", pages = "85--93", month = jan, year = "2012", CODEN = "FGSEVI", DOI = "https://doi.org/10.1016/j.future.2011.05.021", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Thu Mar 8 07:52:12 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www.sciencedirect.com/science/journal/0167739X", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X11001038", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Chakraborty:2012:SOV, author = "Koushik Chakraborty and Philip M. Wells and Gurindar S. Sohi", title = "Supporting Overcommitted Virtual Machines through Hardware Spin Detection", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "23", number = "2", pages = "353--366", month = feb, year = "2012", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2011.143", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Thu Mar 01 14:47:13 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Parallel and Distributed Systems", journal-URL = "http://www.computer.org/tpds/archives.htm", } @Article{Chandak:2012:DLB, author = "Akshay Chandak and Krishnakant Jaju and Akshay Kanfade and Amit Joshi and Pushkar Lohiya", title = "Dynamic Load Balancing of Virtual Machines using {QEMU-KVM}", journal = j-INT-J-COMP-APPL, volume = "46", number = "??", pages = "10--14", month = may, year = "2012", CODEN = "????", DOI = "https://doi.org/10.5120/6910-9263", ISSN = "0975-8887", ISSN-L = "0975-8887", bibdate = "Fri Jan 24 08:44:51 MST 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcompappl.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.ijcaonline.org/archives/volume46/number6/6910-9263/", acknowledgement = ack-nhfb, ajournal = "Intern. J. of Computer Applications", articleno = "6", fjournal = "International Journal of Computer Applications", journal-URL = "https://www.ijcaonline.org/", } @Article{Chen:2012:FGP, author = "Jianhai Chen and Dawei Huang and Bei Wang", title = "A Fine-Grained Performance-Based Decision Model for Virtualization Application Solution", journal = j-LECT-NOTES-COMP-SCI, volume = "7144", pages = "180--195", year = "2012", CODEN = "LNCSD9", DOI = "https://doi.org/10.1007/978-3-642-32627-1_13", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Wed Dec 19 15:25:01 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/lncs2012b.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer.com/chapter/10.1007/978-3-642-32627-1_13/", acknowledgement = ack-nhfb, book-DOI = "https://doi.org/10.1007/978-3-642-32627-1", book-URL = "http://www.springerlink.com/content/978-3-642-32627-1", fjournal = "Lecture Notes in Computer Science", } @Article{Cheng:2012:VBP, author = "Yueqiang Cheng and Xuhua Ding", title = "Virtualization Based Password Protection against Malware in Untrusted Operating Systems", journal = j-LECT-NOTES-COMP-SCI, volume = "7344", pages = "201--218", year = "2012", CODEN = "LNCSD9", DOI = "https://doi.org/10.1007/978-3-642-30921-2_12", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Wed Dec 19 15:20:31 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/lncs2012e.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer.com/chapter/10.1007/978-3-642-30921-2_12/", acknowledgement = ack-nhfb, book-DOI = "https://doi.org/10.1007/978-3-642-30921-2", book-URL = "http://www.springerlink.com/content/978-3-642-30921-2", fjournal = "Lecture Notes in Computer Science", } @Article{Cheriton:2012:HAS, author = "David Cheriton and Amin Firoozshahian and Alex Solomatnikov and John P. Stevenson and Omid Azizi", title = "{HICAMP}: architectural support for efficient concurrency-safe shared structured data access", journal = j-COMP-ARCH-NEWS, volume = "40", number = "1", pages = "287--300", month = mar, year = "2012", CODEN = "CANED2", DOI = "https://doi.org/10.1145/2189750.2151007", ISSN = "0163-5964 (print), 1943-5851 (electronic)", ISSN-L = "0163-5964", bibdate = "Fri Jun 1 17:06:46 MDT 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigarch.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "ASPLOS '12 conference proceedings.", abstract = "Programming language and operating system support for efficient concurrency-safe access to shared data is a key concern for the effective use of multi-core processors. Most research has focused on the software model of multiple threads accessing this data within a single shared address space. However, many real applications are actually structured as multiple separate processes for fault isolation and simplified synchronization. In this paper, we describe the HICAMP architecture and its innovative memory system, which supports efficient concurrency safe access to structured shared data without incurring the overhead of inter-process communication. The HICAMP architecture also provides support for programming language and OS structures such as threads, iterators, read-only access and atomic update. In addition to demonstrating that HICAMP is beneficial for multi-process structured applications, our evaluation shows that the same mechanisms provide substantial benefits for other areas, including sparse matrix computations and virtualization.", acknowledgement = ack-nhfb, fjournal = "ACM SIGARCH Computer Architecture News", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89", } @Article{Chevalier-Boisvert:2012:BSH, author = "Maxime Chevalier-Boisvert and Erick Lavoie and Marc Feeley and Bruno Dufour", title = "Bootstrapping a self-hosted research virtual machine for {JavaScript}: an experience report", journal = j-SIGPLAN, volume = "47", number = "2", pages = "61--72", month = feb, year = "2012", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2168696.2047858", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Apr 20 17:34:09 MDT 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/java2010.bib; https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "JavaScript is one of the most widely used dynamic languages. The performance of existing JavaScript VMs, however, is lower than that of VMs for static languages. There is a need for a research VM to easily explore new implementation approaches. This paper presents the Tachyon JavaScript VM which was designed to be flexible and to allow experimenting with new approaches for the execution of JavaScript. The Tachyon VM is itself implemented in JavaScript and currently supports a subset of the full language that is sufficient to bootstrap itself. The paper discusses the architecture of the system and in particular the bootstrapping of a self-hosted VM. Preliminary performance results indicate that our VM, with few optimizations, can already execute code faster than a commercial JavaScript interpreter on some benchmarks.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "DSL '11 conference proceedings.", } @Article{Chowdhury:2012:VVN, author = "Mosharaf Chowdhury and Muntasir Raihan Rahman and Raouf Boutaba", title = "{ViNEYard}: virtual network embedding algorithms with coordinated node and link mapping", journal = j-IEEE-TRANS-NETWORKING, volume = "20", number = "1", pages = "206--219", month = feb, year = "2012", CODEN = "IEANEP", DOI = "https://doi.org/10.1109/TNET.2011.2159308", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Mon Apr 9 17:46:48 MDT 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Network virtualization allows multiple heterogeneous virtual networks (VNs) to coexist on a shared infrastructure. Efficient mapping of virtual nodes and virtual links of a VN request onto substrate network resources, also known as the VN embedding problem, is the first step toward enabling such multiplicity. Since this problem is known to be -hard, previous research focused on designing heuristic-based algorithms that had clear separation between the node mapping and the link mapping phases. In this paper, we present ViNEYard--a collection of VN embedding algorithms that leverage better coordination between the two phases. We formulate the VN embedding problem as a mixed integer program through substrate network augmentation.We then relax the integer constraints to obtain a linear program and devise two online VN embedding algorithms D-ViNE and R-ViNE using deterministic and randomized rounding techniques, respectively. We also present a generalized window-based VN embedding algorithm (WiNE) to evaluate the effect of lookahead on VN embedding. Our simulation experiments on a large mix of VN requests show that the proposed algorithms increase the acceptance ratio and the revenue while decreasing the cost incurred by the substrate network in the long run.", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771", } @Article{Chrobot:2012:DMV, author = "Arkadiusz Chrobot and Maciej Lasota and Grzegorz {\L}ukawski and Krzysztof Sapiecha", title = "Distributed Memory Virtualization with the Use of {SDDSfL}", journal = j-LECT-NOTES-COMP-SCI, volume = "7204", pages = "141--150", year = "2012", CODEN = "LNCSD9", DOI = "https://doi.org/10.1007/978-3-642-31500-8_15", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Wed Dec 19 15:26:14 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/lncs2012c.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer.com/chapter/10.1007/978-3-642-31500-8_15/", acknowledgement = ack-nhfb, book-DOI = "https://doi.org/10.1007/978-3-642-31500-8", book-URL = "http://www.springerlink.com/content/978-3-642-31500-8", fjournal = "Lecture Notes in Computer Science", } @TechReport{Cox:2012:REM, author = "Russ Cox", title = "Regular Expression Matching with a Trigram Index, or {How Google Code} Search worked", type = "Report", institution = "swtch.com", address = "Cambridge, MA, USA", month = jan, year = "2012", bibdate = "Tue Mar 27 11:39:17 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/plan9.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "See also \cite{Thompson:1968:PTR,Kernighan:1999:REL,Cox:2007:REM,Cox:2009:REM,Cox:2010:REM}", URL = "http://swtch.com/~rsc/regexp/regexp4.html", acknowledgement = ack-nhfb, } @Article{Dall:2012:DIE, author = "Christoffer Dall and Jeremy Andrus and Alexander Van't Hof and Oren Laadan and Jason Nieh", title = "The Design, Implementation, and Evaluation of Cells: a Virtual {Smartphone} Architecture", journal = j-TOCS, volume = "30", number = "3", pages = "9:1--9:??", month = aug, year = "2012", CODEN = "ACSYEC", DOI = "https://doi.org/10.1145/2324876.2324877", ISSN = "0734-2071 (print), 1557-7333 (electronic)", ISSN-L = "0734-2071", bibdate = "Mon Aug 20 16:33:58 MDT 2012", bibsource = "http://www.acm.org/pubs/contents/journals/tocs/; https://www.math.utah.edu/pub/tex/bib/tocs.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Smartphones are increasingly ubiquitous, and many users carry multiple phones to accommodate work, personal, and geographic mobility needs. We present Cells, a virtualization architecture for enabling multiple virtual smartphones to run simultaneously on the same physical cellphone in an isolated, secure manner. Cells introduces a usage model of having one foreground virtual phone and multiple background virtual phones. This model enables a new device namespace mechanism and novel device proxies that integrate with lightweight operating system virtualization to multiplex phone hardware across multiple virtual phones while providing native hardware device performance. Cells virtual phone features include fully accelerated 3D graphics, complete power management features, and full telephony functionality with separately assignable telephone numbers and caller ID support. We have implemented a prototype of Cells that supports multiple Android virtual phones on the same phone. Our performance results demonstrate that Cells imposes only modest runtime and memory overhead, works seamlessly across multiple hardware devices including Google Nexus 1 and Nexus S phones, and transparently runs Android applications at native speed without any modifications.", acknowledgement = ack-nhfb, articleno = "9", fjournal = "ACM Transactions on Computer Systems", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J774", } @Article{Danielsson:2012:OSU, author = "Nils Anders Danielsson", title = "Operational semantics using the partiality monad", journal = j-SIGPLAN, volume = "47", number = "9", pages = "127--138", month = sep, year = "2012", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2398856.2364546", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Nov 15 16:40:19 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "The operational semantics of a partial, functional language is often given as a relation rather than as a function. The latter approach is arguably more natural: if the language is functional, why not take advantage of this when defining the semantics? One can immediately see that a functional semantics is deterministic and, in a constructive setting, computable. This paper shows how one can use the coinductive partiality monad to define big-step or small-step operational semantics for lambda-calculi and virtual machines as total, computable functions (total definitional interpreters). To demonstrate that the resulting semantics are useful type soundness and compiler correctness results are also proved. The results have been implemented and checked using Agda, a dependently typed programming language and proof assistant.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "ICFP '12 conference proceedings.", } @Article{Deb:2012:HSC, author = "Abhishek Deb and Josep Maria Codina and Antonio Gonzalez", title = "A {HW\slash SW} Co-designed Programmable Functional Unit", journal = j-IEEE-COMPUT-ARCHIT-LETT, volume = "11", number = "1", pages = "9--12", month = jan # "\slash " # jun, year = "2012", CODEN = "????", DOI = "https://doi.org/10.1109/L-CA.2011.23", ISSN = "1556-6056 (print), 1556-6064 (electronic)", ISSN-L = "1556-6056", bibdate = "Thu Jun 20 17:18:18 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeecomputarchitlett.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "In this paper, we propose a novel programmable functional unit (PFU) to accelerate general purpose application execution on a modern out-of-order x86 processor. Code is transformed and instructions are generated that run on the PFU using a co-designed virtual machine (Cd-VM). Results presented in this paper show that this HW/SW co-designed approach produces average speedups in performance of 29\% in SPECFP and 19\% in SPECINT, and up-to 55\%, over modern out-of-order processor.", acknowledgement = ack-nhfb, affiliation = "Deb, A (Reprint Author), Univ Politecn Cataluna, C Jordi Girona 1-3, Barcelona, Spain. Deb, Abhishek; Gonzalez, Antonio, Univ Politecn Cataluna, Barcelona, Spain. Maria Codina, Josep; Gonzalez, Antonio, Intel Res Labs Barcelona, Barcelona, Spain.", author-email = "abhishek@ac.upc.edu josep.m.codina@intel.com antonio@intel.com", da = "2019-06-20", doc-delivery-number = "953VM", fjournal = "IEEE Computer Architecture Letters", journal-iso = "IEEE Comput. Archit. Lett.", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=10208", keywords = "Computer architecture; hardware-software codesign; Hardware/software interfaces; hw/sw co-designed; Interface states; Load modeling; Micro-architecture implementation considerations; Microarchitecture; Processor Architectures; programmable functional unit; Programmable functional units; Registers; virtual machine", number-of-cited-references = "13", ORCID-numbers = "Gonzalez, Antonio/0000-0002-0009-0996", research-areas = "Computer Science", researcherid-numbers = "Gonzalez, Antonio/I-2961-2014", times-cited = "0", unique-id = "Deb:2012:HSC", web-of-science-categories = "Computer Science, Hardware \& Architecture", } @Article{Dong:2012:HPN, author = "Yaozu Dong and Xiaowei Yang and Jianhui Li and Guangdeng Liao and Kun Tian and Haibing Guan", title = "High performance network virtualization with {SR-IOV}", journal = j-J-PAR-DIST-COMP, volume = "72", number = "11", pages = "1471--1480", month = nov, year = "2012", CODEN = "JPDCER", DOI = "https://doi.org/10.1016/j.jpdc.2012.01.020", ISSN = "0743-7315 (print), 1096-0848 (electronic)", ISSN-L = "0743-7315", bibdate = "Wed Sep 12 12:11:36 MDT 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www.sciencedirect.com/science/journal/07437315", URL = "http://www.sciencedirect.com/science/article/pii/S0743731512000329", acknowledgement = ack-nhfb, fjournal = "Journal of Parallel and Distributed Computing", journal-URL = "http://www.sciencedirect.com/science/journal/07437315", } @Article{Dong:2012:RAE, author = "Yaozu Dong and Yu Chen and Zhenhao Pan and Jinquan Dai and Yunhong Jiang", title = "{ReNIC}: Architectural extension to {SR-IOV} {I/O} virtualization for efficient replication", journal = j-TACO, volume = "8", number = "4", pages = "40:1--40:??", month = jan, year = "2012", CODEN = "????", DOI = "https://doi.org/10.1145/2086696.2086719", ISSN = "1544-3566 (print), 1544-3973 (electronic)", ISSN-L = "1544-3566", bibdate = "Sat Jan 21 07:49:49 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/taco.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Virtualization is gaining popularity in cloud computing and has become the key enabling technology in cloud infrastructure. By replicating the virtual server state to multiple independent platforms, virtualization improves the reliability and availability of cloud systems. Unfortunately, existing Virtual Machine (VM) replication solutions were designed only for software virtualized I/O, which suffers from large performance and scalability overheads. Although hardware-assisted I/O virtualization (such as SR-IOV) can achieve close to native performance and very good scalability, they cannot be properly replicated across different physical machines due to architectural limitations (such as lack of efficient device state read/write, buffering outbound packets, etc.) .", acknowledgement = ack-nhfb, articleno = "40", fjournal = "ACM Transactions on Architecture and Code Optimization (TACO)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J924", } @Article{Fagin:2012:DSG, author = "Barry Fagin and Dale Skrien", title = "Debugging on the Shoulders of Giants: {von Neumann}'s Programs 65 Years Later", journal = j-COMPUTER, volume = "45", number = "11", pages = "59--68", month = nov, year = "2012", CODEN = "CPTRB4", DOI = "https://doi.org/10.1109/MC.2012.69", ISSN = "0018-9162 (print), 1558-0814 (electronic)", ISSN-L = "0018-9162", bibdate = "Wed Nov 14 18:24:24 2012", bibsource = "https://www.math.utah.edu/pub/bibnet/authors/v/von-neumann-john.bib; https://www.math.utah.edu/pub/tex/bib/computer2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "See \cite{Fagin:2011:IPE} for a description of the emulator on which von Neumann's programs were run and debugged.", URL = "http://www.cs.colby.edu/djskrien/IASSim/", acknowledgement = ack-nhfb, fjournal = "Computer", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2", lastaccessed = "17 November 2012", remark = "From page 59: ``The evidence suggests that at least a few of the programs, which appeared in both IAS technical reports and later in \booktitle{John von Neumann: Collected Works}, were never directly executed on the machine as written. Allowing for typographical errors, at least a few of them contain nontrivial bugs. Our emulator validated corrected versions of all the programs in the original IAS reports, producing the expected results.''", } @Article{Feng:2012:IDU, author = "Zhenqian Feng and Bing Bai and Baokang Zhao and Jinshu Su", title = "{ICTree}: discovering the underlying connections of your rental virtual machines in the public clouds", journal = j-INT-J-COMPUT-SYST-SCI-ENG, volume = "27", number = "6", pages = "??--??", month = "????", year = "2012", CODEN = "CSSEEI", ISSN = "0267-6192", ISSN-L = "0267-6192", bibdate = "Tue Dec 3 12:04:33 MST 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/computsystscieng.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "International Journal of Computer Systems Science and Engineering", } @Article{Gerofi:2012:ETT, author = "Balazs Gerofi and Yutaka Ishikawa", title = "Enhancing {TCP} throughput of highly available virtual machines via speculative communication", journal = j-SIGPLAN, volume = "47", number = "7", pages = "87--96", month = jul, year = "2012", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2365864.2151038", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Sep 6 10:01:03 MDT 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "VEE '12 conference proceedings.", abstract = "Checkpoint-recovery based virtual machine (VM) replication is an attractive technique for accommodating VM installations with high-availability. It provides seamless failover for the entire software stack executed in the VM regardless the application or the underlying operating system (OS), it runs on commodity hardware, and it is inherently capable of dealing with shared memory non-determinism of symmetric multiprocessing (SMP) configurations. There have been several studies aiming at alleviating the overhead of replication, however, due to consistency requirements, network performance of the basic replication mechanism remains extremely poor., In this paper we revisit the replication protocol and extend it with speculative communication. Speculative communication silently acknowledges TCP packets of the VM, enabling the guest's TCP stack to progress with transmission without exposing the messages to the clients before the corresponding execution state is checkpointed to the backup host. Furthermore, we propose replication aware congestion control, an extension to the guest's TCP stack that aggressively fills up the VMM's replication buffer so that speculative packets can be backed up and released earlier to the clients. We observe up to an order of magnitude improvement in bulk data transfer with speculative communication, and close to native VM network performance when replication awareness is enabled in the guest OS. We provide results of micro-, as well as application-level benchmarks.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @Article{Ghosh:2012:RAA, author = "Sudeep Ghosh and Jason Hiser and Jack W. Davidson", title = "Replacement attacks against {VM}-protected applications", journal = j-SIGPLAN, volume = "47", number = "7", pages = "203--214", month = jul, year = "2012", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2365864.2151051", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Sep 6 10:01:03 MDT 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "VEE '12 conference proceedings.", abstract = "Process-level virtualization is increasingly being used to enhance the security of software applications from reverse engineering and unauthorized modification (called software protection). Process-level virtual machines (PVMs) can safeguard the application code at run time and hamper the adversary's ability to launch dynamic attacks on the application. This dynamic protection, combined with its flexibility, ease in handling legacy systems and low performance overhead, has made process-level virtualization a popular approach for providing software protection. While there has been much research on using process-level virtualization to provide such protection, there has been less research on attacks against PVM-protected software. In this paper, we describe an attack on applications protected using process-level virtualization, called a replacement attack. In a replacement attack, the adversary replaces the protecting PVM with an attack VM thereby rendering the application vulnerable to analysis and modification. We present a general description of the replacement attack methodology and two attack implementations against a protected application using freely available tools. The generality and simplicity of replacement attacks demonstrates that there is a strong need to develop techniques that meld applications more tightly to the protecting PVM to prevent such attacks.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @Article{Ghumre:2012:ENC, author = "Pooja Ghumre and Junwei Li and Mukil Kesavan and Ada Gavrilovska and Karsten Schwan", title = "Evaluating the need for complexity in energy-aware management for cloud platforms", journal = j-SIGMETRICS, volume = "40", number = "3", pages = "23--27", month = dec, year = "2012", CODEN = "????", DOI = "https://doi.org/10.1145/2425248.2425254", ISSN = "0163-5999 (print), 1557-9484 (electronic)", ISSN-L = "0163-5999", bibdate = "Sun May 5 09:58:20 MDT 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigmetrics.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "In order to curtail the continuous increase in power consumption of modern datacenters, researchers are responding with sophisticated energy-aware workload management methods. This increases the complexity and cost of the management operation, and may lead to increases in failure rates. The goal of this paper is to illustrate that there exists considerable diversity in the effectiveness of different, potentially 'smarter' workload management methods depending on the target metric or the characteristics of the workload being managed. We conduct experiments on a datacenter prototype platform, virtualized with the VMware vSphere software, and using representative cloud applications --- a distributed key-value store and a map-reduce computation. We observe that, on our testbed, different workload placement decisions may be quite effective for some metrics, but may lead to only marginal impact on others. In particular, we are considering the impact on energy-related metrics, such as power or temperature, as corresponding energy-aware management methods typically come with greater complexity due to fact that they must consider the complex energy consumption trends of various components in the cloud infrastructure. We show that for certain applications, such costs can be avoided, as different management policies and placement decisions have marginal impact on the target metric. The objective is to understand whether for certain classes of applications, and/or application configurations, it is necessary to incur, or if it is benefitial to avoid, the use of complex management methods.", acknowledgement = ack-nhfb, fjournal = "ACM SIGMETRICS Performance Evaluation Review", journal-URL = "http://portal.acm.org/toc.cfm?id=J618", } @Article{Gordon:2012:EBM, author = "Abel Gordon and Nadav Amit and Nadav Har'El and Muli Ben-Yehuda and Alex Landau and Assaf Schuster and Dan Tsafrir", title = "{ELI}: bare-metal performance for {I/O} virtualization", journal = j-COMP-ARCH-NEWS, volume = "40", number = "1", pages = "411--422", month = mar, year = "2012", CODEN = "CANED2", DOI = "https://doi.org/10.1145/2189750.2151020", ISSN = "0163-5964 (print), 1943-5851 (electronic)", ISSN-L = "0163-5964", bibdate = "Fri Jun 1 17:06:46 MDT 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigarch.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "ASPLOS '12 conference proceedings.", abstract = "Direct device assignment enhances the performance of guest virtual machines by allowing them to communicate with I/O devices without host involvement. But even with device assignment, guests are still unable to approach bare-metal performance, because the host intercepts all interrupts, including those interrupts generated by assigned devices to signal to guests the completion of their I/O requests. The host involvement induces multiple unwarranted guest/host context switches, which significantly hamper the performance of I/O intensive workloads. To solve this problem, we present ELI (ExitLess Interrupts), a software-only approach for handling interrupts within guest virtual machines directly and securely. By removing the host from the interrupt handling path, ELI manages to improve the throughput and latency of unmodified, untrusted guests by 1.3x-1.6x, allowing them to reach 97\%-100\% of bare-metal performance even for the most demanding I/O-intensive workloads.", acknowledgement = ack-nhfb, fjournal = "ACM SIGARCH Computer Architecture News", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89", } @Article{Huang:2012:PEN, author = "Shu Huang and Ilia Baldine", title = "Performance Evaluation of {10GE NICs} with {SR-IOV} Support: {I/O} Virtualization and Network Stack Optimizations", journal = j-LECT-NOTES-COMP-SCI, volume = "7201", pages = "197--205", year = "2012", CODEN = "LNCSD9", DOI = "https://doi.org/10.1007/978-3-642-28540-0_14", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Wed Dec 19 15:26:10 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/lncs2012c.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer.com/chapter/10.1007/978-3-642-28540-0_14/", acknowledgement = ack-nhfb, book-DOI = "https://doi.org/10.1007/978-3-642-28540-0", book-URL = "http://www.springerlink.com/content/978-3-642-28540-0", fjournal = "Lecture Notes in Computer Science", } @Article{Huang:2012:VAJ, author = "Ting-Chang Huang and Da-Wei Chang", title = "{VM} aware journaling: improving journaling file system performance in virtualization environments", journal = j-SPE, volume = "42", number = "3", pages = "303--330", month = mar, year = "2012", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/spe.1069", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Wed Apr 4 09:38:34 MDT 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www3.interscience.wiley.com/journalfinder.html", acknowledgement = ack-nhfb, fjournal = "Software---Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", onlinedate = "30 Mar 2011", } @Article{Hudic:2012:PCC, author = "Aleksandar Hudic and Edgar Weippl", title = "Private Cloud Computing: Consolidation, Virtualization, and Service-Oriented Infrastructure", journal = j-COMPUT-SECUR, volume = "31", number = "4", pages = "629--629", month = jun, year = "2012", CODEN = "CPSEDU", ISSN = "0167-4048 (print), 1872-6208 (electronic)", ISSN-L = "0167-4048", bibdate = "Mon Sep 23 09:46:28 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.sciencedirect.com/science/article/pii/S0167404812000612", acknowledgement = ack-nhfb, fjournal = "Computers \& Security", journal-URL = "https://www.sciencedirect.com/science/journal/01674048", } @Article{Jamthagen:2012:TRD, author = "Christopher J{\"a}mthagen and Martin Hell and Ben Smeets", title = "A Technique for Remote Detection of Certain Virtual Machine Monitors", journal = j-LECT-NOTES-COMP-SCI, volume = "7222", pages = "129--137", year = "2012", CODEN = "LNCSD9", DOI = "https://doi.org/10.1007/978-3-642-32298-3_9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Wed Dec 19 15:17:56 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/lncs2012c.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer.com/chapter/10.1007/978-3-642-32298-3_9/", acknowledgement = ack-nhfb, book-DOI = "https://doi.org/10.1007/978-3-642-32298-3", book-URL = "http://www.springerlink.com/content/978-3-642-32298-3", fjournal = "Lecture Notes in Computer Science", } @Article{Jarraya:2012:FVS, author = "Yosr Jarraya and Arash Eghtesadi", title = "Formal Verification of Security Preservation for Migrating Virtual Machines in the Cloud", journal = j-LECT-NOTES-COMP-SCI, volume = "7596", pages = "111--125", year = "2012", CODEN = "LNCSD9", DOI = "https://doi.org/10.1007/978-3-642-33536-5_12", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Wed Dec 19 15:25:31 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/lncs2012j.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer.com/chapter/10.1007/978-3-642-33536-5_12/", acknowledgement = ack-nhfb, book-DOI = "https://doi.org/10.1007/978-3-642-33536-5", book-URL = "http://www.springerlink.com/content/978-3-642-33536-5", fjournal = "Lecture Notes in Computer Science", } @Article{Jeyarani:2012:DIA, author = "R. Jeyarani and N. Nagaveni and R. Vasanth Ram", title = "Design and implementation of adaptive power-aware virtual machine provisioner ({APA--VMP}) using swarm intelligence", journal = j-FUT-GEN-COMP-SYS, volume = "28", number = "5", pages = "811--821", month = may, year = "2012", CODEN = "FGSEVI", DOI = "https://doi.org/10.1016/j.future.2011.06.002", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Thu Mar 8 07:52:21 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www.sciencedirect.com/science/journal/0167739X", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X11001130", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Jiang:2012:UNG, author = "Haitao Jiang and Yun Xu and Yin Liao and Guojie Jin and Guoliang Chen", title = "{UKCF}: a New Graphics Driver Cross-Platform Translation Framework for Virtual Machines", journal = j-LECT-NOTES-COMP-SCI, volume = "7513", pages = "156--163", year = "2012", CODEN = "LNCSD9", DOI = "https://doi.org/10.1007/978-3-642-35606-3_18", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Wed Dec 19 15:24:06 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/lncs2012i.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer.com/chapter/10.1007/978-3-642-35606-3_18/", acknowledgement = ack-nhfb, book-DOI = "https://doi.org/10.1007/978-3-642-35606-3", book-URL = "http://www.springerlink.com/content/978-3-642-35606-3", fjournal = "Lecture Notes in Computer Science", } @Article{Klein:2012:RVM, author = "Casey Klein and Matthew Flatt and Robert Bruce Findler", title = "The {Racket} virtual machine and randomized testing", journal = j-HIGHER-ORDER-SYMB-COMPUT, volume = "25", number = "2--4", pages = "209--253", month = dec, year = "2012", CODEN = "LSCOEX", DOI = "https://doi.org/10.1007/s10990-013-9091-1", ISSN = "1388-3690 (print), 1573-0557 (electronic)", bibdate = "Thu Dec 8 13:59:27 MST 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/higherordersymbcomput.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer.com/accesspage/article/10.1007/s10990-013-9091-1; http://link.springer.com/article/10.1007/s10990-013-9091-1", acknowledgement = ack-nhfb, fjournal = "Higher-Order and Symbolic Computation", journal-URL = "http://link.springer.com/journal/10990", keywords = "MzScheme; Racket virtual machine and bytecode verifier; VLISP project", } @Article{Koksal:2012:CC, author = "Ali Sinan K{\"o}ksal and Viktor Kuncak and Philippe Suter", title = "Constraints as control", journal = j-SIGPLAN, volume = "47", number = "1", pages = "151--164", month = jan, year = "2012", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2103621.2103675", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Mar 15 18:16:55 MDT 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "We present an extension of Scala that supports constraint programming over bounded and unbounded domains. The resulting language, Kaplan, provides the benefits of constraint programming while preserving the existing features of Scala. Kaplan integrates constraint and imperative programming by using constraints as an advanced control structure; the developers use the monadic 'for' construct to iterate over the solutions of constraints or branch on the existence of a solution. The constructs we introduce have simple semantics that can be understood as explicit enumeration of values, but are implemented more efficiently using symbolic reasoning. Kaplan programs can manipulate constraints at run-time, with the combined benefits of type-safe syntax trees and first-class functions. The language of constraints is a functional subset of Scala, supporting arbitrary recursive function definitions over algebraic data types, sets, maps, and integers. Our implementation runs on a platform combining a constraint solver with a standard virtual machine. For constraint solving we use an algorithm that handles recursive function definitions through fair function unrolling and builds upon the state-of-the art SMT solver Z3. We evaluate Kaplan on examples ranging from enumeration of data structures to execution of declarative specifications. We found Kaplan promising because it is expressive, supporting a range of problem domains, while enabling full-speed execution of programs that do not rely on constraint programming.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "POPL '12 conference proceedings.", } @Article{Kounga:2012:ESP, author = "Gina Kounga and Liqun Chen", title = "Enforcing Sticky Policies with {TPM} and Virtualization", journal = j-LECT-NOTES-COMP-SCI, volume = "7222", pages = "32--47", year = "2012", CODEN = "LNCSD9", DOI = "https://doi.org/10.1007/978-3-642-32298-3_3", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Wed Dec 19 15:17:56 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/lncs2012c.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer.com/chapter/10.1007/978-3-642-32298-3_3/", acknowledgement = ack-nhfb, book-DOI = "https://doi.org/10.1007/978-3-642-32298-3", book-URL = "http://www.springerlink.com/content/978-3-642-32298-3", fjournal = "Lecture Notes in Computer Science", } @Article{Kundu:2012:MVA, author = "Sajib Kundu and Raju Rangaswami and Ajay Gulati and Ming Zhao and Kaushik Dutta", title = "Modeling virtualized applications using machine learning techniques", journal = j-SIGPLAN, volume = "47", number = "7", pages = "3--14", month = jul, year = "2012", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2365864.2151028", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Sep 6 10:01:03 MDT 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "VEE '12 conference proceedings.", abstract = "With the growing adoption of virtualized datacenters and cloud hosting services, the allocation and sizing of resources such as CPU, memory, and I/O bandwidth for virtual machines (VMs) is becoming increasingly important. Accurate performance modeling of an application would help users in better VM sizing, thus reducing costs. It can also benefit cloud service providers who can offer a new charging model based on the VMs' performance instead of their configured sizes. In this paper, we present techniques to model the performance of a VM-hosted application as a function of the resources allocated to the VM and the resource contention it experiences. To address this multi-dimensional modeling problem, we propose and refine the use of two machine learning techniques: artificial neural network (ANN) and support vector machine (SVM). We evaluate these modeling techniques using five virtualized applications from the RUBiS and Filebench suite of benchmarks and demonstrate that their median and 90th percentile prediction errors are within 4.36\% and 29.17\% respectively. These results are substantially better than regression based approaches as well as direct applications of machine learning techniques without our refinements. We also present a simple and effective approach to VM sizing and empirically demonstrate that it can deliver optimal results for 65\% of the sizing problems that we studied and produces close-to-optimal sizes for the remaining 35\%.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @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; https://www.math.utah.edu/pub/tex/bib/virtual-machines.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", } @Article{Li:2012:CVS, author = "Jianxin Li and Bo Li and Tianyu Wo and Chunming Hu and Jinpeng Huai and Lu Liu and K. P. Lam", title = "{CyberGuarder}: a virtualization security assurance architecture for green cloud computing", journal = j-FUT-GEN-COMP-SYS, volume = "28", number = "2", pages = "379--390", month = feb, year = "2012", CODEN = "FGSEVI", DOI = "https://doi.org/10.1016/j.future.2011.04.012", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Thu Mar 8 07:52:16 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www.sciencedirect.com/science/journal/0167739X", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X1100063X", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Li:2012:GCV, author = "Guodong Li and Peng Li and Geof Sawaya and Ganesh Gopalakrishnan and Indradeep Ghosh and Sreeranga P. Rajan", title = "{GKLEE}: concolic verification and test generation for {GPUs}", journal = j-SIGPLAN, volume = "47", number = "8", pages = "215--224", month = aug, year = "2012", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2370036.2145844", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Sep 12 12:11:57 MDT 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "PPOPP '12 conference proceedings.", abstract = "Programs written for GPUs often contain correctness errors such as races, deadlocks, or may compute the wrong result. Existing debugging tools often miss these errors because of their limited input-space and execution-space exploration. Existing tools based on conservative static analysis or conservative modeling of SIMD concurrency generate false alarms resulting in wasted bug-hunting. They also often do not target performance bugs (non-coalesced memory accesses, memory bank conflicts, and divergent warps). We provide a new framework called GKLEE that can analyze C++ GPU programs, locating the aforesaid correctness and performance bugs. For these programs, GKLEE can also automatically generate tests that provide high coverage. These tests serve as concrete witnesses for every reported bug. They can also be used for downstream debugging, for example to test the kernel on the actual hardware. We describe the architecture of GKLEE, its symbolic virtual machine model, and describe previously unknown bugs and performance issues that it detected on commercial SDK kernels. We describe GKLEE's test-case reduction heuristics, and the resulting scalability improvement for a given coverage target.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @Article{Li:2012:SRS, author = "Chunxiao Li and Niraj K. Jha and Anand Raghunathan", title = "Secure reconfiguration of software-defined radio", journal = j-TECS, volume = "11", number = "1", pages = "10:1--10:??", month = mar, year = "2012", CODEN = "????", DOI = "https://doi.org/10.1145/2146417.2146427", ISSN = "1539-9087 (print), 1558-3465 (electronic)", ISSN-L = "1539-9087", bibdate = "Mon Apr 2 17:42:24 MDT 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/tecs.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Software-defined radio (SDR) implements a radio system in software that executes on a programmable processor. The components of SDR, such as the filters, amplifiers, and modulators, can be easily reconfigured to adapt to the operating environment and user preferences. However, the flexibility of radio reconfiguration brings along the serious security concern of malicious modification of software in the SDR system, leading to radio malfunction and interference with other users' communications. Both the SDR device and the network need to be protected from such malicious radio reconfiguration. In this article, a new architecture targeted at protecting SDR devices from malicious reconfiguration is proposed. The architecture is based on robust separation of the radio operation environment and user application environment, through the use of virtualization. A new radio middleware layer is designed to securely intercept all attempts to reconfigure the radio, and a security policy monitor checks the target configuration against security policies that represent the interests of various parties. Even if the operating system in the user application environment is compromised, the proposed architecture can ensure secure reconfiguration in the radio operation environment. We have prototyped the proposed secure SDR architecture using VMware and the GNU Radio toolkit and demonstrate that overheads incurred by the architecture are small and tolerable. Therefore, we believe that the proposed solution could be applied to address secure SDR reconfiguration in both general-purpose and embedded computing systems.", acknowledgement = ack-nhfb, articleno = "10", fjournal = "ACM Transactions on Embedded Computing Systems", journal-URL = "http://portal.acm.org/browse_dl.cfm?&idx=J840", } @Article{Li:2012:VMP, author = "Wubin Li and Johan Tordsson and Erik Elmroth", title = "Virtual Machine Placement for Predictable and Time-Constrained Peak Loads", journal = j-LECT-NOTES-COMP-SCI, volume = "7150", pages = "120--134", year = "2012", CODEN = "LNCSD9", DOI = "https://doi.org/10.1007/978-3-642-28675-9_9", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Wed Dec 19 15:25:07 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/lncs2012b.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer.com/chapter/10.1007/978-3-642-28675-9_9/", acknowledgement = ack-nhfb, book-DOI = "https://doi.org/10.1007/978-3-642-28675-9", book-URL = "http://www.springerlink.com/content/978-3-642-28675-9", fjournal = "Lecture Notes in Computer Science", } @Article{Liao:2012:TGC, author = "Xiaofei Liao and Hai Jin and Haikun Liu", title = "Towards a green cluster through dynamic remapping of virtual machines", journal = j-FUT-GEN-COMP-SYS, volume = "28", number = "2", pages = "469--477", month = feb, year = "2012", CODEN = "FGSEVI", DOI = "https://doi.org/10.1016/j.future.2011.04.013", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Thu Mar 8 07:52:16 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www.sciencedirect.com/science/journal/0167739X", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X11000641", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Lin:2012:OVM, author = "Qian Lin and Zhengwei Qi and Jiewei Wu and Yaozu Dong and Haibing Guan", title = "Optimizing virtual machines using hybrid virtualization", journal = j-J-SYST-SOFTW, volume = "85", number = "11", pages = "2593--2603", month = nov, year = "2012", CODEN = "JSSODM", DOI = "https://doi.org/10.1016/j.jss.2012.05.093", ISSN = "0164-1212 (print), 1873-1228 (electronic)", ISSN-L = "0164-1212", bibdate = "Mon Aug 20 17:08:56 MDT 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www.sciencedirect.com/science/journal/01641212", URL = "http://www.sciencedirect.com/science/article/pii/S0164121212001677", acknowledgement = ack-nhfb, fjournal = "Journal of Systems and Software", journal-URL = "http://www.sciencedirect.com/science/journal/01641212", } @Article{Lin:2012:UKT, author = "Yi Lin and Stephen M. Blackburn and Daniel Frampton", title = "Unpicking the knot: teasing apart {VM}\slash application interdependencies", journal = j-SIGPLAN, volume = "47", number = "7", pages = "181--190", month = jul, year = "2012", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2365864.2151048", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Sep 6 10:01:03 MDT 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "VEE '12 conference proceedings.", abstract = "Flexible and efficient runtime design requires an understanding of the dependencies among the components internal to the runtime and those between the application and the runtime. These dependencies are frequently unclear. This problem exists in all runtime design, and is most vivid in a metacircular runtime --- one that is implemented in terms of itself. Metacircularity blurs boundaries between application and runtime implementation, making it harder to understand and make guarantees about overall system behavior, affecting isolation, security, and resource management, as well as reducing opportunities for optimization. Our goal is to shed new light on VM interdependencies, helping all VM designers understand these dependencies and thereby engineer better runtimes. We explore these issues in the context of a high-performance Java-in-Java virtual machine. Our approach is to identify and instrument transition points into and within the runtime, which allows us to establish a dynamic execution context. Our contributions are: (1) implementing and measuring a system that dynamically maintains execution context with very low overhead, (2) demonstrating that such a framework can be used to improve the software engineering of an existing runtime, and (3) analyzing the behavior and runtime characteristics of our runtime across a wide range of benchmarks. Our solution provides clarity about execution state and allowable transitions, making it easier to develop, debug, and understand managed runtimes.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @Article{Lipner:2012:LVS, author = "Steve Lipner and Trent Jaeger and Mary Ellen Zurko", title = "Lessons from {VAX\slash SVS} for High-Assurance {VM} Systems", journal = j-IEEE-SEC-PRIV, volume = "10", number = "6", pages = "26--35", month = nov # "\slash " # dec, year = "2012", CODEN = "????", DOI = "https://doi.org/10.1109/MSP.2012.87", ISSN = "1540-7993 (print), 1558-4046 (electronic)", ISSN-L = "1540-7993", bibdate = "Mon Dec 10 18:29:51 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Security and Privacy", keywords = "secure virtual system (SVS); virtual machine (VM)", } @Article{Liu:2012:PBA, author = "Zhanghui Liu and Xiaoli Wang", title = "A {PSO}-Based Algorithm for Load Balancing in Virtual Machines of Cloud Computing Environment", journal = j-LECT-NOTES-COMP-SCI, volume = "7331", pages = "142--147", year = "2012", CODEN = "LNCSD9", DOI = "https://doi.org/10.1007/978-3-642-30976-2_17", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Wed Dec 19 15:20:13 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/lncs2012e.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer.com/chapter/10.1007/978-3-642-30976-2_17/", acknowledgement = ack-nhfb, book-DOI = "https://doi.org/10.1007/978-3-642-30976-2", book-URL = "http://www.springerlink.com/content/978-3-642-30976-2", fjournal = "Lecture Notes in Computer Science", } @Article{Luo:2012:PNV, author = "Juan Luo and Lei Chen and Shan Fu and Renfa Li", title = "Parallel Network Virtualization Resource Management System", journal = j-LECT-NOTES-COMP-SCI, volume = "7419", pages = "69--77", year = "2012", CODEN = "LNCSD9", DOI = "https://doi.org/10.1007/978-3-642-33050-6_8", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Wed Dec 19 15:22:10 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/lncs2012g.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer.com/chapter/10.1007/978-3-642-33050-6_8/", acknowledgement = ack-nhfb, book-DOI = "https://doi.org/10.1007/978-3-642-33050-6", book-URL = "http://www.springerlink.com/content/978-3-642-33050-6", fjournal = "Lecture Notes in Computer Science", } @Article{Lv:2012:VCV, author = "Hui Lv and Yaozu Dong and Jiangang Duan and Kevin Tian", title = "Virtualization challenges: a view from server consolidation perspective", journal = j-SIGPLAN, volume = "47", number = "7", pages = "15--26", month = jul, year = "2012", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2365864.2151030", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Sep 6 10:01:03 MDT 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "VEE '12 conference proceedings.", abstract = "Server consolidation, by running multiple virtual machines on top of a single platform with virtualization, provides an efficient solution to parallelism and utilization of modern multi-core processors system. However, the performance and scalability of server consolidation solution on modern massive advanced server is not well addressed. In this paper, we conduct a comprehensive study of Xen performance and scalability characterization running SPECvirt_sc2010, and identify that large memory and cache footprint, due to the unnecessary high frequent context switch, introduce additional challenges to the system performance and scalability. We propose two optimizations (dynamically-allocable tasklets and context-switch rate controller) to improve the performance. The results show the improved memory and cache efficiency with a reduction of the overall CPI, resulting in an improvement of server consolidation capability by 15\% in SPECvirt_sc2010. In the meantime, our optimization achieves an up to 50\% acceleration of service response, which greatly improves the QoS of Xen virtualization solution.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @Article{Ma:2012:DTD, author = "Zhiqiang Ma and Zhonghua Sheng and Lin Gu and Liufei Wen and Gong Zhang", title = "{DVM}: towards a datacenter-scale virtual machine", journal = j-SIGPLAN, volume = "47", number = "7", pages = "39--50", month = jul, year = "2012", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2365864.2151032", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Sep 6 10:01:03 MDT 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "VEE '12 conference proceedings.", abstract = "As cloud-based computation becomes increasingly important, providing a general computational interface to support datacenter-scale programming has become an imperative research agenda. Many cloud systems use existing virtual machine monitor (VMM) technologies, such as Xen, VMware, and Windows Hypervisor, to multiplex a physical host into multiple virtual hosts and isolate computation on the shared cluster platform. However, traditional multiplexing VMMs do not scale beyond one single physical host, and it alone cannot provide the programming interface and cluster-wide computation that a datacenter system requires. We design a new instruction set architecture, DISA, to unify myriads of compute nodes to form a big virtual machine called DVM, and present programmers the view of a single computer where thousands of tasks run concurrently in a large, unified, and snapshotted memory space. The DVM provides a simple yet scalable programming model and mitigates the scalability bottleneck of traditional distributed shared memory systems. Along with an efficient execution engine, the capacity of a DVM can scale up to support large clusters. We have implemented and tested DVM on three platforms, and our evaluation shows that DVM has excellent performance in terms of execution time and speedup. On one physical host, the system overhead of DVM is comparable to that of traditional VMMs. On 16 physical hosts, the DVM runs 10 times faster than MapReduce/Hadoop and X10. On 256 EC2 instances, DVM shows linear speedup on a parallelizable workload.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @Article{Marr:2012:IUM, author = "Stefan Marr and Theo D'Hondt", title = "Identifying a Unifying Mechanism for the Implementation of Concurrency Abstractions on Multi-language Virtual Machines", journal = j-LECT-NOTES-COMP-SCI, volume = "7304", pages = "171--186", year = "2012", CODEN = "LNCSD9", DOI = "https://doi.org/10.1007/978-3-642-30561-0_13", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Wed Dec 19 15:19:39 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/lncs2012e.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer.com/chapter/10.1007/978-3-642-30561-0_13/", acknowledgement = ack-nhfb, book-DOI = "https://doi.org/10.1007/978-3-642-30561-0", book-URL = "http://www.springerlink.com/content/978-3-642-30561-0", fjournal = "Lecture Notes in Computer Science", } @Article{Matsuhashi:2012:TVF, author = "Yohei Matsuhashi and Takahiro Shinagawa and Yoshiaki Ishii and Nobuyuki Hirooka and Kazuhiko Kato", title = "Transparent {VPN} failure recovery with virtualization", journal = j-FUT-GEN-COMP-SYS, volume = "28", number = "1", pages = "78--84", month = jan, year = "2012", CODEN = "FGSEVI", DOI = "https://doi.org/10.1016/j.future.2011.05.020", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Thu Mar 8 07:52:12 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www.sciencedirect.com/science/journal/0167739X", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X11001026", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Mayer:2012:URM, author = "C. Mayer and F. Baitinger and S. Amann and G. McAfee and A. Nunez Mencias", title = "{Unified Resource Manager} virtualization management", journal = j-IBM-JRD, volume = "56", number = "1--2", pages = "18:1--18:9", month = "????", year = "2012", CODEN = "IBMJAE", DOI = "https://doi.org/10.1147/JRD.2011.2180750", ISSN = "0018-8646 (print), 2151-8556 (electronic)", ISSN-L = "0018-8646", bibdate = "Fri Apr 13 09:44:32 MDT 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/ibmjrd.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IBM Journal of Research and Development", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520", } @Article{Min:2012:VVM, author = "Changwoo Min and Inhyeok Kim and Taehyoung Kim and Young Ik Eom", title = "{VMMB}: Virtual Machine Memory Balancing for Unmodified Operating Systems", journal = j-J-GRID-COMP, volume = "10", number = "1", pages = "69--84", month = mar, year = "2012", CODEN = "????", ISSN = "1570-7873 (print), 1572-9184 (electronic)", ISSN-L = "1570-7873", bibdate = "Fri Oct 26 06:22:41 MDT 2012", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=1570-7873&volume=10&issue=1; https://www.math.utah.edu/pub/tex/bib/jgridcomp.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=1570-7873&volume=10&issue=1&spage=69", acknowledgement = ack-nhfb, fjournal = "Journal of Grid Computing", journal-URL = "http://link.springer.com/journal/10723", } @Article{Mirzaei:2012:TAA, author = "Nariman Mirzaei and Sam Malek and Corina S. P{\u{a}}s{\u{a}}reanu and Naeem Esfahani and Riyadh Mahmood", title = "Testing {Android} apps through symbolic execution", journal = j-SIGSOFT, volume = "37", number = "6", pages = "1--5", month = nov, year = "2012", CODEN = "SFENDP", DOI = "https://doi.org/10.1145/2382756.2382798", ISSN = "0163-5948 (print), 1943-5843 (electronic)", ISSN-L = "0163-5948", bibdate = "Wed Aug 1 17:16:18 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsoft2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "There is a growing need for automated testing techniques aimed at Android apps. A critical challenge is the systematic generation of test cases. One method of systematically generating test cases for Java programs is symbolic execution. But applying symbolic execution tools, such as Symbolic Pathfinder (SPF), to generate test cases for Android apps is challenged by the fact that Android apps run on the Dalvik Virtual Machine (DVM) instead of JVM. In addition, Android apps are event driven and susceptible to path-divergence due to their reliance on an application development framework. This paper provides an overview of a two-pronged approach to alleviate these issues. First, we have developed a model of Android libraries in Java Pathfinder (JPF) to enable execution of Android apps in a way that addresses the issues of incompatibility with JVM and path-divergence. Second, we have leveraged program analysis techniques to correlate events with their handlers for automatically generating Android-specific drivers that simulate all valid events.", acknowledgement = ack-nhfb, fjournal = "ACM SIGSOFT Software Engineering Notes", journal-URL = "https://dl.acm.org/citation.cfm?id=J728", } @Article{Nguyen:2012:BAS, author = "Dinh Khoa Nguyen and Francesco Lelli and Mike P. Papazoglou and Willem-Jan {Van den Heuvel}", title = "Blueprinting Approach in Support of Cloud Computing", journal = j-FUTURE-INTERNET, volume = "4", number = "1", pages = "322--346", day = "21", month = mar, year = "2012", CODEN = "????", DOI = "https://doi.org/10.3390/fi4010322", ISSN = "1999-5903", ISSN-L = "1999-5903", bibdate = "Thu Nov 21 16:50:47 MST 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/future-internet.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.mdpi.com/1999-5903/4/1/322", abstract = "Current cloud service offerings, i.e., Software-as-a-service (SaaS), Platform-as-a-service (PaaS) and Infrastructure-as-a-service (IaaS) offerings are often provided as monolithic, one-size-fits-all solutions and give little or no room for customization. This limits the ability of Service-based Application (SBA) developers to configure and syndicate offerings from multiple SaaS, PaaS, and IaaS providers to address their application requirements. Furthermore, combining different independent cloud services necessitates a uniform description format that facilitates the design, customization, and composition. Cloud Blueprinting is a novel approach that allows SBA developers to easily design, configure and deploy virtual SBA payloads on virtual machines and resource pools on the cloud. We propose the Blueprint concept as a uniform abstract description for cloud service offerings that may cross different cloud computing layers, i.e., SaaS, PaaS and IaaS. To support developers with the SBA design and development in the cloud, this paper introduces a formal Blueprint Template for unambiguously describing a blueprint, as well as a Blueprint Lifecycle that guides developers through the manipulation, composition and deployment of different blueprints for an SBA. Finally, the empirical evaluation of the blueprinting approach within an EC's FP7 project is reported and an associated blueprint prototype implementation is presented.", acknowledgement = ack-nhfb, journal-URL = "https://www.mdpi.com/journal/futureinternet", remark = "Special Issue Recent Advances in Web Services.", } @Article{Nhan:2012:MDA, author = "Tam Le Nhan and Gerson Suny{\'e} and Jean-Marc J{\'e}z{\'e}quel", title = "A Model-Driven Approach for Virtual Machine Image Provisioning in Cloud Computing", journal = j-LECT-NOTES-COMP-SCI, volume = "7592", pages = "107--121", year = "2012", CODEN = "LNCSD9", DOI = "https://doi.org/10.1007/978-3-642-33427-6_8", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Wed Dec 19 15:25:26 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/lncs2012j.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer.com/chapter/10.1007/978-3-642-33427-6_8/", acknowledgement = ack-nhfb, book-DOI = "https://doi.org/10.1007/978-3-642-33427-6", book-URL = "http://www.springerlink.com/content/978-3-642-33427-6", fjournal = "Lecture Notes in Computer Science", } @Article{Nieh:2012:CBR, author = "Jason Nieh", title = "Challenges in building a real, large private cloud", journal = j-SIGPLAN, volume = "47", number = "7", pages = "1--2", month = jul, year = "2012", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2365864.2151026", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Sep 6 10:01:03 MDT 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "VEE '12 conference proceedings.", abstract = "Virtualization and internal cloud are often touted as the solution to many challenging problems, from resource underutilization to data-center optimization and carbon emission reduction. However, the hidden costs of cloud-scale virtualization, largely stemming from the complex and difficult system administration challenges it poses, are often overlooked. Reaping the fruits of internal Infrastructure as a Service cloud requires the enterprise to navigate scalability limitations, revamp traditional operational practices, manage performance, and achieve unprecedented cross-silo collaboration.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @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; https://www.math.utah.edu/pub/tex/bib/virtual-machines.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", } @Article{Ost:2012:EAT, author = "Luciano Ost and Sameer Varyani and Leandro Soares Indrusiak and Marcelo Mandelli and Gabriel Marchesan Almeida and Eduardo Wachter and Fernando Moraes and Gilles Sassatelli", title = "Enabling Adaptive Techniques in Heterogeneous {MPSoCs} Based on Virtualization", journal = j-TRETS, volume = "5", number = "3", pages = "17:1--17:??", month = oct, year = "2012", CODEN = "????", DOI = "https://doi.org/10.1145/2362374.2362381", ISSN = "1936-7406 (print), 1936-7414 (electronic)", ISSN-L = "1936-7406", bibdate = "Tue Nov 6 18:07:44 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/trets.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "This article explores the use of virtualization to enable mechanisms like task migration and dynamic mapping in heterogeneous MPSoCs, thereby targeting the design of systems capable of adapt their behavior to time-changing workloads. Because tasks may have to be mapped to target processors with different instruction set architectures, we propose the use of Low Level Virtual Machine (LLVM) to postcompile the tasks at runtime depending on their target processor. A novel dynamic mapping heuristic is also proposed, aiming to exploit the advantages of specialized processors while taking into account the overheads imposed by virtualization. Extensive experimental work at different levels of abstraction---FPGA prototype, RTL and system-level simulation---is presented to evaluate the proposed techniques.", acknowledgement = ack-nhfb, articleno = "17", fjournal = "ACM Transactions on Reconfigurable Technology and Systems (TRETS)", journal-URL = "http://portal.acm.org/toc.cfm?id=J1151", } @Article{Pan:2012:CLM, author = "Zhenhao Pan and Yaozu Dong and Yu Chen and Lei Zhang and Zhijiao Zhang", title = "{CompSC}: live migration with pass-through devices", journal = j-SIGPLAN, volume = "47", number = "7", pages = "109--120", month = jul, year = "2012", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2365864.2151040", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Sep 6 10:01:03 MDT 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "VEE '12 conference proceedings.", abstract = "Live migration is one of the most important features of virtualization technology. With regard to recent virtualization techniques, performance of network I/O is critical. Current network I/O virtualization (e.g. Para-virtualized I/O, VMDq) has a significant performance gap with native network I/O. Pass-through network devices have near native performance, however, they have thus far prevented live migration. No existing methods solve the problem of live migration with pass-through devices perfectly. In this paper, we propose CompSC: a solution of hardware state migration that will enable the live migration support of pass-through devices. We go on to apply CompSC to SR-IOV network interface controllers. We discuss the attributes of different hardware states in pass-through devices and migrate them with corresponding techniques. Our experiments show that CompSC enables live migration on an Intel 82599 VF with a throughput 282.66\% higher than para-virtualized devices. In addition, service downtime during live migration is 42.9\% less than para-virtualized devices.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @Article{Papadimitriou:2012:TLS, author = "Panagiotis Papadimitriou and Ines Houidi and Wajdi Louati and Djamal Zeghlache and Christoph Werle", title = "Towards Large-Scale Network Virtualization", journal = j-LECT-NOTES-COMP-SCI, volume = "7277", pages = "13--25", year = "2012", CODEN = "LNCSD9", DOI = "https://doi.org/10.1007/978-3-642-30630-3_2", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Wed Dec 19 15:19:03 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/lncs2012d.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer.com/chapter/10.1007/978-3-642-30630-3_2/", acknowledgement = ack-nhfb, book-DOI = "https://doi.org/10.1007/978-3-642-30630-3", book-URL = "http://www.springerlink.com/content/978-3-642-30630-3", fjournal = "Lecture Notes in Computer Science", } @Article{Patel:2012:PIF, author = "Naresh M. Patel", title = "Performance implications of flash and storage class memories", journal = j-SIGMETRICS, volume = "40", number = "1", pages = "1--2", month = jun, year = "2012", CODEN = "????", DOI = "https://doi.org/10.1145/2318857.2254758", ISSN = "0163-5999 (print), 1557-9484 (electronic)", ISSN-L = "0163-5999", bibdate = "Fri Nov 9 11:06:39 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigmetrics.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "The storage industry has seen incredible growth in data storage needs by both consumers and enterprises. Long-term technology trends mean that the data deluge will continue well into the future. These trends include the big-data trend (driven by data mining analytics, high-bandwidth needs, and large content repositories), server virtualization, cloud storage, and Flash. We will cover how Flash and storage class memories (SCM) interact with some of these major trends from a performance perspective.", acknowledgement = ack-nhfb, fjournal = "ACM SIGMETRICS Performance Evaluation Review", journal-URL = "http://portal.acm.org/toc.cfm?id=J618", } @Article{Pavlou:2012:DBD, author = "Demos Pavlou and Enric Gibert and Fernando Latorre and Antonio Gonzalez", title = "{DDGacc}: boosting dynamic {DDG}-based binary optimizations through specialized hardware support", journal = j-SIGPLAN, volume = "47", number = "7", pages = "159--168", month = jul, year = "2012", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2365864.2151046", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Sep 6 10:01:03 MDT 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "VEE '12 conference proceedings.", abstract = "Dynamic Binary Translators (DBT) and Dynamic Binary Optimization (DBO) by software are used widely for several reasons including performance, design simplification and virtualization. However, the software layer in such systems introduces non-negligible overheads which affect performance and user experience. Hence, reducing DBT/DBO overheads is of paramount importance. In addition, reduced overheads have interesting collateral effects in the rest of the software layer, such as allowing optimizations to be applied earlier. A cost-effective solution to this problem is to provide hardware support to speed up the primitives of the software layer, paying special attention to automate DBT/DBO mechanisms and leave the heuristics to the software, which is more flexible. In this work, we have characterized the overheads of a DBO system using DynamoRIO implementing several basic optimizations. We have seen that the computation of the Data Dependence Graph (DDG) accounts for 5\%-10\% of the execution time. For this reason, we propose to add hardware support for this task in the form of a new functional unit, called DDGacc, which is integrated in a conventional pipeline processor and is operated through new ISA instructions. Our evaluation shows that DDGacc reduces the cost of computing the DDG by 32x, which reduces overall execution time by 5\%-10\% on average and up to 18\% for applications where the DBO optimizes large code footprints.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @Article{Petrides:2012:HPD, author = "Panayiotis Petrides and George Nicolaides and Pedro Trancoso", title = "{HPC} Performance Domains on Multi-core Processors with Virtualization", journal = j-LECT-NOTES-COMP-SCI, volume = "7179", pages = "123--134", year = "2012", CODEN = "LNCSD9", DOI = "https://doi.org/10.1007/978-3-642-28293-5_11", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Wed Dec 19 15:25:42 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/lncs2012b.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer.com/chapter/10.1007/978-3-642-28293-5_11/", acknowledgement = ack-nhfb, book-DOI = "https://doi.org/10.1007/978-3-642-28293-5", book-URL = "http://www.springerlink.com/content/978-3-642-28293-5", fjournal = "Lecture Notes in Computer Science", } @Article{Porter:2012:RLT, author = "Donald E. Porter and Silas Boyd-Wickizer and Jon Howell and Reuben Olinsky and Galen C. Hunt", title = "Rethinking the library {OS} from the top down", journal = j-SIGPLAN, volume = "47", number = "4", pages = "291--304", month = apr, year = "2012", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2248487.1950399", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Jun 7 08:15:03 MDT 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "This paper revisits an old approach to operating system construction, the library OS, in a new context. The idea of the library OS is that the personality of the OS on which an application depends runs in the address space of the application. A small, fixed set of abstractions connects the library OS to the host OS kernel, offering the promise of better system security and more rapid independent evolution of OS components. We describe a working prototype of a Windows 7 library OS that runs the latest releases of major applications such as Microsoft Excel, PowerPoint, and Internet Explorer. We demonstrate that desktop sharing across independent, securely isolated, library OS instances can be achieved through the pragmatic reuse of net-working protocols. Each instance has significantly lower overhead than a full VM bundled with an application: a typical application adds just 16MB of working set and 64MB of disk footprint. We contribute a new ABI below the library OS that enables application mobility. We also show that our library OS can address many of the current uses of hardware virtual machines at a fraction of the overheads. This paper describes the first working prototype of a full commercial OS redesigned as a library OS capable of running significant applications. Our experience shows that the long-promised benefits of the library OS approach better protection of system integrity and rapid system evolution are readily obtainable.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "ASPLOS '12 conference proceedings.", } @Article{Rajagopalan:2012:SDT, author = "Shriram Rajagopalan and Brendan Cully and Ryan O'Connor and Andrew Warfield", title = "{SecondSite}: disaster tolerance as a service", journal = j-SIGPLAN, volume = "47", number = "7", pages = "97--108", month = jul, year = "2012", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2365864.2151039", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Sep 6 10:01:03 MDT 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "VEE '12 conference proceedings.", abstract = "This paper describes the design and implementation of SecondSite, a cloud-based service for disaster tolerance. SecondSite extends the Remus virtualization-based high availability system by allowing groups of virtual machines to be replicated across data centers over wide-area Internet links. The goal of the system is to commodify the property of availability, exposing it as a simple tick box when configuring a new virtual machine. To achieve this in the wide area, we have had to tackle the related issues of replication traffic bandwidth, reliable failure detection across geographic regions and traffic redirection over a wide-area network without compromising on transparency and consistency.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @Article{Ramakrishnan:2012:EIV, author = "Lavanya Ramakrishnan and R. Shane Canon and Krishna Muriki and Iwona Sakrejda and Nicholas J. Wright", title = "Evaluating Interconnect and Virtualization Performance for High Performance Computing", journal = j-SIGMETRICS, volume = "40", number = "2", pages = "55--60", month = sep, year = "2012", CODEN = "????", DOI = "https://doi.org/10.1145/2381056.2381071", ISSN = "0163-5999 (print), 1557-9484 (electronic)", ISSN-L = "0163-5999", bibdate = "Fri Nov 9 11:06:40 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigmetrics.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Scientists are increasingly considering cloud computing platforms to satisfy their computational needs. Previous work has shown that virtualized cloud environments can have significant performance impact. However there is still a limited understanding of the nature of overheads and the type of applications that might do well in these environments. In this paper we detail benchmarking results that characterize the virtualization overhead and its impact on performance. We also examine the performance of various interconnect technologies with a view to understanding the performance impacts of various choices. Our results show that virtualization can have a significant impact upon performance, with at least a 60\% performance penalty. We also show that less capable interconnect technologies can have a significant impact upon performance of typical HPC applications. We also evaluate the performance of the Amazon Cluster compute instance and show that it performs approximately equivalently to a 10G Ethernet cluster at low core counts.", acknowledgement = ack-nhfb, fjournal = "ACM SIGMETRICS Performance Evaluation Review", journal-URL = "http://portal.acm.org/toc.cfm?id=J618", } @Article{Robertson:2012:SVL, author = "Brian Robertson", title = "Security: virtualisation's last frontier", journal = j-NETWORK-SECURITY, volume = "2012", number = "4", pages = "12--15", month = apr, year = "2012", CODEN = "NTSCF5", DOI = "https://doi.org/10.1016/S1353-4858(12)70026-0", ISSN = "1353-4858 (print), 1872-9371 (electronic)", ISSN-L = "1353-4858", bibdate = "Mon Dec 4 17:00:41 MST 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/network-security.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1353485812700260", acknowledgement = ack-nhfb, fjournal = "Network Security", journal-URL = "https://www.sciencedirect.com/journal/network-security", } @Article{Ruan:2012:MVM, author = "Li Ruan and Huixiang Wang and Limin Xiao and Mingfa Zhu and Feibo Li", title = "Memory Virtualization for {MIPS} Processor Based Cloud Server", journal = j-LECT-NOTES-COMP-SCI, volume = "7296", pages = "54--63", year = "2012", CODEN = "LNCSD9", DOI = "https://doi.org/10.1007/978-3-642-30767-6_5", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Wed Dec 19 15:19:28 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/lncs2012d.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer.com/chapter/10.1007/978-3-642-30767-6_5/", acknowledgement = ack-nhfb, book-DOI = "https://doi.org/10.1007/978-3-642-30767-6", book-URL = "http://www.springerlink.com/content/978-3-642-30767-6", fjournal = "Lecture Notes in Computer Science", } @Article{Ryckbosch:2012:VSM, author = "Frederick Ryckbosch and Stijn Polfliet and Lieven Eeckhout", title = "{VSim}: Simulating multi-server setups at near native hardware speed", journal = j-TACO, volume = "8", number = "4", pages = "52:1--52:??", month = jan, year = "2012", CODEN = "????", DOI = "https://doi.org/10.1145/2086696.2086731", ISSN = "1544-3566 (print), 1544-3973 (electronic)", ISSN-L = "1544-3566", bibdate = "Sat Jan 21 07:49:49 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/taco.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Simulating contemporary computer systems is a challenging endeavor, especially when it comes to simulating high-end setups involving multiple servers. The simulation environment needs to run complete software stacks, including operating systems, middleware, and application software, and it needs to simulate network and disk activity next to CPU performance. In addition, it needs the ability to scale out to a large number of server nodes while attaining good accuracy and reasonable simulation speeds. This paper presents VSim, a novel simulation methodology for multi-server systems. VSim leverages virtualization technology for simulating a target system on a host system. VSim controls CPU, network and disk performance on the host, and it gives the illusion to the software stack to run on a target system through time dilation.", acknowledgement = ack-nhfb, articleno = "52", fjournal = "ACM Transactions on Architecture and Code Optimization (TACO)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J924", } @Article{Sartor:2012:EMT, author = "Jennfer B. Sartor and Lieven Eeckhout", title = "Exploring multi-threaded {Java} application performance on multicore hardware", journal = j-SIGPLAN, volume = "47", number = "10", pages = "281--296", month = oct, year = "2012", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2398857.2384638", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Nov 15 16:40:23 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "While there have been many studies of how to schedule applications to take advantage of increasing numbers of cores in modern-day multicore processors, few have focused on multi-threaded managed language applications which are prevalent from the embedded to the server domain. Managed languages complicate performance studies because they have additional virtual machine threads that collect garbage and dynamically compile, closely interacting with application threads. Further complexity is introduced as modern multicore machines have multiple sockets and dynamic frequency scaling options, broadening opportunities to reduce both power and running time. In this paper, we explore the performance of Java applications, studying how best to map application and virtual machine (JVM) threads to a multicore, multi-socket environment. We explore both the cost of separating JVM threads from application threads, and the opportunity to speed up or slow down the clock frequency of isolated threads. We perform experiments with the multi-threaded DaCapo benchmarks and pseudojbb2005 running on the Jikes Research Virtual Machine, on a dual-socket, 8-core Intel Nehalem machine to reveal several novel, and sometimes counter-intuitive, findings. We believe these insights are a first but important step towards understanding and optimizing managed language performance on modern hardware.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "OOPSLA '12 conference proceedings.", } @Article{Shan:2012:FIA, author = "Zhiyong Shan and Xin Wang and Tzi-cker Chiueh and Xiaofeng Meng", title = "Facilitating inter-application interactions for {OS}-level virtualization", journal = j-SIGPLAN, volume = "47", number = "7", pages = "75--86", month = jul, year = "2012", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2365864.2151036", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Sep 6 10:01:03 MDT 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "VEE '12 conference proceedings.", abstract = "OS-level virtualization generates a minimal start-up and run-time overhead on the host OS and thus suits applications that require both good isolation and high efficiency. However, multiple-member applications required for forming a system may need to occasionally communicate across this isolation barrier to cooperate with each other while they are separated in different VMs to isolate intrusion or fault. Such application scenarios are often critical to enterprise-class servers, HPC clusters and intrusion/fault-tolerant systems, etc. We make the first effort to support the inter-application interactions in an OS-level virtualization system without causing a significant compromise on VM isolation. We identify all interactive operations that impact inter-application interactions, including inter-process communications, application invocations, resource name transfers and application dependencies. We propose Shuttle, a novel approach for facilitating inter-application interactions within and across OS-level virtual machines. Our results demonstrate that Shuttle can correctly address all necessary inter-application interactions while providing good isolation capability to all sample applications on different versions of Windows OS.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @Article{Sharifi:2012:PED, author = "Mohsen Sharifi and Hadi Salimi and Mahsa Najafzadeh", title = "Power-efficient distributed scheduling of virtual machines using workload-aware consolidation techniques", journal = j-J-SUPERCOMPUTING, volume = "61", number = "1", pages = "46--66", month = jul, year = "2012", CODEN = "JOSUED", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Fri Oct 26 07:41:32 MDT 2012", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0920-8542&volume=61&issue=1; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0920-8542&volume=61&issue=1&spage=46", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Shi:2012:TSW, author = "Xuanhua Shi and Hai Jin and Hongbo Jiang and Xiaodong Pan and Dachuan Huang and Bo Yu", title = "Toward scalable {Web} systems on multicore clusters: making use of virtual machines", journal = j-J-SUPERCOMPUTING, volume = "61", number = "1", pages = "27--45", month = jul, year = "2012", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-011-0623-3", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Fri Oct 26 07:41:32 MDT 2012", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0920-8542&volume=61&issue=1; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0920-8542&volume=61&issue=1&spage=27", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Shi:2012:VGA, author = "Lin Shi and Hao Chen and Jianhua Sun and Kenli Li", title = "{vCUDA}: {GPU}-Accelerated High-Performance Computing in Virtual Machines", journal = j-IEEE-TRANS-COMPUT, volume = "61", number = "6", pages = "804--816", month = jun, year = "2012", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.2011.112", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Fri Jul 27 08:32:31 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib; https://www.math.utah.edu/pub/tex/bib/super.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Computers", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", } @Article{Shuo:2012:PKR, author = "Tian Shuo and He Yeping and Ding Baozeng", title = "Prevent Kernel Return-Oriented Programming Attacks Using Hardware Virtualization", journal = j-LECT-NOTES-COMP-SCI, volume = "7232", pages = "289--300", year = "2012", CODEN = "LNCSD9", DOI = "https://doi.org/10.1007/978-3-642-29101-2_20", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Wed Dec 19 15:18:09 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/lncs2012c.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer.com/chapter/10.1007/978-3-642-29101-2_20/", acknowledgement = ack-nhfb, book-DOI = "https://doi.org/10.1007/978-3-642-29101-2", book-URL = "http://www.springerlink.com/content/978-3-642-29101-2", fjournal = "Lecture Notes in Computer Science", } @Article{Simao:2012:CER, author = "Jos{\'e} Sim{\~a}o and Tiago Garrochinho and Lu{\'\i}s Veiga", title = "A checkpointing-enabled and resource-aware {Java Virtual Machine} for efficient and robust {e-Science} applications in grid environments", journal = j-CCPE, volume = "24", number = "13", pages = "1421--1442", day = "10", month = sep, year = "2012", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.1879", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Mon Nov 5 07:44:52 MST 2012", bibsource = "http://www.interscience.wiley.com/jpages/1532-0626; https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/java2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", onlinedate = "21 Dec 2011", } @Article{Stoess:2012:LVM, author = "Jan Stoess and Udo Steinberg and Volkmar Uhlig and Jens Kehne and Jonathan Appavoo and Amos Waterland", title = "A lightweight virtual machine monitor for {Blue Gene/P}", journal = j-IJHPCA, volume = "26", number = "2", pages = "95--109", month = may, year = "2012", CODEN = "IHPCFL", DOI = "https://doi.org/10.1177/1094342011434815", ISSN = "1094-3420 (print), 1741-2846 (electronic)", ISSN-L = "1094-3420", bibdate = "Thu Nov 8 11:31:13 MST 2012", bibsource = "http://hpc.sagepub.com/content/26/2.toc; https://www.math.utah.edu/pub/tex/bib/ijsa.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://hpc.sagepub.com/content/26/2/95.full.pdf+html", acknowledgement = ack-nhfb, fjournal = "International Journal of High Performance Computing Applications", journal-URL = "http://hpc.sagepub.com/content/by/year", onlinedate = "March 27, 2012", } @Article{Szefer:2012:ASH, author = "Jakub Szefer and Ruby B. Lee", title = "Architectural support for hypervisor-secure virtualization", journal = j-COMP-ARCH-NEWS, volume = "40", number = "1", pages = "437--450", month = mar, year = "2012", CODEN = "CANED2", DOI = "https://doi.org/10.1145/2189750.2151022", ISSN = "0163-5964 (print), 1943-5851 (electronic)", ISSN-L = "0163-5964", bibdate = "Fri Jun 1 17:06:46 MDT 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigarch.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "ASPLOS '12 conference proceedings.", abstract = "Virtualization has become a standard part of many computer systems. A key part of virtualization is the all-powerful hypervisor which manages the physical platform and can access all of its resources, including memory assigned to the guest virtual machines (VMs). Continuing releases of bug reports and exploits in the virtualization software show that defending the hypervisor against attacks is very difficult. In this work, we present hypervisor-secure virtualization --- a new research direction with the goal of protecting the guest VMs from an untrusted hypervisor. We also present the HyperWall architecture which achieves hypervisor-secure virtualization, using hardware to provide the protections. HyperWall allows a hypervisor to freely manage the memory, processor cores and other resources of a platform. Yet once VMs are created, our new Confidentiality and Integrity Protection (CIP) tables protect the memory of the guest VMs from accesses by the hypervisor or by DMA, depending on the customer's specification. If a hypervisor does become compromised, e.g. by an attack from a malicious VM, it cannot be used in turn to attack other VMs. The protections are enabled through minimal modifications to the microprocessor and memory management units. Whereas much of the previous work concentrates on protecting the hypervisor from attacks by guest VMs, we tackle the problem of protecting the guest VMs from the hypervisor.", acknowledgement = ack-nhfb, fjournal = "ACM SIGARCH Computer Architecture News", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89", } @Article{Tavakoli:2012:FSC, author = "Zahra Tavakoli and Sebastian Meier and Alexander Vensmer", title = "A Framework for Security Context Migration in a Firewall Secured Virtual Machine Environment", journal = j-LECT-NOTES-COMP-SCI, volume = "7479", pages = "41--51", year = "2012", CODEN = "LNCSD9", DOI = "https://doi.org/10.1007/978-3-642-32808-4_5", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Wed Dec 19 15:23:28 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/lncs2012h.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer.com/chapter/10.1007/978-3-642-32808-4_5/", acknowledgement = ack-nhfb, book-DOI = "https://doi.org/10.1007/978-3-642-32808-4", book-URL = "http://www.springerlink.com/content/978-3-642-32808-4", fjournal = "Lecture Notes in Computer Science", } @Article{Tordsson:2012:CBM, author = "Johan Tordsson and Rub{\'e}n S. Montero and Rafael Moreno-Vozmediano and Ignacio M. Llorente", title = "Cloud brokering mechanisms for optimized placement of virtual machines across multiple providers", journal = j-FUT-GEN-COMP-SYS, volume = "28", number = "2", pages = "358--367", month = feb, year = "2012", CODEN = "FGSEVI", DOI = "https://doi.org/10.1016/j.future.2011.07.003", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Thu Mar 8 07:52:16 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www.sciencedirect.com/science/journal/0167739X", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X11001373", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Tuch:2012:BSV, author = "Harvey Tuch and Cyprien Laplace and Kenneth C. Barr and Bi Wu", title = "Block storage virtualization with commodity secure digital cards", journal = j-SIGPLAN, volume = "47", number = "7", pages = "191--202", month = jul, year = "2012", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2365864.2151050", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Sep 6 10:01:03 MDT 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "VEE '12 conference proceedings.", abstract = "Smartphones, tablets and other mobile platforms typically accommodate bulk data storage with low-cost, FAT-formatted Secure Digital cards. When one uses a mobile device to run a full-system virtual machine (VM), there can be a mismatch between (1) the VM's I/O mixture, security and reliability requirements and (2) the properties of the storage media available for VM block storage and checkpoint images. To resolve this mismatch, this paper presents a new VM disk image format called the Logging Block Store (LBS). After motivating the need for a new format, LBS is described in detail with experimental results demonstrating its efficacy. As a result of this work, recommendations are made for future optimizations throughout the stack that may simplify and improve the performance of storage virtualization systems on mobile platforms.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @Article{Tupakula:2012:DSB, author = "Udaya Kiran Tupakula and Vijay Varadharajan", title = "Dynamic State-Based Security Architecture for Detecting Security Attacks in Virtual Machines", journal = j-COMP-J, volume = "55", number = "4", pages = "397--409", month = apr, year = "2012", CODEN = "CMPJA6", DOI = "https://doi.org/10.1093/comjnl/bxr084", ISSN = "0010-4620 (print), 1460-2067 (electronic)", ISSN-L = "0010-4620", bibdate = "Tue Mar 27 18:19:58 MDT 2012", bibsource = "http://comjnl.oxfordjournals.org/content/55/4.toc; https://www.math.utah.edu/pub/tex/bib/comp2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://comjnl.oxfordjournals.org/content/55/4/397.full.pdf+html", acknowledgement = ack-nhfb, fjournal = "Computer Journal", journal-URL = "http://comjnl.oxfordjournals.org/", onlinedate = "September 21, 2011", } @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; https://www.math.utah.edu/pub/tex/bib/virtual-machines.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", } @Article{Voith:2012:QSP, author = "Thomas Voith and Karsten Oberle and Manuel Stein", title = "Quality of service provisioning for distributed data center inter-connectivity enabled by network virtualization", journal = j-FUT-GEN-COMP-SYS, volume = "28", number = "3", pages = "554--562", month = mar, year = "2012", CODEN = "FGSEVI", DOI = "https://doi.org/10.1016/j.future.2011.03.011", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Thu Mar 8 07:52:18 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www.sciencedirect.com/science/journal/0167739X", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X11000392", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Wagelaar:2012:TSC, author = "Dennis Wagelaar and Ludovico Iovino and Davide {Di Ruscio} and Alfonso Pierantonio", title = "Translational Semantics of a Co-evolution Specific Language with the {EMF} Transformation Virtual Machine", journal = j-LECT-NOTES-COMP-SCI, volume = "7307", pages = "192--207", year = "2012", CODEN = "LNCSD9", DOI = "https://doi.org/10.1007/978-3-642-30476-7_13", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Wed Dec 19 15:19:43 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/lncs2012e.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer.com/chapter/10.1007/978-3-642-30476-7_13/", acknowledgement = ack-nhfb, book-DOI = "https://doi.org/10.1007/978-3-642-30476-7", book-URL = "http://www.springerlink.com/content/978-3-642-30476-7", fjournal = "Lecture Notes in Computer Science", } @Article{Waldspurger:2012:V, author = "Carl Waldspurger and Mendel Rosenblum", title = "{I/O} virtualization", journal = j-CACM, volume = "55", number = "1", pages = "66--73", month = jan, year = "2012", CODEN = "CACMA2", DOI = "https://doi.org/10.1145/2063176.2063194", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Thu Jan 5 12:17:32 MST 2012", bibsource = "http://www.acm.org/pubs/contents/journals/cacm/; https://www.math.utah.edu/pub/tex/bib/cacm2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79", } @Article{Wentzlaff:2012:CFG, author = "David Wentzlaff and Christopher J. Jackson and Patrick Griffin and Anant Agarwal", title = "Configurable fine-grain protection for multicore processor virtualization", journal = j-COMP-ARCH-NEWS, volume = "40", number = "3", pages = "464--475", month = jun, year = "2012", CODEN = "CANED2", DOI = "https://doi.org/10.1145/2366231.2337213", ISSN = "0163-5964 (print), 1943-5851 (electronic)", ISSN-L = "0163-5964", bibdate = "Thu Sep 6 10:21:07 MDT 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigarch.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "ISCA '12 conference proceedings.", abstract = "Multicore architectures, with their abundant on-chip resources, are effectively collections of systems-on-a-chip. The protection system for these architectures must support multiple concurrently executing operating systems (OSes) with different needs, and manage and protect the hardware's novel communication mechanisms and hardware features. Traditional protection systems are insufficient; they protect supervisor from user code, but typically do not protect one system from another, and only support fixed assignment of resources to protection levels. In this paper, we propose an alternative to traditional protection systems which we call configurable fine-grain protection (CFP). CFP enables the dynamic assignment of in-core resources to protection levels. We investigate how CFP enables different system software stacks to utilize the same configurable protection hardware, and how differing OSes can execute at the same time on a multicore processor with CFP. As illustration, we describe an implementation of CFP in a commercial multicore, the TILE64 processor.", acknowledgement = ack-nhfb, fjournal = "ACM SIGARCH Computer Architecture News", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89", } @Article{Yan:2012:VCH, author = "Lok-Kwong Yan and Manjukumar Jayachandra and Mu Zhang and Heng Yin", title = "{V2E}: combining hardware virtualization and software emulation for transparent and extensible malware analysis", journal = j-SIGPLAN, volume = "47", number = "7", pages = "227--238", month = jul, year = "2012", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2365864.2151053", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Sep 6 10:01:03 MDT 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "VEE '12 conference proceedings.", abstract = "A transparent and extensible malware analysis platform is essential for defeating malware. This platform should be transparent so malware cannot easily detect and bypass it. It should also be extensible to provide strong support for heavyweight instrumentation and analysis efficiency. However, no existing platform can meet both requirements. Leveraging hardware virtualization technology, analysis platforms like Ether can achieve good transparency, but its instrumentation support and analysis efficiency is poor. In contrast, software emulation provides strong support for code instrumentation and good analysis efficiency by using dynamic binary translation. However, analysis platforms based on software emulation can be easily detected by malware and thus is poor in transparency. To achieve both transparency and extensibility, we propose a new analysis platform that combines hardware virtualization and software emulation. The essence is precise heterogeneous replay: the malware execution is recorded via hardware virtualization and then replayed in software. Our design ensures the execution replay is precise. Moreover, with page-level recording granularity, the platform can easily adjust to analyze various forms of malware (a process, a kernel module, or a shared library). We implemented a prototype called V2E and demonstrated its capability and efficiency by conducting an extensive evaluation with both synthetic samples and 14 realworld emulation-resistant malware samples.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @Article{Zou:2012:CDA, author = "Tao Zou and Ronan {Le Bras} and Marcos {Vaz Salles} and Alan Demers and Johannes Gehrke", title = "{ClouDiA}: a deployment advisor for public clouds", journal = j-PROC-VLDB-ENDOWMENT, volume = "6", number = "2", pages = "121--132", month = dec, year = "2012", CODEN = "????", ISSN = "2150-8097", bibdate = "Fri Dec 13 05:56:14 MST 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; https://www.math.utah.edu/pub/tex/bib/vldbe.bib", abstract = "An increasing number of distributed data-driven applications are moving into shared public clouds. By sharing resources and operating at scale, public clouds promise higher utilization and lower costs than private clusters. To achieve high utilization, however, cloud providers inevitably allocate virtual machine instances noncontiguously, i.e., instances of a given application may end up in physically distant machines in the cloud. This allocation strategy can lead to large differences in average latency between instances. For a large class of applications, this difference can result in significant performance degradation, unless care is taken in how application components are mapped to instances. In this paper, we propose ClouDiA, a general deployment advisor that selects application node deployments minimizing either (i) the largest latency between application nodes, or (ii) the longest critical path among all application nodes. ClouDiA employs mixed-integer programming and constraint programming techniques to efficiently search the space of possible mappings of application nodes to instances. Through experiments with synthetic and real applications in Amazon EC2, we show that our techniques yield a 15\% to 55\% reduction in time-to-solution or service response time, without any need for modifying application code.", acknowledgement = ack-nhfb, fjournal = "Proceedings of the VLDB Endowment", } @Book{Ament:2013:ATG, author = "John Ament", title = "{Arquillian} Testing Guide: get familiarized with the {Arquillian} framework and its capabilities to carry out integration and functional testing on a {Java} virtual machine", publisher = "Packt Publishing", address = "Birmingham, UK", pages = "v + 224", year = "2013", ISBN = "1-78216-070-1", ISBN-13 = "978-1-78216-070-0", LCCN = "QA76.73.J3", bibdate = "Thu Dec 4 08:31:46 MST 2014", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/java2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://proquest.tech.safaribooksonline.de/9781782160700", acknowledgement = ack-nhfb, } @Article{Bai:2013:HPI, author = "Yuebin Bai and Yao Ma and Cheng Luo and Duo Lv and Yuanfeng Peng", title = "A high performance inter-domain communication approach for virtual machines", journal = j-J-SYST-SOFTW, volume = "86", number = "2", pages = "367--376", month = feb, year = "2013", CODEN = "JSSODM", DOI = "https://doi.org/10.1016/j.jss.2012.08.054", ISSN = "0164-1212 (print), 1873-1228 (electronic)", ISSN-L = "0164-1212", bibdate = "Sat Jan 5 09:05:59 MST 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www.sciencedirect.com/science/journal/01641212", URL = "http://www.sciencedirect.com/science/article/pii/S0164121212002476", acknowledgement = ack-nhfb, fjournal = "Journal of Systems and Software", journal-URL = "http://www.sciencedirect.com/science/journal/01641212", } @Article{Bartholomy:2013:NMT, author = "E. Bartholomy and G. Greenlee and M. Sylvia", title = "The need to move toward virtualized and more resilient disaster-recovery architectures", journal = j-IBM-JRD, volume = "57", number = "5", pages = "1:1--1:10", month = sep # "--" # oct, year = "2013", CODEN = "IBMJAE", DOI = "https://doi.org/10.1147/JRD.2013.2258759", ISSN = "0018-8646 (print), 2151-8556 (electronic)", ISSN-L = "0018-8646", bibdate = "Sat Feb 15 16:52:44 MST 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/ibmjrd.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IBM Journal of Research and Development", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520", } @Article{Beloglazov:2013:MOH, author = "Anton Beloglazov and Rajkumar Buyya", title = "Managing Overloaded Hosts for Dynamic Consolidation of Virtual Machines in Cloud Data Centers under Quality of Service Constraints", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "24", number = "7", pages = "1366--1379", month = jul, year = "2013", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2012.240", ISSN = "1045-9219", ISSN-L = "1045-9219", bibdate = "Fri Jun 21 08:51:27 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Parallel and Distributed Systems", journal-URL = "http://www.computer.org/tpds/archives.htm", } @Article{Bolz:2013:SSC, author = "Carl Friedrich Bolz and Lukas Diekmann and Laurence Tratt", title = "Storage strategies for collections in dynamically typed languages", journal = j-SIGPLAN, volume = "48", number = "10", pages = "167--182", month = oct, year = "2013", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2544173.2509531", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Mon Dec 9 09:19:33 MST 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/python.bib; https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "OOPSLA '13 conference proceedings.", abstract = "Dynamically typed language implementations often use more memory and execute slower than their statically typed cousins, in part because operations on collections of elements are unoptimised. This paper describes storage strategies, which dynamically optimise collections whose elements are instances of the same primitive type. We implement storage strategies in the PyPy virtual machine, giving a performance increase of 18\% on wide-ranging benchmarks of real Python programs. We show that storage strategies are simple to implement, needing only 1500LoC in PyPy, and have applicability to a wide range of virtual machines.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @Article{Bond:2013:OCC, author = "Michael D. Bond and Milind Kulkarni and Man Cao and Minjia Zhang and Meisam Fathi Salmi and Swarnendu Biswas and Aritra Sengupta and Jipeng Huang", title = "{OCTET}: capturing and controlling cross-thread dependences efficiently", journal = j-SIGPLAN, volume = "48", number = "10", pages = "693--712", month = oct, year = "2013", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2544173.2509519", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Mon Dec 9 09:19:33 MST 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/multithreading.bib; https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "OOPSLA '13 conference proceedings.", abstract = "Parallel programming is essential for reaping the benefits of parallel hardware, but it is notoriously difficult to develop and debug reliable, scalable software systems. One key challenge is that modern languages and systems provide poor support for ensuring concurrency correctness properties --- atomicity, sequential consistency, and multithreaded determinism --- because all existing approaches are impractical. Dynamic, software-based approaches slow programs by up to an order of magnitude because capturing and controlling cross-thread dependences (i.e., conflicting accesses to shared memory) requires synchronization at virtually every access to potentially shared memory. This paper introduces a new software-based concurrency control mechanism called OCTET that soundly captures cross-thread dependences and can be used to build dynamic analyses for concurrency correctness. OCTET achieves low overheads by tracking the locality state of each potentially shared object. Non-conflicting accesses conform to the locality state and require no synchronization; only conflicting accesses require a state change and heavyweight synchronization. This optimistic tradeoff leads to significant efficiency gains in capturing cross-thread dependences: a prototype implementation of OCTET in a high-performance Java virtual machine slows real-world concurrent programs by only 26\% on average. A dependence recorder, suitable for record {\&} replay, built on top of OCTET adds an additional 5\% overhead on average. These results suggest that OCTET can provide a foundation for developing low-overhead analyses that check and enforce concurrency correctness.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @Article{Botero:2013:GNN, author = "Juan Felipe Botero and Xavier Hesselbach", title = "Greener networking in a network virtualization environment", journal = j-COMP-NET-AMSTERDAM, volume = "57", number = "9", pages = "2021--2039", day = "19", month = jun, year = "2013", CODEN = "????", ISSN = "1389-1286 (print), 1872-7069 (electronic)", ISSN-L = "1389-1286", bibdate = "Mon Jul 1 19:17:12 MDT 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www.sciencedirect.com/science/journal/13891286", URL = "http://www.sciencedirect.com/science/article/pii/S1389128613001151", acknowledgement = ack-nhfb, fjournal = "Computer Networks", journal-URL = "http://www.sciencedirect.com/science/journal/13891286", } @Article{Bu:2013:CSC, author = "Xiangping Bu and Jia Rao and Cheng-Zhong Xu", title = "Coordinated Self-Configuration of Virtual Machines and Appliances Using a Model-Free Learning Approach", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "24", number = "4", pages = "681--690", month = apr, year = "2013", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2012.174", ISSN = "1045-9219", ISSN-L = "1045-9219", bibdate = "Wed May 1 08:02:21 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Parallel and Distributed Systems", journal-URL = "http://www.computer.org/tpds/archives.htm", } @Book{Cardoso:2013:MSC, author = "Edvaldo Alessandro Cardoso", title = "{Microsoft System Center} Virtual Machine Manager 2012 Cookbook", publisher = "Packt Publishing, Limited", address = "Birmingham, UK", pages = "iii + 326", year = "2013", ISBN = "1-84968-632-7 (paperback), 1-84968-633-5 (e-book)", ISBN-13 = "978-1-84968-632-7 (paperback), 978-1-84968-633-4 (e-book)", LCCN = "QA76.774.M55", bibdate = "Thu Dec 4 08:21:30 MST 2014", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://proquest.tech.safaribooksonline.de/9781849686327", acknowledgement = ack-nhfb, subject = "Microsoft System center configuration manager; Microsoft Windows server; Microsoft system center configuration manager; Microsoft Windows server; Operating systems (Computers); Information technology; Management; COMPUTERS; Operating Systems; Windows Server and NT; Management; Operating systems (Computers)", tableofcontents = "Preface \\ Chapter 1: VMM 2012 Architecture \\ Introduction \\ Understanding each component for a real-world implementation \\ Designing the VMM server, database, and console \\ Planning for high availability \\ Specifying the correct system requirements for a real-world scenario \\ Licensing the System Center \\ Troubleshooting VMM and supporting technologies \\ Chapter 2: Installing SCVMM 2012 \\ Introduction \\ Creating service accounts \\ Deploying a Microsoft SQL Server for VMM implementation \\ Installing VMM dependencies \\ Configuring distributed key management \\ Installing a VMM management server \\ Installing the VMM console \\ Connecting to a VMM management server by using the VMM console \\ Creating a Run As account's credentials in VMM \\ Configuring ports and protocols on the host firewall for each SCVMM component \\ Chapter 3: Installing the VMM Management Server \\ Introduction \\ Installing a highly available VMM management server \\ Installing a VMM management server on an additional node of a cluster \\ Connecting to a highly available VMM management server by using the VMM \\ console \\ Deploying a highly available library server on a file server cluster \\ Uninstalling a highly available VMM management server \\ Chapter 4: Configuring Fabric Resources in VMM \\ Introduction \\ Creating host groups \\ Setting up a VMM library \\ Networking \\ configuring logical networks in VMM \\ Networking \\ VM network and gateways with VMM \\ Networking \\ configuring ports and switches with VMM \\ Configuring storage with VMM \\ Provisioning a physical computer as a Hyper-V host \\ Bare Metal host deployment \\ Adding and managing Hyper-V hosts and host clusters with VMM \\ Chapter 5: Deploying Virtual Machines and Services \\ Introduction \\ Creating private clouds \\ Creating hardware, guest OS, application, and SQL profiles \\ Creating user roles in VMM \\ Creating and deploying virtual machines \\ Creating virtual machine templates \\ Creating and deploying service templates \\ Rapidly provisioning a virtual machine by using SAN Copy \\ Chapter 6: Upgrading from SCVMM 2008 R2 SP1 \\ Introduction \\ Reviewing the upgrade options \\ Checking the VMM system requirements and preparing for the upgrade \\ Upgrading to VMM 2012 SP1 \\ Reassociating hosts after upgrading \\ Updating the VMM agents \\ Performing other post-upgrade tasks \\ Chapter 7: Scripting in Virtual Machine Manager \\ Introduction \\ VMM PowerShell overview \\ Finding the command to automate tasks in VMM \\ Creating a script from VMM wizards \\ Storing and running scripts in VMM \\ VMM sample scripts \\ Chapter 8: Managing VMware ESXi and Citrix XenServer Hosts \\ Introduction \\ Adding a VMware vCenter Server to VMM \\ Adding VMware ESX hosts or host clusters to VMM \\ Configuring network settings on a VMware ESX host \\ Configuring host BMC settings \\ Importing VMware templates \\ Converting VMware virtual machines to Hyper-V", } @Article{Chang:2013:ADA, author = "Jian Chang and Krishna K. Venkatasubramanian and Andrew G. West and Insup Lee", title = "Analyzing and defending against {Web}-based malware", journal = j-COMP-SURV, volume = "45", number = "4", pages = "49:1--49:??", month = aug, year = "2013", CODEN = "CMSVAN", DOI = "https://doi.org/10.1145/2501654.2501663", ISSN = "0360-0300 (print), 1557-7341 (electronic)", ISSN-L = "0360-0300", bibdate = "Mon Aug 26 17:21:41 MDT 2013", bibsource = "http://www.acm.org/pubs/contents/journals/surveys/; https://www.math.utah.edu/pub/tex/bib/compsurv.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Web-based malware is a growing threat to today's Internet security. Attacks of this type are prevalent and lead to serious security consequences. Millions of malicious URLs are used as distribution channels to propagate malware all over the Web. After being infected, victim systems fall in the control of attackers, who can utilize them for various cyber crimes such as stealing credentials, spamming, and distributed denial-of-service attacks. Moreover, it has been observed that traditional security technologies such as firewalls and intrusion detection systems have only limited capability to mitigate this new problem. In this article, we survey the state-of-the-art research regarding the analysis of-and defense against-Web-based malware attacks. First, we study the attack model, the root cause, and the vulnerabilities that enable these attacks. Second, we analyze the status quo of the Web-based malware problem. Third, three categories of defense mechanisms are discussed in detail: (1) building honeypots with virtual machines or signature-based detection system to discover existing threats; (2) using code analysis and testing techniques to identify the vulnerabilities of Web applications; and (3) constructing reputation-based blacklists or smart sandbox systems to protect end-users from attacks. We show that these three categories of approaches form an extensive solution space to the Web-based malware problem. Finally, we compare the surveyed approaches and discuss possible future research directions.", acknowledgement = ack-nhfb, articleno = "49", fjournal = "ACM Computing Surveys", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204", } @Article{Chang:2013:IVP, author = "Xiaotao Chang and Hubertus Franke and Yi Ge and Tao Liu and Kun Wang and Jimi Xenidis and Fei Chen and Yu Zhang", title = "Improving virtualization in the presence of software managed translation lookaside buffers", journal = j-COMP-ARCH-NEWS, volume = "41", number = "3", pages = "120--129", month = jun, year = "2013", CODEN = "CANED2", DOI = "https://doi.org/10.1145/2508148.2485933", ISSN = "0163-5964 (print), 1943-5851 (electronic)", ISSN-L = "0163-5964", bibdate = "Sat Jul 27 06:58:55 MDT 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "ICSA '13 conference proceedings.", abstract = "Virtualization has become an important technology that is used across many platforms, particularly servers, to increase utilization, multi-tenancy and security. Virtualization introduces additional overhead that often relates to memory management, interrupt handling and hypervisor mode switching. Among those, memory management and translation lookaside buffer (TLB) management have been shown to have a significant impact on the performance of systems. Two principal mechanisms for TLB management exist in today's systems, namely software and hardware managed TLBs. In this paper, we analyze and quantify the overhead of a pure software virtualization that is implemented over a software managed TLB. We then describe our design of hardware extensions to support virtualization in systems with software managed TLBs to remove the most dominant overheads. These extensions were implemented in the Power embedded A2 core, which is used in the PowerEN and in the Blue Gene/Q processors. They were used to implement a KVM port. We evaluate each of these hardware extensions to determine their overall contributions to performance and efficiency. Collectively these extensions demonstrate an average improvement of 232\% over a pure software implementation.", acknowledgement = ack-nhfb, fjournal = "ACM SIGARCH Computer Architecture News", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89", } @Article{Chen:2013:FRS, author = "Hao Chen and Lin Shi and Jianhua Sun and Kenli Li and Ligang He", title = "A Fast {RPC} System for Virtual Machines", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "24", number = "7", pages = "1267--1276", month = jul, year = "2013", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2012.199", ISSN = "1045-9219", ISSN-L = "1045-9219", bibdate = "Fri Jun 21 08:51:27 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Parallel and Distributed Systems", journal-URL = "http://www.computer.org/tpds/archives.htm", } @Article{Chen:2013:TVR, author = "Chen Chen and Petros Maniatis and Adrian Perrig and Amit Vasudevan and Vyas Sekar", title = "Towards verifiable resource accounting for outsourced computation", journal = j-SIGPLAN, volume = "48", number = "7", pages = "167--178", month = jul, year = "2013", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2517326.2451546", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Mon Aug 26 13:55:17 MDT 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "VEE '13 Conference proceedings.", abstract = "Outsourced computation services should ideally only charge customers for the resources used by their applications. Unfortunately, no verifiable basis for service providers and customers to reconcile resource accounting exists today. This leads to undesirable outcomes for both providers and consumers-providers cannot prove to customers that they really devoted the resources charged, and customers cannot verify that their invoice maps to their actual usage. As a result, many practical and theoretical attacks exist, aimed at charging customers for resources that their applications did not consume. Moreover, providers cannot charge consumers precisely, which causes them to bear the cost of unaccounted resources or pass these costs inefficiently to their customers. We introduce ALIBI, a first step toward a vision for verifiable resource accounting. ALIBI places a minimal, trusted reference monitor underneath the service provider's software platform. This monitor observes resource allocation to customers' guest virtual machines and reports those observations to customers, for verifiable reconciliation. In this paper, we show that ALIBI efficiently and verifiably tracks guests' memory use and CPU-cycle consumption.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @Article{Cheng:2013:DVB, author = "Yueqiang Cheng and Xuhua Ding and Robert H. Deng", title = "{DriverGuard}: Virtualization-Based Fine-Grained Protection on {I/O} Flows", journal = j-TISSEC, volume = "16", number = "2", pages = "6:1--6:??", month = sep, year = "2013", CODEN = "ATISBQ", DOI = "https://doi.org/10.1145/2505123", ISSN = "1094-9224 (print), 1557-7406 (electronic)", ISSN-L = "1094-9224", bibdate = "Mon Sep 23 17:04:07 MDT 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/tissec.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Most commodity peripheral devices and their drivers are geared to achieve high performance with security functions being opted out. The absence of strong security measures invites attacks on the I/O data and consequently posts threats to those services feeding on them, such as fingerprint-based biometric authentication. In this article, we present a generic solution called DriverGuard, which dynamically protects the secrecy of I/O flows such that the I/O data are not exposed to the malicious kernel. Our design leverages a composite of cryptographic and virtualization techniques to achieve fine-grained protection without using any extra devices and modifications on user applications. We implement the DriverGuard prototype on Xen by adding around 1.7K SLOC. DriverGuard is lightweight as it only needs to protect around 2\% of the driver code's execution. We measure the performance and evaluate the security of DriverGuard with three input devices (keyboard, fingerprint reader and camera) and three output devices (printer, graphic card, and sound card). The experiment results show that DriverGuard induces negligible overhead to the applications.", acknowledgement = ack-nhfb, articleno = "6", fjournal = "ACM Transactions on Information and System Security", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789", } @Article{Chiang:2013:IBM, author = "Jui-Hao Chiang and Han-Lin Li and Tzi-cker Chiueh", title = "Introspection-based memory de-duplication and migration", journal = j-SIGPLAN, volume = "48", number = "7", pages = "51--62", month = jul, year = "2013", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2517326.2451525", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Mon Aug 26 13:55:17 MDT 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "VEE '13 Conference proceedings.", abstract = "Memory virtualization abstracts a physical machine's memory resource and presents to the virtual machines running on it a piece of physical memory that could be shared, compressed and moved. To optimize the memory resource utilization by fully leveraging the flexibility afforded by memory virtualization, it is essential that the hypervisor have some sense of how the guest VMs use their allocated physical memory. One way to do this is virtual machine introspection (VMI), which interprets byte values in a guest memory space into semantically meaningful data structures. However, identifying a guest VM's memory usage information such as free memory pool is non-trivial. This paper describes a bootstrapping VM introspection technique that could accurately extract free memory pool information from multiple versions of Windows and Linux without kernel version-specific hard-coding, how to apply this technique to improve the efficiency of memory de-duplication and memory state migration, and the resulting improvement in memory de-duplication speed, gain in additional memory pages de-duplicated, and reduction in traffic loads associated with memory state migration.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @Article{Cui:2013:VMV, author = "Lei Cui and Jianxin Li and Bo Li and Jinpeng Huai and Chunming Hu and Tianyu Wo and Hussain Al-Aqrabi and Lu Liu", title = "{VMScatter}: migrate virtual machines to many hosts", journal = j-SIGPLAN, volume = "48", number = "7", pages = "63--72", month = jul, year = "2013", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2517326.2451528", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Mon Aug 26 13:55:17 MDT 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "VEE '13 Conference proceedings.", abstract = "Live virtual machine migration is a technique often used to migrate an entire OS with running applications in a non-disruptive fashion. Prior works concerned with one-to-one live migration with many techniques have been proposed such as pre-copy, post-copy and log/replay. In contrast, we propose VMScatter, a one-to-many migration method to migrate virtual machines from one to many other hosts simultaneously. First, by merging the identical pages within or across virtual machines, VMScatter multicasts only a single copy of these pages to associated target hosts for avoiding redundant transmission. This is impactful practically when the same OS and similar applications running in the virtual machines where there are plenty of identical pages. Second, we introduce a novel grouping algorithm to decide the placement of virtual machines, distinguished from the previous schedule algorithms which focus on the workload for load balance or power saving, we also focus on network traffic, which is a critical metric in data-intensive data centers. Third, we schedule the multicast sequence of packets to reduce the network overhead introduced by joining or quitting the multicast groups of target hosts. Compared to traditional live migration technique in QEMU/KVM, VMScatter reduces 74.2\% of the total transferred data, 69.1\% of the total migration time and achieves the network traffic reduction from 50.1\% to 70.3\%.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @Article{Dai:2013:LVM, author = "Yuehua Dai and Yong Qi and Jianbao Ren and Yi Shi and Xiaoguang Wang and Xuan Yu", title = "A lightweight {VMM} on many core for high performance computing", journal = j-SIGPLAN, volume = "48", number = "7", pages = "111--120", month = jul, year = "2013", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2517326.2451535", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Mon Aug 26 13:55:17 MDT 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "VEE '13 Conference proceedings.", abstract = "Traditional Virtual Machine Monitor (VMM) virtualizes some devices and instructions, which induces performance overhead to guest operating systems. Furthermore, the virtualization contributes a large amount of codes to VMM, which makes a VMM prone to bugs and vulnerabilities. On the other hand, in cloud computing, cloud service provider configures virtual machines based on requirements which are specified by customers in advance. As resources in a multi-core server increase to more than adequate in the future, virtualization is not necessary although it provides convenience for cloud computing. Based on the above observations, this paper presents an alternative way for constructing a VMM: configuring a booting interface instead of virtualization technology. A lightweight virtual machine monitor --- OSV is proposed based on this idea. OSV can host multiple full functional Linux kernels with little performance overhead. There are only 6 hyper-calls in OSV. The Linux running on top of OSV is intercepted only for the inter-processor interrupts. The resource isolation is implemented with hardware-assist virtualization. The resource sharing is controlled by distributed protocols embedded in current operating systems. We implement a prototype of OSV on AMD Opteron processor based 32-core servers with SVM and cache-coherent NUMA architectures. OSV can host up to 8 Linux kernels on the server with less than 10 lines of code modifications to Linux kernel. OSV has about 8000 lines of code which can be easily tuned and debugged. The experiment results show that OSV VMM has 23.7\% performance improvement compared with Xen VMM.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @Article{Elmore:2013:TDV, author = "Aaron J. Elmore and Carlo Curino and Divyakant Agrawal and Amr {El Abbadi}", title = "Towards database virtualization for database as a service", journal = j-PROC-VLDB-ENDOWMENT, volume = "6", number = "11", pages = "1194--1195", month = aug, year = "2013", CODEN = "????", ISSN = "2150-8097", bibdate = "Fri Dec 13 05:56:54 MST 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; https://www.math.utah.edu/pub/tex/bib/vldbe.bib", abstract = "Advances in operating system and storage-level virtualization technologies have enabled the effective consolidation of heterogeneous applications in a shared cloud infrastructure. Novel research challenges arising from this new shared environment include load balancing, workload estimation, resource isolation, machine replication, live migration, and an emergent need of automation to handle large scale operations with minimal manual intervention. Given that databases are at the core of most applications that are deployed in the cloud, database management systems (DBMSs) represent a very important technology component that needs to be virtualized in order to realize the benefits of virtualization from autonomic management of data-intensive applications in large scale data-centers. The goal of this tutorial is to survey the techniques used in providing elasticity in virtual machine systems, shared storage systems, and survey database research on multitenant architectures and elasticity primitives. This foundation of core Database as a Service advances, together with a primer of important related topics in OS and storage-level virtualization, are central for anyone that wants to operate in this area of research.", acknowledgement = ack-nhfb, fjournal = "Proceedings of the VLDB Endowment", } @Article{Esposito:2013:SES, author = "Flavio Esposito and Ibrahim Matta and Vatche Ishakian", title = "Slice embedding solutions for distributed service architectures", journal = j-COMP-SURV, volume = "46", number = "1", pages = "6:1--6:??", month = oct, year = "2013", CODEN = "CMSVAN", DOI = "https://doi.org/10.1145/2522968.2522974", ISSN = "0360-0300 (print), 1557-7341 (electronic)", ISSN-L = "0360-0300", bibdate = "Fri Nov 1 18:27:34 MDT 2013", bibsource = "http://www.acm.org/pubs/contents/journals/surveys/; https://www.math.utah.edu/pub/tex/bib/compsurv.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Network virtualization provides a novel approach to running multiple concurrent virtual networks over a common physical network infrastructure. From a research perspective, this enables the networking community to concurrently experiment with new Internet architectures and protocols. From a market perspective, on the other hand, this paradigm is appealing as it enables infrastructure service providers to experiment with new business models that range from leasing virtual slices of their infrastructure to hosting multiple concurrent network services. In this article, we present the slice embedding problem and recent developments in the area. A slice is a set of virtual instances spanning a set of physical resources. The embedding problem consists of three main tasks: (1) resource discovery, which involves monitoring the state of the physical resources, (2) virtual network mapping, which involves matching users' requests with the available resources, and (3) allocation, which involves assigning the resources that match the users' requests. We also outline how these three tasks are tightly coupled, and how there exists a wide spectrum of solutions that either solve a particular task or jointly solve multiple tasks along with the interactions among them. To dissect the space of solutions, we introduce three main classification criteria, namely: (1) the type of constraints imposed by the user, (2) the type of dynamics considered in the embedding process, and (3) the allocation strategy adopted. Finally, we conclude with a few interesting research directions.", acknowledgement = ack-nhfb, articleno = "6", fjournal = "ACM Computing Surveys", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204", } @Article{Fabbro:2013:LAS, author = "Andrew Fabbro", title = "{Linux} on {Azure} --- a strange place to find a penguin", journal = j-LINUX-J, volume = "2013", number = "226", pages = "2:1--2:??", month = feb, year = "2013", CODEN = "LIJOFX", ISSN = "1075-3583", ISSN-L = "1075-3583", bibdate = "Wed Mar 27 05:38:05 MDT 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/linux-journal.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "On the heels of Amazon and Google, Microsoft has jumped into the Infrastructure-as-a-Service world, offering cloud-based Linux virtual machines.", acknowledgement = ack-nhfb, articleno = "2", fjournal = "Linux Journal", journal-URL = "http://portal.acm.org/citation.cfm?id=J508", } @Article{Fang:2013:VOV, author = "Weiwei Fang and Xiangmin Liang and Shengxin Li and Luca Chiaraviglio and Naixue Xiong", title = "{VMPlanner}: {Optimizing} virtual machine placement and traffic flow routing to reduce network power costs in cloud data centers", journal = j-COMP-NET-AMSTERDAM, volume = "57", number = "1", pages = "179--196", day = "16", month = jan, year = "2013", CODEN = "????", DOI = "https://doi.org/10.1016/j.comnet.2012.09.008", ISSN = "1389-1286 (print), 1872-7069 (electronic)", ISSN-L = "1389-1286", bibdate = "Tue Feb 12 07:12:41 MST 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www.sciencedirect.com/science/journal/13891286", URL = "http://www.sciencedirect.com/science/article/pii/S1389128612003301", acknowledgement = ack-nhfb, fjournal = "Computer Networks", journal-URL = "http://www.sciencedirect.com/science/journal/13891286", } @Article{Froberg:2013:BRP, author = "Scott Froberg", title = "Book Review: {{\booktitle{Private cloud computing: consolidation, virtualization, and service-oriented infrastructure}} by Stephen R. Smoot, Nam K. Tan}", journal = j-SIGSOFT, volume = "38", number = "2", pages = "35--35", month = mar, year = "2013", CODEN = "SFENDP", DOI = "https://doi.org/10.1145/2439976.2439994", ISSN = "0163-5948 (print), 1943-5843 (electronic)", ISSN-L = "0163-5948", bibdate = "Wed Aug 1 17:16:24 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsoft2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGSOFT Software Engineering Notes", journal-URL = "https://dl.acm.org/citation.cfm?id=J728", } @Article{Fu:2013:BSG, author = "Yangchun Fu and Zhiqiang Lin", title = "Bridging the Semantic Gap in Virtual Machine Introspection via Online Kernel Data Redirection", journal = j-TISSEC, volume = "16", number = "2", pages = "7:1--7:??", month = sep, year = "2013", CODEN = "ATISBQ", DOI = "https://doi.org/10.1145/2505124", ISSN = "1094-9224 (print), 1557-7406 (electronic)", ISSN-L = "1094-9224", bibdate = "Mon Sep 23 17:04:07 MDT 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/tissec.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "It is generally believed to be a tedious, time-consuming, and error-prone process to develop a virtual machine introspection (VMI) tool because of the semantic gap. Recent advance shows that the semantic-gap can be largely narrowed by reusing the executed code from a trusted OS kernel. However, the limitation for such an approach is that it only reuses the exercised code through a training process, which suffers the code coverage issues. Thus, in this article, we present Vmst, a new technique that can seamlessly bridge the semantic gap and automatically generate the VMI tools. The key idea is that, through system wide instruction monitoring, Vmst automatically identifies the introspection related data from a secure-VM and online redirects these data accesses to the kernel memory of a product-VM, without any training. Vmst offers a number of new features and capabilities. Particularly, it enables an in-VM inspection program (e.g., ps) to automatically become an out-of-VM introspection program. We have tested Vmst with over 25 commonly used utilities on top of a number of different OS kernels including Linux and Microsoft Windows. The experimental results show that our technique is general (largely OS-independent), and it introduces 9.3X overhead for Linux utilities and 19.6X overhead for Windows utilities on average for the introspected program compared to the native in-VM execution without data redirection.", acknowledgement = ack-nhfb, articleno = "7", fjournal = "ACM Transactions on Information and System Security", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789", } @Article{Fu:2013:EUD, author = "Yangchun Fu and Zhiqiang Lin", title = "{EXTERIOR}: using a dual-{VM} based external shell for guest-{OS} introspection, configuration, and recovery", journal = j-SIGPLAN, volume = "48", number = "7", pages = "97--110", month = jul, year = "2013", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2517326.2451534", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Mon Aug 26 13:55:17 MDT 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "VEE '13 Conference proceedings.", abstract = "This paper presents EXTERIOR, a dual-VM architecture based external shell that can be used for trusted, timely out-of-VM management of guest-OS such as introspection, configuration, and recovery. Inspired by recent advances in virtual machine introspection (VMI), EXTERIOR leverages an isolated, secure virtual machine (SVM) to introspect the kernel state of a guest virtual machine (GVM). However, it goes far beyond the read-only capability of the traditional VMI, and can perform automatic, fine-grained guest-OS writable operations. The key idea of EXTERIOR is to use a dual-VM architecture in which a SVM runs a kernel identical to that of the GVM to create the necessary environment for a running process (e.g., rmmod, kill), and dynamically and transparently redirect and update the memory state at the VMM layer from SVM to GVM, thereby achieving the same effect in terms of kernel state updates of running the same trusted in-VM program inside the shell of GVM. A proof-of-concept EXTERIOR has been implemented. The experimental results show that EXTERIOR can be used for a timely administration of guest-OS, including introspection and (re)configuration of the guest-OS state and timely response of kernel malware intrusions, without any user account in the guest-OS.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @Article{Fu:2013:SGW, author = "Fangwen Fu and Ulas C. Kozat", title = "Stochastic game for wireless network virtualization", journal = j-IEEE-TRANS-NETWORKING, volume = "21", number = "1", pages = "84--97", month = feb, year = "2013", CODEN = "IEANEP", DOI = "https://doi.org/10.1109/TNET.2012.2190419", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Sat Jul 13 11:32:17 MDT 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "We propose a new framework for wireless network virtualization. In this framework, service providers (SPs) and the network operator (NO) are decoupled from each other: The NO is solely responsible for spectrum management, and SPs are responsible for quality-of-service (QoS) management for their own users. SPs compete for the shared wireless resources to satisfy their distinct service objectives and constraints. We model the dynamic interactions among SPs and the NO as a stochastic game. SPs bid for the resources via dynamically announcing their value functions. The game is regulated by the NO through: (1) sum-utility optimization under rate region constraints; (2) enforcement of Vickrey-Clarke-Groves (VCG) mechanism for pricing the instantaneous rate consumption; and (3) declaration of conjectured prices for future resource consumption. We prove that there exists one Nash equilibrium in the conjectural prices that is efficient, i.e., the sum-utility is maximized. Thus, the NO has the incentive to compute the equilibrium point and feedback to SPs. Given the conjectural prices and the VCG mechanism, we also show that SPs must reveal their truthful value functions at each step to maximize their long-term utilities. As another major contribution, we develop an online learning algorithm that allows the SPs to update the value functions and the NO to update the conjectural prices iteratively. Thus, the proposed framework can deal with unknown dynamics in traffic characteristics and channel conditions. We present simulation results to show the convergence to the Nash equilibrium prices under various dynamic traffic and channel conditions.", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771", } @Article{Fukushima:2013:MDR, author = "Masaki Fukushima and Kohei Sugiyama and Teruyuki Hasegawa and Toru Hasegawa and Akihiro Nakao", title = "Minimum disclosure routing for network virtualization and its experimental evaluation", journal = j-IEEE-TRANS-NETWORKING, volume = "21", number = "6", pages = "1839--1851", month = dec, year = "2013", CODEN = "IEANEP", DOI = "https://doi.org/10.1109/TNET.2013.2238950", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Fri Feb 7 19:18:34 MST 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Although the virtual collocation of service providers (SPs) on top of infrastructure providers (InPs) via network virtualization brings various benefits, we posit that operational confidentiality has not been considered in this network model. We extend and apply the Secure Multiparty Computation (SMC) protocol to solving Minimum Disclosure Routing (MDR), namely, enabling an SP to route packets without disclosing routing information to InPs. We implement the proposed MDR protocol and evaluate its performance via experiments by comparing it against the prediction based on our analytical performance model. Our study reveals that MDR can be securely achieved with marginal latency overhead with regard to the convergence time in well-engineered nonsecure routing algorithms. Our study sheds light on the path for network virtualization to be used to resolve the challenges for the ISPs of today.", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771", } @Article{Gamage:2013:PRO, author = "Sahan Gamage and Ramana Rao Kompella and Dongyan Xu and Ardalan Kangarlou", title = "Protocol Responsibility Offloading to Improve {TCP} Throughput in Virtualized Environments", journal = j-TOCS, volume = "31", number = "3", pages = "7:1--7:??", month = aug, year = "2013", CODEN = "ACSYEC", DOI = "https://doi.org/10.1145/2491463", ISSN = "0734-2071 (print), 1557-7333 (electronic)", ISSN-L = "0734-2071", bibdate = "Wed Aug 28 17:03:36 MDT 2013", bibsource = "http://www.acm.org/pubs/contents/journals/tocs/; https://www.math.utah.edu/pub/tex/bib/tocs.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Virtualization is a key technology that powers cloud computing platforms such as Amazon EC2. Virtual machine (VM) consolidation, where multiple VMs share a physical host, has seen rapid adoption in practice, with increasingly large numbers of VMs per machine and per CPU core. Our investigations, however, suggest that the increasing degree of VM consolidation has serious negative effects on the VMs' TCP performance. As multiple VMs share a given CPU, the scheduling latencies, which can be in the order of tens of milliseconds, substantially increase the typically submillisecond round-trip times (RTTs) for TCP connections in a datacenter, causing significant degradation in throughput. In this article, we propose a lightweight solution, called vPRO, that (a) offloads the VM's TCP congestion control function to the driver domain to improve TCP transmit performance; and (b) offloads TCP acknowledgment functionality to the driver domain to improve the TCP receive performance. Our evaluation of a vPRO prototype on Xen suggests that vPRO substantially improves TCP receive and transmit throughputs with minimal per-packet CPU overhead. We further show that the higher TCP throughput leads to improvement in application-level performance, via experiments with Apache Olio, a Web 2.0 cloud application, and Intel MPI benchmark.", acknowledgement = ack-nhfb, articleno = "7", fjournal = "ACM Transactions on Computer Systems", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J774", } @Article{Ganegedara:2013:CPA, author = "Thilan Ganegedara and Viktor Prasanna", title = "A comprehensive performance analysis of virtual routers on {FPGA}", journal = j-TRETS, volume = "6", number = "2", pages = "9:1--9:??", month = jul, year = "2013", CODEN = "????", DOI = "https://doi.org/10.1145/2492187", ISSN = "1936-7406 (print), 1936-7414 (electronic)", ISSN-L = "1936-7406", bibdate = "Thu Mar 13 08:09:43 MDT 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/trets.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Network virtualization has gained much popularity with the advent of datacenter networking. The hardware aspect of network virtualization, router virtualization, allows network service providers to consolidate network hardware, reducing equipment cost and management overhead. Several approaches have been proposed to achieve router virtualization to support several virtual networks on a single hardware platform. However, their performance has not been analyzed quantitatively to understand the benefits of each approach. In this work, we perform a comprehensive analysis of performance of these approaches on Field Programmable Gate Array (FPGA) with respect to memory consumption, throughput, and power consumption. Generalized versions of virtualization approaches are evaluated based on post place-and-route results on a state-of-the-art FPGA. Grouping of routing tables is proposed as a novel approach to improve scalability (i.e., the number of virtual networks hosted on a single chip) of virtual routers on FPGA with respect to memory requirement. Further, we employ floor-planning techniques to efficiently utilize chip resources and achieve high performance for virtualized, pipelined architectures, resulting in 1.6$ \times $ speedup on the average compared with the non-floor-planned approach. The results indicate that the proposed solution is able to support 100+ and 50 virtual routers per chip in the near-best and near-worst case scenarios, while operating at 20+ Gbps rates.", acknowledgement = ack-nhfb, articleno = "9", fjournal = "ACM Transactions on Reconfigurable Technology and Systems (TRETS)", journal-URL = "http://portal.acm.org/toc.cfm?id=J1151", } @Article{Gao:2013:MOA, author = "Yongqiang Gao and Haibing Guan and Zhengwei Qi and Yang Hou and Liang Liu", title = "A multi-objective ant colony system algorithm for virtual machine placement in cloud computing", journal = j-J-COMP-SYS-SCI, volume = "79", number = "8", pages = "1230--1242", month = dec, year = "2013", CODEN = "JCSSBM", DOI = "https://doi.org/10.1016/j.jcss.2013.02.004", ISSN = "0022-0000 (print), 1090-2724 (electronic)", ISSN-L = "0022-0000", bibdate = "Tue Jan 29 15:27:23 MST 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jcompsyssci.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0022000013000627", acknowledgement = ack-nhfb, fjournal = "Journal of Computer and System Sciences", journal-URL = "http://www.sciencedirect.com/science/journal/00220000", } @Article{Gerofi:2013:UMC, author = "Balazs Gerofi and Zoltan Vass and Yutaka Ishikawa", title = "Utilizing memory content similarity for improving the performance of highly available virtual machines", journal = j-FUT-GEN-COMP-SYS, volume = "29", number = "4", pages = "1085--1095", month = jun, year = "2013", CODEN = "FGSEVI", DOI = "https://doi.org/10.1016/j.future.2012.06.008", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Mon Feb 4 10:31:17 MST 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www.sciencedirect.com/science/journal/0167739X", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X12001446", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Gu:2013:VIV, author = "Dujuan Gu and Xiaohan Liu and Gang Qin and Shuangjian Yan and Ze luo and Baoping Yan", title = "{VNET6}: {IPv6} virtual network for the collaboration between applications and networks", journal = j-J-NETW-COMPUT-APPL, volume = "36", number = "6", pages = "1579--1588", month = nov, year = "2013", CODEN = "JNCAF3", ISSN = "1084-8045 (print), 1095-8592 (electronic)", ISSN-L = "1084-8045", bibdate = "Wed Jan 28 15:44:44 MST 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1084804513000490", acknowledgement = ack-nhfb, ajournal = "J. Netw. Comput. Appl.", fjournal = "Journal of Network and Computer Applications", journal-URL = "http://www.sciencedirect.com/science/journal/10848045", } @Article{Hofmann:2013:ISA, author = "Owen S. Hofmann and Sangman Kim and Alan M. Dunn and Michael Z. Lee and Emmett Witchel", title = "{InkTag}: secure applications on an untrusted operating system", journal = j-COMP-ARCH-NEWS, volume = "41", number = "1", pages = "265--278", month = mar, year = "2013", CODEN = "CANED2", DOI = "https://doi.org/10.1145/2490301.2451146", ISSN = "0163-5964 (print), 1943-5851 (electronic)", ISSN-L = "0163-5964", bibdate = "Thu Sep 4 07:40:49 MDT 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigarch.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "InkTag is a virtualization-based architecture that gives strong safety guarantees to high-assurance processes even in the presence of a malicious operating system. InkTag advances the state of the art in untrusted operating systems in both the design of its hypervisor and in the ability to run useful applications without trusting the operating system. We introduce paraverification, a technique that simplifies the InkTag hypervisor by forcing the untrusted operating system to participate in its own verification. Attribute-based access control allows trusted applications to create decentralized access control policies. InkTag is also the first system of its kind to ensure consistency between secure data and metadata, ensuring recoverability in the face of system crashes.", acknowledgement = ack-nhfb, fjournal = "ACM SIGARCH Computer Architecture News", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89", remark = "ASPLOS '13 conference proceedings.", } @Article{Hovestadt:2013:AOC, author = "Matthias Hovestadt and Odej Kao and Andreas Kliem and Daniel Warneke", title = "Adaptive Online Compression in Clouds --- Making Informed Decisions in Virtual Machine Environments", journal = j-J-GRID-COMP, volume = "11", number = "2", pages = "167--186", month = jun, year = "2013", CODEN = "????", DOI = "https://doi.org/10.1007/s10723-013-9249-4", ISSN = "1570-7873 (print), 1572-9184 (electronic)", ISSN-L = "1570-7873", bibdate = "Sat Jun 22 11:03:44 MDT 2013", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=1570-7873&volume=11&issue=2; https://www.math.utah.edu/pub/tex/bib/datacompression.bib; https://www.math.utah.edu/pub/tex/bib/jgridcomp.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer.com/article/10.1007/s10723-013-9249-4", acknowledgement = ack-nhfb, fjournal = "Journal of Grid Computing", journal-URL = "http://link.springer.com/journal/10723", } @Article{Hsu:2013:IDB, author = "Chun-Chen Hsu and Pangfeng Liu and Jan-Jan Wu and Pen-Chung Yew and Ding-Yong Hong and Wei-Chung Hsu and Chien-Min Wang", title = "Improving dynamic binary optimization through early-exit guided code region formation", journal = j-SIGPLAN, volume = "48", number = "7", pages = "23--32", month = jul, year = "2013", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2517326.2451519", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Mon Aug 26 13:55:17 MDT 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "VEE '13 Conference proceedings.", abstract = "Most dynamic binary translators (DBT) and optimizers (DBO) target binary traces, i.e. frequently executed paths, as code regions to be translated and optimized. Code region formation is the most important first step in all DBTs and DBOs. The quality of the dynamically formed code regions determines the extent and the types of optimization opportunities that can be exposed to DBTs and DBOs, and thus, determines the ultimate quality of the final optimized code. The Next-Executing-Tail (NET) trace formation method used in HP Dynamo is an early example of such techniques. Many existing trace formation schemes are variants of NET. They work very well for most binary traces, but they also suffer a major problem: the formed traces may contain a large number of early exits that could be branched out during the execution. If this happens frequently, the program execution will spend more time in the slow binary interpreter or in the unoptimized code regions than in the optimized traces in code cache. The benefit of the trace optimization is thus lost. Traces/regions with frequently taken early-exits are called delinquent traces/regions. Our empirical study shows that at least 8 of the 12 SPEC CPU2006 integer benchmarks have delinquent traces. In this paper, we propose a light-weight region formation technique called Early-Exit Guided Region Formation (EEG) to improve the quality of the formed traces/regions. It iteratively identifies and merges delinquent regions into larger code regions. We have implemented our EEG algorithm in two LLVM-based multi-threaded DBTs targeting ARM and IA32 instruction set architecture (ISA), respectively. Using SPEC CPU2006 benchmark suite with reference inputs, our results show that compared to an NET-variant currently used in QEMU, a state-of-the-art retargetable DBT, EEG can achieve a significant performance improvement of up to 72\% (27\% on average), and to 49\% (23\% on average) for IA32 and ARM, respectively.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @Article{Hsu:2013:VNM, author = "Wu-Hsiao Hsu and Yuh-Pyng Shieh", title = "Virtual network mapping algorithm in the cloud infrastructure", journal = j-J-NETW-COMPUT-APPL, volume = "36", number = "6", pages = "1724--1734", month = nov, year = "2013", CODEN = "JNCAF3", ISSN = "1084-8045 (print), 1095-8592 (electronic)", ISSN-L = "1084-8045", bibdate = "Wed Jan 28 15:44:44 MST 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1084804513000660", acknowledgement = ack-nhfb, ajournal = "J. Netw. Comput. Appl.", fjournal = "Journal of Network and Computer Applications", journal-URL = "http://www.sciencedirect.com/science/journal/10848045", } @Article{Huang:2013:ECS, author = "Jipeng Huang and Michael D. Bond", title = "Efficient context sensitivity for dynamic analyses via calling context uptrees and customized memory management", journal = j-SIGPLAN, volume = "48", number = "10", pages = "53--72", month = oct, year = "2013", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2544173.2509510", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Mon Dec 9 09:19:33 MST 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "OOPSLA '13 conference proceedings.", abstract = "State-of-the-art dynamic bug detectors such as data race and memory leak detectors report program locations that are likely causes of bugs. However, programmers need more than static program locations to understand the behavior of increasingly complex and concurrent software. Dynamic calling context provides additional information, but it is expensive to record calling context frequently, e.g., at every read and write. Context-sensitive dynamic analyses can build and maintain a calling context tree (CCT) to track calling context--but in order to reuse existing nodes, CCT-based approaches require an expensive lookup. This paper introduces a new approach for context sensitivity that avoids this expensive lookup. The approach uses a new data structure called the calling context uptree (CCU) that adds low overhead by avoiding the lookup and instead allocating a new node for each context. A key contribution is that the approach can mitigate the costs of allocating many nodes by extending tracing garbage collection (GC): GC collects unused CCU nodes naturally and efficiently, and we extend GC to merge duplicate nodes lazily. We implement our CCU-based approach in a high-performance Java virtual machine and integrate it with a staleness-based memory leak detector and happens-before data race detector, so they can report context-sensitive program locations that cause bugs. We show that the CCU-based approach, in concert with an extended GC, provides a compelling alternative to CCT-based approaches for adding context sensitivity to dynamic analyses.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @Article{Huang:2013:ESC, author = "Qun Huang and Patrick P. C. Lee", title = "An experimental study of cascading performance interference in a virtualized environment", journal = j-SIGMETRICS, volume = "40", number = "4", pages = "43--52", month = mar, year = "2013", CODEN = "????", DOI = "https://doi.org/10.1145/2479942.2479948", ISSN = "0163-5999 (print), 1557-9484 (electronic)", ISSN-L = "0163-5999", bibdate = "Sun May 5 09:58:21 MDT 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigmetrics.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "In a consolidated virtualized environment, multiple virtual machines (VMs) are hosted atop a shared physical substrate. They share the underlying hardware resources as well as the software virtualization components. Thus, one VM can generate performance interference to another co-resident VM. This work explores the adverse impact of performance interference from a security perspective. We present a new class of attacks, namely the cascade attacks, in which an adversary seeks to generate performance interference using a malicious VM. One distinct property of the cascade attacks is that when the malicious VM exhausts one type of hardware resources, it will bring ``cascading'' interference to another type of hardware resources. We present four different implementations of cascade attacks and evaluate their effectiveness atop the Xen virtualization platform. We show that a victim VM can see significant performance degradation (e.g., throughput drops in network and disk I/Os) due to the cascade attacks.", acknowledgement = ack-nhfb, fjournal = "ACM SIGMETRICS Performance Evaluation Review", journal-URL = "http://portal.acm.org/toc.cfm?id=J618", } @Article{Huang:2013:VHS, author = "Chun-Hsian Huang and Pao-Ann Hsiung", title = "Virtualizable hardware\slash software design infrastructure for dynamically partially reconfigurable systems", journal = j-TRETS, volume = "6", number = "2", pages = "11:1--11:??", month = jul, year = "2013", CODEN = "????", DOI = "https://doi.org/10.1145/2499625.2499628", ISSN = "1936-7406 (print), 1936-7414 (electronic)", ISSN-L = "1936-7406", bibdate = "Thu Mar 13 08:09:43 MDT 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/trets.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "In most existing works, reconfigurable hardware modules are still managed as conventional hardware devices. Further, the software reconfiguration overhead incurred by loading corresponding device drivers into the kernel of an operating system has been overlooked until now. As a result, the enhancement of system performance and the utilization of reconfigurable hardware modules are still quite limited. This work proposes a virtualizable hardware/software design infrastructure (VDI) for dynamically partially reconfigurable systems. Besides the gate-level hardware virtualization provided by the partial reconfiguration technology, VDI supports the device-level hardware virtualization. In VDI, a reconfigurable hardware module can be virtualized such that it can be accessed efficiently by multiple applications in an interleaving way. A Hot-Plugin Connector (HPC) replaces the conventional device driver, such that it not only assists the device-level hardware virtualization but can also be reused across different hardware modules. To facilitate hardware/software communication and to enhance system scalability, the proposed VDI is realized as a hierarchical design framework. User-designed reconfigurable hardware modules can be easily integrated into VDI, and are then executed as hardware tasks in an operating system for reconfigurable systems (OS4RS). A dynamically partially reconfigurable network security system was designed using VDI, which demonstrated a higher utilization of reconfigurable hardware modules and a reduction by up to 12.83\% of the processing time required by using the conventional method in a dynamically partially reconfigurable system.", acknowledgement = ack-nhfb, articleno = "11", fjournal = "ACM Transactions on Reconfigurable Technology and Systems (TRETS)", journal-URL = "http://portal.acm.org/toc.cfm?id=J1151", } @Article{Isci:2013:AEV, author = "Canturk Isci and Suzanne McIntosh and Jeffrey Kephart and Rajarshi Das and James Hanson and Scott Piper and Robert Wolford and Thomas Brey and Robert Kantner and Allen Ng and James Norris and Abdoulaye Traore and Michael Frissora", title = "Agile, efficient virtualization power management with low-latency server power states", journal = j-COMP-ARCH-NEWS, volume = "41", number = "3", pages = "96--107", month = jun, year = "2013", CODEN = "CANED2", DOI = "https://doi.org/10.1145/2508148.2485931", ISSN = "0163-5964 (print), 1943-5851 (electronic)", ISSN-L = "0163-5964", bibdate = "Sat Jul 27 06:58:55 MDT 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigarch.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "ICSA '13 conference proceedings.", abstract = "One of the main driving forces of the growing adoption of virtualization is its dramatic simplification of the provisioning and dynamic management of IT resources. By decoupling running entities from the underlying physical resources, and by providing easy-to-use controls to allocate, deallocate and migrate virtual machines (VMs) across physical boundaries, virtualization opens up new opportunities for improving overall system resource use and power efficiency. While a range of techniques for dynamic, distributed resource management of virtualized systems have been proposed and have seen their widespread adoption in enterprise systems, similar techniques for dynamic power management have seen limited acceptance. The main barrier to dynamic, power-aware virtualization management stems not from the limitations of virtualization, but rather from the underlying physical systems; and in particular, the high latency and energy cost of power state change actions suited for virtualization power management. In this work, we first explore the feasibility of low-latency power states for enterprise server systems and demonstrate, with real prototypes, their quantitative energy-performance trade offs compared to traditional server power states. Then, we demonstrate an end-to-end power-aware virtualization management solution leveraging these states, and evaluate the dramatically-favorable power-performance characteristics achievable with such systems. We present, via both real system implementations and scale-out simulations, that virtualization power management with low-latency server power states can achieve comparable overheads as base distributed resource management in virtualized systems, and thus can benefit from the same level of adoption, while delivering close to energy-proportional power efficiency.", acknowledgement = ack-nhfb, fjournal = "ACM SIGARCH Computer Architecture News", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89", } @Article{Jantz:2013:FAG, author = "Michael R. Jantz and Carl Strickland and Karthik Kumar and Martin Dimitrov and Kshitij A. Doshi", title = "A framework for application guidance in virtual memory systems", journal = j-SIGPLAN, volume = "48", number = "7", pages = "155--166", month = jul, year = "2013", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2517326.2451543", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Mon Aug 26 13:55:17 MDT 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "VEE '13 Conference proceedings.", abstract = "This paper proposes a collaborative approach in which applications can provide guidance to the operating system regarding allocation and recycling of physical memory. The operating system incorporates this guidance to decide which physical page should be used to back a particular virtual page. The key intuition behind this approach is that application software, as a generator of memory accesses, is best equipped to inform the operating system about the relative access rates and overlapping patterns of usage of its own address space. It is also capable of steering its own algorithms in order to keep its dynamic memory footprint under check when there is a need to reduce power or to contain the spillover effects from bursts in demand. Application software, working cooperatively with the operating system, can therefore help the latter schedule memory more effectively and efficiently than when the operating system is forced to act alone without such guidance. It is particularly difficult to achieve power efficiency without application guidance since power expended in memory is a function not merely of the intensity with which memory is accessed in time but also how many physical ranks are affected by an application's memory usage. Our framework introduces an abstraction called ``colors'' for the application to communicate its intent to the operating system. We modify the operating system to receive this communication in an efficient way, and to organize physical memory pages into intermediate level grouping structures called ``trays'' which capture the physically independent access channels and self-refresh domains, so that it can apply this guidance without entangling the application in lower level details of power or bandwidth management. This paper describes how we re-architect the memory management of a recent Linux kernel to realize a three way collaboration between hardware, supervisory software, and application tasks.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @Article{Jantz:2013:PPO, author = "Michael R. Jantz and Prasad A. Kulkarni", title = "Performance potential of optimization phase selection during dynamic {JIT} compilation", journal = j-SIGPLAN, volume = "48", number = "7", pages = "131--142", month = jul, year = "2013", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2517326.2451539", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Mon Aug 26 13:55:17 MDT 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "VEE '13 Conference proceedings.", abstract = "Phase selection is the process of customizing the applied set of compiler optimization phases for individual functions or programs to improve performance of generated code. Researchers have recently developed novel feature-vector based heuristic techniques to perform phase selection during online JIT compilation. While these heuristics improve program startup speed, steady-state performance was not seen to benefit over the default fixed single sequence baseline. Unfortunately, it is still not conclusively known whether this lack of steady-state performance gain is due to a failure of existing online phase selection heuristics, or because there is, indeed, little or no speedup to be gained by phase selection in online JIT environments. The goal of this work is to resolve this question, while examining the phase selection related behavior of optimizations, and assessing and improving the effectiveness of existing heuristic solutions. We conduct experiments to find and understand the potency of the factors that can cause the phase selection problem in JIT compilers. Next, using long-running genetic algorithms we determine that program-wide and method-specific phase selection in the HotSpot JIT compiler can produce ideal steady-state performance gains of up to 15\% (4.3\% average) and 44\% (6.2\% average) respectively. We also find that existing state-of-the-art heuristic solutions are unable to realize these performance gains (in our experimental setup), discuss possible causes, and show that exploiting knowledge of optimization phase behavior can help improve such heuristic solutions. Our work develops a robust open-source production-quality framework using the HotSpot JVM to further explore this problem in the future.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @Article{Jeong:2013:AVM, author = "Jinkyu Jeong and Sung-Hun Kim and Hwanju Kim and Joonwon Lee and Euiseong Seo", title = "Analysis of virtual machine live-migration as a method for power-capping", journal = j-J-SUPERCOMPUTING, volume = "66", number = "3", pages = "1629--1655", month = dec, year = "2013", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-013-0956-1", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Sat Feb 8 11:30:58 MST 2014", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0920-8542&volume=66&issue=3; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer.com/article/10.1007/s11227-013-0956-1", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Jia:2013:SID, author = "Ning Jia and Chun Yang and Jing Wang and Dong Tong and Keyi Wang", title = "{SPIRE}: improving dynamic binary translation through {SPC}-indexed indirect branch redirecting", journal = j-SIGPLAN, volume = "48", number = "7", pages = "1--12", month = jul, year = "2013", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2517326.2451516", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Mon Aug 26 13:55:17 MDT 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "VEE '13 Conference proceedings.", abstract = "Dynamic binary translation system must perform an address translation for every execution of indirect branch instructions. The procedure to convert Source binary Program Counter (SPC) address to Translated Program Counter (TPC) address always takes more than 10 instructions, becoming a major source of performance overhead. This paper proposes a novel mechanism called SPc-Indexed REdirecting (SPIRE), which can significantly reduce the indirect branch handling overhead. SPIRE doesn't rely on hash lookup and address mapping table to perform address translation. It reuses the source binary code space to build a SPC-indexed redirecting table. This table can be indexed directly by SPC address without hashing. With SPIRE, the indirect branch can jump to the originally SPC address without address translation. The trampoline residing in the SPC address will redirect the control flow to related code cache. Only 2-6 instructions are needed to handle an indirect branch execution. As part of the source binary would be overwritten, a shadow page mechanism is explored to keep transparency of the corrupt source binary code page. Online profiling is adopted to reduce the memory overhead. We have implemented SPIRE on an x86 to x86 DBT system, and discussed the implementation issues on different guest and host architectures. The experiments show that, compared with hash lookup mechanism, SPIRE can reduce the performance overhead by 36.2\% on average, up to 51.4\%, while only 5.6\% extra memory is needed. SPIRE can cooperate with other indirect branch handling mechanisms easily, and we believe the idea of SPIRE can also be applied on other occasions that need address translation.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @Article{Jin:2013:CFG, author = "Hai Jin and Ge Cheng and Deqing Zou and Xinwen Zhang", title = "{Cherub}: Fine-grained application protection with on-demand virtualization", journal = j-COMPUT-MATH-APPL, volume = "65", number = "9", pages = "1326--1338", month = may, year = "2013", CODEN = "CMAPDK", ISSN = "0898-1221 (print), 1873-7668 (electronic)", ISSN-L = "0898-1221", bibdate = "Wed Mar 1 21:51:21 MST 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/computmathappl2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0898122112001149", acknowledgement = ack-nhfb, fjournal = "Computers and Mathematics with Applications", journal-URL = "http://www.sciencedirect.com/science/journal/08981221", } @Article{Jo:2013:ELM, author = "Changyeon Jo and Erik Gustafsson and Jeongseok Son and Bernhard Egger", title = "Efficient live migration of virtual machines using shared storage", journal = j-SIGPLAN, volume = "48", number = "7", pages = "41--50", month = jul, year = "2013", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2517326.2451524", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Mon Aug 26 13:55:17 MDT 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "VEE '13 Conference proceedings.", abstract = "Live migration of virtual machines (VM) across distinct physical hosts is an important feature of virtualization technology for maintenance, load-balancing and energy reduction, especially so for data centers operators and cluster service providers. Several techniques have been proposed to reduce the downtime of the VM being transferred, often at the expense of the total migration time. In this work, we present a technique to reduce the total time required to migrate a running VM from one host to another while keeping the downtime to a minimum. Based on the observation that modern operating systems use the better part of the physical memory to cache data from secondary storage, our technique tracks the VM's I/O operations to the network-attached storage device and maintains an updated mapping of memory pages that currently reside in identical form on the storage device. During the iterative pre-copy live migration process, instead of transferring those pages from the source to the target host, the memory-to-disk mapping is sent to the target host which then fetches the contents directly from the network-attached storage device. We have implemented our approach into the Xen hypervisor and ran a series of experiments with Linux HVM guests. On average, the presented technique shows a reduction of up over 30\% on average of the total transfer time for a series of benchmarks.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @Article{Kalibera:2013:RBR, author = "Tomas Kalibera and Richard Jones", title = "Rigorous benchmarking in reasonable time", journal = j-SIGPLAN, volume = "48", number = "11", pages = "63--74", month = nov, year = "2013", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2555670.2464160", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Mon Dec 9 08:04:34 MST 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "ISMM '13 conference proceedings.", abstract = "Experimental evaluation is key to systems research. Because modern systems are complex and non-deterministic, good experimental methodology demands that researchers account for uncertainty. To obtain valid results, they are expected to run many iterations of benchmarks, invoke virtual machines (VMs) several times, or even rebuild VM or benchmark binaries more than once. All this repetition costs time to complete experiments. Currently, many evaluations give up on sufficient repetition or rigorous statistical methods, or even run benchmarks only in training sizes. The results reported often lack proper variation estimates and, when a small difference between two systems is reported, some are simply unreliable. In contrast, we provide a statistically rigorous methodology for repetition and summarising results that makes efficient use of experimentation time. Time efficiency comes from two key observations. First, a given benchmark on a given platform is typically prone to much less non-determinism than the common worst-case of published corner-case studies. Second, repetition is most needed where most uncertainty arises (whether between builds, between executions or between iterations). We capture experimentation cost with a novel mathematical model, which we use to identify the number of repetitions at each level of an experiment necessary and sufficient to obtain a given level of precision. We present our methodology as a cookbook that guides researchers on the number of repetitions they should run to obtain reliable results. We also show how to present results with an effect size confidence interval. As an example, we show how to use our methodology to conduct throughput experiments with the DaCapo and SPEC CPU benchmarks on three recent platforms.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @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 = "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", } @Article{Kang:2013:HPP, author = "Hui Kang and Jennifer L. Wong", title = "To hardware prefetch or not to prefetch?: a virtualized environment study and core binding approach", journal = j-SIGPLAN, volume = "48", number = "4", pages = "357--368", month = apr, year = "2013", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2499368.2451155", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Mon Jul 1 17:15:23 MDT 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Most hardware and software vendors suggest disabling hardware prefetching in virtualized environments. They claim that prefetching is detrimental to application performance due to inaccurate prediction caused by workload diversity and VM interference on shared cache. However, no comprehensive or quantitative measurements to support this belief have been performed. This paper is the first to systematically measure the influence of hardware prefetching in virtualized environments. We examine a wide variety of benchmarks on three types of chip-multiprocessors (CMPs) to analyze the hardware prefetching performance. We conduct extensive experiments by taking into account a number of important virtualization factors. We find that hardware prefetching has minimal destructive influence under most configurations. Only with certain application combinations does prefetching influence the overall performance. To leverage these findings and make hardware prefetching effective across a diversity of virtualized environments, we propose a dynamic prefetching-aware VCPU-core binding approach (PAVCB), which includes two phases --- classifying and binding. The workload of each VM is classified into different cache sharing constraint categories based upon its cache access characteristics, considering both prefetch requests and demand requests. Then following heuristic rules, the VCPUs of each VM are scheduled onto appropriate cores subject to cache sharing constraints. We show that the proposed approach can improve performance by 12\% on average over the default scheduler and 46\% over manual system administrator bindings across different workload combinations in the presence of hardware prefetching.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "ASPLOS '13 conference proceedings.", } @Article{Kaufmann:2013:SCO, author = "Marco Kaufmann and Rainer G. Spallek", title = "Superblock compilation and other optimization techniques for a {Java}-based {DBT} machine emulator", journal = j-SIGPLAN, volume = "48", number = "7", pages = "33--40", month = jul, year = "2013", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2517326.2451521", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Mon Aug 26 13:55:17 MDT 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "VEE '13 Conference proceedings.", abstract = "Superblock compilation techniques such as control flow graph (CFG) or trace compilation have become a widely adopted approach to increase the performance of dynamically compiling virtual machines even further. While this was shown to be successful for many conventional virtual machines, it did not result in a higher performance for Java-based DBT machine emulators so far. These emulators dynamically translate application binaries of a target machine into Java bytecode, which is then eventually compiled into the native code of the emulating host by the Java Virtual Machine (JVM). Successful superblock compilation techniques for this class of emulators must consider the special requirements that result from the two-stage translation as well as the characteristics of the JVM, such as the inability of most Java JIT compilers to handle large bytecode methods efficiently. In this paper, we present a superblock compilation approach for a Java-based DBT machine emulator that generates a performance increase of up to 90 percent and of 32 percent on average. The key idea of our design is to provide a large scope over the control flow of target applications across basic block boundaries for the JVM, while still keeping small bytecode methods for the execution units. In addition, we also present two further optimizations --- interpreter context elimination and program counter elimination --- which increase the emulation performance by 16 percent again. In total, the optimization techniques discussed in this paper provide an average performance gain of 48 percent for the surveyed emulator.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @Article{Kawahito:2013:IRF, author = "Motohiro Kawahito and Hideaki Komatsu and Takao Moriyama and Hiroshi Inoue and Toshio Nakatani", title = "Idiom recognition framework using topological embedding", journal = j-TACO, volume = "10", number = "3", pages = "13:1--13:??", month = sep, year = "2013", CODEN = "????", DOI = "https://doi.org/10.1145/2512431", ISSN = "1544-3566 (print), 1544-3973 (electronic)", ISSN-L = "1544-3566", bibdate = "Mon Sep 16 17:20:12 MDT 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/taco.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Modern processors support hardware-assist instructions (such as TRT and TROT instructions on the IBM System z) to accelerate certain functions such as delimiter search and character conversion. Such special instructions are often used in high-performance libraries, but their exploitation in optimizing compilers has been limited. We devised a new idiom recognition technique based on a topological embedding algorithm to detect idiom patterns in the input programs more aggressively than in previous approaches using exact pattern matching. Our approach can detect a pattern even if the code segment does not exactly match the idiom. For example, we can detect a code segment that includes additional code within the idiom pattern. We also propose an instruction simplification for the idiom recognition. This optimization analyzes all of the usages of the output of the optimized code for a specific idiom. If we find that we do not need an actual value for the output but only a value in a subrange, then we can assign a value in that subrange as the output. The code generation can generate faster code with this optimization. We implemented our new idiom recognition approach based on the Java Just-In-Time (JIT) compiler that is part of the J9 Java Virtual Machine, and we supported several important idioms for the special hardware-assist instructions on the IBM System z and on some models of the IBM System p. To demonstrate the effectiveness of our technique, we performed two experiments. The first experiment was to see how many more patterns we can detect compared to the previous approach. The second experiment measured the performance improvements over the previous approaches. For the first experiment, we used the Java Compatibility Kit (JCK) API tests. For the second experiment we used the IBM XML parser, SPECjvm98, and SPCjbb2000. In summary, relative to a baseline implementation using exact pattern matching, our algorithm converted 76\% more loops in JCK tests. On a z9, we also observed significant average performance improvement of the XML parser by 54\%, of SPECjvm98 by 1.9\%, and of SPECjbb2000 by 4.4\%. Finally, we observed that the JIT compilation time increased by only 0.32\% to 0.44\%.", acknowledgement = ack-nhfb, articleno = "13", fjournal = "ACM Transactions on Architecture and Code Optimization (TACO)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J924", } @Article{Khazaei:2013:PCC, author = "Hamzeh Khazaei and Jelena Misic and Vojislav B. Misic", title = "Performance of Cloud Centers with High Degree of Virtualization under Batch Task Arrivals", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "24", number = "12", pages = "2429--2438", month = dec, year = "2013", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2012.318", ISSN = "1045-9219", ISSN-L = "1045-9219", bibdate = "Tue Jan 28 18:34:52 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Parallel and Distributed Systems", journal-URL = "http://www.computer.org/tpds/archives.htm", } @Article{Kiefer:2013:RDN, author = "Kurt E. Kiefer and Louise E. Moser", title = "Replay debugging of non-deterministic executions in the {Kernel}-based {Virtual Machine}", journal = j-SPE, volume = "43", number = "11", pages = "1261--1281", month = nov, year = "2013", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/spe.1094", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Tue Dec 3 10:30:25 MST 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www3.interscience.wiley.com/journalfinder.html", acknowledgement = ack-nhfb, fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", onlinedate = "27 May 2011", } @Article{Kiefer:2013:SIP, author = "Kurt E. Kiefer and Louise E. Moser", title = "Special Issue Papers: Replay debugging of non-deterministic executions in the {Kernel}-based {Virtual Machine}", journal = j-SPE, volume = "43", number = "11", pages = "1261--1281", month = nov, year = "2013", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/spe.1094", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Tue Dec 3 10:30:25 MST 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www3.interscience.wiley.com/journalfinder.html", acknowledgement = ack-nhfb, fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", onlinedate = "27 May 2011", } @Article{Kim:2013:DBC, author = "Hwanju Kim and Sangwook Kim and Jinkyu Jeong and Joonwon Lee and Seungryoul Maeng", title = "Demand-based coordinated scheduling for {SMP VMs}", journal = j-COMP-ARCH-NEWS, volume = "41", number = "1", pages = "369--380", month = mar, year = "2013", CODEN = "CANED2", DOI = "https://doi.org/10.1145/2490301.2451156", ISSN = "0163-5964 (print), 1943-5851 (electronic)", ISSN-L = "0163-5964", bibdate = "Thu Sep 4 07:40:49 MDT 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigarch.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "As processor architectures have been enhancing their computing capacity by increasing core counts, independent workloads can be consolidated on a single node for the sake of high resource efficiency in data centers. With the prevalence of virtualization technology, each individual workload can be hosted on a virtual machine for strong isolation between co-located workloads. Along with this trend, hosted applications have increasingly been multithreaded to take advantage of improved hardware parallelism. Although the performance of many multithreaded applications highly depends on communication (or synchronization) latency, existing schemes of virtual machine scheduling do not explicitly coordinate virtual CPUs based on their communication behaviors. This paper presents a demand-based coordinated scheduling scheme for consolidated virtual machines that host multithreaded workloads. To this end, we propose communication-driven scheduling that controls time-sharing in response to inter-processor interrupts (IPIs) between virtual CPUs. On the basis of in-depth analysis on the relationship between IPI communications and coordination demands, we devise IPI-driven coscheduling and delayed preemption schemes, which effectively reduce synchronization latency and unnecessary CPU consumption. In addition, we introduce a load-conscious CPU allocation policy in order to address load imbalance in heterogeneously consolidated environments. The proposed schemes are evaluated with respect to various scenarios of mixed workloads using the PARSEC multithreaded applications. In the evaluation, our scheme improves the overall performance of consolidated workloads, especially communication-intensive applications, by reducing inefficient synchronization latency.", acknowledgement = ack-nhfb, fjournal = "ACM SIGARCH Computer Architecture News", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89", remark = "ASPLOS '13 conference proceedings.", } @Article{Kim:2013:VMC, author = "Shin-gyu Kim and Hyeonsang Eom and Heon Y. Yeom", title = "Virtual machine consolidation based on interference modeling", journal = j-J-SUPERCOMPUTING, volume = "66", number = "3", pages = "1489--1506", month = dec, year = "2013", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-013-0939-2", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Sat Feb 8 10:22:06 MST 2014", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0920-8542&volume=66&issue=3; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer.com/article/10.1007/s11227-013-0939-2", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Kocoloski:2013:ICN, author = "Brian Kocoloski and John Lange", title = "Improving compute node performance using virtualization", journal = j-IJHPCA, volume = "27", number = "2", pages = "124--135", month = may, year = "2013", CODEN = "IHPCFL", DOI = "https://doi.org/10.1177/1094342013476313", ISSN = "1094-3420 (print), 1741-2846 (electronic)", ISSN-L = "1094-3420", bibdate = "Sat Jun 22 12:39:11 MDT 2013", bibsource = "http://hpc.sagepub.com/content/27/2.toc; https://www.math.utah.edu/pub/tex/bib/ijsa.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://hpc.sagepub.com/content/27/2/124.full.pdf+html", acknowledgement = ack-nhfb, fjournal = "International Journal of High Performance Computing Applications", journal-URL = "http://hpc.sagepub.com/content/by/year", onlinedate = "February 28, 2013", } @Article{Kumar:2013:OAM, author = "Narander Kumar and Shalini Agarwal and Vipin Saxena", title = "Overload Avoidance Model using Optimal Placement of Virtual Machines in Cloud Data Cetres", journal = j-INT-J-COMP-APPL, volume = "73", number = "??", pages = "18--25", month = jul, year = "2013", CODEN = "????", DOI = "https://doi.org/10.5120/12786-9963", ISSN = "0975-8887", ISSN-L = "0975-8887", bibdate = "Fri Jan 24 08:58:52 MST 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcompappl.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.ijcaonline.org/archives/volume73/number11/12786-9963/", acknowledgement = ack-nhfb, ajournal = "Intern. J. of Computer Applications", articleno = "11", fjournal = "International Journal of Computer Applications", journal-URL = "https://www.ijcaonline.org/", } @Article{Lameed:2013:MAS, author = "Nurudeen A. Lameed and Laurie J. Hendren", title = "A modular approach to on-stack replacement in {LLVM}", journal = j-SIGPLAN, volume = "48", number = "7", pages = "143--154", month = jul, year = "2013", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2517326.2451541", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Mon Aug 26 13:55:17 MDT 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "VEE '13 Conference proceedings.", abstract = "On-stack replacement (OSR) is a technique that allows a virtual machine to interrupt running code during the execution of a function/method, to re-optimize the function on-the-fly using an optimizing JIT compiler, and then to resume the interrupted function at the point and state at which it was interrupted. OSR is particularly useful for programs with potentially long-running loops, as it allows dynamic optimization of those loops as soon as they become hot. This paper presents a modular approach to implementing OSR for the LLVM compiler infrastructure. This is an important step forward because LLVM is gaining popular support, and adding the OSR capability allows compiler developers to develop new dynamic techniques. In particular, it will enable more sophisticated LLVM-based JIT compiler approaches. Indeed, other compiler/VM developers can use our approach because it is a clean modular addition to the standard LLVM distribution. Further, our approach is defined completely at the LLVM-IR level and thus does not require any modifications to the target code generation. The OSR implementation can be used by different compilers to support a variety of dynamic optimizations. As a demonstration of our OSR approach, we have used it to support dynamic inlining in McVM. McVM is a virtual machine for MATLAB which uses a LLVM-based JIT compiler. MATLAB is a popular dynamic language for scientific and engineering applications that typically manipulate large matrices and often contain long-running loops, and is thus an ideal target for dynamic JIT compilation and OSRs. Using our McVM example, we demonstrate reasonable overheads for our benchmark set, and performance improvements when using it to perform dynamic inlining.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @Article{Li:2013:RVS, author = "Wenfeng Li and Ye Zhong and Xun Wang and Yulian Cao", title = "Resource virtualization and service selection in cloud logistics", journal = j-J-NETW-COMPUT-APPL, volume = "36", number = "6", pages = "1696--1704", month = nov, year = "2013", CODEN = "JNCAF3", ISSN = "1084-8045 (print), 1095-8592 (electronic)", ISSN-L = "1084-8045", bibdate = "Wed Jan 28 15:44:44 MST 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S108480451300057X", acknowledgement = ack-nhfb, ajournal = "J. Netw. Comput. Appl.", fjournal = "Journal of Network and Computer Applications", journal-URL = "http://www.sciencedirect.com/science/journal/10848045", } @Book{Lindholm:2013:JVMa, author = "Tim Lindholm and Frank Yellin and Gilad Bracha and Alex Buckley", title = "The {Java Virtual Machine} Specification", publisher = pub-PH, address = pub-PH:adr, edition = "Third", pages = "????", year = "2013", ISBN = "0-13-326044-5 (paperback)", ISBN-13 = "978-0-13-326044-1 (paperback)", LCCN = "????", bibdate = "Mon Jan 28 14:57:22 MST 2013", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/java2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", series = "The Java series", acknowledgement = ack-nhfb, subject = "Java (Computer program language)", xxaddress = "Harlow", } @Book{Lindholm:2013:JVMb, author = "Tim Lindholm and Frank Yellin and Gilad Bracha and Alex Buckley", title = "The {Java Virtual Machine} Specification", publisher = pub-AW, address = pub-AW, edition = "{Java SE 7}", pages = "xvii + 587 (est.)", year = "2013", ISBN = "0-13-326049-6, 0-13-326044-5", ISBN-13 = "978-0-13-326049-6, 978-0-13-326044-1", LCCN = "QA76.73.J38 L56 1999", bibdate = "Thu Dec 4 07:52:39 MST 2014", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/java2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://proquest.tech.safaribooksonline.de/9780133260496", acknowledgement = ack-nhfb, remark = "Previous edition: 2nd, 1999.", subject = "Java (Computer program language); Internet; Virtual computer systems; Java (Computer program language); Internet; Virtual computer systems", } @Article{Liu:2013:SPV, author = "Denghui Liu and Jinli Cao", title = "Scheduling para-virtualized virtual machines based on events", journal = j-FUT-GEN-COMP-SYS, volume = "29", number = "5", pages = "1130--1139", month = jul, year = "2013", CODEN = "FGSEVI", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Wed Mar 27 07:33:35 MDT 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www.sciencedirect.com/science/journal/0167739X", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X12002348", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Lyons:2013:SFF, author = "Michael Lyons and Gu-Yeon Wei and David Brooks", title = "{Shrink-Fit}: A Framework for Flexible Accelerator Sizing", journal = j-IEEE-COMPUT-ARCHIT-LETT, volume = "12", number = "1", pages = "17--20", month = jan # "\slash " # jun, year = "2013", CODEN = "????", DOI = "https://doi.org/10.1109/L-CA.2012.7", ISSN = "1556-6056 (print), 1556-6064 (electronic)", ISSN-L = "1556-6056", bibdate = "Fri Jun 21 07:26:57 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeecomputarchitlett.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "RTL design complexity discouraged adoption of reconfigurable logic in general purpose systems, impeding opportunities for performance and energy improvements. Recent improvements to HLS compilers simplify RTL design and are easing this barrier. A new challenge will emerge: managing reconfigurable resources between multiple applications with custom hardware designs. In this paper, we propose a method to ``shrink-fit' accelerators within widely varying fabric budgets. Shrink-fit automatically shrinks existing accelerator designs within small fabric budgets and grows designs to increase performance when larger budgets are available. Our method takes advantage of current accelerator design techniques and introduces a novel architectural approach based on fine-grained virtualization. We evaluate shrink-fit using a synthesized implementation of an IDCT for decoding JPEGs and show the IDCT accelerator can shrink by a factor of 16x with minimal performance and area overheads. Using shrink-fit, application designers can achieve the benefits of hardware acceleration with single RTL designs on FPGAs large and small.", acknowledgement = ack-nhfb, affiliation = "Lyons, M (Reprint Author), Harvard Univ, Sch Engn \& Appl Sci, Cambridge, MA 02138 USA. Lyons, Michael; Wei, Gu-Yeon; Brooks, David, Harvard Univ, Sch Engn \& Appl Sci, Cambridge, MA 02138 USA.", da = "2019-06-20", doc-delivery-number = "172HT", fjournal = "IEEE Computer Architecture Letters", journal-iso = "IEEE Comput. Archit. Lett.", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=10208", keywords = "Accelerators; computational complexity; Computer applications; custom hardware design; Decoding; discrete cosine transforms; fabric budget; field programmable gate arrays; Field programmable gate arrays; fine grained virtualization; flexible accelerator sizing; FPGA; general purpose computers; general purpose system; hardware acceleration; Heterogeneous (hybrid) systems; HLS compiler; IDCT accelerator; inverse transforms; JPEG decoding; program compilers; Program processors; reconfigurable architectural approach; reconfigurable architectures; Reconfigurable hardware; reconfigurable logic; reconfigurable resource management; RTL design complexity; Runtime; shrink fit accelerator; Special-Purpose and Application-Based Systems; temporal logic; virtual machines; virtualisation", number-of-cited-references = "12", research-areas = "Computer Science", times-cited = "0", unique-id = "Lyons:2013:SFF", web-of-science-categories = "Computer Science, Hardware \& Architecture", } @Article{Mandal:2013:EVM, author = "Sameer Kumar Mandal and Pabitra Mohan Khilar", title = "Efficient Virtual Machine Placement for On-Demand Access to Infrastructure Resources in Cloud Computing", journal = j-INT-J-COMP-APPL, volume = "68", number = "??", pages = "6--11", month = apr, year = "2013", CODEN = "????", DOI = "https://doi.org/10.5120/11629-7101", ISSN = "0975-8887", ISSN-L = "0975-8887", bibdate = "Fri Jan 24 08:55:55 MST 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcompappl.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.ijcaonline.org/archives/volume68/number12/11629-7101/", acknowledgement = ack-nhfb, ajournal = "Intern. J. of Computer Applications", articleno = "12", fjournal = "International Journal of Computer Applications", journal-URL = "https://www.ijcaonline.org/", } @Article{Medina:2013:SMM, author = "Violeta Medina and Juan Manuel Garc{\'\i}a", title = "A survey of migration mechanisms of virtual machines", journal = j-COMP-SURV, volume = "46", number = "3", pages = "30:1--30:??", month = jan, year = "2013", CODEN = "CMSVAN", DOI = "https://doi.org/10.1145/2492705", ISSN = "0360-0300 (print), 1557-7341 (electronic)", ISSN-L = "0360-0300", bibdate = "Thu Feb 6 07:33:31 MST 2014", bibsource = "http://www.acm.org/pubs/contents/journals/surveys/; https://www.math.utah.edu/pub/tex/bib/compsurv.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "In the virtualization area, replication has been considered as a mechanism to provide high availability. A high-availability system should be active most of the time, and this is the reason that its design should consider almost zero downtime and a minimal human intervention if a recovery process is demanded. Several migration and replication mechanisms have been developed to provide high availability inside virtualized environments. In this article, a survey of migration mechanisms is reported. These approaches are classified in three main classes: process migration, memory migration, and suspend/resume migration.", acknowledgement = ack-nhfb, articleno = "30", fjournal = "ACM Computing Surveys", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204", } @Article{Minhas:2013:RTH, author = "Umar Farooq Minhas and Shriram Rajagopalan and Brendan Cully and Ashraf Aboulnaga and Kenneth Salem and Andrew Warfield", title = "{RemusDB}: transparent high availability for database systems", journal = j-VLDB-J, volume = "22", number = "1", pages = "29--45", month = feb, year = "2013", CODEN = "VLDBFR", DOI = "https://doi.org/10.1007/s00778-012-0294-6", ISSN = "1066-8888 (print), 0949-877X (electronic)", ISSN-L = "1066-8888", bibdate = "Thu Jan 24 06:07:36 MST 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; https://www.math.utah.edu/pub/tex/bib/vldbj.bib", abstract = "In this paper, we present a technique for building a high-availability (HA) database management system (DBMS). The proposed technique can be applied to any DBMS with little or no customization, and with reasonable performance overhead. Our approach is based on Remus, a commodity HA solution implemented in the virtualization layer, that uses asynchronous virtual machine state replication to provide transparent HA and failover capabilities. We show that while Remus and similar systems can protect a DBMS, database workloads incur a performance overhead of up to 32\% as compared to an unprotected DBMS. We identify the sources of this overhead and develop optimizations that mitigate the problems. We present an experimental evaluation using two popular database systems and industry standard benchmarks showing that for certain workloads, our optimized approach provides fast failover ($ \leq 3 $ s of downtime) with low performance overhead when compared to an unprotected DBMS. Our approach provides a practical means for existing, deployed database systems to be made more reliable with a minimum of risk, cost, and effort. Furthermore, this paper invites new discussion about whether the complexity of HA is best implemented within the DBMS, or as a service by the infrastructure below it.", acknowledgement = ack-nhfb, fjournal = "VLDB Journal: Very Large Data Bases", journal-URL = "http://portal.acm.org/toc.cfm?id=J869", } @Article{Mittal:2013:EVE, author = "Aashish Mittal and Dushyant Bansal and Sorav Bansal and Varun Sethi", title = "Efficient virtualization on embedded {Power Architecture\reg} platforms", journal = j-SIGPLAN, volume = "48", number = "4", pages = "445--458", month = apr, year = "2013", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2499368.2451163", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Mon Jul 1 17:15:23 MDT 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Power Architecture\reg{} processors are popular and widespread on embedded systems, and such platforms are increasingly being used to run virtual machines. While the Power Architecture meets the Popek-and-Goldberg virtualization requirements for traditional trap-and-emulate style virtualization, the performance overhead of virtualization remains high. For example, workloads exhibiting a large amount of kernel activity typically show 3-5x slowdowns over bare-metal. Recent additions to the Linux kernel contain guest and host side paravirtual extensions for Power Architecture platforms. While these extensions improve performance significantly, they are guest-specific, guest-intrusive, and cover only a subset of all possible virtualization optimizations. We present a set of host-side optimizations that achieve comparable performance to the aforementioned paravirtual extensions, on an unmodified guest. Our optimizations are based on adaptive in-place binary translation. Unlike the paravirtual approach, our solution is guest neutral. We implement our ideas in a prototype based on Qemu/KVM. After our modifications, KVM can boot an unmodified Linux guest around 2.5x faster. We contrast our optimization approach with previous similar binary translation based approaches for the x86 architecture; in our experience, each architecture presents a unique set of challenges and optimization opportunities.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "ASPLOS '13 conference proceedings.", } @Article{Nambiar:2013:KTR, author = "Raghunath Nambiar and Meikel Poess", title = "Keeping the {TPC} relevant!", journal = j-PROC-VLDB-ENDOWMENT, volume = "6", number = "11", pages = "1186--1187", month = aug, year = "2013", CODEN = "????", ISSN = "2150-8097", bibdate = "Fri Dec 13 05:56:54 MST 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; https://www.math.utah.edu/pub/tex/bib/vldbe.bib", abstract = "The Transaction Processing Performance Council (TPC) is a nonprofit organization founded in 1988 to define transaction processing and database benchmarks. Since then, the TPC has played a crucial role in providing the industry with relevant standards for total system performance, price-performance, and energy-efficiency comparisons. TPC benchmarks are widely used by database researchers and academia. Historically known for database-centric standards, the TPC has developed a benchmark for virtualization and is currently developing a multisource data integration benchmark. The technology landscape is changing at a rapid pace, challenging industry experts and researchers to develop innovative techniques for evaluating, measuring, and characterizing the performance of modern application systems. The Technology Conference series on Performance Evaluation and Benchmarking (TPCTC), introduced in 2009, and the new TPC-Express initiatives are steps taken by the TPC to be relevant in the coming years and beyond.", acknowledgement = ack-nhfb, fjournal = "Proceedings of the VLDB Endowment", } @Article{Noll:2013:OFD, author = "Albert Noll and Thomas Gross", title = "Online feedback-directed optimizations for parallel {Java} code", journal = j-SIGPLAN, volume = "48", number = "10", pages = "713--728", month = oct, year = "2013", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2544173.2509518", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Mon Dec 9 09:19:33 MST 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "OOPSLA '13 conference proceedings.", abstract = "The performance of parallel code significantly depends on the parallel task granularity (PTG). If the PTG is too coarse, performance suffers due to load imbalance; if the PTG is too fine, performance suffers from the overhead that is induced by parallel task creation and scheduling. This paper presents a software platform that automatically determines the PTG at run-time. Automatic PTG selection is enabled by concurrent calls, which are special source language constructs that provide a late decision (at run-time) of whether concurrent calls are executed sequentially or concurrently (as a parallel task). Furthermore, the execution semantics of concurrent calls permits the runtime system to merge two (or more) concurrent calls thereby coarsening the PTG. We present an integration of concurrent calls into the Java programming language, the Java Memory Model, and show how the Java Virtual Machine can adapt the PTG based on dynamic profiling. The performance evaluation shows that our runtime system performs competitively to Java programs for which the PTG is tuned manually. Compared to an unfortunate choice of the PTG, this approach performs up to 3x faster than standard Java code.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @Article{Ouyang:2013:PTS, author = "Jiannan Ouyang and John R. Lange", title = "Preemptable ticket spinlocks: improving consolidated performance in the cloud", journal = j-SIGPLAN, volume = "48", number = "7", pages = "191--200", month = jul, year = "2013", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2517326.2451549", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Mon Aug 26 13:55:17 MDT 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "VEE '13 Conference proceedings.", abstract = "When executing inside a virtual machine environment, OS level synchronization primitives are faced with significant challenges due to the scheduling behavior of the underlying virtual machine monitor. Operations that are ensured to last only a short amount of time on real hardware, are capable of taking considerably longer when running virtualized. This change in assumptions has significant impact when an OS is executing inside a critical region that is protected by a spinlock. The interaction between OS level spinlocks and VMM scheduling is known as the Lock Holder Preemption problem and has a significant impact on overall VM performance. However, with the use of ticket locks instead of generic spinlocks, virtual environments must also contend with waiters being preempted before they are able to acquire the lock. This has the effect of blocking access to a lock, even if the lock itself is available. We identify this scenario as the Lock Waiter Preemption problem. In order to solve both problems we introduce Preemptable Ticket spinlocks, a new locking primitive that is designed to enable a VM to always make forward progress by relaxing the ordering guarantees offered by ticket locks. We show that the use of Preemptable Ticket spinlocks improves VM performance by 5.32X on average, when running on a non paravirtual VMM, and by 7.91X when running on a VMM that supports a paravirtual locking interface, when executing a set of microbenchmarks as well as a realistic e-commerce benchmark.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @Article{Pearce:2013:VIS, author = "Michael Pearce and Sherali Zeadally and Ray Hunt", title = "Virtualization: Issues, security threats, and solutions", journal = j-COMP-SURV, volume = "45", number = "2", pages = "17:1--17:??", month = feb, year = "2013", CODEN = "CMSVAN", DOI = "https://doi.org/10.1145/2431211.2431216", ISSN = "0360-0300 (print), 1557-7341 (electronic)", ISSN-L = "0360-0300", bibdate = "Thu Mar 7 11:42:33 MST 2013", bibsource = "http://www.acm.org/pubs/contents/journals/surveys/; https://www.math.utah.edu/pub/tex/bib/compsurv.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Although system virtualization is not a new paradigm, the way in which it is used in modern system architectures provides a powerful platform for system building, the advantages of which have only been realized in recent years, as a result of the rapid deployment of commodity hardware and software systems. In principle, virtualization involves the use of an encapsulating software layer (Hypervisor or Virtual Machine Monitor) which surrounds or underlies an operating system and provides the same inputs, outputs, and behavior that would be expected from an actual physical device. This abstraction means that an ideal Virtual Machine Monitor provides an environment to the software equivalent to the host system, but which is decoupled from the hardware state. Because a virtual machine is not dependent on the state of the physical hardware, multiple virtual machines may be installed on a single set of hardware. The decoupling of physical and logical states gives virtualization inherent security benefits. However, the design, implementation, and deployment of virtualization technology have also opened up novel threats and security issues which, while not particular to system virtualization, take on new forms in relation to it. Reverse engineering becomes easier due to introspection capabilities, as encryption keys, security algorithms, low-level protection, intrusion detection, or antidebugging measures can become more easily compromised. Furthermore, associated technologies such as virtual routing and networking can create challenging issues for security, intrusion control, and associated forensic processes. We explain the security considerations and some associated methodologies by which security breaches can occur, and offer recommendations for how virtualized environments can best be protected. Finally, we offer a set of generalized recommendations that can be applied to achieve secure virtualized implementations.", acknowledgement = ack-nhfb, articleno = "17", fjournal = "ACM Computing Surveys", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204", } @Article{Pek:2013:SSI, author = "G{\'a}bor P{\'e}k and Levente Butty'an and Boldizs{\'a}r Bencs{\'a}th", title = "A survey of security issues in hardware virtualization", journal = j-COMP-SURV, volume = "45", number = "3", pages = "40:1--40:??", month = jun, year = "2013", CODEN = "CMSVAN", DOI = "https://doi.org/10.1145/2480741.2480757", ISSN = "0360-0300 (print), 1557-7341 (electronic)", ISSN-L = "0360-0300", bibdate = "Mon Jul 1 18:21:14 MDT 2013", bibsource = "http://www.acm.org/pubs/contents/journals/surveys/; https://www.math.utah.edu/pub/tex/bib/compsurv.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Virtualization is a powerful technology for increasing the efficiency of computing services; however, besides its advantages, it also raises a number of security issues. In this article, we provide a thorough survey of those security issues in hardware virtualization. We focus on potential vulnerabilities and existing attacks on various virtualization platforms, but we also briefly sketch some possible countermeasures. To the best of our knowledge, this is the first survey of security issues in hardware virtualization with this level of details. Moreover, the adversary model and the structuring of the attack vectors are original contributions, never published before.", acknowledgement = ack-nhfb, articleno = "40", fjournal = "ACM Computing Surveys", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204", } @PhdThesis{Pfoh:2013:LDV, author = "Jonas Pfoh", title = "Leveraging Derivative Virtual Machine Introspection Methods for Security Applications", type = "{Doktors der Naturwissenschaften (Dr. rer. nat.)}", school = "Fakult{\"a}t f{\"u}r Informatik der Technischen Universit{\"a}t M{\"u}nchen, Lehrstuhl f{\"u}r Sicherheit in der Informatik", address = "Munich, Germany", pages = "xviii + 117", year = "2013", bibdate = "Thu Dec 04 08:25:46 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://mediatum.ub.tum.de/?id=1115811; http://mediatum.ub.tum.de/download/1115811/1115811.pdf; http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:91-diss-20130318-1115811-0-5", abstract = "Virtual machine introspection (VMI) describes the method of monitoring, analyzing, and manipulating the state of a virtual machine from the hypervisor level. This lends itself to many security applications, though they all share a single fundamental challenge: One must address the fact that the hypervisor has no semantic knowledge about what the system state means. Traditionally, this semantic knowledge is simply delivered to the hypervisor in the form of debugging symbols, symbol tables, etc. On the other hand, it is possible to derive information about the guest OS by considering hardware features and their specifications. The main contribution of this research is an examination of such derivative VMI methods and their strengths. This culminates in the introduction of a novel derivative method for collecting system calls from the hypervisor which is completely guest OS agnostic and cannot be evaded from within the guest.", acknowledgement = ack-nhfb, advisor = "Uwe Baumgarten", } @Book{Rayns:2013:CJS, author = "Chris Rayns and others", title = "{CICS} and the {JVM} server developing and deploying {Java} applications", publisher = "IBM Corporation, International Technical Support Organization", address = "Poughkeepsie, NY, USA", pages = "????", year = "2013", ISBN = "0-7384-3833-2", ISBN-13 = "978-0-7384-3833-7", LCCN = "????", bibdate = "Thu Dec 4 08:14:09 MST 2014", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/java2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", series = "IBM redbooks", URL = "http://proquest.tech.safaribooksonline.de/0738438332", acknowledgement = ack-nhfb, subject = "CICS (Syst{\`e}me informatique); Java (Langage de programmation); Logiciels d'application; D{\'e}veloppement; Syst{\`e}mes virtuels (Informatique); CICS (Computer system); Java (Computer program language); Application software; Development; Virtual computer systems; Development; CICS (Computer system); Java (Computer program language); Virtual computer systems.", } @Article{Salimi:2013:BSC, author = "Hadi Salimi and Mohsen Sharifi", title = "Batch scheduling of consolidated virtual machines based on their workload interference model", journal = j-FUT-GEN-COMP-SYS, volume = "29", number = "8", pages = "2057--2066", month = oct, year = "2013", CODEN = "FGSEVI", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Mon Dec 2 16:55:00 MST 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www.sciencedirect.com/science/journal/0167739X", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X13000332", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Salkeld:2013:IDO, author = "Robin Salkeld and Gregor Kiczales", title = "Interacting with dead objects", journal = j-SIGPLAN, volume = "48", number = "10", pages = "203--216", month = oct, year = "2013", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2544173.2509543", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Mon Dec 9 09:19:33 MST 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "OOPSLA '13 conference proceedings.", abstract = "Debugging and analyzing a snapshot of a crashed program's memory is far more difficult than working with a live program, because debuggers can no longer execute code to help make sense of the program state. We present an architecture that supports the restricted execution of ordinary code starting from the snapshot, as if the dead objects within it had been restored, but without access to their original external environment. We demonstrate the feasibility of this approach via an implementation for Java that does not require a custom virtual machine, show that it performs competitively with live execution, and use it to diagnose an unresolved memory leak in a mature mainstream application.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @Article{Sanchez:2013:ZFA, author = "Daniel Sanchez and Christos Kozyrakis", title = "{ZSim}: fast and accurate microarchitectural simulation of thousand-core systems", journal = j-COMP-ARCH-NEWS, volume = "41", number = "3", pages = "475--486", month = jun, year = "2013", CODEN = "CANED2", DOI = "https://doi.org/10.1145/2508148.2485963", ISSN = "0163-5964 (print), 1943-5851 (electronic)", ISSN-L = "0163-5964", bibdate = "Sat Jul 27 06:58:55 MDT 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigarch.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "ICSA '13 conference proceedings.", abstract = "Architectural simulation is time-consuming, and the trend towards hundreds of cores is making sequential simulation even slower. Existing parallel simulation techniques either scale poorly due to excessive synchronization, or sacrifice accuracy by allowing event reordering and using simplistic contention models. As a result, most researchers use sequential simulators and model small-scale systems with 16--32 cores. With 100-core chips already available, developing simulators that scale to thousands of cores is crucial. We present three novel techniques that, together, make thousand-core simulation practical. First, we speed up detailed core models (including OOO cores) with instruction-driven timing models that leverage dynamic binary translation. Second, we introduce bound-weave, a two-phase parallelization technique that scales parallel simulation on multicore hosts efficiently with minimal loss of accuracy. Third, we implement lightweight user-level virtualization to support complex workloads, including multiprogrammed, client-server, and managed-runtime applications, without the need for full-system simulation, sidestepping the lack of scalable OSs and ISAs that support thousands of cores. We use these techniques to build zsim, a fast, scalable, and accurate simulator. On a 16-core host, zsim models a 1024-core chip at speeds of up to 1,500 MIPS using simple cores and up to 300 MIPS using detailed OOO cores, 2-3 orders of magnitude faster than existing parallel simulators. Simulator performance scales well with both the number of modeled cores and the number of host cores. We validate zsim against a real Westmere system on a wide variety of workloads, and find performance and microarchitectural events to be within a narrow range of the real system.", acknowledgement = ack-nhfb, fjournal = "ACM SIGARCH Computer Architecture News", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89", } @MastersThesis{Schmeisser:2013:MOE, author = "Michael Schmei{\ss}er", title = "{Metriken und optimale Einsatzszenarien f{\"u}r Garbage Collectoren der Java HotSpot Virtual Machine}. ({German}) [{Metrics} and best use scenarios for garbage collectors of the {Java HotSpot Virtual Machine}]", type = "Masterarbeit", school = "Hochschule f{\"u}r Technik, Wirtschaft und Kultur", address = "Leipzig, Germany", pages = "iii + 103", year = "2013", bibdate = "Thu Dec 04 08:18:41 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, language = "German", } @PhdThesis{Schneider:2013:FVM, author = "Christian A. Schneider", title = "Full virtual machine state reconstruction for security applications", type = "{Doktors der Naturwissenschaften (Dr. rer. nat.)}", school = "Fakult{\"a}t f{\"u}r Informatik der Technischen Universit{\"a}t M{\"u}nchen, Lehrstuhl f{\"u}r Sicherheit in der Informatik", address = "Munich, Germany", pages = "xvi + 153", day = "23", month = apr, year = "2013", bibdate = "Thu Dec 04 08:03:14 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://mediatum.ub.tum.de/node?id=1142206; http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:91-diss-20131029-1142206-0-0", abstract = "This work explores the possibilities and implications of bridging the semantic gap between the hypervisor and its virtual machines to support security applications using a technique called virtual machine introspection (VMI). We define a formal model for VMI to describe and compare such approaches. We then propose, implement and evaluate a novel VMI framework that applies knowledge of the operating system and derived through a source code analysis to reconstruct the kernel state from physical memory.", acknowledgement = ack-nhfb, advisor = "Uwe Baumgarten", } @Article{Sem-Jacobsen:2013:ELC, author = "Frank Olaf Sem-Jacobsen and Samuel Rodrigo and Tor Skeie and Alessandro Strano and Davide Bertozzi", title = "An efficient, low-cost routing framework for convex mesh partitions to support virtualization", journal = j-TECS, volume = "12", number = "4", pages = "107:1--107:??", month = jun, year = "2013", CODEN = "????", DOI = "https://doi.org/10.1145/2485984.2485995", ISSN = "1539-9087 (print), 1558-3465 (electronic)", ISSN-L = "1539-9087", bibdate = "Mon Jul 1 18:28:35 MDT 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/tecs.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "At the core of an efficient chip multiprocessors (CMP) is support for unicast and multicast routing, low implementation costs, and the ability to isolate concurrent applications with maximum utilization of the CMP. We present an efficient logic-based unicast and multicast routing algorithm that guarantees isolation of local application traffic within any near-convex region on the chip, and the algorithms to recognize supported partitions and configure the cores accordingly. Evaluations show that the routing algorithm has a 57{\&}percent; more compact implementation than a recent multicast solution with the same coverage, and it achieves 5{\&}percent; higher throughput with 13{\&}percent; lower latency.", acknowledgement = ack-nhfb, articleno = "107", fjournal = "ACM Transactions on Embedded Computing Systems", journal-URL = "http://portal.acm.org/browse_dl.cfm?&idx=J840", } @Book{Seth:2013:UJV, author = "Sachin Seth", title = "Understanding {Java Virtual Machine}", publisher = "Alpha Science International", address = "Oxford, UK", pages = "318", year = "2013", ISBN = "1-84265-815-8", ISBN-13 = "978-1-84265-815-4", LCCN = "QA76.73.J38 S437 2013", bibdate = "Thu Dec 4 13:23:14 MST 2014", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/java2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, shorttableofcontents = "Preface \\ Platform Dependency and Virtualization \\ Class File Format \\ Designing Platform Independent Language \\ JVM Internal Data Structure \\ JVM Instruction Set \\ General Algorithm of Java Virtual Machines \\ Understanding Java Native Interface \\ Implementing JNI Functions \\ Multithreading in Java \\ Garbage Collection", subject = "Java virtual machine; Virtual computer systems", tableofcontents = "1. Platform Dependency and Virtualization \\ 1.1. Introduction \\ 1.2. How Programs Are Platform Dependent \\ 1.2.1. Windows Segmented Executable File Format \\ 1.2.2. {\tt a.out} (File Format) \\ 1.2.3. Executable and Linking Format (ELF) \\ 1.3. How Platform Independence is Achieved \\ 1.3.1. Hardware Virtual Machines \\ 1.3.2. Application Virtual Machines \\ 1.3.3. Machine Aggregation \\ 1.4. Java Virtual Machine \\ 1.5. Why Byte Codes \\ 2. Class File Format \\ 2.1. Introduction \\ 2.2. Signature or Magic Byte \\ 2.3. Major and Minor Version Number \\ 2.4. Constant Pool Count \\ 2.5. Constant Pool Table \\ 2.5.1. Constant\_Utf8 \\ 2.5.2. Constant\_Integer and Constant\_Float \\ 2.5.3. Constant\_Long and Constant\_Double \\ 2.5.4. Constant\_Class \\ 2.5.5. Constant\_String \\ 2.5.6. Constant\_Fieldref, Constant\_Methodref, Constant\_InterfaceMethodref \\ 2.5.7. Constant\_NameAndType \\ 2.6. Access Flags \\ 2.7. This\_class \\ 2.8. super\_class \\ 2.9. Interface\_count \\ 2.10. Interfaces table \\ 2.11. Fields Count \\ 2.12. Field table \\ 2.12.1. Access\_Flags \\ 2.12.2. Name\_Index \\ 2.12.3. Descriptor\_Index \\ 2.12.4. Attributes\_Count \\ 2.12.5. Attributes\_Table \\ 2.13. Methods count \\ 2.14. Method table \\ 2.15. Attributes\_Count \\ 2.16. Attributes\_table \\ 2.16.1. Attribute Information Structure \\ 2.17. Code Attribute \\ 2.18. Exceptions Attribute \\ 2.19. C data structure to represent the class file \\ 2.20. Internal Representation of descriptor \\ 2.20.1. Field Descriptors \\ 2.20.2. Method Descriptors \\ 3. Designing Platform Independent Language \\ 3.1. Designing Your Own Platform Independent Language \\ 4. JVM Internal Data Structure \\ 4.1. Introduction \\ 4.2. Java Virtual Machine Data Types \\ 4.2.1. Integral Types \\ 4.2.2. Floating Point Types \\ 4.2.3. Return Address Type \\ 4.2.4. Boolean Type \\ 4.2.5. Reference Type \\ 4.3. JVM Data Types Storage Area \\ 4.4. JVM Internal Data Structures \\ 4.4.1. The pc Register \\ 4.4.2. Class Heap \\ 4.4.3. Object Heap \\ 4.4.4. Array Heap \\ 4.4.5. Stack Frame \\ 4.4.6. Method Area \\ 4.4.7. Operand Stack \\ 5. JVM Instruction Set \\ 5.1. Introduction \\ 5.2. Virtual Machine Error \\ 5.3. Operations Involved in Executing Instructions \\ 5.3.1. Push and Pop on Operand Stack \\ 5.3.2. Push and Pop on Parameter Stack \\ 5.3.3. Creating Function Stack Frame \\ 5.3.4. Retrieving and Storing Values in Function Stack Frame \\ 5.3.5. Creating an Object of Class \\ 5.3.6. Storing Field Value \\ 5.3.7. Getting Field Value \\ 5.3.8. Allocating Memory for Static Fields \\ 5.3.9. Storing Static Field Values \\ 5.3.10. Get Static Field Values \\ 5.3.11. Creating Array \\ 5.3.12. Creating the Muti-dimensional Array \\ 5.3.13. Storing and Retrieving Value from Array \\ 5.3.14. Executing a Method \\ 5.3.15. Throw an Exception \\ 5.3.16. Acquiring Monitor \\ 5.3.17. Releasing Monitor \\ 5.3.18. Constant\_utf8 to String \\ 5.4. Instruction Set \\ 6. General Algorithm Of Java Virtual Machines \\ 6.1. What Happens Behind the Scene \\ 6.1.1. Loading of Class \\ 6.1.2. Verification of Class \\ 6.1.3. Preparation of Class \\ 6.1.4. Resolution of Symbols \\ 6.1.5. Initialization \\ 6.1.6. Initialize System Class Function \\ 6.1.7. Load and Execute Test Class Class \\ 6.2. Changes in JVM's Internal Data Structure \\ 7. Understanding Java Native Interface \\ 7.1. Why JNI \\ 7.2. JNI Interface Functions \\ 7.3. Loading and Linking Native Library \\ 7.4. Referencing Java Objects \\ 7.5. JNI Types and Data Structures \\ 7.6. JNI by Example \\ 7.7. JNI behind the Scene \\ 7.7.1. Calling Native Function from Java \\ 7.7.2. Calling Java Function from Native Language \\ 8. Implementing JNI Functions \\ 8.1. JNI Function Table \\ 8.2. Initializing JNI Environment \\ 8.3. JNI Helper Functions \\ 8.3.1. Call Method \\ 8.3.2. Call Method A0 \\ 8.3.3. Call Static Method 0 \\ 8.3.4. Call Static Method A0 \\ 8.3.5. Release Array Elements 0 \\ 8.3.6. Add to Local Ref List \\ 8.4. JNI Functions \\ 8.4.1. GetVersion \\ 8.4.2. DefineClass \\ 8.4.3. Find Class \\ 8.4.4. GetSuperclass \\ 8.4.5. Is Assignable From \\ 8.4.6. Throw \\ 8.4.7. ThrowNew \\ 8.4.8. Throws \\ 8.4.9. Exception Describe \\ 8.4.10. Exception Clear \\ 8.4.11. Fatal Error \\ 8.4.12. New Local Ref \\ 8.4.13. New Global Ref \\ 8.4.14. New Weak Global Ref \\ 8.4.15. Delete Global Ref \\ 8.4.16. Delete Local Ref \\ 8.4.17. Delete Weak Local Ref \\ 8.4.18. AllocObject \\ 8.4.19. New Object, New ObjectA and New ObjectV \\ 8.4.20. Get Object Class \\ 8.4.21. Is Instance Of \\ 8.4.22. Is Same Object \\ 8.4.23. Get Field ID \\ 8.4.24. GetField \\ 8.4.25. SetField \\ 8.4.26. Get Method ID \\ 8.4.27. CallMethod \\ 8.4.28. Call NonvirtualMethod \\ 8.4.29. Get Static Field ID \\ 8.4.30. Get StaticField Routines \\ 8.4.31. Set StaticField Routines \\ 8.4.32. Get Static Method ID \\ 8.4.33. Call StaticMethod \\ 8.4.34. New String \\ 8.4.35. Get String Length \\ 8.4.36. Get String Region \\ 8.4.37. Get String Chars \\ 8.4.38. Get String Critical \\ 8.4.39. Release String Chars \\ 8.4.40. Release String Critical \\ 8.4.41. New String UTF \\ 8.4.42. Get String UTF Chars \\ 8.4.43. Get String UTF Region \\ 8.4.44. Get String UTF Length \\ 8.4.45. Release String UTF Chars \\ 8.4.46. Get Array Length \\ 8.4.47. New Object Array \\ 8.4.48. Get Object Array Element \\ 8.4.49. Set Object Array Element \\ 8.4.50. NewArray \\ 8.4.51. GetArrayElements Routines \\ 8.4.52. ReleaseArrayElements Routines \\ 8.4.53. GetArrayRegion Routines \\ 8.4.54. SetArrayRegion Routines \\ 8.4.55. Register Natives \\ 8.4.56. Unregister Natives \\ 8.4.57. Push Local Frame \\ 8.4.58. Pop Local Frame \\ 8.4.59. Monitor Enter \\ 8.4.60. Monitor Exit \\ 8.4.61. Get Java VM \\ 9. Multithreading In Java \\ 9.1. Introduction \\ 9.2. Multithreading in Java \\ 9.3. Memory Model for Thread \\ 9.4. Creating Thread in Java \\ 9.5. Why Multithreading in Java is Platform Dependent? \\ 9.5.1. Sleep() \\ 9.5.2. Stop() \\ 9.5.3. Suspend() \\ 9.5.4. Resume() \\ 9.5.5. isAlive() \\ 9.5.6. Interrupt() \\ 9.5.7. Join() \\ 9.5.8. Yield() \\ 9.5.9. SetPriority() \\ 9.6. Thread local storage \\ 9.7. Volatile keyword \\ 9.8. Thread Synchronization in Java \\ 10. Garbage Collection \\ 10.1. Introduction \\ 10.2. Drawbacks of Legacy Languages \\ 10.3. Solution to Memory Leak in Java \\ 10.4. How JVM Recognizes that an Object is not Being Referenced", } @Article{Shanmuganathan:2013:DCU, author = "Ganesha Shanmuganathan and Ajay Gulati and Peter Varman", title = "Defragmenting the cloud using demand-based resource allocation", journal = j-SIGMETRICS, volume = "41", number = "1", pages = "67--80", month = jun, year = "2013", CODEN = "????", DOI = "https://doi.org/10.1145/2494232.2465763", ISSN = "0163-5999 (print), 1557-9484 (electronic)", ISSN-L = "0163-5999", bibdate = "Fri Feb 28 06:09:59 MST 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigmetrics.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Current public cloud offerings sell capacity in the form of pre-defined virtual machine (VM) configurations to their tenants. Typically this means that tenants must purchase individual VM configurations based on the peak demands of the applications, or be restricted to only scale-out applications that can share a pool of VMs. This diminishes the value proposition of moving to a public cloud as compared to server consolidation in a private virtualized datacenter, where one gets the benefits of statistical multiplexing between VMs belonging to the same or different applications. Ideally one would like to enable a cloud tenant to buy capacity in bulk and benefit from statistical multiplexing among its workloads. This requires the purchased capacity to be dynamically and transparently allocated among the tenant's VMs that may be running on different servers, even across datacenters. In this paper, we propose two novel algorithms called BPX and DBS that are able to provide the cloud customer with the abstraction of buying bulk capacity. These algorithms dynamically allocate the bulk capacity purchased by a customer between its VMs based on their individual demands and user-set importance. Our algorithms are highly scalable and are designed to work in a large-scale distributed environment. We implemented a prototype of BPX as part of VMware's management software and showed that BPX is able to closely mimic the behavior of a centralized allocator in a distributed manner.", acknowledgement = ack-nhfb, fjournal = "ACM SIGMETRICS Performance Evaluation Review", journal-URL = "http://portal.acm.org/toc.cfm?id=J618", } @Article{Shao:2013:VOS, author = "Zhiyuan Shao and Ligang He and Zhiqiang Lu and Hai Jin", title = "{VSA}: an offline scheduling analyzer for {Xen} virtual machine monitor", journal = j-FUT-GEN-COMP-SYS, volume = "29", number = "8", pages = "2067--2076", month = oct, year = "2013", CODEN = "FGSEVI", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Mon Dec 2 16:55:00 MST 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www.sciencedirect.com/science/journal/0167739X", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X12002245", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Shi:2013:AGC, author = "Xuanhua Shi and Hai Jin and Song Wu and Wei Zhu and Li Qi", title = "Adapting grid computing environments dependable with virtual machines: design, implementation, and evaluations", journal = j-J-SUPERCOMPUTING, volume = "66", number = "3", pages = "1152--1166", month = dec, year = "2013", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-011-0664-7", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Sat Feb 8 10:22:06 MST 2014", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0920-8542&volume=66&issue=3; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer.com/article/10.1007/s11227-011-0664-7", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Shih:2013:FSV, author = "Chi-Sheng Shih and Jie-Wen Wei and Shih-Hao Hung and Joen Chen and Norman Chang", title = "Fairness scheduler for virtual machines on heterogeneous multi-core platforms", journal = j-SIGAPP, volume = "13", number = "1", pages = "28--40", month = mar, year = "2013", CODEN = "????", DOI = "https://doi.org/10.1145/2460136.2460139", ISSN = "1559-6915 (print), 1931-0161 (electronic)", ISSN-L = "1559-6915", bibdate = "Thu Jan 23 10:24:56 MST 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigapp.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/abs/10.1145/2460136.2460139", abstract = "Heterogeneous multi-core processors are now widely deployed to meet computation requirements for multimedia applications on embedded mobile devices. However, due to the difference on computation capability of heterogeneous multi-cores, it is challenging \ldots{}", acknowledgement = ack-nhfb, fjournal = "ACM SIGAPP Applied Computing Review", journal-URL = "https://dl.acm.org/loi/sigapp", } @Article{Shiraz:2013:SVM, author = "Muhammad Shiraz and Saeid Abolfazli and Zohreh Sanaei and Abdullah Gani", title = "A study on virtual machine deployment for application outsourcing in mobile cloud computing", journal = j-J-SUPERCOMPUTING, volume = "63", number = "3", pages = "946--964", month = mar, year = "2013", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-012-0846-y", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Mon Apr 1 14:50:47 MDT 2013", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0920-8542&volume=63&issue=3; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer.com/article/10.1007/s11227-012-0846-y", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Simao:2013:ADQ, author = "Jos{\'e} Sim{\~a}o and Lu{\'\i}s Veiga", title = "Adaptability Driven by Quality of Execution in High Level Virtual Machines for Shared Cloud Environments", journal = j-INT-J-COMPUT-SYST-SCI-ENG, volume = "28", number = "6", pages = "??--??", month = "????", year = "2013", CODEN = "CSSEEI", ISSN = "0267-6192", ISSN-L = "0267-6192", bibdate = "Tue Feb 10 16:40:28 MST 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/computsystscieng.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "International Journal of Computer Systems Science and Engineering", journal-URL = "http://www.crlpublishing.co.uk/csse", } @Article{Song:2013:PLM, author = "Xiang Song and Jicheng Shi and Ran Liu and Jian Yang and Haibo Chen", title = "Parallelizing live migration of virtual machines", journal = j-SIGPLAN, volume = "48", number = "7", pages = "85--96", month = jul, year = "2013", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2517326.2451531", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Mon Aug 26 13:55:17 MDT 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "VEE '13 Conference proceedings.", abstract = "Live VM migration is one of the major primitive operations to manage virtualized cloud platforms. Such operation is usually mission-critical and disruptive to the running services, and thus should be completed as fast as possible. Unfortunately, with the increasing amount of resources configured to a VM, such operations are becoming increasingly time-consuming. In this paper, we make a comprehensive analysis on the parallelization opportunities of live VM migration on two popular open-source VMMs (i.e., Xen and KVM). By leveraging abundant resources like CPU cores and NICs in contemporary server platforms, we design and implement a system called PMigrate that leverages data parallelism and pipeline parallelism to parallelize the operation. As the parallelization framework requires intensive mmap/munmap operations that tax the address space management system in an operating system, we further propose an abstraction called range lock, which improves scalability of concurrent mutation to the address space of an operating system (i.e., Linux) by selectively replacing the per-process address space lock inside kernel with dynamic and fine-grained range locks that exclude costly operations on the requesting address range from using the per-process lock. Evaluation with our working prototype on Xen and KVM shows that PMigrate accelerates the live VM migration ranging from 2.49X to 9.88X, and decreases the downtime ranging from 1.9X to 279.89X. Performance analysis shows that our integration of range lock to Linux significantly improves parallelism in mutating the address space in VM migration and thus boosts the performance ranging from 2.06X to 3.05X. We also show that PMigrate makes only small disruption to other co-hosted production VMs.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @Article{Stolyar:2013:LSS, author = "Alexander L. Stolyar and Yuan Zhong", title = "A large-scale service system with packing constraints: minimizing the number of occupied servers", journal = j-SIGMETRICS, volume = "41", number = "1", pages = "41--52", month = jun, year = "2013", CODEN = "????", DOI = "https://doi.org/10.1145/2494232.2465547", ISSN = "0163-5999 (print), 1557-9484 (electronic)", ISSN-L = "0163-5999", bibdate = "Fri Feb 28 06:09:59 MST 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigmetrics.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "We consider a large-scale service system model proposed in [14], which is motivated by the problem of efficient placement of virtual machines to physical host machines in a network cloud, so that the total number of occupied hosts is minimized. Customers of different types arrive to a system with an infinite number of servers. A server packing configuration is the vector k = {k$_i$ }, where k$_i$ is the number of type-i customers that the server ``contains''. Packing constraints are described by a fixed finite set of allowed configurations. Upon arrival, each customer is placed into a server immediately, subject to the packing constraints; the server can be idle or already serving other customers. After service completion, each customer leaves its server and the system. It was shown in [14] that a simple real-time algorithm, called Greedy, is asymptotically optimal in the sense of minimizing \Sigma $_k$ X$_k^{1 + \alpha }$ in the stationary regime, as the customer arrival rates grow to infinity. (Here \alpha {$>$} 0, and X$_k$ denotes the number of servers with configuration k.) In particular, when parameter \alpha is small, and in the asymptotic regime where customer arrival rates grow to infinity, Greedy solves a problem approximating one of minimizing \Sigma $_k$ X$_k$, the number of occupied hosts. In this paper we introduce the algorithm called Greedy with sublinear Safety Stocks (GSS), and show that it asymptotically solves the exact problem of minimizing \Sigma $_k$ X$_k$. An important feature of the algorithm is that sublinear safety stocks of X$_k$ are created automatically --- when and where necessary --- without having to determine a priori where they are required. Moreover, we also provide a tight characterization of the rate of convergence to optimality under GSS. The GSS algorithm is as simple as Greedy, and uses no more system state information than Greedy does.", acknowledgement = ack-nhfb, fjournal = "ACM SIGMETRICS Performance Evaluation Review", journal-URL = "http://portal.acm.org/toc.cfm?id=J618", } @Article{Strauss:2013:FCC, author = "David Strauss", title = "The future cloud is container, not virtual machines", journal = j-LINUX-J, volume = "2013", number = "228", pages = "5:1--5:??", month = apr, year = "2013", CODEN = "LIJOFX", ISSN = "1075-3583 (print), 1938-3827 (electronic)", ISSN-L = "1075-3583", bibdate = "Mon Jun 10 06:37:59 MDT 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/linux-journal.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Virtual machines are the cloud's past; the era of containers is now.", acknowledgement = ack-nhfb, articleno = "5", fjournal = "Linux Journal", journal-URL = "http://portal.acm.org/citation.cfm?id=J508", } @Article{Sudevalayam:2013:AAM, author = "Sujesha Sudevalayam and Purushottam Kulkarni", title = "Affinity-aware modeling of {CPU} usage with communicating virtual machines", journal = j-J-SYST-SOFTW, volume = "86", number = "10", pages = "2627--2638", month = oct, year = "2013", CODEN = "JSSODM", ISSN = "0164-1212 (print), 1873-1228 (electronic)", ISSN-L = "0164-1212", bibdate = "Mon Sep 9 07:54:52 MDT 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www.sciencedirect.com/science/journal/01641212", URL = "http://www.sciencedirect.com/science/article/pii/S0164121213001246", acknowledgement = ack-nhfb, fjournal = "Journal of Systems and Software", journal-URL = "http://www.sciencedirect.com/science/journal/01641212", } @Article{Sun:2013:BJW, author = "Mengtao Sun and Gang Tan and Joseph Siefers and Bin Zeng and Greg Morrisett", title = "Bringing {Java}'s wild native world under control", journal = j-TISSEC, volume = "16", number = "3", pages = "9:1--9:??", month = nov, year = "2013", CODEN = "ATISBQ", DOI = "https://doi.org/10.1145/2535505", ISSN = "1094-9224 (print), 1557-7406 (electronic)", ISSN-L = "1094-9224", bibdate = "Mon Dec 9 11:22:22 MST 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2010.bib; https://www.math.utah.edu/pub/tex/bib/tissec.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "For performance and for incorporating legacy libraries, many Java applications contain native-code components written in unsafe languages such as C and C++. Native-code components interoperate with Java components through the Java Native Interface (JNI). As native code is not regulated by Java's security model, it poses serious security threats to the managed Java world. We introduce a security framework that extends Java's security model and brings native code under control. Leveraging software-based fault isolation, the framework puts native code in a separate sandbox and allows the interaction between the native world and the Java world only through a carefully designed pathway. Two different implementations were built. In one implementation, the security framework is integrated into a Java Virtual Machine (JVM). In the second implementation, the framework is built outside of the JVM and takes advantage of JVM-independent interfaces. The second implementation provides JVM portability, at the expense of some performance degradation. Evaluation of our framework demonstrates that it incurs modest runtime overhead while significantly enhancing the security of Java applications.", acknowledgement = ack-nhfb, articleno = "9", fjournal = "ACM Transactions on Information and System Security", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789", } @Article{Thorat:2013:OMV, author = "Nishant Thorat and Arvind Raghavendran and Nigel Groves", title = "Offline management in virtualized environments", journal = j-CACM, volume = "56", number = "4", pages = "75--81", month = apr, year = "2013", CODEN = "CACMA2", DOI = "https://doi.org/10.1145/2436256.2436273", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Wed Mar 27 09:04:24 MDT 2013", bibsource = "http://www.acm.org/pubs/contents/journals/cacm/; https://www.math.utah.edu/pub/tex/bib/cacm2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "How to run virtual machines together with physical machines, especially when sharing computational resources.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79", } @Article{Tu:2013:SDS, author = "Cheng-Chun Tu and Chao-tang Lee and Tzi-cker Chiueh", title = "Secure {I/O} device sharing among virtual machines on multiple hosts", journal = j-COMP-ARCH-NEWS, volume = "41", number = "3", pages = "108--119", month = jun, year = "2013", CODEN = "CANED2", DOI = "https://doi.org/10.1145/2508148.2485932", ISSN = "0163-5964 (print), 1943-5851 (electronic)", ISSN-L = "0163-5964", bibdate = "Sat Jul 27 06:58:55 MDT 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "ICSA '13 conference proceedings.", abstract = "Virtualization allows flexible mappings between physical resources and virtual entities, and improves allocation efficiency and agility. Unfortunately, most existing virtualization technologies are limited to resources in a single host. This paper presents the design, implementation and evaluation of a multi-host I/O device virtualization system called Ladon, which enables I/O devices to be shared among virtual machines running on multiple hosts in a secure and efficient way. Specifically, Ladon uses a PCIe network to connect multiple servers with PCIe devices and allows VMs running on these servers to directly interact with these PCIe devices without interfering with one another. Through an evaluation of a fully operational Ladon prototype, we show that there is no throughput and latency penalty of the multi-host I/O virtualization enabled by Ladon compared to those of the existing single-host I/O virtualization technology.", acknowledgement = ack-nhfb, fjournal = "ACM SIGARCH Computer Architecture News", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89", } @Article{Unnikrishnan:2013:RDP, author = "Deepak Unnikrishnan and Ramakrishna Vadlamani and Yong Liao and Jeremie Crenne and Lixin Gao and Russell Tessier", title = "Reconfigurable Data Planes for Scalable Network Virtualization", journal = j-IEEE-TRANS-COMPUT, volume = "62", number = "12", pages = "2476--2488", year = "2013", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.2012.155", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Wed Nov 27 18:42:19 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Computers", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", } @Article{Ureche:2013:MIS, author = "Vlad Ureche and Cristian Talau and Martin Odersky", title = "Miniboxing: improving the speed to code size tradeoff in parametric polymorphism translations", journal = j-SIGPLAN, volume = "48", number = "10", pages = "73--92", month = oct, year = "2013", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2544173.2509537", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Mon Dec 9 09:19:33 MST 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "OOPSLA '13 conference proceedings.", abstract = "Parametric polymorphism enables code reuse and type safety. Underneath the uniform interface exposed to programmers, however, its low level implementation has to cope with inherently non-uniform data: value types of different sizes and semantics (bytes, integers, floating point numbers) and reference types (pointers to heap objects). On the Java Virtual Machine, parametric polymorphism is currently translated to bytecode using two competing approaches: homogeneous and heterogeneous. Homogeneous translation requires boxing, and thus introduces indirect access delays. Heterogeneous translation duplicates and adapts code for each value type individually, producing more bytecode. Therefore bytecode speed and size are at odds with each other. This paper proposes a novel translation that significantly reduces the bytecode size without affecting the execution speed. The key insight is that larger value types (such as integers) can hold smaller ones (such as bytes) thus reducing the duplication necessary in heterogeneous translations. In our implementation, on the Scala compiler, we encode all primitive value types in long integers. The resulting bytecode approaches the performance of monomorphic code, matches the performance of the heterogeneous translation and obtains speedups of up to 22x over the homogeneous translation, all with modest increases in size.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @Article{Verboven:2013:BBS, author = "Sam Verboven and Kurt Vanmechelen and Jan Broeckhove", title = "Black box scheduling for resource intensive virtual machine workloads with interference models", journal = j-FUT-GEN-COMP-SYS, volume = "29", number = "8", pages = "1871--1884", month = oct, year = "2013", CODEN = "FGSEVI", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Mon Dec 2 16:55:00 MST 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www.sciencedirect.com/science/journal/0167739X", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X1300099X", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Versick:2013:PCE, author = "Daniel Versick and Ingolf Wa{\ss}mann and Djamshid Tavangarian", title = "Power consumption estimation of {CPU} and peripheral components in virtual machines", journal = j-SIGAPP, volume = "13", number = "3", pages = "17--25", month = sep, year = "2013", CODEN = "????", DOI = "https://doi.org/10.1145/2537728.2537730", ISSN = "1559-6915 (print), 1931-0161 (electronic)", ISSN-L = "1559-6915", bibdate = "Thu Jan 23 10:24:57 MST 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigapp.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/abs/10.1145/2537728.2537730", abstract = "Energy consumption of IT increased continuously during the last decades. Numerous works have been accomplished for improving energy efficiency of hardware whereas software energy efficiency has been ignored for a long time. This contribution presents a \ldots{}", acknowledgement = ack-nhfb, fjournal = "ACM SIGAPP Applied Computing Review", journal-URL = "https://dl.acm.org/loi/sigapp", } @Article{vonKoch:2013:LRB, author = "Tobias J. K. Edler von Koch and Bj{\"o}rn Franke", title = "Limits of region-based dynamic binary parallelization", journal = j-SIGPLAN, volume = "48", number = "7", pages = "13--22", month = jul, year = "2013", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2517326.2451518", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Mon Aug 26 13:55:17 MDT 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "VEE '13 Conference proceedings.", abstract = "Efficiently executing sequential legacy binaries on chip multi-processors (CMPs) composed of many, small cores is one of today's most pressing problems. Single-threaded execution is a suboptimal option due to CMPs' lower single-core performance, while multi-threaded execution relies on prior parallelization, which is severely hampered by the low-level binary representation of applications compiled and optimized for a single-core target. A recent technology to address this problem is Dynamic Binary Parallelization (DBP), which creates a Virtual Execution Environment (VEE) taking advantage of the underlying multicore host to transparently parallelize the sequential binary executable. While still in its infancy, DBP has received broad interest within the research community. The combined use of DBP and thread-level speculation (TLS) has been proposed as a technique to accelerate legacy uniprocessor code on modern CMPs. In this paper, we investigate the limits of DBP and seek to gain an understanding of the factors contributing to these limits and the costs and overheads of its implementation. We have performed an extensive evaluation using a parameterizable DBP system targeting a CMP with light-weight architectural TLS support. We demonstrate that there is room for a significant reduction of up to 54\% in the number of instructions on the critical paths of legacy SPEC CPU2006 benchmarks. However, we show that it is much harder to translate these savings into actual performance improvements, with a realistic hardware-supported implementation achieving a speedup of 1.09 on average.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @Article{Wang:2013:JVM, author = "Lin Wang and Fa Zhang and Athanasios V. Vasilakos and Chenying Hou and Zhiyong Liu", title = "Joint virtual machine assignment and traffic engineering for green data center networks", journal = j-SIGMETRICS, volume = "41", number = "3", pages = "107--112", month = dec, year = "2013", CODEN = "????", DOI = "https://doi.org/10.1145/2567529.2567560", ISSN = "0163-5999 (print), 1557-9484 (electronic)", ISSN-L = "0163-5999", bibdate = "Fri Feb 28 06:10:08 MST 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigmetrics.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "The popularization of cloud computing brings emergency concern to the energy consumption in big data centers. Besides the servers, the energy consumed by the network in a data center is also considerable. Existing works for improving the network energy efficiency are mainly focused on traffic engineering, i.e., consolidating flows and switching off unnecessary devices, which fails to comprehensively consider the unique features in data centers. In this paper, we advocate a joint optimization for achieving energy efficiency of data center networks by proposing a unified optimization framework. In this framework, we consider to take advantage of the application characteristics and topology features, and to integrate virtual machine assignment and traffic engineering. Under this framework, we then devise two efficient algorithms, TE VMA and TER, for assigning virtual machines and routing traffic flows respectively. Knowing the communication patterns of the applications, the TE VMA algorithm is purposeful and can generate desirable traffic conditions for the next-step routing optimization. The TER algorithm makes full use of the hierarchical feature of the topology and is conducted on the multipath routing protocol. The performance of the overall framework is confirmed by both theoretical analysis and simulation results, where up to 50\% total energy savings can be achieved, 20\% more compared with traffic engineering only approaches.", acknowledgement = ack-nhfb, fjournal = "ACM SIGMETRICS Performance Evaluation Review", journal-URL = "http://portal.acm.org/toc.cfm?id=J618", } @Article{Wang:2013:RMM, author = "Xiaolin Wang and Lingmei Weng and Zhenlin Wang and Yingwei Luo", title = "Revisiting memory management on virtualized environments", journal = j-TACO, volume = "10", number = "4", pages = "48:1--48:??", month = dec, year = "2013", CODEN = "????", DOI = "https://doi.org/10.1145/2541228.2555304", ISSN = "1544-3566 (print), 1544-3973 (electronic)", ISSN-L = "1544-3566", bibdate = "Thu Jan 9 10:42:35 MST 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/taco.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "With the evolvement of hardware, 64-bit Central Processing Units (CPUs) and 64-bit Operating Systems (OSs) have dominated the market. This article investigates the performance of virtual memory management of Virtual Machines (VMs) with a large virtual address space in 64-bit OSs, which imposes different pressure on memory virtualization than 32-bit systems. Each of the two conventional memory virtualization approaches, Shadowing Paging (SP) and Hardware-Assisted Paging (HAP), causes different overhead for different applications. Our experiments show that 64-bit applications prefer to run in a VM using SP, while 32-bit applications do not have a uniform preference between SP and HAP. In this article, we trace this inconsistency between 32-bit applications and 64-bit applications to its root cause through a systematic empirical study in Linux systems and discover that the major overhead of SP results from memory management in the 32-bit GNU C library ( glibc ). We propose enhancements to the existing memory management algorithms, which substantially reduce the overhead of SP. Based on the evaluations using SPEC CPU2006, Parsec 2.1, and cloud benchmarks, our results show that SP, with the improved memory allocators, can compete with HAP in almost all cases, in both 64-bit and 32-bit systems. We conclude that without a significant breakthrough in HAP, researchers should pay more attention to SP, which is more flexible and cost effective.", acknowledgement = ack-nhfb, articleno = "48", fjournal = "ACM Transactions on Architecture and Code Optimization (TACO)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J924", } @Article{Wang:2013:VPD, author = "Di Wang and Chuangang Ren and Anand Sivasubramaniam", title = "Virtualizing power distribution in datacenters", journal = j-COMP-ARCH-NEWS, volume = "41", number = "3", pages = "595--606", month = jun, year = "2013", CODEN = "CANED2", DOI = "https://doi.org/10.1145/2508148.2485973", ISSN = "0163-5964 (print), 1943-5851 (electronic)", ISSN-L = "0163-5964", bibdate = "Sat Jul 27 06:58:55 MDT 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "ICSA '13 conference proceedings.", abstract = "Power infrastructure contributes to a significant portion of datacenter expenditures. Overbooking this infrastructure for a high percentile of the needs is becoming more attractive than for occasional peaks. There exist several computing knobs to cap the power draw within such under-provisioned capacity. Recently, batteries and other energy storage devices have been proposed to provide a complementary alternative to these knobs, which when decentralized (or hierarchically placed), can temporarily take the load to suppress power peaks propagating up the hierarchy. With aggressive under-provisioning, the power hierarchy becomes as central a datacenter resource as other computing resources, making it imperative to carefully allocate, isolate and manage this resource (including batteries), across applications. Towards this goal, we present vPower, a software system to virtualize power distribution. vPower includes mechanisms and policies to provide a virtual power hierarchy for each application. It leverages traditional computing knobs as well as batteries, to apportion and manage the infrastructure between co-existing applications in the hierarchy. vPower allows applications to specify their power needs, performs admission control and placement, dynamically monitors power usage, and enforces allocations for fairness and system efficiency. Using several datacenter applications, and a 2-level power hierarchy prototype containing batteries at both levels, we demonstrate the effectiveness of vPower when working in an under-provisioned power infrastructure, using the right computing knobs and the right batteries at the right time. Results show over 50\% improved system utilization and scale-out for vPower's over-booking, and between 12-28\% better application performance than traditional power-capping control knobs. It also ensures isolation between applications competing for power.", acknowledgement = ack-nhfb, fjournal = "ACM SIGARCH Computer Architecture News", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89", } @InProceedings{Wen:2013:MPA, author = "Yuanfeng Wen and JongHyuk Lee and Ziyi Liu and Qingji Zheng and Weidong Shi and Shouhuai Xu and Taeweon Suh", editor = "Hubertus Franke", booktitle = "{Proceedings of the ACM International Conference on Computing Frontiers, CF' 13, Ischia, Italy. 14--16 May 2013}", title = "Multi-processor architectural support for protecting virtual machine privacy in untrusted cloud environment", publisher = pub-ACM, address = pub-ACM:adr, pages = "25:1--25:10", year = "2013", DOI = "https://doi.org/10.1145/2482767.2482799", ISBN = "1-4503-2053-8", ISBN-13 = "978-1-4503-2053-5", LCCN = "QA75.5", bibdate = "Tue Jan 23 11:24:25 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/citation.cfm?id=2482799", abstract = "Virtualization is fundamental to cloud computing because it allows multiple operating systems to run simultaneously on a physical machine. However, it also brings a range of security/privacy problems. One particularly challenging and important problem is: how can we protect the Virtual Machines (VMs) from being attacked by Virtual Machine Monitors (VMMs) and/or by the cloud vendors when they are not trusted? In this paper, we propose an architectural solution to the above problem in multi-processor cloud environments. Our key idea is to exploit hardware mechanisms to enforce access control over the shared resources (e.g., memory spaces), while protecting VM memory integrity as well as inter-processor communications and data sharing. We evaluate the solution using full-system emulation and cycle-based architecture models. Experiments based on 20 benchmark applications show that the performance overhead is 1.5\%--10\% when access control is enforced, and 9\%--19\% when VM memory is encrypted.", acknowledgement = ack-nhfb, } @Article{Weng:2013:HCM, author = "Chuliang Weng and Minyi Guo and Yuan Luo and Minglu Li", title = "Hybrid {CPU} Management for Adapting to the Diversity of Virtual Machines", journal = j-IEEE-TRANS-COMPUT, volume = "62", number = "7", pages = "1332--1344", month = jul, year = "2013", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.2012.80", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Mon Jun 17 15:07:53 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Computers", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", } @Article{White:2013:CTP, author = "David R. White and Jeremy Singer and Jonathan M. Aitken and Richard E. Jones", title = "Control theory for principled heap sizing", journal = j-SIGPLAN, volume = "48", number = "11", pages = "27--38", month = nov, year = "2013", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2555670.2466481", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Mon Dec 9 08:04:34 MST 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "ISMM '13 conference proceedings.", abstract = "We propose a new, principled approach to adaptive heap sizing based on control theory. We review current state-of-the-art heap sizing mechanisms, as deployed in Jikes RVM and HotSpot. We then formulate heap sizing as a control problem, apply and tune a standard controller algorithm, and evaluate its performance on a set of well-known benchmarks. We find our controller adapts the heap size more responsively than existing mechanisms. This responsiveness allows tighter virtual machine memory footprints while preserving target application throughput, which is ideal for both embedded and utility computing domains. In short, we argue that formal, systematic approaches to memory management should be replacing ad-hoc heuristics as the discipline matures. Control-theoretic heap sizing is one such systematic approach.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @Article{Wu:2013:HSC, author = "Youfeng Wu", title = "{HW\slash SW} co-designed acceleration of dynamic languages", journal = j-SIGPLAN, volume = "48", number = "5", pages = "1--2", month = may, year = "2013", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2499369.2465555", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Mon Jul 1 17:15:32 MDT 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Dynamic Programming Languages, such as Java, JavaScript, PHP, Perl, Python, Ruby, etc., are dominating languages for programming the web. HW/SW co-designed virtual machine can significantly accelerate their executions by transparently leveraging internal HW features via an internal compiler. We also argue for a common API to interface dynamic languages with the HW/SW co-designed virtual machine, so that a single internal compiler can accelerate all major dynamic languages.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "GPCE '12 conference proceedings.", } @Book{Wunschiers:2013:CBP, author = "R{\"o}bbe W{\"u}nschiers", title = "Computational biology: a practical introduction to biodata processing and analysis with {Linux}, {MySQL}, and {R}", publisher = pub-SV, address = pub-SV:adr, edition = "Second", pages = "xxix + 449", year = "2013", DOI = "https://doi.org/10.1007/978-3-642-34749-8", ISBN = "3-642-34748-7, 3-642-34749-5 (e-book)", ISBN-13 = "978-3-642-34748-1, 978-3-642-34749-8 (e-book)", LCCN = "QH324.2 .W86 2013", bibdate = "Thu Jul 10 08:57:23 MDT 2014", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/linux.bib; https://www.math.utah.edu/pub/tex/bib/s-plus.bib; https://www.math.utah.edu/pub/tex/bib/sqlbooks.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "This greatly expanded 2nd edition provides a practical introduction to --- data processing with Linux tools and the programming languages AWK and Perl --- data management with the relational database system MySQL, and --- data analysis and visualization with the statistical computing environment R for students and practitioners in the life sciences. Although written for beginners, experienced researchers in areas involving bioinformatics and computational biology may benefit from numerous tips and tricks that help to process, filter and format large datasets. Learning by doing is the basic concept of this book. Worked examples illustrate how to employ data processing and analysis techniques, e.g. for --- finding proteins potentially causing pathogenicity in bacteria, --- supporting the significance of BLAST with homology modeling, or --- detecting candidate proteins that may be redox-regulated, on the basis of their structure. All the software tools and datasets used are freely available. One section is devoted to explaining setup and maintenance of Linux as an operating system independent virtual machine. The author's experiences and knowledge gained from working and teaching in both academia and industry constitute the foundation for this practical approach.", acknowledgement = ack-nhfb, subject = "Computational biology; Bioinformatics; Automatic Data Processing; Bioinformatics; Computational biology", tableofcontents = "Whetting Your Appetite \\ Introduction \\ Content of This Book \\ Computer and Operating Systems \\ Unix/Linux \\ Working with Linux \\ The First Touch \\ Working with Files \\ Remote Connections \\ Playing with Text and Data Files \\ Using the Shell \\ Installing BLAST and ClustalW \\ Shell Programming \\ Regular Expressions \\ Sed \\ Programming \\ AWK \\ Perl \\ Other Programming Languages \\ Advanced Data Analysis \\ Relational Databases with MySQL \\ The Statistics Suite R \\ Worked Examples \\ Genomic Analysis of the Pathogenicity Factors from E. coli Strain O157:H7 and EHEC Strain O104:H4 \\ Limits of BLAST and Homology Modeling \\ Virtual Sequencing of pUC18c \\ Querying for Potential Redox-Regulated Enzymes", } @Article{Xiao:2013:DRA, author = "Zhen Xiao and Weijia Song and Qi Chen", title = "Dynamic Resource Allocation Using Virtual Machines for Cloud Computing Environment", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "24", number = "6", pages = "1107--1117", month = jun, year = "2013", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2012.283", ISSN = "1045-9219", ISSN-L = "1045-9219", bibdate = "Wed May 1 08:02:21 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Parallel and Distributed Systems", journal-URL = "http://www.computer.org/tpds/archives.htm", } @Article{Xiao:2013:VMP, author = "Peng Xiao and Zhigang Hu and Dongbo Liu and Guofeng Yan and Xilong Qu", title = "Virtual machine power measuring technique with bounded error in cloud environments", journal = j-J-NETW-COMPUT-APPL, volume = "36", number = "2", pages = "818--828", month = mar, year = "2013", CODEN = "JNCAF3", ISSN = "1084-8045 (print), 1095-8592 (electronic)", ISSN-L = "1084-8045", bibdate = "Wed Jan 28 15:44:34 MST 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1084804512002494", acknowledgement = ack-nhfb, ajournal = "J. Netw. Comput. Appl.", fjournal = "Journal of Network and Computer Applications", journal-URL = "http://www.sciencedirect.com/science/journal/10848045", } @Article{Xie:2013:AAE, author = "Xinwei Xie and Jingling Xue and Jie Zhang", title = "{Acculock}: accurate and efficient detection of data races", journal = j-SPE, volume = "43", number = "5", pages = "543--576", month = may, year = "2013", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/spe.2121", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Sat Apr 27 13:41:04 MDT 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2010.bib; https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www3.interscience.wiley.com/journalfinder.html", acknowledgement = ack-nhfb, fjournal = "Software---Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", keywords = "FastTrack; Java; Java Virtual Machine; JIKES; Jikes Research Virtual Machine; RoadRunner", onlinedate = "16 Apr 2012", } @Article{Yamada:2013:TFT, author = "Hiroshi Yamada and Kenji Kono", title = "Traveling forward in time to newer operating systems using {ShadowReboot}", journal = j-SIGPLAN, volume = "48", number = "7", pages = "121--130", month = jul, year = "2013", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2517326.2451536", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Mon Aug 26 13:55:17 MDT 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "VEE '13 Conference proceedings.", abstract = "Operating system (OS) reboots are an essential part of updating kernels and applications on laptops and desktop PCs. Long downtime during OS reboots severely disrupts users' computational activities. This long disruption discourages the users from conducting OS reboots, failing to enforce them to conduct software updates. This paper presents ShadowReboot, a virtual machine monitor (VMM)-based approach that shortens downtime of OS reboots in software updates. ShadowReboot conceals OS reboot activities from user's applications by spawning a VM dedicated to an OS reboot and systematically producing the rebooted state where the updated kernel and applications are ready for use. ShadowReboot provides an illusion to the users that the guest OS travels forward in time to the rebooted state. ShadowReboot offers the following advantages. It can be used to apply patches to the kernels and even system configuration updates. Next, it does not require any special patch requiring detailed knowledge about the target kernels. Lastly, it does not require any target kernel modification. We implemented a prototype in VirtualBox 4.0.10 OSE. Our experimental results show that ShadowReboot successfully updated software on unmodified commodity OS kernels and shortened the downtime of commodity OS reboots on five Linux distributions (Fedora, Ubuntu, Gentoo, Cent, and SUSE) by 91 to 98\%.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @Article{Yang:2013:QSE, author = "Yan Yang and Yulong Zhang and Alex Hai Wang and Meng Yu and Wanyu Zang and Peng Liu and Sushil Jajodia", title = "Quantitative survivability evaluation of three virtual machine-based server architectures", journal = j-J-NETW-COMPUT-APPL, volume = "36", number = "2", pages = "781--790", month = mar, year = "2013", CODEN = "JNCAF3", ISSN = "1084-8045 (print), 1095-8592 (electronic)", ISSN-L = "1084-8045", bibdate = "Wed Jan 28 15:44:34 MST 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1084804512002536", acknowledgement = ack-nhfb, ajournal = "J. Netw. Comput. Appl.", fjournal = "Journal of Network and Computer Applications", journal-URL = "http://www.sciencedirect.com/science/journal/10848045", } @Article{Yu:2013:OSI, author = "Yulong Yu and Yuxin Wang and He Guo and Xubin He", title = "Optimisation schemes to improve hybrid co-scheduling for concurrent virtual machines", journal = j-INT-J-PAR-EMER-DIST-SYS, volume = "28", number = "1", pages = "46--66", year = "2013", CODEN = "????", DOI = "https://doi.org/10.1080/17445760.2012.656309", ISSN = "1744-5760 (print), 1744-5779 (electronic)", ISSN-L = "1744-5760", bibdate = "Sat Jun 22 12:03:23 MDT 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjparemerdistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "International Journal of Parallel, Emergent and Distributed Systems: IJPEDS", journal-URL = "http://www.tandfonline.com/loi/gpaa20", } @Article{Zaman:2013:CAB, author = "Sharrukh Zaman and Daniel Grosu", title = "Combinatorial auction-based allocation of virtual machine instances in clouds", journal = j-J-PAR-DIST-COMP, volume = "73", number = "4", pages = "495--508", month = apr, year = "2013", CODEN = "JPDCER", DOI = "https://doi.org/10.1016/j.jpdc.2012.12.006", ISSN = "0743-7315 (print), 1096-0848 (electronic)", ISSN-L = "0743-7315", bibdate = "Wed Feb 20 06:51:33 MST 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www.sciencedirect.com/science/journal/07437315", URL = "http://www.sciencedirect.com/science/article/pii/S0743731512002870", acknowledgement = ack-nhfb, fjournal = "Journal of Parallel and Distributed Computing", journal-URL = "http://www.sciencedirect.com/science/journal/07437315", } @Article{Zamorano:2013:ART, author = "Juan Zamorano and {'Angel} Esquinas and Juan A. de la Puente", title = "{Ada} real-time services and virtualization", journal = j-SIGADA-LETTERS, volume = "33", number = "1", pages = "128--133", month = apr, year = "2013", CODEN = "AALEE5", DOI = "https://doi.org/10.1145/2492312.2492325", ISSN = "1094-3641 (print), 1557-9476 (electronic)", ISSN-L = "1094-3641", bibdate = "Fri Jun 21 09:58:26 MDT 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigada.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Virtualization techniques have received increased attention in the field of embedded real-time systems. Such techniques provide a set of virtual machines that run on a single hardware platform, thus allowing several application programs to be executed as though they were running on separate machines, with isolated memory spaces and a fraction of the real processor time available to each of them. This papers deals with some problems that arise when implementing real-time systems written in Ada on a virtual machine. The effects of virtualization on the performance of the Ada real-time services are analysed, and requirements for the virtualization layer are derived. Virtual-machine time services are also defined in order to properly support Ada real-time applications. The implementation of the ORK+ kernel on the XtratuM supervisor is used as an example.", acknowledgement = ack-nhfb, fjournal = "ACM SIGADA Ada Letters", } @Article{Zhang:2013:ASD, author = "Youhui Zhang and Yanhua Li and Weimin Zheng", title = "Automatic software deployment using user-level virtualization for cloud-computing", journal = j-FUT-GEN-COMP-SYS, volume = "29", number = "1", pages = "323--329", month = jan, year = "2013", CODEN = "FGSEVI", DOI = "https://doi.org/10.1016/j.future.2011.08.012", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Fri Oct 26 06:10:54 MDT 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www.sciencedirect.com/science/journal/0167739X", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X11001518", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Zhou:2013:LPC, author = "Ruijin Zhou and Tao Li", title = "Leveraging phase change memory to achieve efficient virtual machine execution", journal = j-SIGPLAN, volume = "48", number = "7", pages = "179--190", month = jul, year = "2013", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2517326.2451547", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Mon Aug 26 13:55:17 MDT 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "VEE '13 Conference proceedings.", abstract = "Virtualization technology is being widely adopted by servers and data centers in the cloud computing era to improve resource utilization and energy efficiency. Nevertheless, the heterogeneous memory demands from multiple virtual machines (VM) make it more challenging to design efficient memory systems. Even worse, mission critical VM management activities (e.g. checkpointing) could incur significant runtime overhead due to intensive IO operations. In this paper, we propose to leverage the adaptable and non-volatile features of the emerging phase change memory (PCM) to achieve efficient virtual machine execution. Towards this end, we exploit VM-aware PCM management mechanisms, which (1) smartly tune SLC/MLC page allocation within a single VM and across different VMs and (2) keep critical checkpointing pages in PCM to reduce I/O traffic. Experimental results show that our single VM design (IntraVM) improves performance by 10\% and 20\% compared to pure SLC- and MLC- based systems. Further incorporating VM-aware resource management schemes (IntraVM+InterVM) increases system performance by 15\%. In addition, our design saves 46\% of checkpoint/restore duration and reduces 50\% of overall IO penalty to the system.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @Article{Zhou:2013:OVM, author = "Ruijin Zhou and Fang Liu and Chao Li and Tao Li", title = "Optimizing virtual machine live storage migration in heterogeneous storage environment", journal = j-SIGPLAN, volume = "48", number = "7", pages = "73--84", month = jul, year = "2013", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2517326.2451529", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Mon Aug 26 13:55:17 MDT 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "VEE '13 Conference proceedings.", abstract = "Virtual machine (VM) live storage migration techniques significantly increase the mobility and manageability of virtual machines in the era of cloud computing. On the other hand, as solid state drives (SSDs) become increasingly popular in data centers, VM live storage migration will inevitably encounter heterogeneous storage environments. Nevertheless, conventional migration mechanisms do not consider the speed discrepancy and SSD's wear-out issue, which not only causes significant performance degradation but also shortens SSD's lifetime. This paper, for the first time, addresses the efficiency of VM live storage migration in heterogeneous storage environments from a multi-dimensional perspective, i.e., user experience, device wearing, and manageability. We derive a flexible metric (migration cost), which captures various design preference. Based on that, we propose and prototype three new storage migration strategies, namely: (1) Low Redundancy (LR), which generates the least amount of redundant writes; (2) Source-based Low Redundancy (SLR), which keeps the balance between IO performance and write redundancy; and (3) Asynchronous IO Mirroring, which seeks the highest IO performance. The evaluation of our prototyped system shows that our techniques outperform existing live storage migration by a significant margin. Furthermore, by adaptively mixing our proposed schemes, the cost of massive VM live storage migration can be even lower than that of only using the best of individual mechanism.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @Article{Adams:2014:HVM, author = "Keith Adams and Jason Evans and Bertrand Maher and Guilherme Ottoni and Andrew Paroski and Brett Simmers and Edwin Smith and Owen Yamauchi", title = "The {HipHop Virtual Machine}", journal = j-SIGPLAN, volume = "49", number = "10", pages = "777--790", month = oct, year = "2014", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2714064.2660199", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue May 12 17:41:21 MDT 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "The HipHop Virtual Machine (HHVM) is a JIT compiler and runtime for PHP. While PHP values are dynamically typed, real programs often have latent types that are useful for optimization once discovered. Some types can be proven through static analysis, but limitations in the ahead-of-time approach leave some types to be discovered at run time. And even though many values have latent types, PHP programs can also contain polymorphic variables and expressions, which must be handled without catastrophic slowdown. HHVM discovers latent types by structuring its JIT around the concept of a tracelet. A tracelet is approximately a basic block specialized for a particular set of run-time types for its input values. Tracelets allow HHVM to exactly and efficiently learn the types observed by the program, while using a simple compiler. This paper shows that this approach enables HHVM to achieve high levels of performance, without sacrificing compatibility or interactivity.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "OOPSLA '14 conference proceedings.", } @Article{Amit:2014:VMS, author = "Nadav Amit and Dan Tsafrir and Assaf Schuster", title = "{VSwapper}: a memory swapper for virtualized environments", journal = j-COMP-ARCH-NEWS, volume = "42", number = "1", pages = "349--366", month = mar, year = "2014", CODEN = "CANED2", DOI = "https://doi.org/10.1145/2654822.2541969", ISSN = "0163-5964 (print), 1943-5851 (electronic)", ISSN-L = "0163-5964", bibdate = "Mon Aug 18 17:12:47 MDT 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigarch.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "The number of guest virtual machines that can be consolidated on one physical host is typically limited by the memory size, motivating memory overcommitment. Guests are given a choice to either install a ``balloon'' driver to coordinate the overcommitment activity, or to experience degraded performance due to uncooperative swapping. Ballooning, however, is not a complete solution, as hosts must still fall back on uncooperative swapping in various circumstances. Additionally, ballooning takes time to accommodate change, and so guests might experience degraded performance under changing conditions. Our goal is to improve the performance of hosts when they fall back on uncooperative swapping and/or operate under changing load conditions. We carefully isolate and characterize the causes for the associated poor performance, which include various types of superfluous swap operations, decayed swap file sequentiality, and ineffective prefetch decisions upon page faults. We address these problems by implementing VSwapper, a guest-agnostic memory swapper for virtual environments that allows efficient, uncooperative overcommitment. With inactive ballooning, VSwapper yields up to an order of magnitude performance improvement. Combined with ballooning, VSwapper can achieve up to double the performance under changing load conditions.", acknowledgement = ack-nhfb, fjournal = "ACM SIGARCH Computer Architecture News", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89", remark = "ASPLOS '14 conference proceedings.", } @Misc{Anonymous:2014:ASS, author = "Anonymous", title = "{AMD64 Simics Simulator} version 1", howpublished = "Web site.", year = "2014", bibdate = "Mon Jun 23 17:38:45 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.windriver.com/simics/", acknowledgement = ack-nhfb, } @Book{Anonymous:2014:AVM, author = "Xiao-feng Li and Jiu-tao Nie and Ligang Wang", title = "Advanced Virtual Machine Design and Implementation", publisher = pub-CRC, address = pub-CRC:adr, pages = "300 (est.)", year = "2014", ISBN = "1-4665-8260-X", ISBN-13 = "978-1-4665-8260-6", LCCN = "????", bibdate = "Thu Dec 4 08:19:21 MST 2014", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, } @Misc{Anonymous:2014:BIE, author = "Anonymous", title = "{Bochs IA-32} Emulator", howpublished = "Web site.", year = "2014", bibdate = "Mon Jun 23 17:36:48 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://bochs.sourceforge.net/", abstract = "Bochs is a highly portable open source IA-32 (x86) PC emulator written in C++, that runs on most popular platforms. It includes emulation of the Intel x86 CPU, common I/O devices, and a custom BIOS. Bochs can be compiled to emulate many different x86 CPUs, from early 386 to the most recent x86-64 Intel and AMD processors which may even not reached the market yet. Bochs is capable of running most Operating Systems inside the emulation including Linux, DOS or Microsoft Windows. Bochs was originally written by Kevin Lawton and is currently maintained by this project.", acknowledgement = ack-nhfb, } @Misc{Anonymous:2014:LVA, author = "Anonymous", title = "The libvirt virtualization {API}", howpublished = "Web site.", year = "2014", bibdate = "Fri Apr 25 14:36:09 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://libvirt.org/", acknowledgement = ack-nhfb, remark = "The FAQ link at top level provides great detail about libvirt, with its admirable goals of controlling multiple virtual machines, and hypervisors, with a common software layer.", } @Misc{Anonymous:2014:O, author = "Anonymous", title = "{oVirt}", howpublished = "Web site.", year = "2014", bibdate = "Sat Apr 26 07:21:09 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://ovirt.org/", acknowledgement = ack-nhfb, remark = "From the About oVirt link: ``If you are familiar with VMware products, it is conceptually similar to vSphere. oVirt serves as the bedrock for Red Hat's Enterprise Virtualization product, and is the `upstream' project where new features are developed in advance of their inclusion in that supported product offering.''", } @Article{Araujo:2014:SAE, author = "Jean Araujo and Rubens Matos and Vandi Alves and Paulo Maciel and F. Vieira de Souza and Rivalino {Matias, Jr.} and Kishor S. Trivedi", title = "Software aging in the {Eucalyptus} cloud computing infrastructure: Characterization and rejuvenation", journal = j-JETC, volume = "10", number = "1", pages = "11:1--11:??", month = jan, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1145/2539122", ISSN = "1550-4832", ISSN-L = "1550-4832", bibdate = "Tue Jan 14 19:15:04 MST 2014", bibsource = "http://www.acm.org/pubs/contents/journals/jetc/; https://www.math.utah.edu/pub/tex/bib/jetc.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "The need for high reliability, availability and performance has significantly increased in modern applications, that handle rapidly growing demands while providing uninterruptible services. Cloud computing systems fundamentally provide access to large pools of data and computational resources. Eucalyptus is a software framework largely used to implement private clouds and hybrid-style Infrastructure as a Service. It implements the Amazon Web Service (AWS) API, allowing interoperability with other AWS-based services. This article investigates the software aging effects in the Eucalyptus framework, considering workloads composed of intensive requests for remote storage attachment and virtual machine instantiations. We found problems that may be harmful to system dependability and performance, specifically regarding to RAM memory and swap space exhaustion, besides highly excessive CPU utilization by the virtual machines. We also present an approach that applies time series analysis to schedule rejuvenation, so as to reduce the downtime by predicting the proper moment to perform the rejuvenation. We experimentally evaluate our approach using an Eucalyptus test bed. The results show that our approach achieves higher availability, when compared to a threshold-triggered rejuvenation method based on continuous monitoring of resources utilization.", acknowledgement = ack-nhfb, articleno = "11", fjournal = "ACM Journal on Emerging Technologies in Computing Systems (JETC)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J967", } @Article{Arya:2014:TRG, author = "Kapil Arya and Yury Baskakov and Alex Garthwaite", title = "Tesseract: reconciling guest {I/O} and hypervisor swapping in a {VM}", journal = j-SIGPLAN, volume = "49", number = "7", pages = "15--28", month = jul, year = "2014", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2674025.2576198", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Sep 26 07:29:50 MDT 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Double-paging is an often-cited, if unsubstantiated, problem in multi-level scheduling of memory between virtual machines (VMs) and the hypervisor. This problem occurs when both a virtualized guest and the hypervisor overcommit their respective physical address-spaces. When the guest pages out memory previously swapped out by the hypervisor, it initiates an expensive sequence of steps causing the contents to be read in from the hypervisor swapfile only to be written out again, significantly lengthening the time to complete the guest I/O request. As a result, performance rapidly drops. We present Tesseract, a system that directly and transparently addresses the double-paging problem. Tesseract tracks when guest and hypervisor I/O operations are redundant and modifies these I/Os to create indirections to existing disk blocks containing the page contents. Although our focus is on reconciling I/Os between the guest disks and hypervisor swap, our technique is general and can reconcile, or deduplicate, I/Os for guest pages read or written by the VM. Deduplication of disk blocks for file contents accessed in a common manner is well-understood. One challenge that our approach faces is that the locality of guest I/Os (reflecting the guest's notion of disk layout) often differs from that of the blocks in the hypervisor swap. This loss of locality through indirection results in significant performance loss on subsequent guest reads. We propose two alternatives to recovering this lost locality, each based on the idea of asynchronously reorganizing the indirected blocks in persistent storage. We evaluate our system and show that it can significantly reduce the costs of double-paging. We focus our experiments on a synthetic benchmark designed to highlight its effects. In our experiments we observe Tesseract can improve our benchmark's throughput by as much as 200\% when using traditional disks and by as much as 30\% when using SSD. At the same time worst case application responsiveness can be improved by a factor of 5.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "VEE '14 conference proceedings.", } @Article{Atif:2014:APA, author = "Muhammad Atif and Peter Strazdins", title = "Adaptive parallel application resource remapping through the live migration of virtual machines", journal = j-FUT-GEN-COMP-SYS, volume = "37", number = "??", pages = "148--161", month = jul, year = "2014", CODEN = "FGSEVI", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Wed May 21 08:14:41 MDT 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X13001428", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X/", } @Article{Bartolini:2014:AFG, author = "Davide B. Bartolini and Filippo Sironi and Donatella Sciuto and Marco D. Santambrogio", title = "Automated Fine-Grained {CPU} Provisioning for Virtual Machines", journal = j-TACO, volume = "11", number = "3", pages = "27:1--27:??", month = oct, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1145/2637480", ISSN = "1544-3566 (print), 1544-3973 (electronic)", ISSN-L = "1544-3566", bibdate = "Mon Oct 27 17:02:20 MDT 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/multithreading.bib; https://www.math.utah.edu/pub/tex/bib/taco.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Ideally, the pay-as-you-go model of Infrastructure as a Service (IaaS) clouds should enable users to rent just enough resources (e.g., CPU or memory bandwidth) to fulfill their service level objectives (SLOs). Achieving this goal is hard on current IaaS offers, which require users to explicitly specify the amount of resources to reserve; this requirement is nontrivial for users, because estimating the amount of resources needed to attain application-level SLOs is often complex, especially when resources are virtualized and the service provider colocates virtual machines (VMs) on host nodes. For this reason, users who deploy VMs subject to SLOs are usually prone to overprovisioning resources, thus resulting in inflated business costs. This article tackles this issue with AutoPro: a runtime system that enhances IaaS clouds with automated and fine-grained resource provisioning based on performance SLOs. Our main contribution with AutoPro is filling the gap between application-level performance SLOs and allocation of a contended resource, without requiring explicit reservations from users. In this article, we focus on CPU bandwidth allocation to throughput-driven, compute-intensive multithreaded applications colocated on a multicore processor; we show that a theoretically sound, yet simple, control strategy can enable automated fine-grained allocation of this contended resource, without the need for offline profiling. Additionally, AutoPro helps service providers optimize infrastructure utilization by provisioning idle resources to best-effort workloads, so as to maximize node-level utilization. Our extensive experimental evaluation confirms that AutoPro is able to automatically determine and enforce allocations to meet performance SLOs while maximizing node-level utilization by supporting batch workloads on a best-effort basis.", acknowledgement = ack-nhfb, articleno = "27", fjournal = "ACM Transactions on Architecture and Code Optimization (TACO)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J924", } @Article{Bell:2014:PID, author = "Jonathan Bell and Gail Kaiser", title = "{Phosphor}: illuminating dynamic data flow in commodity {JVMs}", journal = j-SIGPLAN, volume = "49", number = "10", pages = "83--101", month = oct, year = "2014", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2714064.2660212", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue May 12 17:41:21 MDT 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Dynamic taint analysis is a well-known information flow analysis problem with many possible applications. Taint tracking allows for analysis of application data flow by assigning labels to data, and then propagating those labels through data flow. Taint tracking systems traditionally compromise among performance, precision, soundness, and portability. Performance can be critical, as these systems are often intended to be deployed to production environments, and hence must have low overhead. To be deployed in security-conscious settings, taint tracking must also be sound and precise. Dynamic taint tracking must be portable in order to be easily deployed and adopted for real world purposes, without requiring recompilation of the operating system or language interpreter, and without requiring access to application source code. We present Phosphor, a dynamic taint tracking system for the Java Virtual Machine (JVM) that simultaneously achieves our goals of performance, soundness, precision, and portability. Moreover, to our knowledge, it is the first portable general purpose taint tracking system for the JVM. We evaluated Phosphor 's performance on two commonly used JVM languages (Java and Scala), on two successive revisions of two commonly used JVMs (Oracle's HotSpot and OpenJDK's IcedTea) and on Android's Dalvik Virtual Machine, finding its performance to be impressive: as low as 3\% (53\% on average; 220\% at worst) using the DaCapo macro benchmark suite. This paper describes our approach toward achieving portable taint tracking in the JVM.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "OOPSLA '14 conference proceedings.", } @Article{Bienkowski:2014:WAV, author = "Marcin Bienkowski and Anja Feldmann and Johannes Grassler and Gregor Schaffrath and Stefan Schmid", title = "The Wide-Area Virtual Service Migration Problem: a Competitive Analysis Approach", journal = j-IEEE-TRANS-NETWORKING, volume = "22", number = "1", pages = "165--178", month = feb, year = "2014", CODEN = "IEANEP", DOI = "https://doi.org/10.1109/TNET.2013.2245676", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Tue Mar 4 18:22:52 MST 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Today's trend toward network virtualization and software-defined networking enables flexible new distributed systems where resources can be dynamically allocated and migrated to locations where they are most useful. This paper proposes a competitive analysis approach to design and reason about online algorithms that find a good tradeoff between the benefits and costs of a migratable service. A competitive online algorithm provides worst-case performance guarantees under any demand dynamics, and without any information or statistical assumptions on the demand in the future. This is attractive especially in scenarios where the demand is hard to predict and can be subject to unexpected events. As a case study, we describe a service (e.g., an SAP server or a gaming application) that uses network virtualization to improve the quality of service (QoS) experienced by thin client applications running on mobile devices. By decoupling the service from the underlying resource infrastructure, it can be migrated closer to the current client locations while taking into account migration costs. We identify the major cost factors in such a system and formalize the wide-area service migration problem. Our main contributions are a randomized and a deterministic online algorithm that achieve a competitive ratio of $ O(\log {n}) $ in a simplified scenario, where $n$ is the size of the substrate network. This is almost optimal. We complement our worst-case analysis with simulations in different specific scenarios and also sketch a migration demonstrator.", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771", } @Article{Biswas:2014:DES, author = "Swarnendu Biswas and Jipeng Huang and Aritra Sengupta and Michael D. Bond", title = "{DoubleChecker}: efficient sound and precise atomicity checking", journal = j-SIGPLAN, volume = "49", number = "6", pages = "28--39", month = jun, year = "2014", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2666356.2594323", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Sep 26 07:38:28 MDT 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2010.bib; https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Atomicity is a key correctness property that allows programmers to reason about code regions in isolation. However, programs often fail to enforce atomicity correctly, leading to atomicity violations that are difficult to detect. Dynamic program analysis can detect atomicity violations based on an atomicity specification, but existing approaches slow programs substantially. This paper presents DoubleChecker, a novel sound and precise atomicity checker whose key insight lies in its use of two new cooperating dynamic analyses. Its imprecise analysis tracks cross-thread dependences soundly but imprecisely with significantly better performance than a fully precise analysis. Its precise analysis is more expensive but only needs to process a subset of the execution identified as potentially involved in atomicity violations by the imprecise analysis. If DoubleChecker operates in single-run mode, the two analyses execute in the same program run, which guarantees soundness and precision but requires logging program accesses to pass from the imprecise to the precise analysis. In multi-run mode, the first program run executes only the imprecise analysis, and a second run executes both analyses. Multi-run mode trades accuracy for performance; each run of multi-run mode outperforms single-run mode, but can potentially miss violations. We have implemented DoubleChecker and an existing state-of-the-art atomicity checker called Velodrome in a high-performance Java virtual machine. DoubleChecker's single-run mode significantly outperforms Velodrome, while still providing full soundness and precision. DoubleChecker's multi-run mode improves performance further, without significantly impacting soundness in practice. These results suggest that DoubleChecker's approach is a promising direction for improving the performance of dynamic atomicity checking over prior work.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", received = "PLDI '14 conference proceedings.", } @Article{Bourguiba:2014:INV, author = "Manel Bourguiba and Kamel Haddadou and Ines {El Korbi} and Guy Pujolle", title = "Improving Network {I/O} Virtualization for Cloud Computing", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "25", number = "3", pages = "673--681", month = mar, year = "2014", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2013.29", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Mon Aug 25 07:12:16 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Parallel and Distributed Systems", journal-URL = "http://www.computer.org/tpds/archives.htm", } @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 = "https://www.math.utah.edu/pub/tex/bib/sigops.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{Canali:2014:DSV, author = "Claudia Canali and Riccardo Lancellotti", title = "Detecting similarities in virtual machine behavior for cloud monitoring using smoothed histograms", journal = j-J-PAR-DIST-COMP, volume = "74", number = "8", pages = "2757--2769", month = aug, year = "2014", CODEN = "JPDCER", ISSN = "0743-7315 (print), 1096-0848 (electronic)", ISSN-L = "0743-7315", bibdate = "Mon Aug 18 08:45:37 MDT 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0743731514000343", acknowledgement = ack-nhfb, fjournal = "Journal of Parallel and Distributed Computing", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", } @Article{Cao:2014:EAH, author = "Zhibo Cao and Shoubin Dong", title = "An energy-aware heuristic framework for virtual machine consolidation in {Cloud} computing", journal = j-J-SUPERCOMPUTING, volume = "69", number = "1", pages = "429--451", month = jul, year = "2014", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-014-1172-3", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Wed Sep 10 06:45:04 MDT 2014", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0920-8542&volume=69&issue=1; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer.com/article/10.1007/s11227-014-1172-3", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Book{Cardoso:2014:SCR, author = "Edvaldo Alessandro Cardoso", title = "{System Center 2012 R2} virtual machine manager cookbook: over 70 recipes to help you design, configure, and manage a reliable and efficient virtual infrastructure with {VMM 2012 R2}", publisher = "Packt Publishing", address = "Birmingham, UK", edition = "Second", pages = "428", year = "2014", ISBN = "1-78217-684-5, 1-78217-685-3 (ebook)", ISBN-13 = "978-1-78217-684-8, 978-1-78217-685-5 (ebook)", LCCN = "QA76.76.C69", bibdate = "Thu Dec 4 07:49:18 MST 2014", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", series = "Quick answers to common problems", URL = "http://proquest.tech.safaribooksonline.de/9781782176848", acknowledgement = ack-nhfb, subject = "Microsoft System center; Gestion de configurations; Syst{\`e}mes virtuels (Informatique); Infonuagique", } @Article{Chang:2014:EMV, author = "Chao-Jui Chang and Jan-Jan Wu and Wei-Chung Hsu and Pangfeng Liu and Pen-Chung Yew", title = "Efficient memory virtualization for {Cross-ISA} system mode emulation", journal = j-SIGPLAN, volume = "49", number = "7", pages = "117--128", month = jul, year = "2014", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2674025.2576201", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Sep 26 07:29:50 MDT 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Cross-ISA system-mode emulation has many important applications. For example, Cross-ISA system-mode emulation helps computer architects and OS developers trace and debug kernel execution-flow efficiently by emulating a slower platform (such as ARM) on a more powerful plat-form (such as an x86 machine). Cross-ISA system-mode emulation also enables workload consolidation in data centers with platforms of different instruction-set architectures (ISAs). However, system-mode emulation is much slower. One major overhead in system-mode emulation is the multi-level memory address translation that maps guest virtual address to host physical address. Shadow page tables (SPT) have been used to reduce such overheads, but primarily for same-ISA virtualization. In this paper we propose a novel approach called embedded shadow page tables (ESPT). EPST embeds a shadow page table into the address space of a cross-ISA dynamic binary translation (DBT) and uses hardware memory management unit in the CPU to translate memory addresses, instead of software translation in a current DBT emulator like QEMU. We also use the larger address space on modern 64-bit CPUs to accommodate our DBT emulator so that it will not interfere with the guest operating system. We incorporate our new scheme into QEMU, a popular, retargetable cross-ISA system emulator. SPEC CINT2006 benchmark results indicate that our technique achieves an average speedup of 1.51 times in system mode when emulating ARM on x86, and a 1.59 times speedup for emulating IA32 on x86_64.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "VEE '14 conference proceedings.", } @Article{Chen:2014:CCB, author = "Licheng Chen and Zhipeng Wei and Zehan Cui and Mingyu Chen and Haiyang Pan and Yungang Bao", title = "{CMD}: classification-based memory deduplication through page access characteristics", journal = j-SIGPLAN, volume = "49", number = "7", pages = "65--76", month = jul, year = "2014", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2674025.2576204", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Sep 26 07:29:50 MDT 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Limited main memory size is considered as one of the major bottlenecks in virtualization environments. Content-Based Page Sharing (CBPS) is an efficient memory deduplication technique to reduce server memory requirements, in which pages with same content are detected and shared into a single copy. As the widely used implementation of CBPS, Kernel Samepage Merging (KSM) maintains the whole memory pages into two global comparison trees (a stable tree and an unstable tree). To detect page sharing opportunities, each tracked page needs to be compared with pages already in these two large global trees. However since the vast majority of compared pages have different content with it, that will induce massive futility comparisons and thus heavy overhead. In this paper, we propose a lightweight page Classification-based Memory Deduplication approach named CMD to reduce futile page comparison overhead meanwhile to detect page sharing opportunities efficiently. The main innovation of CMD is that pages are grouped into different classifications based on page access characteristics. Pages with similar access characteristics are suggested to have higher possibility with same content, thus they are grouped into the same classification. In CMD, the large global comparison trees are divided into multiple small trees with dedicated local ones in each page classification. Page comparisons are performed just in the same classification, and pages from different classifications are never compared (since they probably result in futile comparisons). The experimental results show that CMD can efficiently reduce page comparisons (by about 68.5\%) meanwhile detect nearly the same (by more than 98\%) or even more page sharing opportunities.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "VEE '14 conference proceedings.", } @Article{Chen:2014:HBA, author = "Songqing Chen and Lei Liu and Xinyuan Wang and Xinwen Zhang and Zhao Zhang", title = "A Host-Based Approach for Unknown Fast-Spreading Worm Detection and Containment", journal = j-TAAS, volume = "8", number = "4", pages = "21:1--21:??", month = jan, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1145/2555615", ISSN = "1556-4665 (print), 1556-4703 (electronic)", ISSN-L = "1556-4665", bibdate = "Thu Mar 13 06:39:26 MDT 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/taas.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "The fast-spreading worm, which immediately propagates itself after a successful infection, is becoming one of the most serious threats to today's networked information systems. In this article, we present WormTerminator, a host-based solution for fast Internet worm detection and containment with the assistance of virtual machine techniques based on the fast-worm defining characteristic. In WormTerminator, a virtual machine cloning the host OS runs in parallel to the host OS. Thus, the virtual machine has the same set of vulnerabilities as the host. Any outgoing traffic from the host is diverted through the virtual machine. If the outgoing traffic from the host is for fast worm propagation, the virtual machine should be infected and will exhibit worm propagation pattern very quickly because a fast-spreading worm will start to propagate as soon as it successfully infects a host. To prove the concept, we have implemented a prototype of WormTerminator and have examined its effectiveness against the real Internet worm Linux/Slapper. Our empirical results confirm that WormTerminator is able to completely contain worm propagation in real-time without blocking any non-worm traffic. The major performance cost of WormTerminator is a one-time delay to the start of each outgoing normal connection for worm detection. To reduce the performance overhead, caching is utilized, through which WormTerminator will delay no more than 6\% normal outgoing traffic for such detection on average.", acknowledgement = ack-nhfb, articleno = "21", fjournal = "ACM Transactions on Autonomous and Adaptive Systems (TAAS)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1010", } @Article{Chiueh:2014:SFI, author = "Tzi-cker Chiueh and Xin Wang and Zhiyong Shan", title = "{Shuttle}: Facilitating Inter-Application Interactions for {OS}-Level Virtualization", journal = j-IEEE-TRANS-COMPUT, volume = "63", number = "5", pages = "1220--1233", month = may, year = "2014", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.2012.297", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Mon Aug 25 08:24:32 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Computers", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", } @Article{Clifford:2014:AFB, author = "Daniel Clifford and Hannes Payer and Michael Starzinger and Ben L. Titzer", title = "Allocation folding based on dominance", journal = j-SIGPLAN, volume = "49", number = "11", pages = "15--24", month = nov, year = "2014", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2775049.2602994", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue May 12 17:41:19 MDT 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Memory management system performance is of increasing importance in today's managed languages. Two lingering sources of overhead are the direct costs of memory allocations and write barriers. This paper introduces it allocation folding, an optimization technique where the virtual machine automatically folds multiple memory allocation operations in optimized code together into a single, larger it allocation group. An allocation group comprises multiple objects and requires just a single bounds check in a bump-pointer style allocation, rather than a check for each individual object. More importantly, all objects allocated in a single allocation group are guaranteed to be contiguous after allocation and thus exist in the same generation, which makes it possible to statically remove write barriers for reference stores involving objects in the same allocation group. Unlike object inlining, object fusing, and object colocation, allocation folding requires no special connectivity or ownership relation between the objects in an allocation group. We present our analysis algorithm to determine when it is safe to fold allocations together and discuss our implementation in V8, an open-source, production JavaScript virtual machine. We present performance results for the Octane and Kraken benchmark suites and show that allocation folding is a strong performance improvement, even in the presence of some heap fragmentation. Additionally, we use four hand-selected benchmarks JPEGEncoder, NBody, Soft3D, and Textwriter where allocation folding has a large impact.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "ISMM '14 conference proceedings.", } @Article{Dall:2014:KAD, author = "Christoffer Dall and Jason Nieh", title = "{KVM\slash ARM}: the design and implementation of the {Linux ARM} hypervisor", journal = j-COMP-ARCH-NEWS, volume = "42", number = "1", pages = "333--348", month = mar, year = "2014", CODEN = "CANED2", DOI = "https://doi.org/10.1145/2654822.2541946", ISSN = "0163-5964 (print), 1943-5851 (electronic)", ISSN-L = "0163-5964", bibdate = "Mon Aug 18 17:12:47 MDT 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigarch.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "As ARM CPUs become increasingly common in mobile devices and servers, there is a growing demand for providing the benefits of virtualization for ARM-based devices. We present our experiences building the Linux ARM hypervisor, KVM/ARM, the first full system ARM virtualization solution that can run unmodified guest operating systems on ARM multicore hardware. KVM/ARM introduces split-mode virtualization, allowing a hypervisor to split its execution across CPU modes and be integrated into the Linux kernel. This allows KVM/ARM to leverage existing Linux hardware support and functionality to simplify hypervisor development and maintainability while utilizing recent ARM hardware virtualization extensions to run virtual machines with comparable performance to native execution. KVM/ARM has been successfully merged into the mainline Linux kernel, ensuring that it will gain wide adoption as the virtualization platform of choice for ARM. We provide the first measurements on real hardware of a complete hypervisor using ARM hardware virtualization support. Our results demonstrate that KVM/ARM has modest virtualization performance and power costs, and can achieve lower performance and power costs compared to x86-based Linux virtualization on multicore hardware.", acknowledgement = ack-nhfb, fjournal = "ACM SIGARCH Computer Architecture News", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89", remark = "ASPLOS '14 conference proceedings.", } @Article{Dargie:2014:PCE, author = "Waltenegus Dargie and Alexander Schill and Christoph Mobius", title = "Power Consumption Estimation Models for Processors, Virtual Machines, and Servers", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "25", number = "6", pages = "1600--1614", month = jun, year = "2014", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2013.183", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Mon Aug 25 07:12:16 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Parallel and Distributed Systems", journal-URL = "http://www.computer.org/tpds/archives.htm", } @Article{Dillon:2014:VHN, author = "Marion Dillon and Timothy Winters", title = "Virtualization of Home Network Gateways", journal = j-COMPUTER, volume = "47", number = "11", pages = "62--65", month = nov, year = "2014", CODEN = "CPTRB4", DOI = "https://doi.org/10.1109/MC.2014.338", ISSN = "0018-9162 (print), 1558-0814 (electronic)", ISSN-L = "0018-9162", bibdate = "Fri Feb 13 11:56:31 MST 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/computer2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://csdl.computer.org/csdl/mags/co/2014/11/mco2014110062-abs.html", abstract-URL = "http://csdl.computer.org/csdl/mags/co/2014/11/mco2014110062-abs.html", acknowledgement = ack-nhfb, journal-URL = "http://www.computer.org/portal/web/csdl/magazines/computer", } @Article{Feuser:2014:DOP, author = "Johannes Feuser and Jan Peleska", title = "Dependability in open proof software with hardware virtualization --- {The} railway control systems perspective", journal = j-SCI-COMPUT-PROGRAM, volume = "91 (part B)", number = "??", pages = "188--215", day = "1", month = oct, year = "2014", CODEN = "SCPGD4", ISSN = "0167-6423 (print), 1872-7964 (electronic)", ISSN-L = "0167-6423", bibdate = "Sat Aug 16 11:32:54 MDT 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/scicomputprogram.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167642313002001", acknowledgement = ack-nhfb, fjournal = "Science of Computer Programming", journal-URL = "http://www.sciencedirect.com/science/journal/01676423/", } @Book{Fitzhugh:2014:VVM, author = "Rebecca Fitzhugh", title = "{vSphere} virtual machine management: create {vSphere} virtual machines, manage performance, and explore advanced capabilities", publisher = "Packt Publishing", address = "Birmingham, UK", pages = "vi + 307", year = "2014", ISBN = "1-78217-218-1, 1-78217-219-X", ISBN-13 = "978-1-78217-218-5, 978-1-78217-219-2", LCCN = "QA76.9.V5 F58 2014", bibdate = "Thu Dec 4 07:46:46 MST 2014", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", series = "Professional expertise distilled", acknowledgement = ack-nhfb, subject = "VMware vSphere; Virtual computer systems", } @Article{Frincu:2014:ESV, author = "Marc E. Frincu and St{\'e}phane Genaud and Julien Gossa", title = "On the efficiency of several {VM} provisioning strategies for workflows with multi-threaded tasks on clouds", journal = j-COMPUTING, volume = "96", number = "11", pages = "1059--1086", month = nov, year = "2014", CODEN = "CMPTA2", DOI = "https://doi.org/10.1007/s00607-014-0410-0", ISSN = "0010-485X (print), 1436-5057 (electronic)", ISSN-L = "0010-485X", bibdate = "Wed Feb 11 07:42:25 MST 2015", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0010-485X&volume=96&issue=11; https://www.math.utah.edu/pub/tex/bib/computing.bib; https://www.math.utah.edu/pub/tex/bib/multithreading.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer.com/article/10.1007/s00607-014-0410-0", acknowledgement = ack-nhfb, fjournal = "Computing", journal-URL = "http://link.springer.com/journal/607", } @Article{Garg:2014:SBV, author = "Saurabh Kumar Garg and Adel Nadjaran Toosi and Srinivasa K. Gopalaiyengar and Rajkumar Buyya", title = "{SLA}-based virtual machine management for heterogeneous workloads in a cloud datacenter", journal = j-J-NETW-COMPUT-APPL, volume = "45", number = "??", pages = "108--120", month = oct, year = "2014", CODEN = "JNCAF3", ISSN = "1084-8045 (print), 1095-8592 (electronic)", ISSN-L = "1084-8045", bibdate = "Wed Jan 28 15:45:10 MST 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1084804514001787", acknowledgement = ack-nhfb, ajournal = "J. Netw. Comput. Appl.", fjournal = "Journal of Network and Computer Applications", journal-URL = "http://www.sciencedirect.com/science/journal/10848045", } @Article{Guan:2014:HHV, author = "Haibing Guan", title = "{HYVI}: A {HYbrid VIrtualization} Solution Balancing Performance and Manageability", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "25", number = "9", pages = "2332--2341", month = sep, year = "2014", CODEN = "ITDSEO", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Thu Feb 12 13:58:32 MST 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.computer.org/csdl/trans/td/2014/09/06605688-abs.html", abstract-URL = "http://www.computer.org/csdl/trans/td/2014/09/06605688-abs.html", acknowledgement = ack-nhfb, journal-URL = "http://www.computer.org/tpds/archives.htm", } @Article{Guyer:2014:UJT, author = "Samuel Z. Guyer", title = "Use of the {JVM} at {Twitter}: a bird's eye view", journal = j-SIGPLAN, volume = "49", number = "11", pages = "1--1", month = nov, year = "2014", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2775049.2619208", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue May 12 17:41:19 MDT 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Specialties: 15+ years of virtual machine implementation experience with special focus on memory management / garbage collection. Close to 20 years of C/C++ experience. 15+ years of Java experience. Expert in concurrent/parallel programming.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "ISMM '14 conference proceedings.", } @Article{He:2014:DRC, author = "Ligang He and Deqing Zou and Zhang Zhang and Chao Chen and Hai Jin and Stephen A. Jarvis", title = "Developing resource consolidation frameworks for moldable virtual machines in clouds", journal = j-FUT-GEN-COMP-SYS, volume = "32", number = "??", pages = "69--81", month = mar, year = "2014", CODEN = "FGSEVI", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Mon Jan 27 18:39:15 MST 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X12001112", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X/", } @Article{Hizver:2014:RTD, author = "Jennia Hizver and Tzi-cker Chiueh", title = "Real-time deep virtual machine introspection and its applications", journal = j-SIGPLAN, volume = "49", number = "7", pages = "3--14", month = jul, year = "2014", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2674025.2576196", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Sep 26 07:29:50 MDT 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Virtual Machine Introspection (VMI) provides the ability to monitor virtual machines (VM) in an agentless fashion by gathering VM execution states from the hypervisor and analyzing those states to extract information about a running operating system (OS) without installing an agent inside the VM. VMI's main challenge lies in the difficulty in converting low-level byte string values into high-level semantic states of the monitored VM's OS. In this work, we tackle this challenge by developing a real-time kernel data structure monitoring (RTKDSM) system that leverages the rich OS analysis capabilities of Volatility, an open source computer forensics framework, to significantly simplify and automate analysis of VM execution states. The RTKDSM system is designed as an extensible software framework that is meant to be extended to perform application-specific VM state analysis. In addition, the RTKDSM system is able to perform real-time monitoring of any changes made to the extracted OS states of guest VMs. This real-time monitoring capability is especially important for VMI-based security applications. To minimize the performance overhead associated with real-time kernel data structure monitoring, the RTKDSM system has incorporated several optimizations whose effectiveness is reported in this paper.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "VEE '14 conference proceedings.", } @Article{Horie:2014:SDJ, author = "Michihiro Horie and Kazunori Ogata and Kiyokuni Kawachiya and Tamiya Onodera", title = "String deduplication for {Java}-based middleware in virtualized environments", journal = j-SIGPLAN, volume = "49", number = "7", pages = "177--188", month = jul, year = "2014", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2674025.2576210", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Sep 26 07:29:50 MDT 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2010.bib; https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "To increase the memory efficiency in physical servers is a significant concern for increasing the number of virtual machines (VM) in them. When similar web application service runs in each guest VM, many string data with the same values are created in every guest VMs. These duplications of string data are redundant from the viewpoint of memory efficiency in the host OS. This paper proposes two approaches to reduce the duplication in Java string in a single Java VM (JVM) and across JVMs. The first approach is to share string objects cross JVMs by using a read-only memory-mapped file. The other approach is to selectively unify string objects created at runtime in the web applications. This paper evaluates our approach by using the Apache DayTrader and the DaCapo benchmark suite. Our prototype implementation achieved 7\% to 12\% reduction in the total size of the objects allocated over the lifetime of the programs. In addition, we observed the performance of DayTrader was maintained even under a situation of high density guest VMs in a KVM host machine.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "VEE '14 conference proceedings.", } @Article{Hurlburt:2014:BBC, author = "G. F. Hurlburt and I. Bojanova", title = "{Bitcoin}: Benefit or Curse?", journal = j-IT-PRO, volume = "16", number = "3", pages = "10--15", month = may, year = "2014", CODEN = "IPMAFM", DOI = "https://doi.org/10.1109/MITP.2014.28", ISSN = "1520-9202 (print), 1941-045x (electronic)", ISSN-L = "1520-9202", bibdate = "Thu Nov 30 15:24:52 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib; https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "{IT} Professional", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6294", keywords = "bitcoin crypto-currency model; bitcoin technology; cloud; cryptocurrency; Cryptography; Data mining; financial data processing; foreign exchange trading; information technology; Internet of Anything; Internet of Things; Internet/Web technologies; Market research; mobile; mobile commerce; Mobile communication; mobile devices; Online banking; virtual currency; Virtualization", } @Article{Hwang:2014:MFG, author = "Jinho Hwang and Ahsen Uppal and Timothy Wood and Howie Huang", title = "{Mortar}: filling the gaps in data center memory", journal = j-SIGPLAN, volume = "49", number = "7", pages = "53--64", month = jul, year = "2014", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2674025.2576203", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Sep 26 07:29:50 MDT 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Data center servers are typically overprovisioned, leaving spare memory and CPU capacity idle to handle unpredictable workload bursts by the virtual machines running on them. While this allows for fast hotspot mitigation, it is also wasteful. Unfortunately, making use of spare capacity without impacting active applications is particularly difficult for memory since it typically must be allocated in coarse chunks over long timescales. In this work we propose repurposing the poorly utilized memory in a data center to store a volatile data store that is managed by the hypervisor. We present two uses for our Mortar framework: as a cache for prefetching disk blocks, and as an application-level distributed cache that follows the memcached protocol. Both prototypes use the framework to ask the hypervisor to store useful, but recoverable data within its free memory pool. This allows the hypervisor to control eviction policies and prioritize access to the cache. We demonstrate the benefits of our prototypes using realistic web applications and disk benchmarks, as well as memory traces gathered from live servers in our university's IT department. By expanding and contracting the data store size based on the free memory available, Mortar improves average response time of a web application by up to 35\% compared to a fixed size memcached deployment, and improves overall video streaming performance by 45\% through prefetching.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "VEE '14 conference proceedings.", } @Article{Iancu:2014:CPV, author = "Costin Iancu", title = "The Case for Partitioning Virtual Machines on Multicore Architectures", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "25", number = "10", pages = "2683--2696", month = oct, year = "2014", CODEN = "ITDSEO", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Thu Feb 12 13:58:32 MST 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.computer.org/csdl/trans/td/2014/10/06613989-abs.html", abstract-URL = "http://www.computer.org/csdl/trans/td/2014/10/06613989-abs.html", acknowledgement = ack-nhfb, journal-URL = "http://www.computer.org/tpds/archives.htm", } @Article{Jin:2014:MLM, author = "Hai Jin and Li Deng and Song Wu and Xuanhua Shi and Hanhua Chen and Xiaodong Pan", title = "{MECOM}: Live migration of virtual machines by adaptively compressing memory pages", journal = j-FUT-GEN-COMP-SYS, volume = "38", number = "??", pages = "23--35", month = sep, year = "2014", CODEN = "FGSEVI", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Sat Aug 16 12:24:59 MDT 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X13002100", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X/", } @Article{Johnson:2014:CML, author = "David Johnson and Mike Hibler and Eric Eric", title = "Composable multi-level debugging with {Stackdb}", journal = j-SIGPLAN, volume = "49", number = "7", pages = "213--226", month = jul, year = "2014", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2674025.2576212", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Sep 26 07:29:50 MDT 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Virtual machine introspection (VMI) allows users to debug software that executes within a virtual machine. To support rich, whole-system analyses, a VMI tool must inspect and control systems at multiple levels of the software stack. Traditional debuggers enable inspection and control, but they limit users to treating a whole system as just one kind of target: e.g., just a kernel, or just a process, but not both. We created Stackdb, a debugging library with VMI support that allows one to monitor and control a whole system through multiple, coordinated targets. A target corresponds to a particular level of the system's software stack; multiple targets allow a user to observe a VM guest at several levels of abstraction simultaneously. For example, with Stackdb, one can observe a PHP script running in a Linux process in a Xen VM via three coordinated targets at the language, process, and kernel levels. Within Stackdb, higher-level targets are components that utilize lower-level targets; a key contribution of Stackdb is its API that supports multi-level and flexible ``stacks'' of targets. This paper describes the challenges we faced in creating Stackdb, presents the solutions we devised, and evaluates Stackdb through its application to a security-focused, whole-system case study.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "VEE '14 conference proceedings.", } @Article{Kalibera:2014:FAS, author = "Tomas Kalibera and Petr Maj and Floreal Morandat and Jan Vitek", title = "A fast abstract syntax tree interpreter for {R}", journal = j-SIGPLAN, volume = "49", number = "7", pages = "89--102", month = jul, year = "2014", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2674025.2576205", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Sep 26 07:29:50 MDT 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2010.bib; https://www.math.utah.edu/pub/tex/bib/s-plus.bib; https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Dynamic languages have been gaining popularity to the point that their performance is starting to matter. The effort required to develop a production-quality, high-performance runtime is, however, staggering and the expertise required to do so is often out of reach of the community maintaining a particular language. Many domain specific languages remain stuck with naive implementations, as they are easy to write and simple to maintain for domain scientists. In this paper, we try to see how far one can push a naive implementation while remaining portable and not requiring expertise in compilers and runtime systems. We choose the R language, a dynamic language used in statistics, as the target of our experiment and adopt the simplest possible implementation strategy, one based on evaluation of abstract syntax trees. We build our interpreter on top of a Java virtual machine and use only facilities available to all Java programmers. We compare our results to other implementations of R.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "VEE '14 conference proceedings.", } @Article{Kang:2014:HSA, author = "Chih-Kai Kang and Yu-Jhang Cai and Chin-Hsien Wu and Pi-Cheng Hsiu", title = "A Hybrid Storage Access Framework for High-Performance Virtual Machines", journal = j-TECS, volume = "13", number = "5s", pages = "157:1--157:??", month = sep, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1145/2660493", ISSN = "1539-9087 (print), 1558-3465 (electronic)", ISSN-L = "1539-9087", bibdate = "Mon Oct 6 16:07:59 MDT 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/tecs.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "In recent years, advances in virtualization technology have enabled multiple virtual machines to run on a physical machine, such that each virtual machine can perform independently with its own operating system. The IT industry has adopted virtualization technology because of its ability to improve hardware resource utilization, achieve low-power consumption, support concurrent applications, simplify device management, and reduce maintenance costs. However, because of the hardware limitation of storage devices, the I/O capacity could cause performance bottlenecks. To address the problem, we propose a hybrid storage access framework that exploits solid-state drives (SSDs) to improve the I/O performance in a virtualization environment.", acknowledgement = ack-nhfb, articleno = "157", fjournal = "ACM Transactions on Embedded Computing Systems", journal-URL = "http://portal.acm.org/browse_dl.cfm?&idx=J840", } @Article{Kedlaya:2014:DDL, author = "Madhukar N. Kedlaya and Behnam Robatmili and Cglin Cascaval and Ben Hardekopf", title = "Deoptimization for dynamic language {JITs} on typed, stack-based virtual machines", journal = j-SIGPLAN, volume = "49", number = "7", pages = "103--114", month = jul, year = "2014", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2674025.2576209", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Sep 26 07:29:50 MDT 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2010.bib; https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "We are interested in implementing dynamic language runtimes on top of language-level virtual machines. Type specialization is a critical optimization for dynamic language runtimes: generic code that handles any type of data is replaced with specialized code for particular types observed during execution. However, types can change, and the runtime must recover whenever unexpected types are encountered. The state-of-the-art recovery mechanism is called deoptimization. Deoptimization is a well-known technique for dynamic language runtimes implemented in low-level languages like C. However, no dynamic language runtime implemented on top of a virtual machine such as the Common Language Runtime (CLR) or the Java Virtual Machine (JVM) uses deoptimization, because the implementation thereof used in low-level languages is not possible. In this paper we propose a novel technique that enables deoptimization for dynamic language runtimes implemented on top of typed, stack-based virtual machines. Our technique does not require any changes to the underlying virtual machine. We implement our proposed technique in a JavaScript language implementation, MCJS, running on top of the Mono runtime (CLR). We evaluate our implementation against the current state-of-the-art recovery mechanism for virtual machine-based runtimes, as implemented both in MCJS and in IronJS. We show that deoptimization provides significant performance benefits, even for runtimes running on top of a virtual machine.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "VEE '14 conference proceedings.", } @Article{Kertesz:2014:ISA, author = "A. Kertesz and G. Kecskemeti and I. Brandic", title = "An interoperable and self-adaptive approach for {SLA}-based service virtualization in heterogeneous {Cloud} environments", journal = j-FUT-GEN-COMP-SYS, volume = "32", number = "??", pages = "54--68", month = mar, year = "2014", CODEN = "FGSEVI", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Mon Jan 27 18:39:15 MST 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X12001124", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X/", } @Article{Kessaci:2014:MSL, author = "Yacine Kessaci and Nouredine Melab and El-Ghazali Talbi", title = "A multi-start local search heuristic for an energy efficient {VMs} assignment on top of the {OpenNebula} cloud manager", journal = j-FUT-GEN-COMP-SYS, volume = "36", number = "??", pages = "237--256", month = jul, year = "2014", CODEN = "FGSEVI", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Mon Apr 28 15:56:06 MDT 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X13001520", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X/", } @Article{Kim:2014:ECS, author = "Nakku Kim and Jungwook Cho and Euiseong Seo", title = "Energy-credit scheduler: an energy-aware virtual machine scheduler for cloud systems", journal = j-FUT-GEN-COMP-SYS, volume = "32", number = "??", pages = "128--137", month = mar, year = "2014", CODEN = "FGSEVI", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Mon Jan 27 18:39:15 MST 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X1200115X", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X/", } @Article{Kim:2014:VAM, author = "Hwanju Kim and Sangwook Kim and Jinkyu Jeong and Joonwon Lee", title = "Virtual asymmetric multiprocessor for interactive performance of consolidated desktops", journal = j-SIGPLAN, volume = "49", number = "7", pages = "29--40", month = jul, year = "2014", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2674025.2576199", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Sep 26 07:29:50 MDT 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "This paper presents virtual asymmetric multiprocessor, a new scheme of virtual desktop scheduling on multi-core processors for user-interactive performance. The proposed scheme enables virtual CPUs to be dynamically performance-asymmetric based on their hosted workloads. To enhance user experience on consolidated desktops, our scheme provides interactive workloads with fast virtual CPUs, which have more computing power than those hosting background workloads in the same virtual machine. To this end, we devise a hypervisor extension that transparently classifies background tasks from potentially interactive workloads. In addition, we introduce a guest extension that manipulates the scheduling policy of an operating system in favor of our hypervisor-level scheme so that interactive performance can be further improved. Our evaluation shows that the proposed scheme significantly improves interactive performance of application launch, Web browsing, and video playback applications when CPU-intensive workloads highly disturb the interactive workloads.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "VEE '14 conference proceedings.", } @Article{Kim:2014:VPT, author = "Daehoon Kim and Hwanju Kim and Jaehyuk Huh", title = "{vCache}: Providing a Transparent View of the {LLC} in Virtualized Environments", journal = j-IEEE-COMPUT-ARCHIT-LETT, volume = "13", number = "2", pages = "109--112", month = jul # "\slash " # dec, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1109/L-CA.2013.20", ISSN = "1556-6056 (print), 1556-6064 (electronic)", ISSN-L = "1556-6056", bibdate = "Thu Jun 20 17:18:18 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeecomputarchitlett.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Since most of the current multi-core processors use a large last-level cache (LLC), efficient use of an LLC is critical for the overall performance of multi-cores. To improve the caching efficiency, page coloring is a representative software-based approach to allow the OS to control placement of pages on an LLC to improve their cache utility and to avoid conflicts among cores. However, system virtualization, with additional address translation by the hypervisor, can make page coloring techniques used by the guest OS ineffective, as guest physical addresses used by the guest OS for coloring differ from real addresses used for cache indexing in the LLCs. In this paper, we propose a novel LLC architecture to provide the guest OS with a flexible control over LLC placement in virtualized systems. The proposed vCache architecture can preserve coloring information set by the guest OS. In addition to color preservation, vCache can potentially eliminate the traditional limitation of page coloring, the cost of dynamic color changes for memory pages. By using the pollute buffer mechanism, one of the color-based cache optimization techniques, vCache shows performance improvement of benchmark applications up to 33\% without degrading the performance of another co-running application in the VM.", acknowledgement = ack-nhfb, affiliation = "Kim, D (Reprint Author), Korea Adv Inst Sci \& Technol, Dept Comp Sci, Taejon, South Korea. Kim, Daehoon; Kim, Hwanju; Huh, Jaehyuk, Korea Adv Inst Sci \& Technol, Dept Comp Sci, Taejon, South Korea.", author-email = "daehoon@calab.kaist.ac.kr hjukim@calab.kaist.ac.kr jhuh@calab.kaist.ac.kr", da = "2019-06-20", doc-delivery-number = "AX5PM", eissn = "1556-6064", fjournal = "IEEE Computer Architecture Letters", funding-acknowledgement = "SW Computing R\&D Program of KEIT(UX-oriented Mobile SW Platform) --- Ministry of Trade, Industry, and Energy [2011-10041313]", funding-text = "This research was supported by the SW Computing R\&D Program of KEIT(2011-10041313, UX-oriented Mobile SW Platform) funded by the Ministry of Trade, Industry, and Energy.", journal-iso = "IEEE Comput. Archit. Lett.", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=10208", keywords = "Cache partitioning; Page coloring; Virtualization", number-of-cited-references = "8", research-areas = "Computer Science", researcherid-numbers = "Huh, Jaehyuk/C-1716-2011", times-cited = "2", unique-id = "Kim:2014:VPT", web-of-science-categories = "Computer Science, Hardware \& Architecture", } @Article{Kong:2014:SGE, author = "Fanxin Kong and Xue Liu", title = "A Survey on Green-Energy-Aware Power Management for Datacenters", journal = j-COMP-SURV, volume = "47", number = "2", pages = "30:1--30:??", month = nov, year = "2014", CODEN = "CMSVAN", DOI = "https://doi.org/10.1145/2642708", ISSN = "0360-0300 (print), 1557-7341 (electronic)", ISSN-L = "0360-0300", bibdate = "Sat Nov 15 15:22:35 MST 2014", bibsource = "http://www.acm.org/pubs/contents/journals/surveys/; https://www.math.utah.edu/pub/tex/bib/compsurv.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Megawatt-scale datacenters have emerged to meet the increasing demand for IT applications and services. The hunger for power brings large electricity bills to datacenter operators and causes significant impacts to the environment. To reduce costs and environmental impacts, modern datacenters, such as those of Google and Apple, are beginning to integrate renewable or green energy sources into their power supply. This article investigates the green-energy-aware power management problem for these datacenters and surveys and classifies works that explicitly consider renewable energy and/or carbon emission. Our aim is to give a full view of this problem. Hence, we first provide some basic knowledge on datacenters (including datacenter components, power infrastructure, power load estimation, and energy sources' operations), the electrical grid (including dynamic pricing, power outages, and emission factor), and the carbon market (including cap-and-trade and carbon tax). Then, we categorize existing research works according to their basic approaches used, including workload scheduling, virtual machine management, and energy capacity planning. Each category's discussion includes the description of the shared core idea, qualitative analysis, and quantitative analysis among works of this category.", acknowledgement = ack-nhfb, articleno = "30", fjournal = "ACM Computing Surveys", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204", } @Article{Kumar:2014:DLB, author = "Narander Kumar and Shalini Agarwal and Taskeen Zaidi and Vipin Saxena", title = "A Distributed Load-balancing Scheme Based on a Complex Network Model of Cloud Servers", journal = j-SIGSOFT, volume = "39", number = "6", pages = "1--6", month = nov, year = "2014", CODEN = "SFENDP", DOI = "https://doi.org/10.1145/2674632.2674639", ISSN = "0163-5948 (print), 1943-5843 (electronic)", ISSN-L = "0163-5948", bibdate = "Wed Aug 1 17:16:36 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigsoft2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Efficient management of resources in a federation of interacting computing servers and devices, for example, in a cloud computing environment, requires a load-balancing system that is self-regulatory and oblivious in nature. Due to the increasing size of data centers and their distribution across the globe, centralized load-balancing approaches suffer significant deficiencies in terms of communication overhead caused by the need to collect state dependent information. The technology of the cloud in its current state runs as many as 200 virtual machines on a single server, which clearly shows the importance of studying distributed load-balancing systems in the cloud. In the present paper, the federation of cloud servers is modeled as a complex network. In a complex network the structure and dynamics of the underlying system are encoded in the network topology itself. A method using random walks on complex networks for discovering free resources in a Cloud Server Network is given. The given method is used to balance the overall load on the network by equalising loads on overloaded and underloaded nodes without the need of a global load balancer. Simulation results are obtained through Network Simulator Version 2, which show that the proposed load-balancing scheme performs well for a large network by uniformly distributing the workload among the servers in polynomial time.", acknowledgement = ack-nhfb, fjournal = "ACM SIGSOFT Software Engineering Notes", journal-URL = "https://dl.acm.org/citation.cfm?id=J728", } @Article{Lee:2014:GSB, author = "Hwamin Lee and Doosoon Park", title = "A {Grid} Service-Based Virtual Screening System", journal = j-COMP-J, volume = "57", number = "2", pages = "302--307", month = feb, year = "2014", CODEN = "CMPJA6", DOI = "https://doi.org/10.1093/comjnl/bxt015", ISSN = "0010-4620 (print), 1460-2067 (electronic)", ISSN-L = "0010-4620", bibdate = "Mon Feb 3 17:03:04 MST 2014", bibsource = "http://comjnl.oxfordjournals.org/content/57/2.toc; https://www.math.utah.edu/pub/tex/bib/compj2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://comjnl.oxfordjournals.org/content/57/2/302.full.pdf+html", acknowledgement = ack-nhfb, fjournal = "Computer Journal", journal-URL = "http://comjnl.oxfordjournals.org/", onlinedate = "February 18, 2013", } @Article{Li:2014:LSD, author = "Keqin Li", title = "{Liquid}: A Scalable Deduplication File System for Virtual Machine Images", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "25", number = "5", pages = "1257--1266", month = may, year = "2014", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2013.173", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Mon Aug 25 07:12:16 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Parallel and Distributed Systems", journal-URL = "http://www.computer.org/tpds/archives.htm", } @Article{Li:2014:MHD, author = "Pengcheng Li and Chen Ding and Hao Luo", title = "Modeling heap data growth using average liveness", journal = j-SIGPLAN, volume = "49", number = "11", pages = "71--82", month = nov, year = "2014", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2775049.2602997", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue May 12 17:41:19 MDT 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Most of today's programs make use of a sizable heap to store dynamic data. To characterize the heap dynamics, this paper presents a set of metrics to measure the average amount of data live and dead in a period of execution. They are collectively called average liveness. The paper defines these metrics of average liveness, gives linear-time algorithms for measurement, and discusses their use in finding the best heap size. The algorithms are implemented in a Java tracing system called Elephant Tracks and evaluated using the Dacapo benchmarks running on the Oracle HotSpot and IBM J9 Java virtual machines.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "ISMM '14 conference proceedings.", } @Article{Li:2014:SCA, author = "Peng Li and Debin Gao and Michael K. Reiter", title = "{StopWatch}: a Cloud Architecture for Timing Channel Mitigation", journal = j-TISSEC, volume = "17", number = "2", pages = "8:1--8:??", month = nov, year = "2014", CODEN = "ATISBQ", DOI = "https://doi.org/10.1145/2670940", ISSN = "1094-9224 (print), 1557-7406 (electronic)", ISSN-L = "1094-9224", bibdate = "Wed Nov 19 12:26:42 MST 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib; https://www.math.utah.edu/pub/tex/bib/tissec.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "This article presents StopWatch, a system that defends against timing-based side-channel attacks that arise from coresidency of victims and attackers in infrastructure-as-a-service clouds. StopWatch triplicates each cloud-resident guest virtual machine (VM) and places replicas so that the three replicas of a guest VM are coresident with nonoverlapping sets of (replicas of) other VMs. StopWatch uses the timing of I/O events at a VM's replicas collectively to determine the timings observed by each one or by an external observer, so that observable timing behaviors are similarly likely in the absence of any other individual, coresident VMs. We detail the design and implementation of StopWatch in Xen, evaluate the factors that influence its performance, demonstrate its advantages relative to alternative defenses against timing side channels with commodity hardware, and address the problem of placing VM replicas in a cloud under the constraints of StopWatch so as to still enable adequate cloud utilization.", acknowledgement = ack-nhfb, articleno = "8", fjournal = "ACM Transactions on Information and System Security", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J789", } @Article{Li:2014:USI, author = "Yusen Li and Wentong Cai", title = "Update schedules for improving consistency in multi-server distributed virtual environments", journal = j-J-NETW-COMPUT-APPL, volume = "41", number = "??", pages = "263--273", month = may, year = "2014", CODEN = "JNCAF3", ISSN = "1084-8045 (print), 1095-8592 (electronic)", ISSN-L = "1084-8045", bibdate = "Wed Jan 28 15:45:00 MST 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1084804514000083", acknowledgement = ack-nhfb, ajournal = "J. Netw. Comput. Appl.", fjournal = "Journal of Network and Computer Applications", journal-URL = "http://www.sciencedirect.com/science/journal/10848045", } @Article{Li:2014:VSK, author = "Ye Li and Richard West and Eric Missimer", title = "A virtualized separation kernel for mixed criticality systems", journal = j-SIGPLAN, volume = "49", number = "7", pages = "201--212", month = jul, year = "2014", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2674025.2576206", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Sep 26 07:29:50 MDT 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Multi- and many-core processors are becoming increasingly popular in embedded systems. Many of these processors now feature hardware virtualization capabilities, such as the ARM Cortex A15, and x86 processors with Intel VT-x or AMD-V support. Hardware virtualization offers opportunities to partition physical resources, including processor cores, memory and I/O devices amongst guest virtual machines. Mixed criticality systems and services can then co-exist on the same platform in separate virtual machines. However, traditional virtual machine systems are too expensive because of the costs of trapping into hypervisors to multiplex and manage machine physical resources on behalf of separate guests. For example, hypervisors are needed to schedule separate VMs on physical processor cores. In this paper, we discuss the design of the Quest-V separation kernel, which partitions services of different criticalities in separate virtual machines, or sandboxes. Each sandbox encapsulates a subset of machine physical resources that it manages without requiring intervention of a hypervisor. Moreover, a hypervisor is not needed for normal operation, except to bootstrap the system and establish communication channels between sandboxes.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "VEE '14 conference proceedings.", } @Article{Lin:2014:IQA, author = "Jenn-Wei Lin and Chien-Hung Chen and Chi-Yi Lin", title = "Integrating {QoS} awareness with virtualization in cloud computing systems for delay-sensitive applications", journal = j-FUT-GEN-COMP-SYS, volume = "37", number = "??", pages = "478--487", month = jul, year = "2014", CODEN = "FGSEVI", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Wed May 21 08:14:41 MDT 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X13002987", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X/", } @Book{Lindholm:2014:JVM, author = "Tim Lindholm and Frank Yellin and Gilad Bracha and Alex Buckley", title = "The {Java} Virtual Machine Specification: {Java SE 8} edition", publisher = pub-AW, address = pub-AW, pages = "xvi + 584", year = "2014", ISBN = "0-13-390590-X (paperback), 0-13-392274-X (e-book)", ISBN-13 = "978-0-13-390590-8 (paperback), 978-0-13-392274-5 (e-book)", LCCN = "QA76.73.J38 L56 2014", bibdate = "Thu Dec 4 07:34:57 MST 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.loc.gov:7090/Voyager", abstract = "Written by the inventors of the technology, this is the definitive technical reference for the Java Virtual Machine. The book provides complete, accurate, and detailed coverage of the Java Virtual Machine. It fully describes the new features added in Java SE 8, including the invocation of default methods and the class file extensions for type annotations and method parameters. The book also clarifies the interpretation of class file attributes and the rules of bytecode verification.", acknowledgement = ack-nhfb, subject = "Java (Computer program language)", tableofcontents = "1 Introduction / 1 \\ 1.1 A Bit of History / 1 \\ 1.2 The Java Virtual Machine / 2 \\ 1.3 Organization of the Specification / 3 \\ 1.4 Notation / 4 \\ 1.5 Feedback / 4 \\ \\ 2 The Structure of the Java Virtual Machine / 5 \\ 2.1 The class File Format / 5 \\ 2.2 Data Types / 6 \\ 2.3 Primitive Types and Values / 6 \\ 2.3.1 Integral Types and Values / 7 \\ 2.3.2 Floating-Point Types, Value Sets, and Values / 8 \\ 2.3.3 The returnAddress Type and Values / 10 \\ 2.3.4 The boolean Type / 10 \\ 2.4 Reference Types and Values / 11 \\ 2.5 Run-Time Data Areas / 11 \\ 2.5.1 The pc Register / 12 \\ 2.5.2 Java Virtual Machine Stacks / 12 \\ 2.5.3 Heap / 13 \\ 2.5.4 Method Area / 13 \\ 2.5.5 Run-Time Constant Pool / 14 \\ 2.5.6 Native Method Stacks / 14 \\ 2.6 Frames / 15 \\ 2.6.1 Local Variables / 16 \\ 2.6.2 Operand Stacks / 17 \\ 2.6.3 Dynamic Linking / 18 \\ 2.6.4 Normal Method Invocation Completion / 18 \\ 2.6.5 Abrupt Method Invocation Completion / 18 \\ 2.7 Representation of Objects / 19 \\ 2.8 Floating-Point Arithmetic / 19 \\ 2.8.1 Java Virtual Machine Floating-Point Arithmetic and IEEE 754 / 19 \\ 2.8.2 Floating-Point Modes / 20 \\ 2.8.3 Value Set Conversion / 20 \\ 2.9 Special Methods / 22 \\ 2.10 Exceptions / 23 \\ 2.11 Instruction Set Summary / 25 \\ 2.11.1 Types and the Java Virtual Machine / 26 \\ 2.11.2 Load and Store Instructions / 29 \\ 2.11.3 Arithmetic Instructions / 30 \\ 2.11.4 Type Conversion Instructions / 32 \\ 2.11.5 Object Creation and Manipulation / 34 \\ 2.11.6 Operand Stack Management Instructions / 34 \\ 2.11.7 Control Transfer Instructions / 34 \\ 2.11.8 Method Invocation and Return Instructions / 35 \\ 2.11.9 Throwing Exceptions / 36 \\ 2.11.10 Synchronization / 36 \\ 2.12 Class Libraries / 37 \\ 2.13 Public Design, Private Implementation / 37 \\ \\ 3 Compiling for the Java Virtual Machine / 39 \\ 3.1 Format of Examples / 39 \\ 3.2 Use of Constants, Local Variables, and Control Constructs / 40 \\ 3.3 Arithmetic / 45 \\ 3.4 Accessing the Run-Time Constant Pool / 46 \\ 3.5 More Control Examples / 47 \\ 3.6 Receiving Arguments / 50 \\ 3.7 Invoking Methods / 51 \\ 3.8 Working with Class Instances / 53 \\ 3.9 Arrays / 55 \\ 3.10 Compiling Switches / 57 \\ 3.11 Operations on the Operand Stack / 59 \\ 3.12 Throwing and Handling Exceptions / 60 \\ 3.13 Compiling finally / 63 \\ 3.14 Synchronization / 66 \\ 3.15 Annotations / 67 \\ \\ 4 The class File Format / 69 \\ 4.1 The ClassFile Structure / 70 \\ 4.2 The Internal Form of Names / 74 \\ 4.2.1 Binary Class and Interface Names / 74 \\ 4.2.2 Unqualified Names / 75 \\ 4.3 Descriptors / 75 \\ 4.3.1 Grammar Notation / 75 \\ 4.3.2 Field Descriptors / 76 \\ 4.3.3 Method Descriptors / 77 \\ 4.4 The Constant Pool / 78 \\ 4.4.1 The CONSTANT_Class_info Structure / 79 \\ 4.4.2 The CONSTANT_Fieldref_info, CONSTANT_Methodref_info, and CONSTANT_InterfaceMethodref_info Structures / 80 \\ 4.4.3 The CONSTANT_String_info Structure / 81 \\ 4.4.4 The CONSTANT_Integer_info and CONSTANT_Float_info Structures / 82 \\ 4.4.5 The CONSTANT_Long_info and CONSTANT_Double_info Structures / 83 \\ 4.4.6 The CONSTANT_NameAndType_info Structure / 85 \\ 4.4.7 The CONSTANT_Utf8_info Structure / 85 \\ 4.4.8 The CONSTANT_MethodHandle_info Structure / 87 \\ 4.4.9 The CONSTANT_MethodType_info Structure / 89 \\ 4.4.10 The CONSTANT_InvokeDynamic_info Structure / 89 \\ 4.5 Fields / 90 \\ 4.6 Methods / 92 \\ 4.7 Attributes / 95 \\ 4.7.1 Defining and Naming New Attributes / 101 \\ 4.7.2 The ConstantValue Attribute / 101 \\ 4.7.3 The Code Attribute / 102 \\ 4.7.4 The StackMapTable Attribute / 106 \\ 4.7.5 The Exceptions Attribute / 113 \\ 4.7.6 The InnerClasses Attribute / 114 \\ 4.7.7 The EnclosingMethod Attribute / 116 \\ 4.7.8 The Synthetic Attribute / 118 \\ 4.7.9 The Signature Attribute / 118 \\ 4.7.9.1 Signatures / 119 \\ 4.7.10 The SourceFile Attribute / 123 \\ 4.7.11 The SourceDebugExtension Attribute / 124 \\ 4.7.12 The LineNumberTable Attribute / 124 \\ 4.7.13 The LocalVariableTable Attribute / 126 \\ 4.7.14 The LocalVariableTypeTable Attribute / 128 \\ 4.7.15 The Deprecated Attribute / 129 \\ 4.7.16 The RuntimeVisibleAnnotations Attribute / 130 \\ 4.7.16.1 The element_value structure / 132 \\ 4.7.17 The RuntimeInvisibleAnnotations Attribute / 135 \\ 4.7.18 The RuntimeVisibleParameterAnnotations Attribute / 136 \\ 4.7.19 The RuntimeInvisibleParameterAnnotations Attribute / 137 \\ 4.7.20 The RuntimeVisibleTypeAnnotations Attribute / 139 \\ 4.7.20.1 The target_info union / 144 \\ 4.7.20.2 The type_path structure / 148 \\ 4.7.21 The RuntimeInvisibleTypeAnnotations Attribute / 152 \\ 4.7.22 The AnnotationDefault Attribute / 153 \\ 4.7.23 The BootstrapMethods Attribute / 154 \\ 4.7.24 The MethodParameters Attribute / 156 \\ 4.8 Format Checking / 158 \\ 4.9 Constraints on Java Virtual Machine Code / 159 \\ 4.9.1 Static Constraints / 159 \\ 4.9.2 Structural Constraints / 163 \\ 4.10 Verification of class Files / 166 \\ 4.10.1 Verification by Type Checking / 167 \\ 4.10.1.1 Accessors for Java Virtual Machine Artifacts / 169 \\ 4.10.1.2 Verification Type System / 173 \\ 4.10.1.3 Instruction Representation / 177 \\ 4.10.1.4 Stack Map Frame Representation / 178 \\ 4.10.1.5 Type Checking Abstract and Native Methods / 184 \\ 4.10.1.6 Type Checking Methods with Code / 187 \\ 4.10.1.7 Type Checking Load and Store Instructions / 194 \\ 4.10.1.8 Type Checking for protected Members / 196 \\ 4.10.1.9 Type Checking Instructions / 199 \\ 4.10.2 Verification by Type Inference / 319 \\ 4.10.2.1 The Process of Verification by Type Inference / 319 \\ 4.10.2.2 The Bytecode Verifier / 319 \\ 4.10.2.3 Values of Types long and double / 323 \\ 4.10.2.4 Instance Initialization Methods and Newly Created Objects / 323 \\ 4.10.2.5 Exceptions and finally / 325 \\ 4.11 Limitations of the Java Virtual Machine / 327 \\ \\ 5 Loading, Linking, and Initializing / 329 \\ 5.1 The Run-Time Constant Pool / 329 \\ 5.2 Java Virtual Machine Startup / 332 \\ 5.3 Creation and Loading / 332 \\ 5.3.1 Loading Using the Bootstrap Class Loader / 334 \\ 5.3.2 Loading Using a User-defined Class Loader / 335 \\ 5.3.3 Creating Array Classes / 336 \\ 5.3.4 Loading Constraints / 336 \\ 5.3.5 Deriving a Class from a class File Representation / 338 \\ 5.4 Linking / 339 \\ 5.4.1 Verification / 340 \\ 5.4.2 Preparation / 340 \\ 5.4.3 Resolution / 341 \\ 5.4.3.1 Class and Interface Resolution / 342 \\ 5.4.3.2 Field Resolution / 343 \\ 5.4.3.3 Method Resolution / 344 \\ 5.4.3.4 Interface Method Resolution / 346 \\ 5.4.3.5 Method Type and Method Handle Resolution / 347 \\ 5.4.3.6 Call Site Specifier Resolution / 350 \\ 5.4.4 Access Control / 351 \\ 5.4.5 Overriding / 352 \\ 5.5 Initialization / 352 \\ 5.6 Binding Native Method Implementations / 355 \\ 5.7 Java Virtual Machine Exit / 355 \\ \\ 6 The Java Virtual Machine Instruction Set / 357 \\ 6.1 Assumptions: The Meaning of ``Must'' / 357 \\ 6.2 Reserved Opcodes / 358 \\ 6.3 Virtual Machine Errors / 358 \\ 6.4 Format of Instruction Descriptions / 359 \\ mnemonic / 360 \\ 6.5 Instructions / 362 \\ aaload / 363 \\ aastore / 364 \\ aconst_null / 366 \\ aload / 367 \\ aload_ / 368 \\ anewarray / 369 \\ areturn / 370 \\ arraylength / 371 \\ astore / 372 \\ astore_ / 373 \\ athrow / 374 \\ baload / 376 \\ bastore / 377 \\ bipush / 378 \\ caload / 379 \\ castore / 380 \\ checkcast / 381 \\ d2f / 383 \\ d2i / 384 \\ d2l / 385 \\ dadd / 386 \\ daload / 388 \\ dastore / 389 \\ dcmp / 390 \\ dconst_ / 392 \\ ddiv / 393 \\ dload / 395 \\ dload_ / 396 \\ dmul / 397 \\ dneg / 399 \\ drem / 400 \\ dreturn / 402 \\ dstore / 403 \\ dstore_ / 404 \\ dsub / 405 \\ dup / 406 \\ dup_x1 / 407 \\ dup_x2 / 408 \\ dup2 / 409 \\ dup2_x1 / 410 \\ dup2_x2 / 411 \\ f2d / 413 \\ f2i / 414 \\ f2l / 415 \\ fadd / 416 \\ faload / 418 \\ fastore / 419 \\ fcmp / 420 \\ fconst_ / 422 \\ fdiv / 423 \\ fload / 425 \\ fload_ / 426 \\ fmul / 427 \\ fneg / 429 \\ frem / 430 \\ freturn / 432 \\ fstore / 433 \\ fstore_ / 434 \\ fsub / 435 \\ getfield / 436 \\ getstatic / 438 \\ goto / 440 \\ goto_w / 441 \\ i2b / 442 \\ i2c / 443 \\ i2d / 444 \\ i2f / 445 \\ i2l / 446 \\ i2s / 447 \\ iadd / 448 \\ iaload / 449 \\ iand / 450 \\ iastore / 451 \\ iconst_ / 452 \\ idiv / 453 \\ if_acmp / 454 \\ if_icmp / 455 \\ if / 457 \\ ifnonnull / 459 \\ ifnull / 460 \\ iinc / 461 \\ iload / 462 \\ iload_ / 463 \\ imul / 464 \\ ineg / 465 \\ instanceof / 466 \\ invokedynamic / 468 \\ invokeinterface / 473 \\ invokespecial / 477 \\ invokestatic / 481 \\ invokevirtual / 484 \\ ior / 489 \\ irem / 490 \\ ireturn / 491 \\ ishl / 492 \\ ishr / 493 \\ istore / 494 \\ istore_ / 495 \\ isub / 496 \\ iushr / 497 \\ ixor / 498 \\ jsr / 499 \\ jsr_w / 500 \\ l2d / 501 \\ l2f / 502 \\ l2i / 503 \\ ladd / 504 \\ laload / 505 \\ land / 506 \\ lastore / 507 \\ lcmp / 508 \\ lconst_ / 509 \\ ldc / 510 \\ ldc_w / 512 \\ ldc2_w / 514 \\ ldiv / 515 \\ lload / 516 \\ lload_ / 517 \\ lmul / 518 \\ lneg / 519 \\ lookupswitch / 520 \\ lor / 522 \\ lrem / 523 \\ lreturn / 524 \\ lshl / 525 \\ lshr / 526 \\ lstore / 527 \\ lstore_ / 528 \\ lsub / 529 \\ lushr / 530 \\ lxor / 531 \\ monitorenter / 532 \\ monitorexit / 534 \\ multianewarray / 536 \\ new / 538 \\ newarray / 540 \\ nop / 542 \\ pop / 543 \\ pop2 / 544 \\ putfield / 545 \\ putstatic / 547 \\ ret / 549 \\ return / 550 \\ saload / 551 \\ sastore / 552 \\ sipush / 553 \\ swap / 554 \\ tableswitch / 555 \\ wide / 557 \\ \\ 7 Opcode Mnemonics by Opcode / 559 \\ Index / 563 \\ \\ A Limited License Grant / 581", } @Article{Liu:2014:MGR, author = "Ning Liu and Xiaoping Li and Weiming Shen", title = "Multi-granularity resource virtualization and sharing strategies in cloud manufacturing", journal = j-J-NETW-COMPUT-APPL, volume = "46", number = "??", pages = "72--82", month = nov, year = "2014", CODEN = "JNCAF3", ISSN = "1084-8045 (print), 1095-8592 (electronic)", ISSN-L = "1084-8045", bibdate = "Wed Jan 28 15:45:13 MST 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1084804514001933", acknowledgement = ack-nhfb, ajournal = "J. Netw. Comput. Appl.", fjournal = "Journal of Network and Computer Applications", journal-URL = "http://www.sciencedirect.com/science/journal/10848045", } @Article{Liu:2014:OVM, author = "Ming Liu and Tao Li", title = "Optimizing virtual machine consolidation performance on {NUMA} server architecture for cloud workloads", journal = j-COMP-ARCH-NEWS, volume = "42", number = "3", pages = "325--336", month = jun, year = "2014", CODEN = "CANED2", DOI = "https://doi.org/10.1145/2678373.2665720", ISSN = "0163-5964 (print), 1943-5851 (electronic)", ISSN-L = "0163-5964", bibdate = "Wed Dec 3 16:18:50 MST 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigarch.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Server virtualization and workload consolidation enable multiple workloads to share a single physical server, resulting in significant energy savings and utilization improvements. The shift of physical server architectures to NUMA and the increasing popularity of scale-out cloud applications undermine workload consolidation efficiency and result in overall system degradation. In this work, we characterize the consolidation of cloud workloads on NUMA virtualized systems, estimate four different sources of architecture overhead, and explore optimization opportunities beyond the default NUMA-aware hypervisor memory management Motivated by the observed architectural impact on cloud workload consolidation performance, we propose three optimization techniques incorporating NUMA access overhead into the hypervisor's virtual machine memory allocation and page fault handling routines. Among these, estimation of the memory zone access overhead serves as a foundation for the other two techniques: a NUMA overhead aware buddy allocator and a P2M swap FIFO. Cache hit rate, cycle loss due to cache miss, and IPC serve as indicators to estimate the access cost of each memory node. Our optimized buddy allocator dynamically selects low-overhead memory zones and ``proportionally'' distributes memory pages across target nodes. The P2M swap FIFO records recently unused PFN, MFN lists for mapping exchanges to rebalance memory access pressure within one domain. Our real system based evaluations show a 41.1\% performance improvement when consolidating 16-VMs on a 4-socket server (the proposed allocator contributes 22.8\% of the performance gain and the P2M swap FIFO accounts for the rest). Furthermore, our techniques can cooperate well with other methods (i.e. vCPU migration) and scale well when varying VM memory size and the number of sockets in a physical host", acknowledgement = ack-nhfb, fjournal = "ACM SIGARCH Computer Architecture News", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89", remark = "ISCA '14 conference proceedings.", } @Article{Liu:2014:PAC, author = "Xiaodong Liu and Weiqin Tong and Xiaoli Zhi and Fu ZhiRen and Liao WenZhao", title = "Performance analysis of cloud computing services considering resources sharing among virtual machines", journal = j-J-SUPERCOMPUTING, volume = "69", number = "1", pages = "357--374", month = jul, year = "2014", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-014-1156-3", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Wed Sep 10 06:45:04 MDT 2014", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0920-8542&volume=69&issue=1; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer.com/article/10.1007/s11227-014-1156-3", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Book{Lowe:2014:MVV, author = "Scott Lowe and Nick Marshall and Forbes Guthrie and Matt Liebowitz and Josh Atwell", title = "Mastering {VMware vSphere 5.5}", publisher = pub-WILEY, address = pub-WILEY:adr, pages = "xxix + 808", year = "2014", ISBN = "1-118-66114-1 (paperback)", ISBN-13 = "978-1-118-66114-7 (paperback)", LCCN = "????", bibdate = "Thu Jan 16 12:11:40 MST 2014", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.loc.gov:7090/Voyager", acknowledgement = ack-nhfb, } @Article{Ma:2014:DBV, author = "Zhiqiang Ma and Zhonghua Sheng and Lin Gu", title = "{DVM}: A Big Virtual Machine for Cloud Computing", journal = j-IEEE-TRANS-COMPUT, volume = "63", number = "9", pages = "2245--2258", month = sep, year = "2014", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.2013.102", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Tue Sep 9 06:54:10 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Computers", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", } @Article{Machida:2014:JCT, author = "Fumio Machida and Victor F. Nicola and Kishor S. Trivedi", title = "Job completion time on a virtualized server with software rejuvenation", journal = j-JETC, volume = "10", number = "1", pages = "10:1--10:??", month = jan, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1145/2539121", ISSN = "1550-4832", ISSN-L = "1550-4832", bibdate = "Tue Jan 14 19:15:04 MST 2014", bibsource = "http://www.acm.org/pubs/contents/journals/jetc/; https://www.math.utah.edu/pub/tex/bib/jetc.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "This article analyzes the completion time of a job running on a virtualized server subject to software aging and rejuvenation in a virtual machine monitor (VMM). A job running on the server may be interrupted by virtual machine (VM) failure, VMM failure or VMM rejuvenation. The job interruption is categorized as either preemptive-repeat ( prt ), in which case the interrupted job needs to restart from the beginning, or preemptive-resume ( prs ), in which case the job resumes execution from the point of interruption. Using a semi-Markov process (SMP) to model the server behavior, the steady-state server availability is computed and the theory developed in Kulkarni et al. [1987] is used to obtain the Laplace--Stieltjes transform (LST) of the job completion time. In the numerical experiments, we introduce four types of aging behavior of VMM. The effectiveness of VMM rejuvenation on job completion time is discussed in association with the type of interruption it causes and the VMM aging type. With our parameter settings, VMM rejuvenation with prs job interruption improves the performance of job execution regardless of the aging type, with performance degradation is taken into account.", acknowledgement = ack-nhfb, articleno = "10", fjournal = "ACM Journal on Emerging Technologies in Computing Systems (JETC)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J967", } @Article{Mao:2014:RPO, author = "Bo Mao and Hong Jiang and Suzhen Wu and Yinjin Fu and Lei Tian", title = "Read-Performance Optimization for Deduplication-Based Storage Systems in the Cloud", journal = j-TOS, volume = "10", number = "2", pages = "6:1--6:??", month = mar, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1145/2512348", ISSN = "1553-3077 (print), 1553-3093 (electronic)", ISSN-L = "1553-3077", bibdate = "Tue Apr 1 05:59:01 MDT 2014", bibsource = "http://www.acm.org/pubs/contents/journals/tos/; https://www.math.utah.edu/pub/tex/bib/tos.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Data deduplication has been demonstrated to be an effective technique in reducing the total data transferred over the network and the storage space in cloud backup, archiving, and primary storage systems, such as VM (virtual machine) platforms. However, the performance of restore operations from a deduplicated backup can be significantly lower than that without deduplication. The main reason lies in the fact that a file or block is split into multiple small data chunks that are often located in different disks after deduplication, which can cause a subsequent read operation to invoke many disk IOs involving multiple disks and thus degrade the read performance significantly. While this problem has been by and large ignored in the literature thus far, we argue that the time is ripe for us to pay significant attention to it in light of the emerging cloud storage applications and the increasing popularity of the VM platform in the cloud. This is because, in a cloud storage or VM environment, a simple read request on the client side may translate into a restore operation if the data to be read or a VM suspended by the user was previously deduplicated when written to the cloud or the VM storage server, a likely scenario considering the network bandwidth and storage capacity concerns in such an environment. To address this problem, in this article, we propose SAR, an SSD (solid-state drive)-Assisted Read scheme, that effectively exploits the high random-read performance properties of SSDs and the unique data-sharing characteristic of deduplication-based storage systems by storing in SSDs the unique data chunks with high reference count, small size, and nonsequential characteristics. In this way, many read requests to HDDs are replaced by read requests to SSDs, thus significantly improving the read performance of the deduplication-based storage systems in the cloud. The extensive trace-driven and VM restore evaluations on the prototype implementation of SAR show that SAR outperforms the traditional deduplication-based and flash-based cache schemes significantly, in terms of the average response times.", acknowledgement = ack-nhfb, articleno = "6", fjournal = "ACM Transactions on Storage", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J960", } @Article{Mihajlovic:2014:DIQ, author = "Bojan Mihajlovi{\'c} and Zeljko Zili{\'c} and Warren J. Gross", title = "Dynamically Instrumenting the {QEMU} Emulator for {Linux} Process Trace Generation with the {GDB} Debugger", journal = j-TECS, volume = "13", number = "5s", pages = "167:1--167:??", month = nov, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1145/2678022", ISSN = "1539-9087 (print), 1558-3465 (electronic)", ISSN-L = "1539-9087", bibdate = "Wed Jan 7 15:03:31 MST 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/gnu.bib; https://www.math.utah.edu/pub/tex/bib/linux.bib; https://www.math.utah.edu/pub/tex/bib/tecs.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "In software debugging, trace generation techniques are used to resolve highly complex bugs. However, the emulators increasingly used for embedded software development do not yet offer the types of trace generation infrastructure available in hardware. In this article, we make changes to the ARM ISA emulation of the QEMU emulator to allow for continuous instruction-level trace generation. Using a standard GDB client, tracepoints can be inserted to dynamically log registers and memory addresses without altering executing code. The ability to run trace experiments in five different modes allows the scope of trace generation to be narrowed as needed, down to the level of a single Linux process. Our scheme collects the execution traces of a Linux process on average between 9.6x--0.7x the speed of existing QEMU trace capabilities, with 96.7\% less trace data volume. Compared to a software-instrumented tracing scheme, our method is both unobtrusive and performs on average between 3--4 orders of magnitude faster.", acknowledgement = ack-nhfb, articleno = "167", fjournal = "ACM Transactions on Embedded Computing Systems", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J840", } @Article{Mitsuishi:2014:ABF, author = "Takuji Mitsuishi and Shimpei Nomura and Jun Suzuki and Yuki Hayashi and Masaki Kan and Hideharu Amano", title = "Accelerating Breadth First Search on {GPU--BOX}", journal = j-COMP-ARCH-NEWS, volume = "42", number = "4", pages = "81--86", year = "2014", CODEN = "CANED2", DOI = "https://doi.org/10.1145/2693714.2693729", ISSN = "0163-5964 (print), 1943-5851 (electronic)", ISSN-L = "0163-5964", bibdate = "Wed Dec 3 16:18:50 MST 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigarch.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "The graph analysis has been applied in various fields related to big-data processing and actively researched in recent years. For processing a larger scale of graph, parallel computing with multi-GPU system is paid attention as an economical solution. Here, an efficient parallel method is proposed to solve a typical graph analysis, Breadth First Search (BFS) for multi-GPU systems. Our target system is GPU-BOX, a prototype of multi-GPU system using ExpEther which is a virtualization technology based on PCI Express and Ethernet. Although many vertices between GPUs must be exchanged to run BFS on multi-GPU system, GPU-BOX provides only small communication performance because of using Ethernet. Our parallel algorithm for BFS is designed so as to reduce the traffic between GPUs as possible. The proposed method reduced 30-40\% traffic between GPUs and improved the traditional parallel method by 10\%.", acknowledgement = ack-nhfb, fjournal = "ACM SIGARCH Computer Architecture News", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89", remark = "HEART '14 conference proceedings.", } @Article{Nomura:2014:PAM, author = "Shimpei Nomura and Takuji Mitsuishi and Jun Suzuki and Yuki Hayashi and Masaki Kan and Hideharu Amano", title = "Performance Analysis of the {Multi-GPU} System with {ExpEther}", journal = j-COMP-ARCH-NEWS, volume = "42", number = "4", pages = "9--14", year = "2014", CODEN = "CANED2", DOI = "https://doi.org/10.1145/2693714.2693717", ISSN = "0163-5964 (print), 1943-5851 (electronic)", ISSN-L = "0163-5964", bibdate = "Wed Dec 3 16:18:50 MST 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigarch.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "A GPU cluster in which each node provides a few GPUs connected with PCIe (PCI Express) is commonly used for acceleration of a large application program requiring the performance beyond a single GPU. However, in such a system, programmers are required to describe two parallel programming between nodes in MPIs or other message passing library as well as the fine grained parallel programming for intra-GPUs. As a cost effective alternative of such clusters, we propose a novel multi-GPU system with ExpEther, a virtualization technique which extends PCIe of a host CPU to Ethernet. All devices connected by ExpEther can be treated as if they were directly connected to the host. Evaluation with two application programs with and without GPU-GPU communication revealed that the proposed system with four GPUs achieved 3.88 and 3.29 times performance improvement respectively compared with a single GPU system. Compared with GPU cluster system in which each node provides a GPU, the proposed system achieved about 7\% and 30\% performance improvement, respectively.", acknowledgement = ack-nhfb, fjournal = "ACM SIGARCH Computer Architecture News", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89", remark = "HEART '14 conference proceedings.", } @Book{Oaks:2014:JPD, author = "Scott Oaks", title = "{Java} Performance: The Definitive Guide", publisher = pub-ORA-MEDIA, address = pub-ORA-MEDIA:adr, pages = "xiv + 408", year = "2014", ISBN = "1-4493-5845-4 (paperback), 1-4493-6354-7 (e-book)", ISBN-13 = "978-1-4493-5845-7 (paperback), 978-1-4493-6354-3 (e-book)", LCCN = "QA76.73.J38", bibdate = "Thu Dec 4 13:14:48 MST 2014", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/java2010.bib; https://www.math.utah.edu/pub/tex/bib/ora.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://proquest.safaribooksonline.com/9781449363512", abstract = "Coding and testing are often considered separate areas of expertise. In this comprehensive guide, author and Java expert Scott Oaks takes the approach that anyone who works with Java should be equally adept at understanding how code behaves in the JVM, as well as the tunings likely to help its performance. You'll gain in-depth knowledge of Java application performance, using the Java Virtual Machine (JVM) and the Java platform, including the language and API. Developers and performance engineers alike will learn a variety of features, tools, and processes for improving the way Java 7 and 8 applications perform. Apply four principles for obtaining the best results from performance testing Use JDK tools to collect data on how a Java application is performing Understand the advantages and disadvantages of using a JIT compiler Tune JVM garbage collectors to affect programs as little as possible Use techniques to manage heap memory and JVM native memory Maximize Java threading and synchronization performance features Tackle performance issues in Java EE and Java SE APIs Improve Java-driven database application performance.", acknowledgement = ack-nhfb, subject = "Java (Computer program language)", } @Book{Pape:2014:EJV, author = "Tobias Pape and Arian Treffer and Robert Hirschfeld and Michael Haupt", title = "Extending a {Java Virtual Machine} to Dynamic Object-oriented Languages", volume = "82", publisher = "Universit{\"a}tsverlag Potsdam", address = "Potsdam, Germany", pages = "163", year = "2014", ISBN = "3-86956-266-8", ISBN-13 = "978-3-86956-266-7", LCCN = "????", bibdate = "Thu Dec 4 08:01:22 MST 2014", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/java2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", series = "Technische Berichte des Hasso-Plattner-Instituts f{\"u}r Softwaresystemtechnik an der Universit{\"a}t Potsdam", URL = "http://d-nb.info/1046379119/04; http://opus.kobv.de/ubp/volltexte/2013/6743/", acknowledgement = ack-nhfb, subject = "Java Virtual Machine; Objektorientierte Programmiersprache; Dynamische Optimierung", } @Article{Pawlish:2014:CEE, author = "Michael Pawlish and Aparna S. Varde and Stefan A. Robila and Anand Ranganathan", title = "A call for energy efficiency in data centers", journal = j-SIGMOD, volume = "43", number = "1", pages = "45--51", month = mar, year = "2014", CODEN = "SRECD8", DOI = "https://doi.org/10.1145/2627692.2627703", ISSN = "0163-5808 (print), 1943-5835 (electronic)", ISSN-L = "0163-5808", bibdate = "Wed May 21 18:46:50 MDT 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigmod.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "In this paper, we explore a data center's performance with a call for energy efficiency through green computing. Some performance metrics we examine in data centers are server energy usage, Power Usage Effectiveness and utilization rate, i.e., the extent to which data center servers are being used. Recent literature indicates that utilization rates at many internal data centers are quite low, resulting in poor usage of resources such as energy and materials. Based on our study, we attribute these low utilization rates to not fully taking advantage of virtualization, and not retiring phantom (unused) servers. This paper describes our initiative corroborated with real data in a university setting. We suggest that future data centers will need to increase their utilization rates for better energy efficiency, and moving towards a cloud provider would help. However, we argue that neither a pure in-house data center or cloud model is the best solution. Instead we recommend, from a decision support perspective, a hybrid model in data center management to lower costs and increase services, while also providing greater energy efficiency.", acknowledgement = ack-nhfb, fjournal = "SIGMOD Record (ACM Special Interest Group on Management of Data)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J689", } @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; https://www.math.utah.edu/pub/tex/bib/virtual-machines.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{Pham:2014:BRS, author = "Cuong Pham and Zachary J. Estrada and Phuong Cao and Zbigniew Kalbarczyk and Ravishankar K. Iyer", title = "Building Reliable and Secure {Virtual Machines} Using Architectural Invariants", journal = j-IEEE-SEC-PRIV, volume = "12", number = "5", pages = "82--85", month = sep # "\slash " # oct, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1109/MSP.2014.87", ISSN = "1540-7993 (print), 1558-4046 (electronic)", ISSN-L = "1540-7993", bibdate = "Wed Feb 11 15:40:12 MST 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.computer.org/csdl/mags/sp/2014/05/msp2014050082-abs.html", abstract-URL = "http://www.computer.org/csdl/mags/sp/2014/05/msp2014050082-abs.html", acknowledgement = ack-nhfb, fjournal = "IEEE Security \& Privacy", journal-URL = "http://www.computer.org/portal/web/csdl/magazines/security", } @Article{Rao:2014:TFE, author = "Jia Rao and Xiaobo Zhou", title = "Towards fair and efficient {SMP} virtual machine scheduling", journal = j-SIGPLAN, volume = "49", number = "8", pages = "273--286", month = aug, year = "2014", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2692916.2555246", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Nov 26 16:26:30 MST 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "As multicore processors become prevalent in modern computer systems, there is a growing need for increasing hardware utilization and exploiting the parallelism of such platforms. With virtualization technology, hardware utilization is improved by encapsulating independent workloads into virtual machines (VMs) and consolidating them onto the same machine. SMP virtual machines have been widely adopted to exploit parallelism. For virtualized systems, such as a public cloud, fairness between tenants and the efficiency of running their applications are keys to success. However, we find that existing virtualization platforms fail to enforce fairness between VMs with different number of virtual CPUs (vCPU) that run on multiple CPUs. We attribute the unfairness to the use of per-CPU schedulers and the load imbalance on these CPUs that incur inaccurate CPU allocations. Unfortunately, existing approaches to reduce unfairness, e.g., dynamic load balancing and CPU capping, introduce significant inefficiencies to parallel workloads. In this paper, we present Flex, a vCPU scheduling scheme that enforces fairness at VM-level and improves the efficiency of hosted parallel applications. Flex centers on two key designs: (1) dynamically adjusting vCPU weights (FlexW) on multiple CPUs to achieve VM-level fairness and (2) flexibly scheduling vCPUs (FlexS) to minimize wasted busy-waiting time. We have implemented Flex in Xen and performed comprehensive evaluations with various parallel workloads. Results show that Flex is able to achieve CPU allocations with on average no more than 5\% error compared to the ideal fair allocation. Further, Flex outperforms Xen's credit scheduler and two representative co-scheduling approaches by as much as $ 10 \times $ for parallel applications using busy-waiting or blocking synchronization methods.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "PPoPP '14 conference proceedings.", } @Article{Rosen:2014:LCF, author = "Rami Rosen", title = "{Linux} containers and the future cloud", journal = j-LINUX-J, volume = "2014", number = "240", pages = "3:1--3:??", month = apr, year = "2014", CODEN = "LIJOFX", ISSN = "1075-3583 (print), 1938-3827 (electronic)", ISSN-L = "1075-3583", bibdate = "Fri May 9 15:49:24 MDT 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/linux-journal.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Process-level virtualization with Linux-based containers.", acknowledgement = ack-nhfb, articleno = "3", fjournal = "Linux Journal", journal-URL = "http://portal.acm.org/citation.cfm?id=J508", } @Article{Salehi:2014:RPB, author = "Mohsen Amini Salehi and Bahman Javadi and Rajkumar Buyya", title = "Resource provisioning based on preempting virtual machines in distributed systems", journal = j-CCPE, volume = "26", number = "2", pages = "412--433", month = feb, year = "2014", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.3004", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Sat Feb 8 15:45:14 MST 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", onlinedate = "30 Jan 2013", } @Article{Sallam:2014:MOV, author = "Ahmed Sallam and Kenli Li", title = "A Multi-objective Virtual Machine Migration Policy in Cloud Systems", journal = j-COMP-J, volume = "57", number = "2", pages = "195--204", month = feb, year = "2014", CODEN = "CMPJA6", DOI = "https://doi.org/10.1093/comjnl/bxt018", ISSN = "0010-4620 (print), 1460-2067 (electronic)", ISSN-L = "0010-4620", bibdate = "Mon Feb 3 17:03:04 MST 2014", bibsource = "http://comjnl.oxfordjournals.org/content/57/2.toc; https://www.math.utah.edu/pub/tex/bib/compj2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://comjnl.oxfordjournals.org/content/57/2/195.full.pdf+html", acknowledgement = ack-nhfb, fjournal = "Computer Journal", journal-URL = "http://comjnl.oxfordjournals.org/", onlinedate = "March 1, 2013", } @Article{Sani:2014:PDF, author = "Ardalan Amiri Sani and Kevin Boos and Shaopu Qin and Lin Zhong", title = "{I/O} paravirtualization at the device file boundary", journal = j-COMP-ARCH-NEWS, volume = "42", number = "1", pages = "319--332", month = mar, year = "2014", CODEN = "CANED2", DOI = "https://doi.org/10.1145/2654822.2541943", ISSN = "0163-5964 (print), 1943-5851 (electronic)", ISSN-L = "0163-5964", bibdate = "Mon Aug 18 17:12:47 MDT 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigarch.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Paravirtualization is an important I/O virtualization technology since it uniquely provides all of the following benefits: the ability to share the device between multiple VMs, support for legacy devices without virtualization hardware, and high performance. However, existing paravirtualization solutions have one main limitation: they only support one I/O device class, and would require significant engineering effort to support new device classes and features. In this paper, we present Paradice, a solution that vastly simplifies I/O paravirtualization by using a common paravirtualization boundary for various I/O device classes: Unix device files. Using this boundary, the paravirtual drivers simply act as a class-agnostic indirection layer between the application and the actual device driver. We address two fundamental challenges: supporting cross-VM driver memory operations without changes to applications or device drivers and providing fault and device data isolation between guest VMs despite device driver bugs. We implement Paradice for x86, the Xen hypervisor, and the Linux and FreeBSD OSes. Our implementation paravirtualizes various GPUs, input devices, cameras, an audio device, and an Ethernet card for the netmap framework with ~7700 LoC, of which only ~900 are device class-specific. Our measurements show that Paradice achieves performance close to native for different devices and applications including netmap, 3D HD games, and OpenCL applications.", acknowledgement = ack-nhfb, fjournal = "ACM SIGARCH Computer Architecture News", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89", remark = "ASPLOS '14 conference proceedings.", } @Article{Sarimbekov:2014:JCS, author = "Aibek Sarimbekov and Andreas Sewe and Walter Binder and Philippe Moret and Mira Mezini", title = "{JP2}: {Call}-site aware calling context profiling for the {Java Virtual Machine}", journal = j-SCI-COMPUT-PROGRAM, volume = "79", number = "??", pages = "146--157", day = "1", month = jan, year = "2014", CODEN = "SCPGD4", ISSN = "0167-6423 (print), 1872-7964 (electronic)", ISSN-L = "0167-6423", bibdate = "Sat Nov 30 15:06:12 MST 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2010.bib; https://www.math.utah.edu/pub/tex/bib/scicomputprogram.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www.sciencedirect.com/science/journal/01676423", URL = "http://www.sciencedirect.com/science/article/pii/S0167642311002036", acknowledgement = ack-nhfb, fjournal = "Science of Computer Programming", journal-URL = "http://www.sciencedirect.com/science/journal/01676423", } @Article{Savrun-Yeniceri:2014:EHI, author = "G{\"u}lfem Savrun-Yeni{\c{c}}eri and Wei Zhang and Huahan Zhang and Eric Seckler and Chen Li and Stefan Brunthaler and Per Larsen and Michael Franz", title = "Efficient hosted interpreters on the {JVM}", journal = j-TACO, volume = "11", number = "1", pages = "9:1--9:24", month = feb, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1145/2532642", ISSN = "1544-3566 (print), 1544-3973 (electronic)", ISSN-L = "1544-3566", bibdate = "Tue Mar 10 08:08:33 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2010.bib; https://www.math.utah.edu/pub/tex/bib/taco.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/abs/10.1145/2532642", abstract = "Many guest languages are implemented using the Java Virtual Machine (JVM) as a host environment. There are two major implementation choices: custom compilers and so-called hosted interpreters. Custom compilers are complex to build but offer good performance. Hosted interpreters are comparatively simpler to implement but until now have suffered from poor performance.\par We studied the performance of hosted interpreters and identified common bottlenecks preventing their efficient execution. First, similar to interpreters written in C/C++, instruction dispatch is expensive on the JVM. Second, Java's semantics require expensive runtime exception checks that negatively affect array performance essential to interpreters.\par We present two optimizations targeting these bottlenecks and show that the performance of optimized interpreters increases dramatically: we report speedups by a factor of up to 2.45 over the Jython interpreter, 3.57 over the Rhino interpreter, and 2.52 over the JRuby interpreter, respectively. The resulting performance is comparable with that of custom compilers. Our optimizations are enabled by a few simple annotations that require only modest implementation effort; in return, performance increases substantially.", acknowledgement = ack-nhfb, articleno = "9", fjournal = "ACM Transactions on Architecture and Code Optimization (TACO)", journal-URL = "https://dl.acm.org/loi/taco", } @Article{Song:2014:AFB, author = "Xiang Song and Jian Yang and Haibo Chen", title = "Architecting Flash-based Solid-State Drive for High-performance {I/O} Virtualization", journal = j-IEEE-COMPUT-ARCHIT-LETT, volume = "13", number = "2", pages = "61--64", month = jul # "\slash " # dec, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1109/L-CA.2013.22", ISSN = "1556-6056 (print), 1556-6064 (electronic)", ISSN-L = "1556-6056", bibdate = "Thu Jun 20 17:18:18 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeecomputarchitlett.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Flash-based solid-state drive (SSD) is now being widely deployed in cloud computing platforms due to the potential advantages of better performance and less energy consumption. However, current virtualization architecture lacks support for high-performance I/O virtualization over persistent storage, which results in sub-optimal I/O performance for guest virtual machines (VMs) on SSD. Further, current software-based I/O virtualization violates the ``don't hide {power''} principle due to inefficient support for some advanced SSD commands (e.g., TRIM) and constrained parallelism, leading to sub-optimal performance and life cycle. This paper observes that the massive internal parallelism and the block emulation in the flash translation layer (FTL) make flash-based SSD an ideal candidate to support high-performance I/O virtualization for persistent storage. Based on this observation, we propose VFlash, the first storage I/O virtualization architecture that extends existing SSDs with trivial hardware changes to directly expose multiple virtual SSDs to guest VMs. Performance evaluation using a modified FlashSim with two FTL schemes (i.e., DFTL and FAST) shows that VFlash incurs only small performance overhead over native SSDs and can efficiently exploit parallelism.", acknowledgement = ack-nhfb, affiliation = "Chen, HB (Reprint Author), Shanghai Jiao Tong Univ, Sch Software, Inst Parallel \& Distributed Syst, Shanghai 200030, Peoples R China. Song, Xiang; Yang, Jian; Chen, Haibo, Shanghai Jiao Tong Univ, Sch Software, Inst Parallel \& Distributed Syst, Shanghai 200030, Peoples R China.", author-email = "haibochen@sjtu.edu.cn", da = "2019-06-20", doc-delivery-number = "AX5PM", eissn = "1556-6064", fjournal = "IEEE Computer Architecture Letters", funding-acknowledgement = "China National Natural Science Foundation [61003002]; Intel", funding-text = "This work was supported by China National Natural Science Foundation under grant numbered 61003002 and a grant from Intel.", journal-iso = "IEEE Comput. Archit. Lett.", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=10208", keywords = "I/O virtualization; Solid State Drive", number-of-cited-references = "13", research-areas = "Computer Science", times-cited = "6", unique-id = "Song:2014:AFB", web-of-science-categories = "Computer Science, Hardware \& Architecture", } @Article{Song:2014:ARP, author = "Weijia Song and Zhen Xiao and Qi Chen and Haipeng Luo", title = "Adaptive Resource Provisioning for the Cloud Using Online Bin Packing", journal = j-IEEE-TRANS-COMPUT, volume = "63", number = "11", pages = "2647--2660", month = nov, year = "2014", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.2013.148", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Thu Nov 06 07:39:04 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Computers", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", keywords = "application demand; Approximation algorithms; Approximation methods; bin packing; cloud adaptive resource provisioning; cloud computing; Cloud computing; computer centres; data center applications; dynamic data center resource allocation; green computing; Heuristic algorithms; Layout; physical machines; physical servers; relaxed online bin packing problem; resource allocation; Resource management; Scheduling algorithms; server number optimization; server resource multiplexing; Servers; virtual machine; virtual machines; virtualisation; virtualization; virtualization technology", } @Article{Song:2014:OBS, author = "Fei Song and Daochao Huang and Huachun Zhou and Hongke Zhang and Ilsun You", title = "An Optimization-Based Scheme for Efficient Virtual Machine Placement", journal = j-INT-J-PARALLEL-PROG, volume = "42", number = "5", pages = "853--872", month = oct, year = "2014", CODEN = "IJPPE5", DOI = "https://doi.org/10.1007/s10766-013-0274-5", ISSN = "0885-7458 (print), 1573-7640 (electronic)", ISSN-L = "0885-7458", bibdate = "Wed Sep 10 07:13:07 MDT 2014", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=42&issue=5; https://www.math.utah.edu/pub/tex/bib/intjparallelprogram.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer.com/article/10.1007/s10766-013-0274-5", acknowledgement = ack-nhfb, fjournal = "International Journal of Parallel Programming", journal-URL = "http://link.springer.com/journal/10766", } @Book{Stark:2014:JJV, author = "Robert F. St{\"a}rk and Joachim Schmid and Egon B{\"o}rger", title = "{Java} and the {Java Virtual Machine}: Definition, Verification, Validation", publisher = pub-SV, address = pub-SV:adr, pages = "x + 381", year = "2014", DOI = "https://doi.org/10.1007/978-3-642-59495-3", ISBN = "3-642-63997-6", ISBN-13 = "978-3-642-63997-5", LCCN = "QA76.76.C65", bibdate = "Mon Jan 16 16:02:58 MST 2017", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/java2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "Softcover reprint of \cite{Stark:2001:JJV}.", URL = "http://deposit.d-nb.de/cgi-bin/dokserv?id=4745749\%26prov=M\%26dok\_var=1\%26dok\_ext=htm", abstract = "This book provides a high-level description, together with a mathematical and an experimental analysis, of Java and of the Java Virtual Machine (JVM), including a standard compiler of Java programs to JVM code and the security critical bytecode verifier component of the JVM. The description is structured into language layers and machine components. It comes with a natural executable refinement which can be used for testing code. The method developed for this purpose is based on Abstract State Machines (ASMs) and can be applied to other virtual machines and to other programming languages as well. The book is written for advanced students and for professionals and practitioners in research and development who need for their work a complete and transparent definition and an executable model of the language and of the virtual machine underlying its intended implementation.", acknowledgement = ack-nhfb, tableofcontents = "Introduction \\ Abstract State Machines \\ Part I. Java \\ Part II. Compilation of Java: The Trustful JVM \\ Part III. Bytecode Verification: The Secure JVM \\ Appendix \\ Index", } @Article{Stecklina:2014:SHO, author = "Julian Stecklina", title = "Shrinking the hypervisor one subsystem at a time: a userspace packet switch for virtual machines", journal = j-SIGPLAN, volume = "49", number = "7", pages = "189--200", month = jul, year = "2014", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2674025.2576202", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Sep 26 07:29:50 MDT 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Efficient and secure networking between virtual machines is crucial in a time where a large share of the services on the Internet and in private datacenters run in virtual machines. To achieve this efficiency, virtualization solutions, such as Qemu/KVM, move toward a monolithic system architecture in which all performance critical functionality is implemented directly in the hypervisor in privileged mode. This is an attack surface in the hypervisor that can be used from compromised VMs to take over the virtual machine host and all VMs running on it. We show that it is possible to implement an efficient network switch for virtual machines as an unprivileged userspace component running in the host system including the driver for the upstream network adapter. Our network switch relies on functionality already present in the KVM hypervisor and requires no changes to Linux, the host operating system, and the guest. Our userspace implementation compares favorably to the existing in-kernel implementation with respect to throughput and latency. We reduced per-packet overhead by using a run-to-completion model an are able to outperform the unmodified system for VM-to-VM traffic by a large margin when packet rates are high.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "VEE '14 conference proceedings.", } @Article{Su:2014:EAV, author = "Sen Su and Zhongbao Zhang and Alex X. Liu and Xiang Cheng and Yiwen Wang and Xinchao Zhao", title = "Energy-aware virtual network embedding", journal = j-IEEE-TRANS-NETWORKING, volume = "22", number = "5", pages = "1607--1620", month = oct, year = "2014", CODEN = "IEANEP", DOI = "https://doi.org/10.1109/TNET.2013.2286156", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Thu Feb 12 18:29:34 MST 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Virtual network embedding, which means mapping virtual networks requested by users to a shared substrate network maintained by an Internet service provider, is a key function that network virtualization needs to provide. Prior work on virtual network embedding has primarily focused on maximizing the revenue of the Internet service provider and did not consider the energy cost in accommodating such requests. As energy cost is more than half of the operating cost of the substrate networks, while trying to accommodate more virtual network requests, minimizing energy cost is critical for infrastructure providers. In this paper, we make the first effort toward energy-aware virtual network embedding. We first propose an energy cost model and formulate the energy-aware virtual network embedding problem as an integer linear programming problem. We then propose two efficient energy-aware virtual network embedding algorithms: a heuristic-based algorithm and a particle-swarm-optimization-technique-based algorithm. We implemented our algorithms in C++ and performed side-by-side comparison with prior algorithms. The simulation results show that our algorithms significantly reduce the energy cost by up to 50\% over the existing algorithm for accommodating the same sequence of virtual network requests.", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771", } @Article{Su:2014:RVP, author = "Tzu-Hsiang Su and Hsiang-Jen Tsai and Keng-Hao Yang and Po-Chun Chang and Tien-Fu Chen and Yi-Ting Zhao", title = "Reconfigurable vertical profiling framework for the {Android} runtime system", journal = j-TECS, volume = "13", number = "2s", pages = "59:1--59:??", month = jan, year = "2014", CODEN = "????", DOI = "https://doi.org/10.1145/2544375.2544379", ISSN = "1539-9087 (print), 1558-3465 (electronic)", ISSN-L = "1539-9087", bibdate = "Tue Jan 28 17:34:43 MST 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2010.bib; https://www.math.utah.edu/pub/tex/bib/tecs.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Dalvik virtual machine in the Android system creates a profiling barrier between VM-space applications and Linux user-space libraries. It is difficult for existing profiling tools on the Android system to definitively identify whether a bottleneck occurred in the application level, the Linux user-space level, or the Linux kernel level. Information barriers exist between VM-space applications and Linux native analysis tools due to runtime virtual machines' dynamic memory allocation mechanism. Furthermore, traditional vertical profiling tools targeted for Java virtual machines cannot be simply applied on the Dalvik virtual machine due to its unique design. The proposed the Reconfigurable Vertical Profiling Framework bridges the information gap and streamlines the hardware-software co-design process for the Android runtime system.", acknowledgement = ack-nhfb, articleno = "59", fjournal = "ACM Transactions on Embedded Computing Systems", journal-URL = "http://portal.acm.org/browse_dl.cfm?&idx=J840", } @Article{Subbiah:2014:CFT, author = "Dharmalingam Subbiah and Balaji Arulmozhi and Hariharasudhan Maruthamuthu", title = "Constraint Free Testing using Service Virtualization", journal = j-INT-J-COMP-APPL, volume = "105", number = "??", pages = "23--26", month = nov, year = "2014", CODEN = "????", DOI = "https://doi.org/10.5120/18470-9882", ISSN = "0975-8887", ISSN-L = "0975-8887", bibdate = "Fri Jan 24 09:12:48 MST 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcompappl.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.ijcaonline.org/archives/volume105/number17/18470-9882/", acknowledgement = ack-nhfb, ajournal = "Intern. J. of Computer Applications", articleno = "17", fjournal = "International Journal of Computer Applications", journal-URL = "https://www.ijcaonline.org/", } @Article{Tan:2014:DBD, author = "Huailiang Tan and Lianjun Huang and Zaihong He and Youyou Lu and Xubin He", title = "{DMVL}: an {I/O} bandwidth dynamic allocation method for virtual networks", journal = j-J-NETW-COMPUT-APPL, volume = "39", number = "??", pages = "104--116", month = mar, year = "2014", CODEN = "JNCAF3", ISSN = "1084-8045 (print), 1095-8592 (electronic)", ISSN-L = "1084-8045", bibdate = "Wed Jan 28 15:44:53 MST 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1084804513001380", acknowledgement = ack-nhfb, ajournal = "J. Netw. Comput. Appl.", fjournal = "Journal of Network and Computer Applications", journal-URL = "http://www.sciencedirect.com/science/journal/10848045", } @Article{Tang:2014:DFS, author = "Zhuo Tang and Yanqing Mo and Kenli Li and Keqin Li", title = "Dynamic forecast scheduling algorithm for virtual machine placement in cloud computing environment", journal = j-J-SUPERCOMPUTING, volume = "70", number = "3", pages = "1279--1296", month = dec, year = "2014", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-014-1227-5", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Fri Feb 13 12:32:24 MST 2015", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0920-8542&volume=70&issue=3; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer.com/article/10.1007/s11227-014-1227-5", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Tien:2014:EOS, author = "Tsan-Rong Tien and Yi-Ping You", title = "Enabling {OpenCL} support for {GPGPU} in Kernel-based Virtual Machine", journal = j-SPE, volume = "44", number = "5", pages = "483--510", month = may, year = "2014", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/spe.2166", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Wed Sep 10 05:57:32 MDT 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/pvm.bib; https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", onlinedate = "22 Nov 2012", } @Article{Torlak:2014:LSV, author = "Emina Torlak and Rastislav Bodik", title = "A lightweight symbolic virtual machine for solver-aided host languages", journal = j-SIGPLAN, volume = "49", number = "6", pages = "530--541", month = jun, year = "2014", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2666356.2594340", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Sep 26 07:38:28 MDT 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Solver-aided domain-specific languages (SDSLs) are an emerging class of computer-aided programming systems. They ease the construction of programs by using satisfiability solvers to automate tasks such as verification, debugging, synthesis, and non-deterministic execution. But reducing programming tasks to satisfiability problems involves translating programs to logical constraints, which is an engineering challenge even for domain-specific languages. We have previously shown that translation to constraints can be avoided if SDSLs are implemented by (traditional) embedding into a host language that is itself solver-aided. This paper describes how to implement a symbolic virtual machine (SVM) for such a host language. Our symbolic virtual machine is lightweight because it compiles to constraints only a small subset of the host's constructs, while allowing SDSL designers to use the entire language, including constructs for DSL embedding. This lightweight compilation employs a novel symbolic execution technique with two key properties: it produces compact encodings, and it enables concrete evaluation to strip away host constructs that are outside the subset compilable to constraints. Our symbolic virtual machine architecture is at the heart of Rosette, a solver-aided language that is host to several new SDSLs.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", received = "PLDI '14 conference proceedings.", } @Article{Tsafrir:2014:ELV, author = "Dan Tsafrir", title = "Experiences in the land of virtual abstractions", journal = j-SIGPLAN, volume = "49", number = "7", pages = "1--2", month = jul, year = "2014", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2674025.2576215", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Sep 26 07:29:50 MDT 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "The Microsoft Research Drawbridge Project began with a simple question: Is it possible to achieve the benefits of hardware virtual machines without the overheads? Following that question, we have built a line of exploratory prototypes. These prototypes range from an ARM-based phone that runs x86 Windows binaries to new forms of secure computation. In this talk, I'll briefly describe our various prototypes and the evidence we have accumulated that our first question can be answered in the affirmative.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "VEE '14 conference proceedings.", } @Article{Tu:2014:PPP, author = "Chia-Heng Tu and Hui-Hsin Hsu and Jen-Hao Chen and Chun-Han Chen and Shih-Hao Hung", title = "Performance and power profiling for emulated {Android} systems", journal = j-TODAES, volume = "19", number = "2", pages = "10:1--10:??", month = mar, year = "2014", CODEN = "ATASFO", DOI = "https://doi.org/10.1145/2566660", ISSN = "1084-4309 (print), 1557-7309 (electronic)", ISSN-L = "1084-4309", bibdate = "Fri Mar 21 18:21:14 MDT 2014", bibsource = "http://www.acm.org/pubs/contents/journals/todaes/; https://www.math.utah.edu/pub/tex/bib/java2010.bib; https://www.math.utah.edu/pub/tex/bib/todaes.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Simulation is a common approach for assisting system design and optimization. For system-wide optimization, energy and computational resources are often the two most critical issues. Monitoring the energy state of each hardware component and measuring the time spent in each state is needed for accurate energy and performance prediction. For software optimization, it is important to profile the energy and the time consumed by each software construct in a realistic operating environment with a proper workload. However, the conventional approaches of simulation often fail to produce satisfying data. First, building a cycle-accurate simulation environment for a complex system, such as an Android smartphone, is difficult and can take a long time. Second, a slow simulation can significantly alter the behavior of multithreaded, I/O-intensive applications and can affect the accuracy of profiles. Third, existing software-based profilers generally do not work on simulators, which makes it difficult for performance analysis of complicated software, for example, Java applications executed by the Dalvik VM in an Android system. To address these aforementioned problems, we proposed and prototyped a framework, called virtual performance analyzer (VPA). VPA takes advantage of an existing emulator or virtual machine monitor to reduce the complexity of building a simulator. VPA allows the user to selectively and incrementally integrate timing models and power models into the emulator with our carefully designed performance/power monitors, tracing facility, and profiling tools to evaluate and analyze the emulated system. The emulated system can perform at different levels of speed to help verify if the profile data are impacted by the emulation speed. Finally, VPA supports existing software-based profiles and enables non-intrusive tracing/profiling by minimizing the probe effect. Our experimental results show that the VPA framework allows users to quickly establish a performance/power evaluation environment and gather useful information to support system design and software optimization for Android smartphones.", acknowledgement = ack-nhfb, articleno = "10", fjournal = "ACM Transactions on Design Automation of Electronic Systems", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J776", } @InProceedings{vanMoolenbroek:2014:TFL, author = "David C. van Moolenbroek and Raja Appuswamy and Andrew S. Tanenbaum", editor = "????", booktitle = "{SYSTOR '14: proceedings of the 7th ACM International Systems and Storage Conference: June 10--12, 2014, Haifa, Israel}", title = "Towards a Flexible, Lightweight Virtualization Alternative", publisher = pub-ACM, address = pub-ACM:adr, pages = "1--7", year = "2014", DOI = "https://doi.org/10.1145/2611354.2611369", ISBN = "1-4503-2920-9", ISBN-13 = "978-1-4503-2920-0", LCCN = "????", bibdate = "Fri Oct 24 07:49:02 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/minix.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://dl.acm.org/citation.cfm?id=2611354; http://www.minix3.org/docs/conf/systor-2014.pdf", acknowledgement = ack-nhfb, } @Article{Varadharajan:2014:CSA, author = "Vijay Varadharajan and Udaya Tupakula", title = "Counteracting security attacks in virtual machines in the cloud using property based attestation", journal = j-J-NETW-COMPUT-APPL, volume = "40", number = "??", pages = "31--45", month = apr, year = "2014", CODEN = "JNCAF3", ISSN = "1084-8045 (print), 1095-8592 (electronic)", ISSN-L = "1084-8045", bibdate = "Wed Jan 28 15:44:57 MST 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1084804513001768", acknowledgement = ack-nhfb, ajournal = "J. Netw. Comput. Appl.", fjournal = "Journal of Network and Computer Applications", journal-URL = "http://www.sciencedirect.com/science/journal/10848045", } @Article{Visegrady:2014:SCV, author = "T. Visegrady and S. Dragone and M. Osborne", title = "Stateless cryptography for virtual environments", journal = j-IBM-JRD, volume = "58", number = "1", pages = "5:1--5:10", month = jan # "--" # feb, year = "2014", CODEN = "IBMJAE", DOI = "https://doi.org/10.1147/JRD.2013.2287811", ISSN = "0018-8646 (print), 2151-8556 (electronic)", ISSN-L = "0018-8646", bibdate = "Sat Feb 15 16:52:52 MST 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib; https://www.math.utah.edu/pub/tex/bib/ibmjrd.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IBM Journal of Research and Development", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520", } @Article{Vitek:2014:CTR, author = "Jan Vitek", title = "The case for the three {R}'s of systems research: repeatability, reproducibility and rigor", journal = j-SIGPLAN, volume = "49", number = "7", pages = "115--116", month = jul, year = "2014", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2674025.2576216", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Sep 26 07:29:50 MDT 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2010.bib; https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Computer systems research spans sub-disciplines that include embedded systems, programming languages, networking, and operating systems. In this talk my contention is that a number of structural factors inhibit quality systems research. Symptoms of the problem include unrepeatable and unreproduced results as well as results that are either devoid of meaning or that measure the wrong thing. I will illustrate the impact of these issues on our research output with examples from the development and empirical evaluation of the Schism real-time garbage collection algorithm that is shipped with the FijiVM --- a Java virtual machine for embedded and mobile devices. I will argue that our field should foster: repetition of results, independent reproduction, as well as rigorous evaluation. I will outline some baby steps taken by several computer conferences. In particular I will focus on the introduction of Artifact Evaluation Committees or AECs to ECOOP, OOPLSA, PLDI and soon POPL. The goal of the AECs is to encourage author to package the software artifacts that they used to support the claims made in their paper and to submit these artifacts for evaluation. AECs were carefully designed to provide positive feedback to the authors that take the time to create repeatable research.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "VEE '14 conference proceedings.", } @Article{Wood:2014:LLD, author = "Benjamin P. Wood and Luis Ceze and Dan Grossman", title = "Low-level detection of language-level data races with {LARD}", journal = j-COMP-ARCH-NEWS, volume = "42", number = "1", pages = "671--686", month = mar, year = "2014", CODEN = "CANED2", DOI = "https://doi.org/10.1145/2654822.2541955", ISSN = "0163-5964 (print), 1943-5851 (electronic)", ISSN-L = "0163-5964", bibdate = "Mon Aug 18 17:12:47 MDT 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigarch.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Researchers have proposed always-on data-race exceptions as a way to avoid the ill effects of data races, but slow performance of accurate dynamic data-race detection remains a barrier to the adoption of always-on data-race exceptions. Proposals for accurate low-level (e.g., hardware) data-race detection have the potential to reduce this performance barrier. This paper explains why low-level data-race detectors are wrong for programs written in high-level languages (e.g., Java): they miss true data races and report false data races in these programs. To bring the benefits of low-level data-race detection to high-level languages, we design low-level abstractable race detection (LARD), an extension of the interface between low-level data-race detectors and run-time systems that enables accurate language-level data-race detection using low-level detection mechanisms. We implement accurate LARD data-race exception support for Java, coupling a modified Jikes RVM Java virtual machine and a simulated hardware race detector. We evaluate our detector's accuracy against an accurate dynamic Java data-race detector and other low-level race detectors without LARD, showing that naive accurate low-level data-race detectors suffer from many missed and false language-level races in practice, and that LARD prevents this inaccuracy.", acknowledgement = ack-nhfb, fjournal = "ACM SIGARCH Computer Architecture News", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89", remark = "ASPLOS '14 conference proceedings.", } @Article{Xie:2014:DIP, author = "Xia Xie and Wenzhi Cao and Hai Jin and Xijiang Ke and Shuwen Luo", title = "Design and implementation of process-aware predictive scheduling scheme for virtual machine", journal = j-J-SUPERCOMPUTING, volume = "70", number = "3", pages = "1577--1587", month = dec, year = "2014", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-014-1254-2", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Fri Feb 13 12:13:22 MST 2015", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0920-8542&volume=70&issue=3; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer.com/article/10.1007/s11227-014-1254-2", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Xu:2014:IML, author = "Fei Xu and Fangming Liu and Linghui Liu and Hai Jin and Bo Li and Baochun Li", title = "{iAware}: Making Live Migration of Virtual Machines Interference-Aware in the Cloud", journal = j-IEEE-TRANS-COMPUT, volume = "63", number = "12", pages = "3012--3025", month = dec, year = "2014", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.2013.185", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Thu Dec 4 10:36:57 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Computers", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", keywords = "Bandwidth; Central Processing Unit; cloud computing; Cloud computing; cloud services; complementary large-scale simulations; computer centres; consolidation policies; contracts; CPU; Degradation; iAware; interference-aware VM; large-scale datacenters; live migration; load balancing; multiresource demand-supply model; Nonvolatile memory; performance interference; resource allocation; service-level-agreement; SLA; virtual machine interference-aware; virtual machines; Virtual machining; virtualisation; virtualization; VM migration approaches; VM performance interference; VM scheduling; Xen virtualized cluster platform", } @Article{Yan:2014:EFG, author = "Jie Yan and Guangming Tan and Ninghui Sun", title = "Exploiting fine-grained parallelism in graph traversal algorithms via lock virtualization on multi-core architecture", journal = j-J-SUPERCOMPUTING, volume = "69", number = "3", pages = "1462--1490", month = sep, year = "2014", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-014-1239-1", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Fri Feb 13 12:15:43 MST 2015", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0920-8542&volume=69&issue=3; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer.com/article/10.1007/s11227-014-1239-1", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Yang:2014:ICV, author = "Chao-Tung Yang and Jung-Chun Liu and Ching-Hsien Hsu", title = "On improvement of cloud virtual machine availability with virtualization fault tolerance mechanism", journal = j-J-SUPERCOMPUTING, volume = "69", number = "3", pages = "1103--1122", month = sep, year = "2014", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-013-1045-1", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Fri Feb 13 12:28:15 MST 2015", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0920-8542&volume=69&issue=3; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer.com/article/10.1007/s11227-013-1045-1", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Yang:2014:IGV, author = "Chao-Tung Yang and Jung-Chun Liu and Hsien-Yi Wang and Ching-Hsien Hsu", title = "Implementation of {GPU} virtualization using {PCI} pass-through mechanism", journal = j-J-SUPERCOMPUTING, volume = "68", number = "1", pages = "183--213", month = apr, year = "2014", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-013-1034-4", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Wed Sep 10 06:44:53 MDT 2014", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0920-8542&volume=68&issue=1; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer.com/article/10.1007/s11227-013-1034-4", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Yang:2014:IIV, author = "Hailong Yang and Qi Zhao and Zhongzhi Luan and Depei Qian", title = "{iMeter}: an integrated {VM} power model based on performance profiling", journal = j-FUT-GEN-COMP-SYS, volume = "36", number = "??", pages = "267--286", month = jul, year = "2014", CODEN = "FGSEVI", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Mon Apr 28 15:56:06 MDT 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X13001532", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X/", } @Article{Yang:2014:MMG, author = "Chao-Tung Yang and Jung-Chun Liu and Kuan-Lung Huang and Fuu-Cheng Jiang", title = "A method for managing green power of a virtual machine cluster in cloud", journal = j-FUT-GEN-COMP-SYS, volume = "37", number = "??", pages = "26--36", month = jul, year = "2014", CODEN = "FGSEVI", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Wed May 21 08:14:41 MDT 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X14000466", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X/", } @Article{Yao:2014:GFT, author = "Lin Yao and Guowei Wu and Jiankang Ren and Yanwei Zhu and Ying Li", title = "Guaranteeing Fault-Tolerant Requirement Load Balancing Scheme Based on {VM} Migration", journal = j-COMP-J, volume = "57", number = "2", pages = "225--232", month = feb, year = "2014", CODEN = "CMPJA6", DOI = "https://doi.org/10.1093/comjnl/bxt012", ISSN = "0010-4620 (print), 1460-2067 (electronic)", ISSN-L = "0010-4620", bibdate = "Mon Feb 3 17:03:04 MST 2014", bibsource = "http://comjnl.oxfordjournals.org/content/57/2.toc; https://www.math.utah.edu/pub/tex/bib/compj2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://comjnl.oxfordjournals.org/content/57/2/225.full.pdf+html", acknowledgement = ack-nhfb, fjournal = "Computer Journal", journal-URL = "http://comjnl.oxfordjournals.org/", onlinedate = "February 12, 2013", } @Article{Yu:2014:MPP, author = "Chao Yu and Leihua Qin and Jingli Zhou", title = "A multicore periodical preemption virtual machine scheduling scheme to improve the performance of computational tasks", journal = j-J-SUPERCOMPUTING, volume = "67", number = "1", pages = "254--276", month = jan, year = "2014", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-013-0998-4", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Sat Feb 8 10:22:13 MST 2014", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0920-8542&volume=67&issue=1; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer.com/article/10.1007/s11227-013-0998-4", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Zakkak:2014:JJM, author = "Foivos S. Zakkak and Polyvios Pratikakis", title = "{JDMM}: a {Java} memory model for non-cache-coherent memory architectures", journal = j-SIGPLAN, volume = "49", number = "11", pages = "83--92", month = nov, year = "2014", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2775049.2602999", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue May 12 17:41:19 MDT 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "As the number of cores continuously grows, processor designers are considering non coherent memories as more scalable and energy efficient alternatives to the current coherent ones. The Java Memory Model (JMM) requires that all cores can access the Java heap. It guarantees sequential consistency for data-race-free programs and no out-of-thin-air values for non data-race-free programs. To implement the Java Memory Model over non-cache-coherent and distributed architectures Java Virtual Machines (JVMs) are most likely to employ software caching. In this work, (i) we provide a formalization of the Java Memory Model for non-cache-coherent and distributed memory architectures, (ii) prove the adherence of our model with the Java Memory Model and (iii) evaluate, regarding its compliance to the Java Memory Model, a state-of-the-art Java Virtual Machine implementation on a non-cache-coherent architecture.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "ISMM '14 conference proceedings.", } @Article{Zhang:2014:AIO, author = "Wei Zhang and Per Larsen and Stefan Brunthaler and Michael Franz", title = "Accelerating iterators in optimizing {AST} interpreters", journal = j-SIGPLAN, volume = "49", number = "10", pages = "727--743", month = oct, year = "2014", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2714064.2660223", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue May 12 17:41:21 MDT 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/python.bib; https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Generators offer an elegant way to express iterators. However, their performance has always been their Achilles heel and has prevented widespread adoption. We present techniques to efficiently implement and optimize generators. We have implemented our optimizations in ZipPy, a modern, light-weight AST interpreter based Python 3 implementation targeting the Java virtual machine. Our implementation builds on a framework that optimizes AST interpreters using just-in-time compilation. In such a system, it is crucial that AST optimizations do not prevent subsequent optimizations. Our system was carefully designed to avoid this problem. We report an average speedup of 3.58x for generator-bound programs. As a result, using generators no longer has downsides and programmers are free to enjoy their upsides.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "OOPSLA '14 conference proceedings.", } @Article{Zhang:2014:VFP, author = "Zhaoning Zhang and Ziyang Li and Kui Wu and Dongsheng Li and Huiba Li and Yuxing Peng and Xicheng Lu", title = "{VMThunder}: Fast Provisioning of Large-Scale Virtual Machine Clusters", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "25", number = "12", pages = "3328--3338", month = dec, year = "2014", CODEN = "ITDSEO", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Thu Feb 12 13:58:34 MST 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.computer.org/csdl/trans/td/2014/12/06719385-abs.html", abstract-URL = "http://www.computer.org/csdl/trans/td/2014/12/06719385-abs.html", acknowledgement = ack-nhfb, journal-URL = "http://www.computer.org/tpds/archives.htm", } @Article{Zheng:2014:CCM, author = "Jie Zheng and Tze Sing Eugene Ng and Kunwadee Sripanidkulchai and Zhaolei Liu", title = "{COMMA}: coordinating the migration of multi-tier applications", journal = j-SIGPLAN, volume = "49", number = "7", pages = "153--164", month = jul, year = "2014", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2674025.2576200", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Sep 26 07:29:50 MDT 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Multi-tier applications are widely deployed in today's virtualized cloud computing environments. At the same time, management operations in these virtualized environments, such as load balancing, hardware maintenance, workload consolidation, etc., often make use of live virtual machine (VM) migration to control the placement of VMs. Although existing solutions are able to migrate a single VM efficiently, little attention has been devoted to migrating related VMs in multi-tier applications. Ignoring the relatedness of VMs during migration can lead to serious application performance degradation. This paper formulates the multi-tier application migration problem, and presents a new communication-impact-driven coordinated approach, as well as a system called COMMA that realizes this approach. Through extensive testbed experiments, numerical analyses, and a demonstration of COMMA on Amazon EC2, we show that this approach is highly effective in minimizing migration's impact on multi-tier applications' performance.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "VEE '14 conference proceedings.", } @Article{Zou:2014:VOV, author = "Shihong Zou and Xitao Wen and Kai Chen and Shan Huang and Yan Chen and Yongqiang Liu and Yong Xia and Chengchen Hu", title = "{VirtualKnotter}: Online virtual machine shuffling for congestion resolving in virtualized datacenter", journal = j-COMP-NET-AMSTERDAM, volume = "67", number = "??", pages = "141--153", day = "4", month = jul, year = "2014", CODEN = "????", ISSN = "1389-1286 (print), 1872-7069 (electronic)", ISSN-L = "1389-1286", bibdate = "Fri May 23 18:09:14 MDT 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S138912861400139X", acknowledgement = ack-nhfb, fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)", journal-URL = "http://www.sciencedirect.com/science/journal/13891286/", } @Article{Ahmad:2015:SVM, author = "Raja Wasim Ahmad and Abdullah Gani and Siti Hafizah Ab. Hamid and Muhammad Shiraz and Abdullah Yousafzai and Feng Xia", title = "A survey on virtual machine migration and server consolidation frameworks for cloud data centers", journal = j-J-NETW-COMPUT-APPL, volume = "52", number = "??", pages = "11--25", month = jun, year = "2015", CODEN = "JNCAF3", ISSN = "1084-8045 (print), 1095-8592 (electronic)", ISSN-L = "1084-8045", bibdate = "Sat Aug 8 15:46:39 MDT 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1084804515000284", acknowledgement = ack-nhfb, fjournal = "Journal of Network and Computer Applications", journal-URL = "http://www.sciencedirect.com/science/journal/10848045", } @Article{Ahmad:2015:VMM, author = "Raja Wasim Ahmad and Abdullah Gani and Siti Hafizah Ab. Hamid and Muhammad Shiraz and Feng Xia and Sajjad A. Madani", title = "Virtual machine migration in cloud data centers: a review, taxonomy, and open research issues", journal = j-J-SUPERCOMPUTING, volume = "71", number = "7", pages = "2473--2515", month = jul, year = "2015", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-015-1400-5", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Sat Aug 8 12:23:11 MDT 2015", bibsource = "http://link.springer.com/journal/11227/71/7; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer.com/article/10.1007/s11227-015-1400-5", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Aigner:2015:AJE, author = "Martin Aigner and Thomas H{\"u}tter and Christoph M. Kirsch and Alexander Miller and Hannes Payer and Mario Preishuber", title = "{ACDC-JS}: explorative benchmarking of {JavaScript} memory management", journal = j-SIGPLAN, volume = "50", number = "2", pages = "67--78", month = feb, year = "2015", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2775052.2661089", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue May 12 17:41:21 MDT 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "We present ACDC-JS, an open-source JavaScript memory management benchmarking tool. ACDC-JS incorporates a heap model based on real web applications and may be configured to expose virtually any relevant performance characteristics of JavaScript memory management systems. ACDC-JS is based on ACDC, a benchmarking tool for C/C++ that models periodic allocation and deallocation behavior (AC) as well as persistent memory (DC). We identify important characteristics of JavaScript mutator behavior and propose a configurable heap model based on typical distributions of these characteristics as foundation for ACDC-JS. We describe heap analyses of 13 real web applications extending existing work on JavaScript behavior analysis. Our experimental results show that ACDC-JS enables performance benchmarking and debugging of state-of-the-art JavaScript virtual machines such as V8 and SpiderMonkey by exposing key aspects of their memory management performance.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "DLS '14 conference proceedings.", } @Article{Akyildiz:2015:WSD, author = "Ian F. Akyildiz and Shih-Chun Lin and Pu Wang", title = "Wireless software-defined networks {(W-SDNs)} and network function virtualization {(NFV)} for {$5$G} cellular systems: an overview and qualitative evaluation", journal = j-COMP-NET-AMSTERDAM, volume = "93 (part 1)", number = "??", pages = "66--79", day = "24", month = dec, year = "2015", CODEN = "????", ISSN = "1389-1286 (print), 1872-7069 (electronic)", ISSN-L = "1389-1286", bibdate = "Mon Nov 30 08:40:41 MST 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1389128615003862", acknowledgement = ack-nhfb, fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)", journal-URL = "http://www.sciencedirect.com/science/journal/13891286/", } @Misc{Anonymous:2015:CXB, author = "Anonymous", title = "Critical {Xen} bug in {PV} memory virtualization code ({XSA 148})", howpublished = "Web bug report", day = "29", month = oct, year = "2015", bibdate = "Fri Oct 30 18:19:12 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "The report notes about this bug that allows memory pages to leak between Xen virtual machines on the same physical host: ``\ldots{} the bug is a very critical one. Probably the worst we have seen affecting the Xen hypervisor, ever. Sadly. \ldots{} it is really shocking that such a bug has been lurking in the core of the hypervisor for so many years.''", URL = "https://github.com/QubesOS/qubes-secpack/blob/master/QSBs/qsb-022-2015.txt", acknowledgement = ack-nhfb, } @Article{Axnix:2015:IZF, author = "C. Axnix and G. Bayer and H. Bohm and J. von Buttlar and M. S. Farrell and L. C. Heller and J. P. Kubala and S. E. Lederer and R. Mansell and A. Nunez Mencias and S. Usenbinz", title = "{IBM z13} firmware innovations for simultaneous multithreading and {I/O} virtualization", journal = j-IBM-JRD, volume = "59", number = "??", pages = "11:1--11:11", month = "????", year = "2015", CODEN = "IBMJAE", ISSN = "0018-8646 (print), 2151-8556 (electronic)", ISSN-L = "0018-8646", bibdate = "Wed Oct 21 11:38:12 MDT 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/ibmjrd.bib; https://www.math.utah.edu/pub/tex/bib/multithreading.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, } @Article{Baccarelli:2015:MEB, author = "Enzo Baccarelli and Danilo Amendola and Nicola Cordeschi", title = "Minimum-energy bandwidth management for {QoS} live migration of virtual machines", journal = j-COMP-NET-AMSTERDAM, volume = "93 (part 1)", number = "??", pages = "1--22", day = "24", month = dec, year = "2015", CODEN = "????", ISSN = "1389-1286 (print), 1872-7069 (electronic)", ISSN-L = "1389-1286", bibdate = "Mon Nov 30 08:40:41 MST 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1389128615003655", acknowledgement = ack-nhfb, fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)", journal-URL = "http://www.sciencedirect.com/science/journal/13891286/", } @Article{Bauman:2015:SHB, author = "Erick Bauman and Gbadebo Ayoade and Zhiqiang Lin", title = "A Survey on Hypervisor-Based Monitoring: Approaches, Applications, and Evolutions", journal = j-COMP-SURV, volume = "48", number = "1", pages = "10:1--10:??", month = sep, year = "2015", CODEN = "CMSVAN", DOI = "https://doi.org/10.1145/2775111", ISSN = "0360-0300 (print), 1557-7341 (electronic)", ISSN-L = "0360-0300", bibdate = "Wed Sep 30 17:08:21 MDT 2015", bibsource = "http://www.acm.org/pubs/contents/journals/surveys/; https://www.math.utah.edu/pub/tex/bib/compsurv.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "When designing computer monitoring systems, one goal has always been to have a complete view of the monitored target and at the same time stealthily protect the monitor itself. One way to achieve this is to use hypervisor-based, or more generally out of virtual machine (VM)-based, monitoring. There are, however, challenges that limit the use of this mechanism; the most significant of these is the semantic gap problem. Over the past decade, a considerable amount of research has been carried out to bridge the semantic gap and develop all kinds of out-of-VM monitoring techniques and applications. By tracing the evolution of out-of-VM security solutions, this article examines and classifies different approaches that have been proposed to overcome the semantic gap-the fundamental challenge in hypervisor-based monitoring-and how they have been used to develop various security applications. In particular, we review how the past approaches address different constraints, such as practicality, flexibility, coverage, and automation, while bridging the semantic gap; how they have developed different monitoring systems; and how the monitoring systems have been applied and deployed. In addition to systematizing all of the proposed techniques, we also discuss the remaining research problems and shed light on the future directions of hypervisor-based monitoring.", acknowledgement = ack-nhfb, articleno = "10", fjournal = "ACM Computing Surveys", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204", } @Article{Bellavista:2015:VNF, author = "Paolo Bellavista and Franco Callegati and Walter Cerroni and Chiara Contoli and Antonio Corradi and Luca Foschini and Alessandro Pernafini and Giuliano Santandrea", title = "Virtual network function embedding in real cloud environments", journal = j-COMP-NET-AMSTERDAM, volume = "93 (part 3)", number = "??", pages = "506--517", day = "24", month = dec, year = "2015", CODEN = "????", ISSN = "1389-1286 (print), 1872-7069 (electronic)", ISSN-L = "1389-1286", bibdate = "Thu Dec 3 09:50:31 MST 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1389128615003588", acknowledgement = ack-nhfb, fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)", journal-URL = "http://www.sciencedirect.com/science/journal/13891286/", } @Article{Beloglazov:2015:ONF, author = "Anton Beloglazov and Rajkumar Buyya", title = "{OpenStack Neat}: a framework for dynamic and energy-efficient consolidation of virtual machines in {OpenStack} clouds", journal = j-CCPE, volume = "27", number = "5", pages = "1310--1333", day = "10", month = apr, year = "2015", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.3314", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Sat Jul 25 19:54:07 MDT 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", onlinedate = "17 Jun 2014", } @Article{Biedermann:2015:SDR, author = "Alexander Biedermann and Sorin A. Huss and Adeel Israr", title = "Safe Dynamic Reshaping of Reconfigurable {MPSoC} Embedded Systems for Self-Healing and Self-Adaption Purposes", journal = j-TRETS, volume = "8", number = "4", pages = "26:1--26:??", month = oct, year = "2015", CODEN = "????", DOI = "https://doi.org/10.1145/2700416", ISSN = "1936-7406 (print), 1936-7414 (electronic)", ISSN-L = "1936-7406", bibdate = "Mon Oct 5 08:47:01 MDT 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/trets.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Multiprocessor system-on-chip (MPSoC) architectures are a huge challenge in embedded system design. This situation arises from the fact that available MPSoCs and related designs flows are not tailored to the specific needs of embedded systems. This work demonstrates how to provide self-healing properties in embedded MPSoC design. This is achieved by combining the features of a generic approach to create virtualizable MPSoCs out of off-the-shelf embedded processors with a methodology to derive system configurations, such as task-processor bindings, which are optimal in terms of safety and execution time. The virtualization properties enable a reshaping of the MPSoC at runtime. Thus, system configurations may be exchanged rapidly in a dynamic fashion. As a main result of this work, embedded multiprocessor systems are introduced, which dynamically adapt to changing operating conditions, possible module defects, and internal state changes. We demonstrate the figures of merit of such reconfigurable MPSoC embedded systems by means of a complex automotive application scenario mapped to an FPGA featuring a virtualizable array of eight soft-core processors.", acknowledgement = ack-nhfb, articleno = "26", fjournal = "ACM Transactions on Reconfigurable Technology and Systems (TRETS)", journal-URL = "http://portal.acm.org/toc.cfm?id=J1151", } @Article{Bila:2015:EOP, author = "Nilton Bila and Eric J. Wright and Eyal {De Lara} and Kaustubh Joshi and H. Andr{\'e}s Lagar-Cavilla and Eunbyung Park and Ashvin Goel and Matti Hiltunen and Mahadev Satyanarayanan", title = "Energy-Oriented Partial Desktop Virtual Machine Migration", journal = j-TOCS, volume = "33", number = "1", pages = "2:1--2:??", month = mar, year = "2015", CODEN = "ACSYEC", DOI = "https://doi.org/10.1145/2699683", ISSN = "0734-2071 (print), 1557-7333 (electronic)", ISSN-L = "0734-2071", bibdate = "Fri Mar 13 07:03:25 MDT 2015", bibsource = "http://www.acm.org/pubs/contents/journals/tocs/; https://www.math.utah.edu/pub/tex/bib/tocs.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Modern offices are crowded with personal computers. While studies have shown these to be idle most of the time, they remain powered, consuming up to 60\% of their peak power. Hardware-based solutions engendered by PC vendors (e.g., low-power states, Wake-on-LAN) have proved unsuccessful because, in spite of user inactivity, these machines often need to remain network active in support of background applications that maintain network presence. Recent proposals have advocated the use of consolidation of idle desktop Virtual Machines (VMs). However, desktop VMs are often large, requiring gigabytes of memory. Consolidating such VMs creates large network transfers lasting in the order of minutes and utilizes server memory inefficiently. When multiple VMs migrate concurrently, networks become congested, and the resulting migration latencies are prohibitive. We present partial VM migration, an approach that transparently migrates only the working set of an idle VM. It creates a partial replica of the desktop VM on the consolidation server by copying only VM metadata, and it transfers pages to the server on-demand, as the VM accesses them. This approach places desktop PCs in low-power mode when inactive and switches them to running mode when pages are needed by the VM running on the consolidation server. To ensure that desktops save energy, we have developed sleep scheduling and prefetching algorithms, as well as the context-aware selective resume framework, a novel approach to reduce the latency of power mode transition operations in commodity PCs. Jettison, our software prototype of partial VM migration for off-the-shelf PCs, can deliver 44--91\% energy savings during idle periods of at least 10 minutes, while providing low migration latencies of about 4 seconds and migrating minimal state that is under an order of magnitude of the VM's memory footprint.", acknowledgement = ack-nhfb, articleno = "2", fjournal = "ACM Transactions on Computer Systems", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J774", } @Article{Birke:2015:WVM, author = "Robert Birke and Mathias Bj{\"o}rkqvist and Cyriel Minkenberg and Martin Schmatz and Lydia Y. Chen", title = "When Virtual Meets Physical at the Edge: a Field Study on Datacenters' Virtual Traffic", journal = j-SIGMETRICS, volume = "43", number = "1", pages = "403--415", month = jun, year = "2015", CODEN = "????", DOI = "https://doi.org/10.1145/2796314.2745865", ISSN = "0163-5999 (print), 1557-9484 (electronic)", ISSN-L = "0163-5999", bibdate = "Fri Sep 18 06:59:51 MDT 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigmetrics.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "The wide deployment of virtualization in datacenters catalyzes the emergence of virtual traffic that delivers the network demands between the physical network and the virtual machines hosting clients' services. Virtual traffic presents new opportunities for reducing physical network demands, as well as challenges of increasing management complexity. Given the plethora of prior art on virtualization technologies in datacenters, surprisingly little is still known about such virtual traffic, and its dependence on the physical network and virtual machines. This paper provides a multi-faceted analysis of the patterns and impacts of multiplexing the virtual traffic onto the physical network, particularly from the perspective of the network edge. We use a large collection of field data from production datacenters hosting a large number of diversified services from multiple enterprise tenants. Our first focus is on uncovering the temporal and spatial characteristics of the virtual and physical traffic, i.e., network demand growth and communication patterns, with special attention paid to the traffic of migrating virtual machines. The second focus is on characterizing the effect of network multiplexing in terms of communication locality, traffic load heterogeneity, and the dependency on CPU processing power at the edges of the network. Last but not least, we conduct a mirroring analysis on service QoS, defined by the service unavailability induced by network related issues, e.g., loads. We qualitatively and quantitatively discuss the implications and opportunities that virtual traffic presents for network capacity planning of virtualized networks and datacenters.", acknowledgement = ack-nhfb, fjournal = "ACM SIGMETRICS Performance Evaluation Review", journal-URL = "http://portal.acm.org/toc.cfm?id=J618", } @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 = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.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{Bolz:2015:IMT, author = "Carl Friedrich Bolz and Laurence Tratt", title = "The impact of meta-tracing on {VM} design and implementation", journal = j-SCI-COMPUT-PROGRAM, volume = "98 (part 3)", number = "??", pages = "408--421", day = "1", month = feb, year = "2015", CODEN = "SCPGD4", ISSN = "0167-6423 (print), 1872-7964 (electronic)", ISSN-L = "0167-6423", bibdate = "Thu Dec 4 19:45:00 MST 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/scicomputprogram.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167642313000269", acknowledgement = ack-nhfb, fjournal = "Science of Computer Programming", journal-URL = "http://www.sciencedirect.com/science/journal/01676423/", } @Article{Branco:2015:TFS, author = "Adriano Branco and Francisco Sant'anna and Roberto Ierusalimschy and Noemi Rodriguez and Silvana Rossetto", title = "{Terra}: Flexibility and Safety in Wireless Sensor Networks", journal = j-TOSN, volume = "11", number = "4", pages = "59:1--59:??", month = dec, year = "2015", CODEN = "????", DOI = "https://doi.org/10.1145/2811267", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Dec 23 16:13:11 MST 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Terra is a system for programming wireless sensor network (WSN) applications. It combines the use of configurable virtual machines with a reactive scripting language that can be statically analyzed to avoid unbounded execution and memory conflicts. This approach allows the flexibility of remotely uploading code on motes to be combined with a set of guarantees for the programmer. The choice of the specific set of components in a virtual machine configuration defines the abstraction level seen by the application script. We describe a specific component library built for Terra, which we designed taking into account the functionality commonly needed in WSN applications --- typically for sense and control. We also discuss the programming environment resulting from the combination of a statically analyzable scripting language with this library of components. Finally, we evaluate Terra by measuring its overhead in a basic application and discussing its use and cost in a typical monitoring WSN scenario.", acknowledgement = ack-nhfb, articleno = "59", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Bravo-Torres:2015:IVL, author = "Jack Fernando Bravo-Torres and Mart{\'\i}n L{\'o}pez-Nores and Yolanda Blanco-Fern{\'a}ndez and Jos{\'e} Juan Pazos-Arias and Manuel Ramos-Cabrer and Alberto Gil-Solla", title = "An improved virtualization layer to support distribution of multimedia contents in pervasive social applications", journal = j-J-NETW-COMPUT-APPL, volume = "51", number = "??", pages = "1--17", month = may, year = "2015", CODEN = "JNCAF3", ISSN = "1084-8045 (print), 1095-8592 (electronic)", ISSN-L = "1084-8045", bibdate = "Sat Aug 8 15:46:39 MDT 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1084804515000120", acknowledgement = ack-nhfb, fjournal = "Journal of Network and Computer Applications", journal-URL = "http://www.sciencedirect.com/science/journal/10848045", } @Article{Bravo-Torres:2015:VVL, author = "Jack F. Bravo-Torres and Mart{\'\i}n L{\'o}pez-Nores and Yolanda Blanco-Fern{\'a}ndez and Jos{\'e} J. Pazos-Arias and Esteban F. Ord{\'o}{\~n}ez-Morales", title = "{VaNetLayer}: a virtualization layer supporting access to web contents from within vehicular networks", journal = j-J-COMPUT-SCI, volume = "11", pages = "185--195", month = nov, year = "2015", CODEN = "????", DOI = "https://doi.org/10.1016/j.jocs.2014.07.004", ISSN = "1877-7503 (print), 1877-7511 (electronic)", ISSN-L = "1877-7503", bibdate = "Tue Sep 19 13:53:55 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/jcomputsci.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.sciencedirect.com/science/article/pii/S1877750314001008", acknowledgement = ack-nhfb, ajournal = "J. Comput. Sci.", fjournal = "Journal of Computational Science", journal-URL = "https://www.sciencedirect.com/journal/journal-of-computational-science", } @Article{Caballer:2015:PDC, author = "Miguel Caballer and Dami{\'a}n Segrelles and Germ{\'a}n Molt{\'o} and Ignacio Blanquer", title = "A platform to deploy customized scientific virtual infrastructures on the cloud", journal = j-CCPE, volume = "27", number = "16", pages = "4318--4329", month = nov, year = "2015", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.3518", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Tue Feb 9 06:13:20 MST 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", onlinedate = "20 May 2015", } @Article{Cameron:2015:JFE, author = "Callum Cameron and Jeremy Singer and David Vengerov", title = "The judgment of {FORSETI}: economic utility for dynamic heap sizing of multiple runtimes", journal = j-SIGPLAN, volume = "50", number = "11", pages = "143--156", month = nov, year = "2015", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2887746.2754180", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Feb 16 12:01:44 MST 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "We introduce the FORSETI system, which is a principled approach for holistic memory management. It permits a sysadmin to specify the total physical memory resource that may be shared between all concurrent virtual machines on a physical node. FORSETI models the heap size versus application throughput for each virtual machine, and seeks to maximize the combined throughput of the set of VMs based on concepts from economic utility theory. We evaluate the FORSETI system using a standard Java managed runtime, i.e. OpenJDK. Our results demonstrate that FORSETI enables dramatic reductions (up to 5x) in heap footprint without compromising application execution times.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "ISMM '15 conference proceedings.", } @Article{Checco:2015:FVN, author = "Alessandro Checco and Douglas J. Leith", title = "Fair virtualization of 802.11 networks", journal = j-IEEE-TRANS-NETWORKING, volume = "23", number = "1", pages = "148--160", month = feb, year = "2015", CODEN = "IEANEP", DOI = "https://doi.org/10.1109/TNET.2013.2293501", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Fri Aug 28 06:01:29 MDT 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "We consider virtualization of network capacity in 802.11 WLANs and mesh networks. We show that allocating total airtime slices to ISPs is analogous to allocating a fraction of available time-slots in TDMA. We establish that the max-min fair flow rate allocation within an ISP airtime slice can be characterized independently of the rate allocation policy employed in other slices. Building on these observations, we present a lightweight, distributed algorithm for allocating airtime slices among ISP and max-min fair flow rates within each slice.", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771", } @Article{Chen:2015:LVS, author = "Wenzhi Chen and Lei Xu and Guoxi Li and Yang Xiang", title = "A Lightweight Virtualization Solution for {Android} Devices", journal = j-IEEE-TRANS-COMPUT, volume = "64", number = "10", pages = "2741--2751", month = "????", year = "2015", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.2015.2389791", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Tue Oct 13 06:51:51 MDT 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Computers", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", } @Article{Chiang:2015:SEV, author = "Ron C. Chiang and Sundaresan Rajasekaran and Nan Zhang and H. Howie Huang", title = "{Swiper}: Exploiting Virtual Machine Vulnerability in Third-Party Clouds with Competition for {I/O} Resources", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "26", number = "6", pages = "1732--1742", month = jun, year = "2015", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2014.2325564", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Thu Jun 4 19:34:14 MDT 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://csdl.computer.org/csdl/trans/td/2015/06/06824231-abs.html", abstract-URL = "http://csdl.computer.org/csdl/trans/td/2015/06/06824231-abs.html", acknowledgement = ack-nhfb, journal-URL = "http://www.computer.org/tpds/archives.htm", } @Article{Clifford:2015:MMD, author = "Daniel Clifford and Hannes Payer and Michael Stanton and Ben L. Titzer", title = "Memento mori: dynamic allocation-site-based optimizations", journal = j-SIGPLAN, volume = "50", number = "11", pages = "105--117", month = nov, year = "2015", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2887746.2754181", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Feb 16 12:01:44 MST 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Languages that lack static typing are ubiquitous in the world of mobile and web applications. The rapid rise of larger applications like interactive web GUIs, games, and cryptography presents a new range of implementation challenges for modern virtual machines to close the performance gap between typed and untyped languages. While all languages can benefit from efficient automatic memory management, languages like JavaScript present extra thrill with innocent-looking but difficult features like dynamically-sized arrays, deletable properties, and prototypes. Optimizing such languages requires complex dynamic techniques with more radical object layout strategies such as dynamically evolving representations for arrays. This paper presents a general approach for gathering temporal allocation site feedback that tackles both the general problem of object lifetime estimation and improves optimization of these problematic language features. We introduce a new implementation technique where allocation mementos processed by the garbage collector and runtime system efficiently tie objects back to allocation sites in the program and dynamically estimate object lifetime, representation, and size to inform three optimizations: pretenuring, pretransitioning, and presizing. Unlike previous work on pretenuring, our system utilizes allocation mementos to achieve fully dynamic allocation-site-based pretenuring in a production system. We implement all of our techniques in V8, a high performance virtual machine for JavaScript, and demonstrate solid performance improvements across a range of benchmarks.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "ISMM '15 conference proceedings.", } @Article{Coutinho:2015:OVM, author = "Rafaelli de C. Coutinho and L{\'u}cia M. A. Drummond and Yuri Frota and Daniel de Oliveira", title = "Optimizing virtual machine allocation for parallel scientific workflows in federated clouds", journal = j-FUT-GEN-COMP-SYS, volume = "46", number = "??", pages = "51--68", month = may, year = "2015", CODEN = "FGSEVI", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Mon Feb 23 09:01:44 MST 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X14002027", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X/", } @Article{Cui:2015:PPA, author = "Lei Cui and Tianyu Wo and Bo Li and Jianxin Li and Bin Shi and Jinpeng Huai", title = "{PARS}: a Page-Aware Replication System for Efficiently Storing Virtual Machine Snapshots", journal = j-SIGPLAN, volume = "50", number = "7", pages = "215--228", month = jul, year = "2015", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2817817.2731190", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Feb 16 12:01:42 MST 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Virtual machine (VM) snapshot enhances the system availability by saving the running state into stable storage during failure-free execution and rolling back to the snapshot point upon failures. Unfortunately, the snapshot state may be lost due to disk failures, so that the VM fails to be recovered. The popular distributed file systems employ replication technique to tolerate disk failures by placing redundant copies across disperse disks. However, unless user-specific personalization is provided, these systems consider the data in the file as of same importance and create identical copies of the entire file, leading to non-trivial additional storage overhead. This paper proposes a page-aware replication system (PARS) to store VM snapshots efficiently. PARS employs VM introspection technique to explore how a page is used by guest, and classifies the pages by their importance to system execution. If a page is critical, PARS replicates it multiple copies to ensure high availability and long-term durability. Otherwise, the loss of this page causes no harm for system to work properly, PARS therefore saves only one copy of the page. Consequently, PARS improves storage efficiency without compromising availability. We have implemented PARS to justify its practicality. The experimental results demonstrate that PARS achieves 53.9\% space saving compared to the native replication approach in HDFS which replicates the whole snapshot file fully and identically.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "VEE '15 conference proceedings.", } @Article{Di:2015:ECP, author = "Sheng Di and Franck Cappello", title = "Extended Conference Papers: {GloudSim}: {Google} trace based cloud simulator with virtual machines", journal = j-SPE, volume = "45", number = "11", pages = "1571--1590", month = nov, year = "2015", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/spe.2303", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Mon Feb 8 18:03:22 MST 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", onlinedate = "7 Dec 2014", } @Article{Di:2015:OCC, author = "Sheng Di and D. Kondo and Cho-Li Wang", title = "Optimization of Composite Cloud Service Processing with Virtual Machines", journal = j-IEEE-TRANS-COMPUT, volume = "64", number = "6", pages = "1755--1768", month = "????", year = "2015", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.2014.2329685", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Wed Jun 10 07:41:35 MDT 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Computers", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", } @Article{Ding:2015:EES, author = "Youwei Ding and Xiaolin Qin and Liang Liu and Taochun Wang", title = "Energy efficient scheduling of virtual machines in cloud with deadline constraint", journal = j-FUT-GEN-COMP-SYS, volume = "50", number = "??", pages = "62--74", month = sep, year = "2015", CODEN = "FGSEVI", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Fri Jun 5 10:18:40 MDT 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X15000369", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X/", } @Article{Dong:2015:VSB, author = "YaoZu Dong and JunJie Mao and HaiBing Guan and Jian Li and Yu Chen", title = "A Virtualization Solution for {BYOD} With Dynamic Platform Context Switching", journal = j-IEEE-MICRO, volume = "35", number = "1", pages = "34--43", month = jan # "\slash " # feb, year = "2015", CODEN = "IEMIDZ", DOI = "https://doi.org/10.1109/MM.2015.3", ISSN = "0272-1732 (print), 1937-4143 (electronic)", ISSN-L = "0272-1732", bibdate = "Thu Jun 4 19:19:24 MDT 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeemicro.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.computer.org/csdl/mags/mi/2015/01/mmi2015010034-abs.html", abstract-URL = "http://www.computer.org/csdl/mags/mi/2015/01/mmi2015010034-abs.html", acknowledgement = ack-nhfb, journal-URL = "http://www.computer.org/csdl/mags/mi/index.html", } @Article{Ebrahimirad:2015:EAS, author = "Vahid Ebrahimirad and Maziar Goudarzi and Aboozar Rajabi", title = "Energy-Aware Scheduling for Precedence-Constrained Parallel Virtual Machines in Virtualized Data Centers", journal = j-J-GRID-COMP, volume = "13", number = "2", pages = "233--253", month = jun, year = "2015", CODEN = "????", DOI = "https://doi.org/10.1007/s10723-015-9327-x", ISSN = "1570-7873 (print), 1572-9184 (electronic)", ISSN-L = "1570-7873", bibdate = "Sat Aug 8 12:08:29 MDT 2015", bibsource = "http://link.springer.com/journal/10723/13/2; https://www.math.utah.edu/pub/tex/bib/jgridcomp.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer.com/article/10.1007/s10723-015-9327-x", acknowledgement = ack-nhfb, fjournal = "Journal of Grid Computing", journal-URL = "http://link.springer.com/journal/10723", } @Article{Egger:2015:ERV, author = "Bernhard Egger and Erik Gustafsson and Changyeon Jo and Jeongseok Son", title = "Efficiently Restoring Virtual Machines", journal = j-INT-J-PARALLEL-PROG, volume = "43", number = "3", pages = "421--439", month = jun, year = "2015", CODEN = "IJPPE5", DOI = "https://doi.org/10.1007/s10766-013-0295-0", ISSN = "0885-7458 (print), 1573-7640 (electronic)", ISSN-L = "0885-7458", bibdate = "Sat Aug 8 12:34:16 MDT 2015", bibsource = "http://link.springer.com/journal/10766/43/3; https://www.math.utah.edu/pub/tex/bib/intjparallelprogram.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer.com/article/10.1007/s10766-013-0295-0", acknowledgement = ack-nhfb, fjournal = "International Journal of Parallel Programming", journal-URL = "http://link.springer.com/journal/10766", } @Article{Estrada:2015:PCT, author = "Zachary John Estrada and Fei Deng and Zachary Stephens and Cuong Pham and Zbigniew Kalbarczyk and Ravishankar Iyer", title = "Performance Comparison and Tuning of Virtual Machines For Sequence Alignment Software", journal = j-SCPE, volume = "16", number = "1", pages = "??--??", month = "????", year = "2015", CODEN = "????", ISSN = "1895-1767", ISSN-L = "1895-1767", bibdate = "Fri Feb 13 06:32:06 MST 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/scpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www.scpe.org/index.php/scpe/issue/view/126", URL = "http://www.scpe.org/index.php/scpe/article/view/1061", acknowledgement = ack-nhfb, journal-URL = "http://www.scpe.org/", } @Article{Evoy:2015:ADP, author = "Giacomo Mc Evoy and Antonio R. Mury and Bruno Schulze", title = "An analysis of definition and placement of virtual machines for high performance applications on {Clouds}", journal = j-CCPE, volume = "27", number = "7", pages = "1789--1814", month = may, year = "2015", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.3346", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Sat Jul 25 19:54:07 MDT 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", onlinedate = "13 Aug 2014", } @Article{Fan:2015:UCC, author = "Hua Fan and Aditya Ramaraju and Marlon McKenzie and Wojciech Golab and Bernard Wong", title = "Understanding the causes of consistency anomalies in {Apache Cassandra}", journal = j-PROC-VLDB-ENDOWMENT, volume = "8", number = "7", pages = "810--813", month = feb, year = "2015", CODEN = "????", ISSN = "2150-8097", bibdate = "Wed Apr 15 19:04:24 MDT 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; https://www.math.utah.edu/pub/tex/bib/vldbe.bib", abstract = "A recent paper on benchmarking eventual consistency showed that when a constant workload is applied against Cassandra, the staleness of values returned by read operations exhibits interesting but unexplained variations when plotted against time. In this paper we reproduce this phenomenon and investigate in greater depth the low-level mechanisms that give rise to stale reads. We show that the staleness spikes exhibited by Cassandra are strongly correlated with garbage collection, particularly the ``stop-the-world'' phase which pauses all application threads in a Java virtual machine. We show experimentally that the staleness spikes can be virtually eliminated by delaying read operations artificially at servers immediately after a garbage collection pause. In our experiments this yields more than a 98\% reduction in the number of consistency anomalies that exceed 5ms, and has negligible impact on throughput and latency.", acknowledgement = ack-nhfb, fjournal = "Proceedings of the VLDB Endowment", journal-URL = "http://portal.acm.org/citation.cfm?id=J1174", } @Article{Filiposka:2015:CBV, author = "Sonja Filiposka and Anastas Mishev and Carlos Juiz", title = "Community-based {VM} placement framework", journal = j-J-SUPERCOMPUTING, volume = "71", number = "12", pages = "4504--4528", month = dec, year = "2015", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-015-1546-1", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Mon Jan 25 08:18:10 MST 2016", bibsource = "http://link.springer.com/journal/11227/71/12; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer.com/article/10.1007/s11227-015-1546-1", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Forsman:2015:AAL, author = "Mattias Forsman and Andreas Glad and Lars Lundberg and Dragos Ilie", title = "Algorithms for automated live migration of virtual machines", journal = j-J-SYST-SOFTW, volume = "101", number = "??", pages = "110--126", month = mar, year = "2015", CODEN = "JSSODM", ISSN = "0164-1212 (print), 1873-1228 (electronic)", ISSN-L = "0164-1212", bibdate = "Tue Jan 27 06:18:33 MST 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0164121214002751", acknowledgement = ack-nhfb, fjournal = "Journal of Systems and Software", journal-URL = "http://www.sciencedirect.com/science/journal/01641212/", } @Article{Freudenberg:2015:SMP, author = "Bert Freudenberg and Dan H. H. Ingalls and Tim Felgentreff and Tobias Pape and Robert Hirschfeld", title = "{SqueakJS}: a modern and practical smalltalk that runs in any browser", journal = j-SIGPLAN, volume = "50", number = "2", pages = "57--66", month = feb, year = "2015", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2775052.2661100", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue May 12 17:41:21 MDT 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "We report our experience in implementing SqueakJS, a bit-compatible implementation of Squeak/Smalltalk written in pure JavaScript. SqueakJS runs entirely in the Web browser with a virtual filesystem that can be directed to a server or client-side storage. Our implementation is notable for simplicity and performance gained through adaptation to the host object memory and deployment leverage gained through the Lively Web development environment. We present several novel techniques as well as performance measurements for the resulting virtual machine. Much of this experience is potentially relevant to preserving other dynamic language systems and making them available in a browser-based environment.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "DLS '14 conference proceedings.", } @Article{Gidra:2015:NGC, author = "Lokesh Gidra and Ga{\"e}l Thomas and Julien Sopena and Marc Shapiro and Nhan Nguyen", title = "{NumaGiC}: a Garbage Collector for Big Data on Big {NUMA} Machines", journal = j-SIGPLAN, volume = "50", number = "4", pages = "661--673", month = apr, year = "2015", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2775054.2694361", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue May 12 17:41:19 MDT 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "On contemporary cache-coherent Non-Uniform Memory Access (ccNUMA) architectures, applications with a large memory footprint suffer from the cost of the garbage collector (GC), because, as the GC scans the reference graph, it makes many remote memory accesses, saturating the interconnect between memory nodes. We address this problem with NumaGiC, a GC with a mostly-distributed design. In order to maximise memory access locality during collection, a GC thread avoids accessing a different memory node, instead notifying a remote GC thread with a message; nonetheless, NumaGiC avoids the drawbacks of a pure distributed design, which tends to decrease parallelism. We compare NumaGiC with Parallel Scavenge and NAPS on two different ccNUMA architectures running on the Hotspot Java Virtual Machine of OpenJDK 7. On Spark and Neo4j, two industry-strength analytics applications, with heap sizes ranging from 160GB to 350GB, and on SPECjbb2013 and SPECjbb2005, our gc improves overall performance by up to 45\% over NAPS (up to 94\% over Parallel Scavenge), and increases the performance of the collector itself by up to 3.6x over NAPS (up to 5.4x over Parallel Scavenge).", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "ASPLOS '15 conference proceedings.", } @Article{Guo:2015:PBL, author = "Fei Guo and Seongbeom Kim and Yury Baskakov and Ishan Banerjee", title = "Proactively Breaking Large Pages to Improve Memory Overcommitment Performance in {VMware ESXi}", journal = j-SIGPLAN, volume = "50", number = "7", pages = "39--51", month = jul, year = "2015", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2817817.2731187", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Feb 16 12:01:42 MST 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "VMware ESXi leverages hardware support for MMU virtualization available in modern Intel/AMD CPUs. To optimize address translation performance when running on such CPUs, ESXi preferably uses host large pages (2MB in x86-64 systems) to back VM's guest memory. While using host large pages provides best performance when host has sufficient free memory, it increases host memory pressure and effectively defeats page sharing. Hence, the host is more likely to hit the point where ESXi has to reclaim VM memory through much more expensive techniques such as ballooning or host swapping. As a result, using host large pages may significantly hurt consolidation ratio. To deal with this problem, we propose a new host large page management policy that allows to: (a) identify 'cold' large pages and break them even when host has plenty of free memory; (b) break all large pages proactively when host free memory becomes scarce, but before the host starts ballooning or swapping; (c) reclaim the small pages within the broken large pages through page sharing. With the new policy, the shareable small pages can be shared much earlier and the amount of memory that needs to be ballooned or swapped can be largely reduced when host memory pressure is high. We also propose an algorithm to dynamically adjust the page sharing rate when proactively breaking large pages using a VM large page shareability estimator for higher efficiency. Experimental results show that the proposed large page management policy can improve the performance of various workloads up to 2.1x by significantly reducing the amount of ballooned or swapped memory when host memory pressure is high. Applications still fully benefit from host large pages when memory pressure is low.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "VEE '15 conference proceedings.", } @Article{Gupta:2015:HER, author = "Vishal Gupta and Min Lee and Karsten Schwan", title = "{HeteroVisor}: Exploiting Resource Heterogeneity to Enhance the Elasticity of Cloud Platforms", journal = j-SIGPLAN, volume = "50", number = "7", pages = "79--92", month = jul, year = "2015", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2817817.2731191", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Feb 16 12:01:42 MST 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "This paper presents HeteroVisor, a heterogeneity-aware hypervisor, that exploits resource heterogeneity to enhance the elasticity of cloud systems. Introducing the notion of 'elasticity' (E) states, HeteroVisor permits applications to manage their changes in resource requirements as state transitions that implicitly move their execution among heterogeneous platform components. Masking the details of platform heterogeneity from virtual machines, the E-state abstraction allows applications to adapt their resource usage in a fine-grained manner via VM-specific 'elasticity drivers' encoding VM-desired policies. The approach is explored for the heterogeneous processor and memory subsystems evolving for modern server platforms, leading to mechanisms that can manage these heterogeneous resources dynamically and as required by the different VMs being run. HeteroVisor is implemented for the Xen hypervisor, with mechanisms that go beyond core scaling to also deal with memory resources, via the online detection of hot memory pages and transparent page migration. Evaluation on an emulated heterogeneous platform uses workload traces from real-world data, demonstrating the ability to provide high on-demand performance while also reducing resource usage for these workloads.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "VEE '15 conference proceedings.", } @Article{Gupta:2015:LBO, author = "Varun Gupta and Ana Radovanovic", title = "{Lagrangian}-based Online Stochastic Bin Packing", journal = j-SIGMETRICS, volume = "43", number = "1", pages = "467--468", month = jun, year = "2015", CODEN = "????", DOI = "https://doi.org/10.1145/2796314.2745897", ISSN = "0163-5999 (print), 1557-9484 (electronic)", ISSN-L = "0163-5999", bibdate = "Fri Sep 18 06:59:51 MDT 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigmetrics.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Motivated by the problem of packing Virtual Machines on physical servers in the cloud, we study the problem of online stochastic bin packing under two settings --- packing with permanent items, and packing under item departures. In the setting with permanent items, we present the first truly distribution-oblivious bin packing heuristic that achieves $ O(\sqrt n) $ regret compared to OPT for all distributions. Our algorithm is essentially gradient descent on suitably defined Lagrangian relaxation of the bin packing Linear Program. We also prove guarantees of our heuristic against non i.i.d. input using a randomly delayed Lyapunov function to smoothen the input. For the setting where items eventually depart, we are interested in minimizing the steady-state number of bins. Our algorithm extends as is to the case of item departures. Further, leveraging the Lagrangian approach, we generalize our algorithm to a setting where the processing time of an item is inflated by a certain known factor depending on the configuration it is packed in.", acknowledgement = ack-nhfb, fjournal = "ACM SIGMETRICS Performance Evaluation Review", journal-URL = "http://portal.acm.org/toc.cfm?id=J618", } @Article{Hsu:2015:LLA, author = "Ching-Hsien Hsu and Kenn D. Slagter and Yeh-Ching Chung", title = "Locality and loading aware virtual machine mapping techniques for optimizing communications in {MapReduce} applications", journal = j-FUT-GEN-COMP-SYS, volume = "53", number = "??", pages = "43--54", month = dec, year = "2015", CODEN = "FGSEVI", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Sat Jul 25 08:56:12 MDT 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X15000989", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X/", } @Article{Hume:2015:SCS, author = "Tom Hume and Des Watson", title = "Short Communication: Is superoptimization viable for {VM} instruction sets?", journal = j-SPE, volume = "45", number = "4", pages = "571--579", month = apr, year = "2015", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/spe.2240", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Sat Mar 14 10:39:31 MDT 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", onlinedate = "21 Nov 2013", } @Article{Hussein:2015:DRM, author = "Ahmed Hussein and Antony L. Hosking and Mathias Payer and Christopher A. Vick", title = "Don't race the memory bus: taming the {GC} leadfoot", journal = j-SIGPLAN, volume = "50", number = "11", pages = "15--27", month = nov, year = "2015", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2887746.2754182", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Feb 16 12:01:44 MST 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Dynamic voltage and frequency scaling (DVFS) is ubiquitous on mobile devices as a mechanism for saving energy. Reducing the clock frequency of a processor allows a corresponding reduction in power consumption, as does turning off idle cores. Garbage collection is a canonical example of the sort of memory-bound workload that best responds to such scaling. Here, we explore the impact of frequency scaling for garbage collection in a real mobile device running Android's Dalvik virtual machine, which uses a concurrent collector. By controlling the frequency of the core on which the concurrent collector thread runs we can reduce power significantly. Running established multi-threaded benchmarks shows that total processor energy can be reduced up to 30\%, with end-to-end performance loss of at most 10\%.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "ISMM '15 conference proceedings.", } @Article{Hwang:2015:RPA, author = "Woomin Hwang and Ki-Woong Park and Kyu Ho Park", title = "Reference Pattern-Aware Instant Memory Balancing for Consolidated Virtual Machines on Manycores", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "26", number = "7", pages = "2036--2050", month = jul, year = "2015", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2014.2340854", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Mon Aug 3 11:58:51 MDT 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.computer.org/csdl/trans/td/2015/07/06860294-abs.html", abstract-URL = "http://www.computer.org/csdl/trans/td/2015/07/06860294-abs.html", acknowledgement = ack-nhfb, journal-URL = "http://www.computer.org/tpds/archives.htm", } @Article{Ilkhechi:2015:NAV, author = "Amir Rahimzadeh Ilkhechi and Ibrahim Korpeoglu and {\"O}zg{\"u}r Ulusoy", title = "Network-aware virtual machine placement in cloud data centers with multiple traffic-intensive components", journal = j-COMP-NET-AMSTERDAM, volume = "91", number = "??", pages = "508--527", day = "14", month = nov, year = "2015", CODEN = "????", ISSN = "1389-1286 (print), 1872-7069 (electronic)", ISSN-L = "1389-1286", bibdate = "Mon Oct 19 06:36:12 MDT 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1389128615003023", acknowledgement = ack-nhfb, fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)", journal-URL = "http://www.sciencedirect.com/science/journal/13891286/", } @Article{Jaffer:2015:IRD, author = "Shehbaz Jaffer and Piyus Kedia and Sorav Bansal", title = "Improving Remote Desktopping Through Adaptive Record\slash Replay", journal = j-SIGPLAN, volume = "50", number = "7", pages = "161--172", month = jul, year = "2015", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2817817.2731193", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Feb 16 12:01:42 MST 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Accessing the display of a computer remotely, is popularly called remote desktopping. Remote desktopping software installs at both the user-facing client computer and the remote server computer; it simulates user's input events at server, and streams the corresponding display changes to client, thus providing an illusion to the user of controlling the remote machine using local input devices (e.g., keyboard/mouse). Many such remote desktopping tools are widely used. We show that if the remote server is a virtual machine (VM) and the client is reasonably powerful (e.g., current laptop and desktop grade hardware), VM deterministic replay capabilities can be used adaptively to significantly reduce the network bandwidth consumption and server-side CPU utilization of a remote desktopping tool. We implement these optimizations in a tool based on Qemu/KVM virtualization platform and VNC remote desktopping platform. Our tool reduces VNC's network bandwidth consumption by up to 9x and server-side CPU utilization by up to 56\% for popular graphics-intensive applications. On the flip side, our techniques consume higher CPU/memory/disk resources at the client. The effect of our optimizations on user-perceived latency is negligible.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "VEE '15 conference proceedings.", } @Article{Jarray:2015:DAV, author = "Abdallah Jarray and Ahmed Karmouch", title = "Decomposition approaches for virtual network embedding with one-shot node and link mapping", journal = j-IEEE-TRANS-NETWORKING, volume = "23", number = "3", pages = "1012--1025", month = jun, year = "2015", CODEN = "IEANEP", DOI = "https://doi.org/10.1109/TNET.2014.2312928", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Mon Sep 14 16:10:54 MDT 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Network virtualization is a promising new resource management approach that allows customized virtual networks (VNs) to be multiplexed on a shared physical infrastructure. In this paper, our focus is on the embedding of VN resources onto this infrastructure. Since this problem is known to be NP-hard, embedding proposals in literature are heuristic-based approaches that restrict the problem space in different dimensions. Limitations of these proposals are: (1) as embedding of VN links and nodes is performed in two separate stages, it may ensue in a high blocking of VN requests and a less efficient usage of substrate resources; and (2) as pricing of embedding resources is based on linear functions, it triggers no competition among VN users in order to maximize infrastructure provider profits. These drawbacks motivate us to propose a mathematical model that makes use of large-scale optimization tools and proposes a Column Generation (CG) formulation of the problem, coupled with branch-and-bound technique or rounding-off heuristic. We also propose a periodical planning of embedding process where profitable VN requests are selected through an auction mechanism. In our experiments with different substrate network topologies and many different VN request patterns, we show a clear advantage of auction-based CG models over present benchmarks.", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771", } @Article{Jarraya:2015:VFR, author = "Yosr Jarraya and Arash Eghtesadi and Sahba Sadri and Mourad Debbabi and Makan Pourzandi", title = "Verification of firewall reconfiguration for virtual machines migrations in the cloud", journal = j-COMP-NET-AMSTERDAM, volume = "93 (part 3)", number = "??", pages = "480--491", day = "24", month = dec, year = "2015", CODEN = "????", ISSN = "1389-1286 (print), 1872-7069 (electronic)", ISSN-L = "1389-1286", bibdate = "Thu Dec 3 09:50:31 MST 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S138912861500376X", acknowledgement = ack-nhfb, fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)", journal-URL = "http://www.sciencedirect.com/science/journal/13891286/", } @Article{Jia:2015:DRA, author = "Xiaohua Jia and Jinhai Wang and Chuanhe Huang and Qin Liu and Kai He and Jing Wang and Peng Li", title = "Dynamic resource allocation based on energy utility maximization using virtual machines in cloud environment", journal = j-INT-J-COMPUT-SYST-SCI-ENG, volume = "30", number = "6", pages = "??--??", month = nov, year = "2015", CODEN = "CSSEEI", ISSN = "0267-6192", ISSN-L = "0267-6192", bibdate = "Sun Apr 2 09:35:33 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/computsystscieng.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "International Journal of Computer Systems Science and Engineering", journal-URL = "http://www.crlpublishing.co.uk/csse", } @Article{Jin:2015:CCC, author = "Hai Jin and Hanfeng Qin and Song Wu and Xuerong Guo", title = "{CCAP}: A Cache Contention-Aware Virtual Machine Placement Approach for {HPC} Cloud", journal = j-INT-J-PARALLEL-PROG, volume = "43", number = "3", pages = "403--420", month = jun, year = "2015", CODEN = "IJPPE5", DOI = "https://doi.org/10.1007/s10766-013-0286-1", ISSN = "0885-7458 (print), 1573-7640 (electronic)", ISSN-L = "0885-7458", bibdate = "Sat Aug 8 12:34:16 MDT 2015", bibsource = "http://link.springer.com/journal/10766/43/3; https://www.math.utah.edu/pub/tex/bib/intjparallelprogram.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer.com/article/10.1007/s10766-013-0286-1", acknowledgement = ack-nhfb, fjournal = "International Journal of Parallel Programming", journal-URL = "http://link.springer.com/journal/10766", } @Article{Jin:2015:HAS, author = "Seongwook Jin and Jinho Seol and Jaehyuk Huh and Seungryoul Maeng", title = "Hardware-Assisted Secure Resource Accounting under a Vulnerable Hypervisor", journal = j-SIGPLAN, volume = "50", number = "7", pages = "201--213", month = jul, year = "2015", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2817817.2731203", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Feb 16 12:01:42 MST 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "With the proliferation of cloud computing to outsource computation in remote servers, the accountability of computational resources has emerged as an important new challenge for both cloud users and providers. Among the cloud resources, CPU and memory are difficult to verify their actual allocation, since the current virtualization techniques attempt to hide the discrepancy between physical and virtual allocations for the two resources. This paper proposes an online verifiable resource accounting technique for CPU and memory allocation for cloud computing. Unlike prior approaches for cloud resource accounting, the proposed accounting mechanism, called Hardware-assisted Resource Accounting (HRA), uses the hardware support for system management mode (SMM) and virtualization to provide secure resource accounting, even if the hypervisor is compromised. Using a secure isolated execution support of SMM, this study investigates two aspects of verifiable resource accounting for cloud systems. First, this paper presents how the hardware-assisted SMM and virtualization techniques can be used to implement the secure resource accounting mechanism even under a compromised hypervisor. Second, the paper investigates a sample-based resource accounting technique to minimize performance overheads. Using a statistical random sampling method, the technique estimates the overall CPU and memory allocation status with 99\%~100\% accuracies and performance degradations of 0.1\%~0.5\%.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "VEE '15 conference proceedings.", } @Article{Jin:2015:HSH, author = "Seongwook Jin and Jeongseob Ahn and Jinho Seol and Sanghoon Cha and Jaehyuk Huh and Seungryoul Maeng", title = "{H-SVM}: Hardware-Assisted Secure Virtual Machines under a Vulnerable Hypervisor", journal = j-IEEE-TRANS-COMPUT, volume = "64", number = "10", pages = "2833--2846", month = "????", year = "2015", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.2015.2389792", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Tue Oct 13 06:51:51 MDT 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Computers", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", } @Article{Jin:2015:PSV, author = "Dong Jin and David M. Nicol", title = "Parallel Simulation and Virtual-Machine-Based Emulation of Software-Defined Networks", journal = j-TOMACS, volume = "26", number = "1", pages = "8:1--8:??", month = dec, year = "2015", CODEN = "ATMCEZ", DOI = "https://doi.org/10.1145/2834116", ISSN = "1049-3301 (print), 1558-1195 (electronic)", ISSN-L = "1049-3301", bibdate = "Fri Jan 8 07:39:46 MST 2016", bibsource = "http://www.acm.org/pubs/contents/journals/tomacs/; https://www.math.utah.edu/pub/tex/bib/tomacs.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "The emerging software-defined networking (SDN) technology decouples the control plane from the data plane in a computer network with open and standardized interfaces, and hence opens up the network designers' options and ability to innovate. The wide adoption of SDN in industry has motivated the development of large-scale, high-fidelity testbeds for evaluation of systems that incorporate SDN. In this article, we develop a framework to support OpenFlow-based SDN simulation and distributed emulation, by leveraging our prior work on a hybrid network testbed with a parallel network simulator and a virtual-machine-based emulation system. We show how to exploit typical SDN controller behaviors to handle performance issues caused by the centralized controller in parallel discrete-event simulation. In particular, we develop an asynchronous synchronization algorithm for passive SDN controllers and design a two-level architecture for active SDN controllers. We evaluate the system performance, showing good scalability. Finally, we present a case study, using the testbed, to evaluate network verification applications in an SDN-based data center network.", acknowledgement = ack-nhfb, articleno = "8", fjournal = "ACM Transactions on Modeling and Computer Simulation", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J781", } @Article{Kasapovic:2015:PVD, author = "Suad Kasapovic and Esmir Biberkic and Lejla Banjanovic-Mehmedovic", title = "Performances of Virtualization in Design of Fully Collapsed Demilitarized Zone", journal = j-INT-J-COMP-APPL, volume = "131", number = "??", pages = "1--6", month = dec, year = "2015", CODEN = "????", DOI = "https://doi.org/10.5120/ijca2015907475", ISSN = "0975-8887", ISSN-L = "0975-8887", bibdate = "Fri Jan 24 09:24:27 MST 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcompappl.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.ijcaonline.org/archives/volume131/number13/23506-2015907475/", acknowledgement = ack-nhfb, ajournal = "Intern. J. of Computer Applications", articleno = "13", fjournal = "International Journal of Computer Applications", journal-URL = "https://www.ijcaonline.org/", } @Article{Kavvadia:2015:EVM, author = "Eleni Kavvadia and Spyros Sagiadinos and Konstantinos Oikonomou and Giorgos Tsioutsiouliklis and Sonia A{\"\i}ssa", title = "Elastic virtual machine placement in cloud computing network environments", journal = j-COMP-NET-AMSTERDAM, volume = "93 (part 3)", number = "??", pages = "435--447", day = "24", month = dec, year = "2015", CODEN = "????", ISSN = "1389-1286 (print), 1872-7069 (electronic)", ISSN-L = "1389-1286", bibdate = "Thu Dec 3 09:50:31 MST 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1389128615003631", acknowledgement = ack-nhfb, fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)", journal-URL = "http://www.sciencedirect.com/science/journal/13891286/", } @Article{Kereki:2015:CCC, author = "Federico Kereki", title = "Concerning containers' connections: on {Docker} networking", journal = j-LINUX-J, volume = "2015", number = "254", pages = "2:1--2:??", month = jun, year = "2015", CODEN = "LIJOFX", ISSN = "1075-3583 (print), 1938-3827 (electronic)", ISSN-L = "1075-3583", bibdate = "Tue Sep 22 17:33:58 MDT 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/linux-journal.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://dl.acm.org/ft_gateway.cfm?id=2807680", abstract = "Link and weave containers to build systems.", acknowledgement = ack-nhfb, articleno = "2", fjournal = "Linux Journal", journal-URL = "http://portal.acm.org/citation.cfm?id=J508", } @Article{Kim:2015:CBR, author = "Chulmin Kim and Kyu Ho Park", title = "Credit-Based Runtime Placement of Virtual Machines on a Single {NUMA} System for {QoS} of Data Access Performance", journal = j-IEEE-TRANS-COMPUT, volume = "64", number = "6", pages = "1633--1646", month = "????", year = "2015", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.2014.2329671", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Wed Jun 10 07:41:35 MDT 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Computers", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", } @Article{Kim:2015:PMS, author = "Changhyeon Kim and Changho Jeon and Wonjoo Lee and Sungil Yang", title = "A parallel migration scheme for fast virtual machine relocation on a cloud cluster", journal = j-J-SUPERCOMPUTING, volume = "71", number = "12", pages = "4623--4645", month = dec, year = "2015", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-015-1563-0", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Mon Jan 25 08:18:10 MST 2016", bibsource = "http://link.springer.com/journal/11227/71/12; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer.com/article/10.1007/s11227-015-1563-0", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Kim:2015:UWM, author = "Huioon Kim and Kyungwon Chun and Hyounggyu Kim and Youngjoo Chung", title = "Utilization of workflow management system for virtual machine instance management on cloud", journal = j-CCPE, volume = "27", number = "17", pages = "5350--5373", day = "10", month = dec, year = "2015", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.3579", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Tue Feb 9 06:13:20 MST 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", onlinedate = "24 Jul 2015", } @Article{Kyle:2015:ADA, author = "Stephen Kyle and Hugh Leather and Bj{\"o}rn Franke and Dave Butcher and Stuart Monteith", title = "Application of Domain-aware Binary Fuzzing to Aid {Android} Virtual Machine Testing", journal = j-SIGPLAN, volume = "50", number = "7", pages = "121--132", month = jul, year = "2015", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2817817.2731198", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Feb 16 12:01:42 MST 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "The development of a new application virtual machine (VM), like the creation of any complex piece of software, is a bug-prone process. In version 5.0, the widely-used Android operating system has changed from the Dalvik VM to the newly-developed ART VM to execute Android applications. As new iterations of this VM are released, how can the developers aim to reduce the number of potentially security-threatening bugs that make it into the final product? In this paper we combine domain-aware binary fuzzing and differential testing to produce DexFuzz, a tool that exploits the presence of multiple modes of execution within a VM to test for defects. These modes of execution include the interpreter and a runtime that executes ahead-of-time compiled code. We find and present a number of bugs in the in-development version of ART in the Android Open Source Project. We also assess DexFuzz's ability to highlight defects in the experimental version of ART released in the previous version of Android, 4.4, finding 189 crashing programs and 15 divergent programs that indicate defects after only 5,000 attempts.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "VEE '15 conference proceedings.", } @Article{Lama:2015:CPP, author = "P. Lama and Xiaobo Zhou", title = "Coordinated Power and Performance Guarantee with Fuzzy {MIMO} Control in Virtualized Server Clusters", journal = j-IEEE-TRANS-COMPUT, volume = "64", number = "1", pages = "97--111", month = jan, year = "2015", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.2013.184", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Wed Jan 21 08:56:46 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Computers", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", keywords = "Accuracy; Adaptation models; artificial neural network; coordinated power; fuzzy control; fuzzy logic; fuzzy MIMO control; Internet; MIMO; MIMO systems; multi-tier Internet applications; multi-tier internet services; multiple input multiple output control; percentile-based response time; performance guarantee; PERFUME system; power aware computing; Power budget; power budget; power consumption; Power demand; Predictive models; proactive control; representative utility based approach; self adaptation; server virtualization; Servers; system throughput; Time factors; virtualisation; virtualized blade servers; virtualized server clusters", } @Article{Li:2015:ARP, author = "Zengxiang Li and Wentong Cai and Stephen John Turner and Xiaorong Li and Ta Nguyen Binh Duong and Rick Siow Mong Goh", title = "Adaptive Resource Provisioning Mechanism in {VEEs} for Improving Performance of {HLA}-Based Simulations", journal = j-TOMACS, volume = "26", number = "1", pages = "1:1--1:??", month = dec, year = "2015", CODEN = "ATMCEZ", DOI = "https://doi.org/10.1145/2717309", ISSN = "1049-3301 (print), 1558-1195 (electronic)", ISSN-L = "1049-3301", bibdate = "Fri Jan 8 07:39:46 MST 2016", bibsource = "http://www.acm.org/pubs/contents/journals/tomacs/; https://www.math.utah.edu/pub/tex/bib/tomacs.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Parallel and distributed simulations (or High-Level Architecture (HLA)-based simulations) employing optimistic synchronization allow federates to advance simulation time freely at the risk of overoptimistic executions and execution rollbacks. As a result, the simulation performance may degrade significantly due to the simulation workload imbalance among federates. In this article, we investigate the execution of parallel and distributed simulations on Cloud and data centers with Virtual Execution Environments (VEEs). In order to speed up simulation execution, an Adaptive Resource Provisioning Mechanism in Virtual Execution Environments (ArmVee) is proposed. It is composed of a performance monitor and a resource manager. The former measures federate performance transparently to the simulation application. The latter distributes available resources among federates based on the measured federate performance. Federates with different simulation workloads are thus able to advance their simulation times with comparable speeds, thus are able to avoid wasting time and resources on overoptimistic executions and execution rollbacks. ArmVee is evaluated using a real-world simulation model with various simulation workload inputs and different parameter settings. The experimental results show that ArmVee is able to speed up the simulation execution significantly. In addition, it also greatly reduces memory usage and is scalable.", acknowledgement = ack-nhfb, articleno = "1", fjournal = "ACM Transactions on Modeling and Computer Simulation", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J781", } @Article{Li:2015:GHB, author = "Dan Li and Jing Zhu and Jianping Wu and Junjie Guan and Ying Zhang", title = "Guaranteeing heterogeneous bandwidth demand in multitenant data center networks", journal = j-IEEE-TRANS-NETWORKING, volume = "23", number = "5", pages = "1648--1660", month = oct, year = "2015", CODEN = "IEANEP", DOI = "https://doi.org/10.1109/TNET.2014.2341246", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Tue Jan 5 18:36:30 MST 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "The ability to provide guaranteed network bandwidth for tenants is essential to the prosperity of cloud computing platforms, as it is a critical step for offering predictable performance to applications. Despite its importance, it is still an open problem for efficient network bandwidth sharing in a multitenant environment, especially when applications have diverse bandwidth requirements. More precisely, it is not only that different tenants have distinct demands, but also that one tenant may want to assign bandwidth differently across her virtual machines (VMs), i.e., the heterogeneous bandwidth requirements. In this paper, we tackle the problem of VM allocation with bandwidth guarantee in multitenant data center networks. We first propose an online VM allocation algorithm that improves on the accuracy of the existing work. Next, we develop a VM allocation algorithm under heterogeneous bandwidth demands. We conduct extensive simulations to demonstrate the efficiency of our method.", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771", } @Article{Li:2015:ITA, author = "Jianxin Li and Jieyu Zhao and Yi Li and Lei Cui and Bo Li and Lu Liu and John Panneerselvam", title = "{iMIG}: Toward an Adaptive Live Migration Method for {KVM} Virtual Machines", journal = j-COMP-J, volume = "58", number = "6", pages = "1227--1242", month = jun, year = "2015", CODEN = "CMPJA6", DOI = "https://doi.org/10.1093/comjnl/bxu065", ISSN = "0010-4620 (print), 1460-2067 (electronic)", ISSN-L = "0010-4620", bibdate = "Fri Jun 12 10:18:23 MDT 2015", bibsource = "http://comjnl.oxfordjournals.org/content/58/6.toc; https://www.math.utah.edu/pub/tex/bib/compj2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://comjnl.oxfordjournals.org/content/58/6/1227", acknowledgement = ack-nhfb, fjournal = "Computer Journal", journal-URL = "http://comjnl.oxfordjournals.org/", onlinedate = "July 22, 2014", } @Article{Li:2015:VMP, author = "Kangkang Li and Huanyang Zheng and Jie Wu and Xiaojiang Du", title = "Virtual machine placement in cloud systems through migration process", journal = j-INT-J-PAR-EMER-DIST-SYS, volume = "30", number = "5", pages = "393--410", year = "2015", CODEN = "????", DOI = "https://doi.org/10.1080/17445760.2014.931957", ISSN = "1744-5760 (print), 1744-5779 (electronic)", ISSN-L = "1744-5760", bibdate = "Tue Nov 17 08:24:26 MST 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjparemerdistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www.tandfonline.com/toc/gpaa20/30/5", acknowledgement = ack-nhfb, fjournal = "International Journal of Parallel, Emergent and Distributed Systems: IJPEDS", journal-URL = "http://www.tandfonline.com/loi/gpaa20", } @Article{Liao:2015:NMA, author = "Xiaofei Liao and Hai Jin and Shizhan Yu and Yu Zhang", title = "A novel memory allocation scheme for memory energy reduction in virtualization environment", journal = j-J-COMP-SYS-SCI, volume = "81", number = "1", pages = "3--15", month = feb, year = "2015", CODEN = "JCSSBM", DOI = "https://doi.org/10.1016/j.jcss.2014.06.018", ISSN = "0022-0000 (print), 1090-2724 (electronic)", ISSN-L = "0022-0000", bibdate = "Tue Jan 29 15:27:27 MST 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jcompsyssci.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0022000014001056", acknowledgement = ack-nhfb, fjournal = "Journal of Computer and System Sciences", journal-URL = "http://www.sciencedirect.com/science/journal/00220000", } @Article{Lin:2015:SGU, author = "Yi Lin and Kunshan Wang and Stephen M. Blackburn and Antony L. Hosking and Michael Norrish", title = "Stop and go: understanding yieldpoint behavior", journal = j-SIGPLAN, volume = "50", number = "11", pages = "70--80", month = nov, year = "2015", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2887746.2754187", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Feb 16 12:01:44 MST 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Yieldpoints are critical to the implementation of high performance garbage collected languages, yet the design space is not well understood. Yieldpoints allow a running program to be interrupted at well-defined points in its execution, facilitating exact garbage collection, biased locking, on-stack replacement, profiling, and other important virtual machine behaviors. In this paper we identify and evaluate yieldpoint design choices, including previously undocumented designs and optimizations. One of the designs we identify opens new opportunities for very low overhead profiling. We measure the frequency with which yieldpoints are executed and establish a methodology for evaluating the common case execution time overhead. We also measure the median and worst case time-to-yield. We find that Java benchmarks execute about 100M yieldpoints per second, of which about 1/20000 are taken. The average execution time overhead for untaken yieldpoints on the VM we use ranges from 2.5\% to close to zero on modern hardware, depending on the design, and we find that the designs trade off total overhead with worst case time-to-yield. This analysis gives new insight into a critical but overlooked aspect of garbage collector implementation, and identifies a new optimization and new opportunities for very low overhead profiling.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "ISMM '15 conference proceedings.", } @Article{Liu:2015:HBC, author = "Haikun Liu and Hai Jin and Xiaofei Liao and Wei Deng and Bingsheng He and Cheng-zhong Xu", title = "Hotplug or Ballooning: A Comparative Study on Dynamic Memory Management Techniques for Virtual Machines", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "26", number = "5", pages = "1350--1363", month = may, year = "2015", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2014.2320915", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Thu Jun 4 19:34:11 MDT 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://csdl.computer.org/csdl/trans/td/2015/05/06807799-abs.html", abstract-URL = "http://csdl.computer.org/csdl/trans/td/2015/05/06807799-abs.html", acknowledgement = ack-nhfb, journal-URL = "http://www.computer.org/tpds/archives.htm", } @Article{Liu:2015:VCL, author = "Haikun Liu and Bingsheng He", title = "{VMbuddies}: Coordinating Live Migration of Multi-Tier Applications in Cloud Environments", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "26", number = "4", pages = "1192--1205", month = apr, year = "2015", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2014.2316152", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Thu Jun 4 19:34:08 MDT 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://csdl.computer.org/csdl/trans/td/2015/04/06784491-abs.html", abstract-URL = "http://csdl.computer.org/csdl/trans/td/2015/04/06784491-abs.html", acknowledgement = ack-nhfb, journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=71", } @Article{Ludwig:2015:DCM, author = "Arne Ludwig and Stefan Schmid", title = "Distributed Cloud Market: Who Benefits from Specification Flexibilities?", journal = j-SIGMETRICS, volume = "43", number = "3", pages = "38--41", month = dec, year = "2015", CODEN = "????", DOI = "https://doi.org/10.1145/2847220.2847230", ISSN = "0163-5999 (print), 1557-9484 (electronic)", ISSN-L = "0163-5999", bibdate = "Fri Dec 11 08:25:00 MST 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigmetrics.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Virtualization is arguably the main innovation motor in the Internet today. Virtualization enables the decoupling of applications from the physical infrastructure, and introduces new mapping and scheduling flexibilities. While the corresponding algorithmic problems are fairly well-understood, we ask: Who reaps the benefits from the virtualization flexibilities? We introduce two simple distributed cloud market models and study this question in two dimensions: (1) a horizontal market where different cloud providers compete for the customer requests, and (2) a vertical market where a broker resells the resources of a cloud provider.", acknowledgement = ack-nhfb, fjournal = "ACM SIGMETRICS Performance Evaluation Review", journal-URL = "http://portal.acm.org/toc.cfm?id=J618", } @Article{Ma:2015:SDS, author = "Jiuyue Ma and Xiufeng Sui and Ninghui Sun and Yupeng Li and Zihao Yu and Bowen Huang and Tianni Xu and Zhicheng Yao and Yun Chen and Haibin Wang and Lixin Zhang and Yungang Bao", title = "Supporting Differentiated Services in Computers via Programmable Architecture for Resourcing-on-Demand {(PARD)}", journal = j-SIGPLAN, volume = "50", number = "4", pages = "131--143", month = apr, year = "2015", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2775054.2694382", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue May 12 17:41:19 MDT 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "This paper presents PARD, a programmable architecture for resourcing-on-demand that provides a new programming interface to convey an application's high-level information like quality-of-service requirements to the hardware. PARD enables new functionalities like fully hardware-supported virtualization and differentiated services in computers. PARD is inspired by the observation that a computer is inherently a network in which hardware components communicate via packets (e.g., over the NoC or PCIe). We apply principles of software-defined networking to this intra-computer network and address three major challenges. First, to deal with the semantic gap between high-level applications and underlying hardware packets, PARD attaches a high-level semantic tag (e.g., a virtual machine or thread ID) to each memory-access, I/O, or interrupt packet. Second, to make hardware components more manageable, PARD implements programmable control planes that can be integrated into various shared resources (e.g., cache, DRAM, and I/O devices) and can differentially process packets according to tag-based rules. Third, to facilitate programming, PARD abstracts all control planes as a device file tree to provide a uniform programming interface via which users create and apply tag-based rules. Full-system simulation results show that by co-locating latency-critical memcached applications with other workloads PARD can improve a four-core computer's CPU utilization by up to a factor of four without significantly increasing tail latency. FPGA emulation based on a preliminary RTL implementation demonstrates that the cache control plane introduces no extra latency and that the memory control plane can reduce queueing delay for high-priority memory-access requests by up to a factor of 5.6.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "ASPLOS '15 conference proceedings.", } @Article{Malik:2015:LMV, author = "Vikas Malik and C. R. Barde", title = "Live Migration of Virtual Machines in Cloud Environment using Prediction of {CPU} Usage", journal = j-INT-J-COMP-APPL, volume = "117", number = "??", pages = "1--5", month = may, year = "2015", CODEN = "????", DOI = "https://doi.org/10.5120/20691-3604", ISSN = "0975-8887", ISSN-L = "0975-8887", bibdate = "Fri Jan 24 09:18:02 MST 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcompappl.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.ijcaonline.org/archives/volume117/number23/20691-3604/", acknowledgement = ack-nhfb, ajournal = "Intern. J. of Computer Applications", articleno = "23", fjournal = "International Journal of Computer Applications", journal-URL = "https://www.ijcaonline.org/", } @Article{Mann:2015:AVM, author = "Zolt{\'a}n {\'A}d{\'a}m Mann", title = "Allocation of Virtual Machines in Cloud Data Centers --- A Survey of Problem Models and Optimization Algorithms", journal = j-COMP-SURV, volume = "48", number = "1", pages = "11:1--11:??", month = sep, year = "2015", CODEN = "CMSVAN", DOI = "https://doi.org/10.1145/2797211", ISSN = "0360-0300 (print), 1557-7341 (electronic)", ISSN-L = "0360-0300", bibdate = "Wed Sep 30 17:08:21 MDT 2015", bibsource = "http://www.acm.org/pubs/contents/journals/surveys/; https://www.math.utah.edu/pub/tex/bib/compsurv.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Data centers in public, private, and hybrid cloud settings make it possible to provision virtual machines (VMs) with unprecedented flexibility. However, purchasing, operating, and maintaining the underlying physical resources incurs significant monetary costs and environmental impact. Therefore, cloud providers must optimize the use of physical resources by a careful allocation of VMs to hosts, continuously balancing between the conflicting requirements on performance and operational costs. In recent years, several algorithms have been proposed for this important optimization problem. Unfortunately, the proposed approaches are hardly comparable because of subtle differences in the used problem models. This article surveys the used problem formulations and optimization algorithms, highlighting their strengths and limitations, and pointing out areas that need further research.", acknowledgement = ack-nhfb, articleno = "11", fjournal = "ACM Computing Surveys", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204", } @Article{Mann:2015:RRE, author = "Zolt{\'a}n {\'A}d{\'a}m Mann", title = "Rigorous results on the effectiveness of some heuristics for the consolidation of virtual machines in a cloud data center", journal = j-FUT-GEN-COMP-SYS, volume = "51", number = "??", pages = "1--6", month = oct, year = "2015", CODEN = "FGSEVI", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Sat Jul 25 08:56:11 MDT 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X15000965", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X/", } @Article{Nejad:2015:SPV, author = "Bijan Chokoufe Nejad and Thorsten Ohl and J{\"u}rgen Reuter", title = "Simple, parallel virtual machines for extreme computations", journal = j-COMP-PHYS-COMM, volume = "196", number = "??", pages = "58--69", month = nov, year = "2015", CODEN = "CPHCBZ", ISSN = "0010-4655 (print), 1879-2944 (electronic)", ISSN-L = "0010-4655", bibdate = "Tue Sep 22 13:45:19 MDT 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/compphyscomm2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0010465515001952", acknowledgement = ack-nhfb, fjournal = "Computer Physics Communications", journal-URL = "http://www.sciencedirect.com/science/journal/00104655/", } @Article{Nejad:2015:TGM, author = "Mahyar Movahed Nejad and Lena Mashayekhy and Daniel Grosu", title = "Truthful Greedy Mechanisms for Dynamic Virtual Machine Provisioning and Allocation in Clouds", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "26", number = "2", pages = "594--603", month = feb, year = "2015", CODEN = "ITDSEO", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Thu Feb 12 13:58:35 MST 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.computer.org/csdl/trans/td/2015/02/06748071-abs.html", abstract-URL = "http://www.computer.org/csdl/trans/td/2015/02/06748071-abs.html", acknowledgement = ack-nhfb, journal-URL = "http://www.computer.org/tpds/archives.htm", } @Article{Ngo:2015:RES, author = "Minh Ngo and Fabio Massacci and Dimiter Milushev and Frank Piessens", title = "Runtime Enforcement of Security Policies on Black Box Reactive Programs", journal = j-SIGPLAN, volume = "50", number = "1", pages = "43--54", month = jan, year = "2015", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2775051.2676978", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue May 12 17:41:19 MDT 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Security enforcement mechanisms like execution monitors are used to make sure that some untrusted program complies with a policy. Different enforcement mechanisms have different strengths and weaknesses and hence it is important to understand the qualities of various enforcement mechanisms. This paper studies runtime enforcement mechanisms for reactive programs. We study the impact of two important constraints that many practical enforcement mechanisms satisfy: (1) the enforcement mechanism must handle each input/output event in finite time and on occurrence of the event (as opposed to for instance Ligatti's edit automata that have the power to buffer events for an arbitrary amount of time), and (2) the enforcement mechanism treats the untrusted program as a black box: it can monitor and/or edit the input/output events that the program exhibits on execution and it can explore alternative executions of the program by running additional copies of the program and providing these different inputs. It can not inspect the source or machine code of the untrusted program. Such enforcement mechanisms are important in practice: they include for instance many execution monitors, virtual machine monitors, and secure multi-execution or shadow executions. We establish upper and lower bounds for the class of policies that are enforceable by such black box mechanisms, and we propose a generic enforcement mechanism that works for a wide range of policies. We also show how our generic enforcement mechanism can be instantiated to enforce specific classes of policies, at the same time showing that many existing enforcement mechanisms are optimized instances of our construction.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "POPL '15 conference proceedings.", } @Article{Nowatzki:2015:ASC, author = "Tony Nowatzki and Jaikrishnan Menon and Chen-Han Ho and Karthikeyan Sankaralingam", title = "Architectural Simulators Considered Harmful", journal = j-IEEE-MICRO, volume = "35", number = "6", pages = "4--12", month = nov # "\slash " # dec, year = "2015", CODEN = "IEMIDZ", DOI = "https://doi.org/10.1109/MM.2015.74", ISSN = "0272-1732 (print), 1937-4143 (electronic)", ISSN-L = "0272-1732", bibdate = "Mon Jan 4 18:19:52 MST 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeemicro.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://csdl.computer.org/csdl/mags/mi/2015/06/mmi2015060004-abs.html", abstract-URL = "http://csdl.computer.org/csdl/mags/mi/2015/06/mmi2015060004-abs.html", acknowledgement = ack-nhfb, journal-URL = "http://www.computer.org/csdl/mags/mi/index.html", } @Article{Oliveira:2015:ORE, author = "Rodrigo R. Oliveira and Daniel S. Marcon and Leonardo R. Bays and Miguel C. Neves and Luciano P. Gaspary and Deep Medhi and Marinho P. Barcellos", title = "{Opportunistic Resilience Embedding (ORE)}: Toward cost-efficient resilient virtual networks", journal = j-COMP-NET-AMSTERDAM, volume = "89", number = "??", pages = "59--77", year = "2015", CODEN = "????", DOI = "https://doi.org/10.1016/j.comnet.2015.07.010", ISSN = "1389-1286 (print), 1872-7069 (electronic)", ISSN-L = "1389-1286", bibdate = "Tue Sep 8 19:39:32 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1389128615002339", acknowledgement = ack-nhfb, keywords = "Multipath embedding; Multiple paths; Network virtualization; Resilience; Survivability; Virtual network embedding", } @Article{Omote:2015:IAE, author = "Yushi Omote and Takahiro Shinagawa and Kazuhiko Kato", title = "Improving Agility and Elasticity in Bare-metal Clouds", journal = j-SIGPLAN, volume = "50", number = "4", pages = "145--159", month = apr, year = "2015", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2775054.2694349", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue May 12 17:41:19 MDT 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Bare-metal clouds are an emerging infrastructure-as-a-service (IaaS) that leases physical machines (bare-metal instances) rather than virtual machines, allowing resource-intensive applications to have exclusive access to physical hardware. Unfortunately, bare-metal instances require time-consuming or OS-specific tasks for deployment due to the lack of virtualization layers, thereby sacrificing several beneficial features of traditional IaaS clouds such as agility, elasticity, and OS transparency. We present BMcast, an OS deployment system with a special-purpose de-virtualizable virtual machine monitor (VMM) that supports quick and OS-transparent startup of bare-metal instances. BMcast performs streaming OS deployment while allowing direct access to physical hardware from the guest OS, and then disappears after completing the deployment. Quick startup of instances improves agility and elasticity significantly, and OS transparency greatly simplifies management tasks for cloud customers. Experimental results have confirmed that BMcast initiated a bare-metal instance 8.6 times faster than image copying, and database performance on BMcast during streaming OS deployment was comparable to that on a state-of-the-art VMM without performing deployment. BMcast incurred zero overhead after de-virtualization.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "ASPLOS '15 conference proceedings.", } @Article{Pfefferle:2015:HVF, author = "Jonas Pfefferle and Patrick Stuedi and Animesh Trivedi and Bernard Metzler and Ionnis Koltsidas and Thomas R. Gross", title = "A Hybrid {I/O} Virtualization Framework for {RDMA}-capable Network Interfaces", journal = j-SIGPLAN, volume = "50", number = "7", pages = "17--30", month = jul, year = "2015", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2817817.2731200", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Feb 16 12:01:42 MST 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "DMA-capable interconnects, providing ultra-low latency and high bandwidth, are increasingly being used in the context of distributed storage and data processing systems. However, the deployment of such systems in virtualized data centers is currently inhibited by the lack of a flexible and high-performance virtualization solution for RDMA network interfaces. In this work, we present a hybrid virtualization architecture which builds upon the concept of separation of paths for control and data operations available in RDMA. With hybrid virtualization, RDMA control operations are virtualized using hypervisor involvement, while data operations are set up to bypass the hypervisor completely. We describe HyV (Hybrid Virtualization), a virtualization framework for RDMA devices implementing such a hybrid architecture. In the paper, we provide a detailed evaluation of HyV for different RDMA technologies and operations. We further demonstrate the advantages of HyV in the context of a real distributed system by running RAMCloud on a set of HyV-enabled virtual machines deployed across a 6-node RDMA cluster. All of the performance results we obtained illustrate that hybrid virtualization enables bare-metal RDMA performance inside virtual machines while retaining the flexibility typically associated with paravirtualization.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "VEE '15 conference proceedings.", } @Article{Pham:2015:SRD, author = "Quan Pham and Severin Thaler and Tanu Malik and Ian Foster and Boris Glavic", title = "Sharing and reproducing database applications", journal = j-PROC-VLDB-ENDOWMENT, volume = "8", number = "12", pages = "1988--1991", month = aug, year = "2015", CODEN = "VLDBFR", DOI = "https://doi.org/10.14778/2824032.2824118", ISSN = "2150-8097", ISSN-L = "2150-8097", bibdate = "Wed Sep 16 18:23:11 MDT 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; https://www.math.utah.edu/pub/tex/bib/vldbe.bib", abstract = "Sharing and repeating scientific applications is crucial for verifying claims, reproducing experimental results (e.g., to repeat a computational experiment described in a publication), and promoting reuse of complex applications. The predominant methods of sharing and making applications repeatable are building a companion web site and/or provisioning a virtual machine image (VMI). Recently, application virtualization (AV), has emerged as a light-weight alternative for sharing and efficient repeatability. AV approaches such as Linux Containers create a chroot-like environment [4], while approaches such as CDE [1] trace system calls during application execution to copy all binaries, data, and software dependencies into a self-contained package.", acknowledgement = ack-nhfb, fjournal = "VLDB Journal: Very Large Data Bases", journal-URL = "http://portal.acm.org/toc.cfm?id=J869", } @Article{Pignolet:2015:ATD, author = "Yvonne Anne Pignolet and Stefan Schmid and Gilles Tredan", title = "Adversarial topology discovery in network virtualization environments: a threat for {ISPs}?", journal = j-DISTRIB-COMPUT, volume = "28", number = "2", pages = "91--109", month = apr, year = "2015", CODEN = "DICOEB", DOI = "https://doi.org/10.1007/s00446-014-0217-4", ISSN = "0178-2770 (print), 1432-0452 (electronic)", ISSN-L = "0178-2770", bibdate = "Mon Aug 1 08:49:26 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/distribcomput.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://link.springer.com/article/10.1007/s00446-014-0217-4", acknowledgement = ack-nhfb, ajournal = "Distrib. comput.", fjournal = "Distributed Computing", journal-URL = "https://link.springer.com/journal/446", } @Article{Rastogi:2015:SEG, author = "Aseem Rastogi and Nikhil Swamy and C{\'e}dric Fournet and Gavin Bierman and Panagiotis Vekris", title = "Safe \& Efficient Gradual Typing for {TypeScript}", journal = j-SIGPLAN, volume = "50", number = "1", pages = "167--180", month = jan, year = "2015", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2775051.2676971", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue May 12 17:41:19 MDT 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Current proposals for adding gradual typing to JavaScript, such as Closure, TypeScript and Dart, forgo soundness to deal with issues of scale, code reuse, and popular programming patterns. We show how to address these issues in practice while retaining soundness. We design and implement a new gradual type system, prototyped for expediency as a 'Safe' compilation mode for TypeScript. Our compiler achieves soundness by enforcing stricter static checks and embedding residual runtime checks in compiled code. It emits plain JavaScript that runs on stock virtual machines. Our main theorem is a simulation that ensures that the checks introduced by Safe TypeScript (1) catch any dynamic type error, and (2) do not alter the semantics of type-safe TypeScript code. Safe TypeScript is carefully designed to minimize the performance overhead of runtime checks. At its core, we rely on two new ideas: differential subtyping, a new form of coercive subtyping that computes the minimum amount of runtime type information that must be added to each object; and an erasure modality, which we use to safely and selectively erase type information. This allows us to scale our design to full-fledged TypeScript, including arrays, maps, classes, inheritance, overloading, and generic types. We validate the usability and performance of Safe TypeScript empirically by type-checking and compiling around 120,000 lines of existing TypeScript source code. Although runtime checks can be expensive, the end-to-end overhead is small for code bases that already have type annotations. For instance, we bootstrap the Safe TypeScript compiler (90,000 lines including the base TypeScript compiler): we measure a 15\% runtime overhead for type safety, and also uncover programming errors as type safety violations. We conclude that, at least during development and testing, subjecting JavaScript/TypeScript programs to safe gradual typing adds significant value to source type annotations at a modest cost.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "POPL '15 conference proceedings.", } @Article{Reano:2015:IUE, author = "Carlos Rea{\~n}o and Federico Silla and Adri{\'a}n Castell{\'o} and Antonio J. Pe{\~n}a and Rafael Mayo and Enrique S. Quintana-Ort{\'\i} and Jos{\'e} Duato", title = "Improving the user experience of the {rCUDA} remote {GPU} virtualization framework", journal = j-CCPE, volume = "27", number = "14", pages = "3746--3770", day = "25", month = sep, year = "2015", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.3409", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Mon Sep 28 09:32:54 MDT 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", onlinedate = "10 Oct 2014", } @Article{Roy:2015:SCP, author = "Arpan Roy and Santonu Sarkar and Rajeshwari Ganesan and Geetika Goel", title = "Secure the Cloud: From the Perspective of a Service-Oriented Organization", journal = j-COMP-SURV, volume = "47", number = "3", pages = "41:1--41:??", month = apr, year = "2015", CODEN = "CMSVAN", DOI = "https://doi.org/10.1145/2693841", ISSN = "0360-0300 (print), 1557-7341 (electronic)", ISSN-L = "0360-0300", bibdate = "Thu Apr 16 18:47:49 MDT 2015", bibsource = "http://www.acm.org/pubs/contents/journals/surveys/; https://www.math.utah.edu/pub/tex/bib/compsurv.bib; https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "In response to the revival of virtualized technology by Rosenblum and Garfinkel [2005], NIST defined cloud computing, a new paradigm in service computing infrastructures. In cloud environments, the basic security mechanism is ingrained in virtualization --- that is, the execution of instructions at different privilege levels. Despite its obvious benefits, the caveat is that a crashed virtual machine (VM) is much harder to recover than a crashed workstation. When crashed, a VM is nothing but a giant corrupt binary file and quite unrecoverable by standard disk-based forensics. Therefore, VM crashes should be avoided at all costs. Security is one of the major contributors to such VM crashes. This includes compromising the hypervisor, cloud storage, images of VMs used infrequently, and remote cloud client used by the customer as well as threat from malicious insiders. Although using secure infrastructures such as private clouds alleviate several of these security problems, most cloud users end up using cheaper options such as third-party infrastructures (i.e., private clouds), thus a thorough discussion of all known security issues is pertinent. Hence, in this article, we discuss ongoing research in cloud security in order of the attack scenarios exploited most often in the cloud environment. We explore attack scenarios that call for securing the hypervisor, exploiting co-residency of VMs, VM image management, mitigating insider threats, securing storage in clouds, abusing lightweight software-as-a-service clients, and protecting data propagation in clouds. Wearing a practitioner's glasses, we explore the relevance of each attack scenario to a service company like Infosys. At the same time, we draw parallels between cloud security research and implementation of security solutions in the form of enterprise security suites for the cloud. We discuss the state of practice in the form of enterprise security suites that include cryptographic solutions, access control policies in the cloud, new techniques for attack detection, and security quality assurance in clouds.", acknowledgement = ack-nhfb, articleno = "41", fjournal = "ACM Computing Surveys", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204", } @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 = "https://www.math.utah.edu/pub/tex/bib/sigops.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{Singh:2015:TVC, author = "Rayman Preet Singh and Tim Brecht and S. Keshav", title = "Towards {VM} Consolidation Using a Hierarchy of Idle States", journal = j-SIGPLAN, volume = "50", number = "7", pages = "107--119", month = jul, year = "2015", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2817817.2731195", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Feb 16 12:01:42 MST 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Typical VM consolidation approaches re-pack VMs into fewer physical machines, resulting in energy and cost savings [13, 19, 23, 40]. Recent work has explored a just-in time approach to VM consolidation by transitioning VMsto an inactive state when idle and activating them on the arrival of client requests[17, 21]. This leads to increased VM density at the cost of an increase in client request latency (called miss penalty ). The VM density so obtained, although greater, is still limited by the number of VMs that can be hosted in the one inactive state. If idle VMs were hosted in multiple inactive states, VM density can be increased further while ensuring small miss penalties. However, VMs in different inactive states have different capacities, activation times, and resource requirements. Therefore, a key question is: How should VMs be transitioned between different states to minimize the expected miss penalty? This paper explores the hosting of idle VMs in a hierarchy of multiple such inactive states, and studies the effect of different idle VMmanagement policies on VMdensity and miss penalties. We formulate a mathematical model for the problem, and provide a theoretical lower bound on the miss penalty. Using an off-the-shelf virtualization solution (LXC [2]), we demonstrate how the required model parameters can be obtained. We evaluate a variety of policies and quantify their miss penalties for different VM densities. We observe that some policies consolidate up to 550 VMs per machine with average miss penalties smaller than 1 ms.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "VEE '15 conference proceedings.", } @Article{Steindorfer:2015:OHA, author = "Michael J. Steindorfer and Jurgen J. Vinju", title = "Optimizing hash-array mapped tries for fast and lean immutable {JVM} collections", journal = j-SIGPLAN, volume = "50", number = "10", pages = "783--800", month = oct, year = "2015", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2858965.2814312", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Feb 16 12:01:43 MST 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/hash.bib; https://www.math.utah.edu/pub/tex/bib/java2010.bib; https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "The data structures under-pinning collection API (e.g. lists, sets, maps) in the standard libraries of programming languages are used intensively in many applications. The standard libraries of recent Java Virtual Machine languages, such as Clojure or Scala, contain scalable and well-performing immutable collection data structures that are implemented as Hash-Array Mapped Tries (HAMTs). HAMTs already feature efficient lookup, insert, and delete operations, however due to their tree-based nature their memory footprints and the runtime performance of iteration and equality checking lag behind array-based counterparts. This particularly prohibits their application in programs which process larger data sets. In this paper, we propose changes to the HAMT design that increase the overall performance of immutable sets and maps. The resulting general purpose design increases cache locality and features a canonical representation. It outperforms Scala's and Clojure's data structure implementations in terms of memory footprint and runtime efficiency of iteration (1.3-6.7x) and equality checking (3-25.4x).", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "OOPSLA '15 conference proceedings.", } @Article{Steinert:2015:OVS, author = "Bastian Steinert and Lauritz Thamsen and Tim Felgentreff and Robert Hirschfeld", title = "Object versioning to support recovery needs: using proxies to preserve previous development states in lively", journal = j-SIGPLAN, volume = "50", number = "2", pages = "113--124", month = feb, year = "2015", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2775052.2661093", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue May 12 17:41:21 MDT 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "We present object versioning as a generic approach to preserve access to previous development and application states. Version-aware references can manage the modifications made to the target object and record versions as desired. Such references can be provided without modifications to the virtual machine. We used proxies to implement the proposed concepts and demonstrate the Lively Kernel running on top of this object versioning layer. This enables Lively users to undo the effects of direct manipulation and other programming actions.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "DLS '14 conference proceedings.", } @Article{Suneja:2015:EVI, author = "Sahil Suneja and Canturk Isci and Eyal de Lara and Vasanth Bala", title = "Exploring {VM} Introspection: Techniques and Trade-offs", journal = j-SIGPLAN, volume = "50", number = "7", pages = "133--146", month = jul, year = "2015", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2817817.2731196", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Feb 16 12:01:42 MST 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "While there are a variety of existing virtual machine introspection (VMI) techniques, their latency, overhead, complexity and consistency trade-offs are not clear. In this work, we address this gap by first organizing the various existing VMI techniques into a taxonomy based upon their operational principles, so that they can be put into context. Next we perform a thorough exploration of their trade-offs both qualitatively and quantitatively. We present a comprehensive set of observations and best practices for efficient, accurate and consistent VMI operation based on our experiences with these techniques. Our results show the stunning range of variations in performance, complexity and overhead with different VMI techniques.We further present a deep dive on VMI consistency aspects to understand the sources of inconsistency in observed VM state and show that, contrary to common expectation, pause-and-introspect based VMI techniques achieve very little to improve consistency despite their substantial performance impact.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "VEE '15 conference proceedings.", } @Article{Tu:2015:CIE, author = "Cheng-Chun Tu and Michael Ferdman and Chao-tung Lee and Tzi-cker Chiueh", title = "A Comprehensive Implementation and Evaluation of Direct Interrupt Delivery", journal = j-SIGPLAN, volume = "50", number = "7", pages = "1--15", month = jul, year = "2015", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2817817.2731189", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Feb 16 12:01:42 MST 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "As the performance overhead associated with CPU and memory virtualization becomes largely negligible, research efforts are directed toward reducing the I/O virtualization overhead, which mainly comes from two sources: DMA set-up and payload copy, and interrupt delivery. The advent of SRIOV and MRIOV effectively reduces the DMA-related virtualization overhead to a minimum. Therefore, the last battleground for minimizing virtualization overhead is how to directly deliver every interrupt to its target VM without involving the hypervisor. This paper describes the design, implementation, and evaluation of a KVM-based direct interrupt delivery system called DID. DID delivers interrupts from SRIOV devices, virtual devices, and timers to their target VMs directly, completely avoiding VM exits. Moreover, DID does not require any modifications to the VM's operating system and preserves the correct priority among interrupts in all cases. We demonstrate that DID reduces the number of VM exits by a factor of 100 for I/O-intensive workloads, decreases the interrupt invocation latency by 80\%, and improves the throughput of a VM running Memcached by a factor of 3.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "VEE '15 conference proceedings.", } @Article{Upadhyaya:2015:EML, author = "Ganesha Upadhyaya and Hridesh Rajan", title = "Effectively mapping linguistic abstractions for message-passing concurrency to threads on the {Java Virtual Machine}", journal = j-SIGPLAN, volume = "50", number = "10", pages = "840--859", month = oct, year = "2015", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2858965.2814289", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Feb 16 12:01:43 MST 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2010.bib; https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Efficient mapping of message passing concurrency (MPC) abstractions to Java Virtual Machine (JVM) threads is critical for performance, scalability, and CPU utilization; but tedious and time consuming to perform manually. In general, this mapping cannot be found in polynomial time, but we show that by exploiting the local characteristics of MPC abstractions and their communication patterns this mapping can be determined effectively. We describe our MPC abstraction to thread mapping technique, its realization in two frameworks (Panini and Akka), and its rigorous evaluation using several benchmarks from representative MPC frameworks. We also compare our technique against four default mapping techniques: thread-all, round-robin-task-all, random-task-all and work-stealing. Our evaluation shows that our mapping technique can improve the performance by 30\%-60\% over default mapping techniques. These improvements are due to a number of challenges addressed by our technique namely: (i) balancing the computations across JVM threads, (ii) reducing the communication overheads, (iii) utilizing information about cache locality, and (iv) mapping MPC abstractions to threads in a way that reduces the contention between JVM threads.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "OOPSLA '15 conference proceedings.", } @Article{Wang:2015:DAA, author = "Hui Wang and Canturk Isci and Lavanya Subramanian and Jongmoo Choi and Depei Qian and Onur Mutlu", title = "{A-DRM}: Architecture-aware Distributed Resource Management of Virtualized Clusters", journal = j-SIGPLAN, volume = "50", number = "7", pages = "93--106", month = jul, year = "2015", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2817817.2731202", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Feb 16 12:01:42 MST 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Virtualization technologies has been widely adopted by large-scale cloud computing platforms. These virtualized systems employ distributed resource management (DRM) to achieve high resource utilization and energy savings by dynamically migrating and consolidating virtual machines. DRM schemes usually use operating-system-level metrics, such as CPU utilization, memory capacity demand and I/O utilization, to detect and balance resource contention. However, they are oblivious to microarchitecture-level resource interference (e.g., memory bandwidth contention between different VMs running on a host), which is currently not exposed to the operating system. We observe that the lack of visibility into microarchitecture-level resource interference significantly impacts the performance of virtualized systems. Motivated by this observation, we propose a novel architecture-aware DRM scheme (ADRM), that takes into account microarchitecture-level resource interference when making migration decisions in a virtualized cluster. ADRM makes use of three core techniques: (1) a profiler to monitor the microarchitecture-level resource usage behavior online for each physical host, (2) a memory bandwidth interference model to assess the interference degree among virtual machines on a host, and (3) a cost-benefit analysis to determine a candidate virtual machine and a host for migration. Real system experiments on thirty randomly selected combinations of applications from the CPU2006, PARSEC, STREAM, NAS Parallel Benchmark suites in a four-host virtualized cluster show that ADRM can improve performance by up to 26.55\%, with an average of 9.67\%, compared to traditional DRM schemes that lack visibility into microarchitecture-level resource utilization and contention.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "VEE '15 conference proceedings.", } @Article{Wang:2015:HPI, author = "Zhe Wang and Jianjun Li and Chenggang Wu and Dongyan Yang and Zhenjiang Wang and Wei-Chung Hsu and Bin Li and Yong Guan", title = "{HSPT}: Practical Implementation and Efficient Management of Embedded Shadow Page Tables for Cross-{ISA} System Virtual Machines", journal = j-SIGPLAN, volume = "50", number = "7", pages = "53--64", month = jul, year = "2015", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2817817.2731188", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Feb 16 12:01:42 MST 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Cross-ISA (Instruction Set Architecture) system-level virtual machine has a significant research and practical value. For example, several recently announced virtual smart phones for iOS which run smart phone applications on x86 based PCs are deployed on cross-ISA system level virtual machines. Also, for mobile device application development, by emulating the Android/ARM environment on the more powerful x86-64 platform, application development and debugging become more convenient and productive. However, the virtualization layer often incurs high performance overhead. The key overhead comes from memory virtualization where a guest virtual address (GVA) must go through multi-level address translation to become a host physical address (HPA). The Embedded Shadow Page Table (ESPT) approach has been proposed to effectively decrease this address translation cost. ESPT directly maps GVA to HPA, thus avoid the lengthy guest virtual to guest physical, guest physical to host virtual, and host virtual to host physical address translation. However, the original ESPT work has a few drawbacks. For example, its implementation relies on a loadable kernel module (LKM) to manage the shadow page table. Using LKMs is less desirable for system virtual machines due to portability, security and maintainability concerns. Our work proposes a different, yet more practical, implementation to address the shortcomings. Instead of relying on using LKMs, our approach adopts a shared memory mapping scheme to maintain the shadow page table (SPT) using only ''mmap'' system call. Furthermore, this work studies the support of SPT for multi-processing in greater details. It devices three different SPT organizations and evaluates their strength and weakness with standard and real Android applications on the system virtual machine which emulates the Android/ARM platform on x86-64 systems.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "VEE '15 conference proceedings.", } @Article{Wang:2015:HRR, author = "Jihe Wang and Meikang Qiu and Bing Guo", title = "High reliable real-time bandwidth scheduling for virtual machines with hidden {Markov} predicting in telehealth platform", journal = j-FUT-GEN-COMP-SYS, volume = "49", number = "??", pages = "68--76", month = aug, year = "2015", CODEN = "FGSEVI", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Wed Apr 29 07:41:59 MDT 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X1400154X", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X/", } @Article{Wang:2015:IJV, author = "Yang Wang and Kenneth B. Kent and Graeme Johnson", title = "Improving {J9} virtual machine with {LTTng} for efficient and effective tracing", journal = j-SPE, volume = "45", number = "7", pages = "973--987", month = jul, year = "2015", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/spe.2282", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Sat Jul 25 19:41:36 MDT 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", onlinedate = "29 Jul 2014", } @Article{Weng:2015:TEI, author = "Chuliang Weng and Jianfeng Zhan and Yuan Luo", title = "{TSAC}: Enforcing Isolation of Virtual Machines in Clouds", journal = j-IEEE-TRANS-COMPUT, volume = "64", number = "5", pages = "1470--1482", month = "????", year = "2015", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.2014.2322608", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Thu Jun 4 19:46:44 MDT 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Computers", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", } @Article{Wessel:2015:IMD, author = "Sascha Wessel and Manuel Huber and Frederic Stumpf and Claudia Eckert", title = "Improving mobile device security with operating system-level virtualization", journal = j-COMPUT-SECUR, volume = "52", number = "??", pages = "207--220", month = jul, year = "2015", CODEN = "CPSEDU", ISSN = "0167-4048 (print), 1872-6208 (electronic)", ISSN-L = "0167-4048", bibdate = "Mon Sep 23 09:46:42 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.sciencedirect.com/science/article/pii/S0167404815000206", acknowledgement = ack-nhfb, fjournal = "Computers \& Security", journal-URL = "https://www.sciencedirect.com/science/journal/01674048", } @Article{Wood:2015:CDP, author = "Timothy Wood and K. K. Ramakrishnan and Prashant Shenoy and Jacobus {Van Der Merwe} and Jinho Hwang and Guyue Liu and Lucas Chaufournier", title = "{CloudNet}: dynamic pooling of cloud resources by live {WAN} migration of virtual machines", journal = j-IEEE-TRANS-NETWORKING, volume = "23", number = "5", pages = "1568--1583", month = oct, year = "2015", CODEN = "IEANEP", DOI = "https://doi.org/10.1109/TNET.2014.2343945", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Tue Jan 5 18:36:30 MST 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Virtualization technology and the ease with which virtual machines (VMs) can be migrated within the LAN have changed the scope of resource management from allocating resources on a single server to manipulating pools of resources within a data center. We expect WAN migration of virtual machines to likewise transform the scope of provisioning resources from a single data center to multiple data centers spread across the country or around the world. In this paper, we present the CloudNet architecture consisting of cloud computing platforms linked with a virtual private network (VPN)-based network infrastructure to provide seamless and secure connectivity between enterprise and cloud data center sites. To realize our vision of efficiently pooling geographically distributed data center resources, CloudNet provides optimized support for live WAN migration of virtual machines. Specifically, we present a set of optimizations that minimize the cost of transferring storage and virtual machine memory during migrations over low bandwidth and high-latency Internet links. We evaluate our system on an operational cloud platform distributed across the continental US. During simultaneous migrations of four VMs between data centers in Texas and Illinois, CloudNet's optimizations reduce memory migration time by 65\% and lower bandwidth consumption for the storage and memory transfer by 19 GB, a 50\% reduction.", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771", } @Article{Wu:2015:WHS, author = "Zhenyu Wu and Zhang Xu and Haining Wang", title = "Whispers in the hyper-space: high-bandwidth and reliable covert channel attacks inside the cloud", journal = j-IEEE-TRANS-NETWORKING, volume = "23", number = "2", pages = "603--614", month = apr, year = "2015", CODEN = "IEANEP", DOI = "https://doi.org/10.1109/TNET.2014.2304439", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Fri Aug 28 06:01:29 MDT 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Privacy and information security in general are major concerns that impede enterprise adaptation of shared or public cloud computing. Specifically, the concern of virtual machine (VM) physical co-residency stems from the threat that hostile tenants can leverage various forms of side channels (such as cache covert channels) to exfiltrate sensitive information of victims on the same physical system. However, on virtualized x86 systems, covert channel attacks have not yet proven to be practical, and thus the threat is widely considered a ``potential risk.'' In this paper, we present a novel covert channel attack that is capable of high-bandwidth and reliable data transmission in the cloud. We first study the application of existing cache channel techniques in a virtualized environment and uncover their major insufficiency and difficulties. We then overcome these obstacles by: (1) redesigning a pure timing-based data transmission scheme, and (2) exploiting the memory bus as a high-bandwidth covert channel medium. We further design and implement a robust communication protocol and demonstrate realistic covert channel attacks on various virtualized x86 systems. Our experimental results show that covert channels do pose serious threats to information security in the cloud. Finally, we discuss our insights on covert channel mitigation in virtualized environments.", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771", } @Article{Xie:2015:PDC, author = "Qiaomin Xie and Xiaobo Dong and Yi Lu and Rayadurgam Srikant", title = "Power of $d$ Choices for Large-Scale Bin Packing: a Loss Model", journal = j-SIGMETRICS, volume = "43", number = "1", pages = "321--334", month = jun, year = "2015", CODEN = "????", DOI = "https://doi.org/10.1145/2796314.2745849", ISSN = "0163-5999 (print), 1557-9484 (electronic)", ISSN-L = "0163-5999", bibdate = "Fri Sep 18 06:59:51 MDT 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigmetrics.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "We consider a system of $N$ parallel servers, where each server consists of B units of a resource. Jobs arrive at this system according to a Poisson process, and each job stays in the system for an exponentially distributed amount of time. Each job may request different units of the resource from the system. The goal is to understand how to route arriving jobs to the servers to minimize the probability that an arriving job does not find the required amount of resource at the server, i.e., the goal is to minimize blocking probability. The motivation for this problem arises from the design of cloud computing systems in which the jobs are virtual machines (VMs) that request resources such as memory from a large pool of servers. In this paper, we consider power-of- d -choices routing, where a job is routed to the server with the largest amount of available resource among $ d \geq 2$ randomly chosen servers. We consider a fluid model that corresponds to the limit as N goes to infinity and provide an explicit upper bound for the equilibrium blocking probability. We show that the upper bound exhibits different behavior as B goes to infinity depending on the relationship between the total traffic intensity \lambda and B. In particular, if $ (B - \lambda) / \sqrt {\lambda } \to \alpha $, the upper bound is doubly exponential in $ \sqrt {\lambda }$ and if $ (B - \lambda) / \log_d \lambda \to \beta $, $ \beta > 1$, the upper bound is exponential in $ \lambda $. Simulation results show that the blocking probability, even for small B, exhibits qualitatively different behavior in the two traffic regimes. This is in contrast with the result for random routing, where the blocking probability scales as $ O (1 / \sqrt \lambda)$ even if $ (B - \lambda) / \sqrt {\lambda } \to \alpha $.", acknowledgement = ack-nhfb, fjournal = "ACM SIGMETRICS Performance Evaluation Review", journal-URL = "http://portal.acm.org/toc.cfm?id=J618", } @Article{Xie:2015:SSV, author = "Ruitao Xie and Yonggang Wen and Xiaohua Jia and Haiyong Xie", title = "Supporting Seamless Virtual Machine Migration via Named Data Networking in Cloud Data Center", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "26", number = "12", pages = "3485--3497", month = dec, year = "2015", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2014.2377119", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Tue Nov 17 06:28:07 MST 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://csdl.computer.org/csdl/trans/td/2015/12/06975186-abs.html", abstract-URL = "http://csdl.computer.org/csdl/trans/td/2015/12/06975186-abs.html", acknowledgement = ack-nhfb, journal-URL = "http://www.computer.org/tpds/archives.htm", } @Article{Xing:2015:OIB, author = "Bin Xing and Zhen Han and Xiaolin Chang and Jiqiang Liu", title = "{OB--IMA}: out-of-the-box integrity measurement approach for guest virtual machines", journal = j-CCPE, volume = "27", number = "5", pages = "1092--1109", day = "10", month = apr, year = "2015", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.3273", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Sat Jul 25 19:54:07 MDT 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", onlinedate = "11 Apr 2014", } @Article{Xu:2015:RSV, author = "Xiaolin Xu and Hai Jin and Song Wu and Yihong Wang", title = "Rethink the storage of virtual machine images in clouds", journal = j-FUT-GEN-COMP-SYS, volume = "50", number = "??", pages = "75--86", month = sep, year = "2015", CODEN = "FGSEVI", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Fri Jun 5 10:18:40 MDT 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X14001885", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X/", } @Article{Yao:2015:MEV, author = "Hong Yao and Changmin Bai and Deze Zeng and Qingzhong Liang and Yuanyuan Fan", title = "Migrate or not? {Exploring} virtual machine migration in roadside cloudlet-based vehicular cloud", journal = j-CCPE, volume = "27", number = "18", pages = "5780--5792", day = "25", month = dec, year = "2015", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.3642", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Tue Feb 9 06:13:20 MST 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", onlinedate = "7 Oct 2015", } @Article{Ye:2015:PBW, author = "Kejiang Ye and Zhaohui Wu and Chen Wang and Bing Bing Zhou and Weisheng Si and Xiaohong Jiang and Albert Y. Zomaya", title = "Profiling-Based Workload Consolidation and Migration in Virtualized Data Centers", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "26", number = "3", pages = "878--890", month = mar, year = "2015", CODEN = "ITDSEO", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Thu Feb 12 13:58:36 MST 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.computer.org/csdl/trans/td/2015/03/06777568-abs.html", abstract-URL = "http://www.computer.org/csdl/trans/td/2015/03/06777568-abs.html", acknowledgement = ack-nhfb, journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=71", } @Article{Yi:2015:ESF, author = "Qiuping Yi and Zijiang Yang and Jian Liu and Chen Zhao and Chao Wang", title = "Explaining Software Failures by Cascade Fault Localization", journal = j-TODAES, volume = "20", number = "3", pages = "41:1--41:??", month = jun, year = "2015", CODEN = "ATASFO", DOI = "https://doi.org/10.1145/2738038", ISSN = "1084-4309 (print), 1557-7309 (electronic)", ISSN-L = "1084-4309", bibdate = "Fri Aug 7 08:47:44 MDT 2015", bibsource = "http://www.acm.org/pubs/contents/journals/todaes/; https://www.math.utah.edu/pub/tex/bib/gnu.bib; https://www.math.utah.edu/pub/tex/bib/todaes.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "During software debugging, a significant amount of effort is required for programmers to identify the root cause of a manifested failure. In this article, we propose a cascade fault localization method to help speed up this labor-intensive process via a combination of weakest precondition computation and constraint solving. Our approach produces a cause tree, where each node is a potential cause of the failure and each edge represents a casual relationship between two causes. There are two main contributions of this article that differentiate our approach from existing methods. First, our method systematically computes all potential causes of a failure and augments each cause with a proper context for ease of comprehension by the user. Second, our method organizes the potential causes in a tree structure to enable on-the-fly pruning based on domain knowledge and feedback from the user. We have implemented our new method in a software tool called CaFL, which builds upon the LLVM compiler and KLEE symbolic virtual machine. We have conducted experiments on a large set of public benchmarks, including real applications from GNU Coreutils and Busybox. Our results show that in most cases the user has to examine only a small fraction of the execution trace before identifying the root cause of the failure.", acknowledgement = ack-nhfb, articleno = "41", fjournal = "ACM Transactions on Design Automation of Electronic Systems", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J776", } @Article{Yoginath:2015:EPD, author = "Srikanth B. Yoginath and Kalyan S. Perumalla", title = "Efficient Parallel Discrete Event Simulation on Cloud\slash Virtual Machine Platforms", journal = j-TOMACS, volume = "26", number = "1", pages = "5:1--5:??", month = dec, year = "2015", CODEN = "ATMCEZ", DOI = "https://doi.org/10.1145/2746232", ISSN = "1049-3301 (print), 1558-1195 (electronic)", ISSN-L = "1049-3301", bibdate = "Fri Jan 8 07:39:46 MST 2016", bibsource = "http://www.acm.org/pubs/contents/journals/tomacs/; https://www.math.utah.edu/pub/tex/bib/tomacs.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Cloud and Virtual Machine (VM) technologies present new challenges with respect to performance and monetary cost in executing parallel discrete event simulation (PDES) applications. Due to the introduction of overall cost as a metric, the traditional use of the highest-end computing configuration is no longer the most obvious choice. Moreover, the unique runtime dynamics and configuration choices of Cloud and VM platforms introduce new design considerations and runtime characteristics specific to PDES over Cloud/VMs. Here, an empirical study is presented to help understand the dynamics, trends, and trade-offs in executing PDES on Cloud/VM platforms. Performance and cost measures obtained from multiple PDES applications executed on the Amazon EC2 Cloud and on a high-end VM host machine reveal new, counterintuitive VM--PDES dynamics and guidelines. One of the critical aspects uncovered is the fundamental mismatch in hypervisor scheduler policies designed for general Cloud workloads versus the virtual time ordering needed for PDES workloads. This insight is supported by experimental data revealing the gross deterioration in PDES performance traceable to VM scheduling policy. To overcome this fundamental problem, the design and implementation of a new deadlock-free scheduler algorithm are presented, optimized specifically for PDES applications on VMs. The scalability of our scheduler has been tested in up to 128 VMs multiplexed on 32 cores, showing significant improvement in the runtime relative to the default Cloud/VM scheduler. The observations, algorithmic design, and results are timely for emerging Cloud/VM-based installations, highlighting the need for PDES-specific support in high-performance discrete event simulations on Cloud/VM platforms.", acknowledgement = ack-nhfb, articleno = "5", fjournal = "ACM Transactions on Modeling and Computer Simulation", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J781", } @Article{You:2015:VFO, author = "Yi-Ping You and Hen-Jung Wu and Yeh-Ning Tsai and Yen-Ting Chao", title = "{VirtCL}: a framework for {OpenCL} device abstraction and management", journal = j-SIGPLAN, volume = "50", number = "8", pages = "161--172", month = aug, year = "2015", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2858788.2688505", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Feb 16 12:01:42 MST 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/pvm.bib; https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "The interest in using multiple graphics processing units (GPUs) to accelerate applications has increased in recent years. However, the existing heterogeneous programming models (e.g., OpenCL) abstract details of GPU devices at the per-device level and require programmers to explicitly schedule their kernel tasks on a system equipped with multiple GPU devices. Unfortunately, multiple applications running on a multi-GPU system may compete for some of the GPU devices while leaving other GPU devices unused. Moreover, the distributed memory model defined in OpenCL, where each device has its own memory space, increases the complexity of managing the memory among multiple GPU devices. In this article we propose a framework (called VirtCL) that reduces the programming burden by acting as a layer between the programmer and the native OpenCL run-time system for abstracting multiple devices into a single virtual device and for scheduling computations and communications among the multiple devices. VirtCL comprises two main components: (1) a front-end library, which exposes primary OpenCL APIs and the virtual device, and (2) a back-end run-time system (called CLDaemon) for scheduling and dispatching kernel tasks based on a history-based scheduler. The front-end library forwards computation requests to the back-end CLDaemon, which then schedules and dispatches the requests. We also propose a history-based scheduler that is able to schedule kernel tasks in a contention- and communication-aware manner. Experiments demonstrated that the VirtCL framework introduced a small overhead (mean of 6\%) but outperformed the native OpenCL run-time system for most benchmarks in the Rodinia benchmark suite, which was due to the abstraction layer eliminating the time-consuming initialization of OpenCL contexts. We also evaluated different scheduling policies in VirtCL with a real-world application (clsurf) and various synthetic workload traces. The results indicated that the VirtCL framework provides scalability for multiple kernel tasks running on multi-GPU systems.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "PPoPP '15 conference proceedings.", } @Article{Younge:2015:SHP, author = "Andrew J. Younge and John Paul Walters and Stephen P. Crago and Geoffrey C. Fox", title = "Supporting High Performance Molecular Dynamics in Virtualized Clusters using {IOMMU}, {SR-IOV}, and {GPUDirect}", journal = j-SIGPLAN, volume = "50", number = "7", pages = "31--38", month = jul, year = "2015", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2817817.2731194", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Feb 16 12:01:42 MST 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Cloud Infrastructure-as-a-Service paradigms have recently shown their utility for a vast array of computational problems, ranging from advanced web service architectures to high throughput computing. However, many scientific computing applications have been slow to adapt to virtualized cloud frameworks. This is due to performance impacts of virtualization technologies, coupled with the lack of advanced hardware support necessary for running many high performance scientific applications at scale. By using KVM virtual machines that leverage both Nvidia GPUs and InfiniBand, we show that molecular dynamics simulations with LAMMPS and HOOMD run at near-native speeds. This experiment also illustrates how virtualized environments can support the latest parallel computing paradigms, including both MPI+CUDA and new GPUDirect RDMA functionality. Specific findings show initial promise in scaling of such applications to larger production deployments targeting large scale computational workloads.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "VEE '15 conference proceedings.", } @Article{Zabolotnyi:2015:JCG, author = "Rostyslav Zabolotnyi and Philipp Leitner and Waldemar Hummer and Schahram Dustdar", title = "{JCloudScale}: Closing the Gap Between {IaaS} and {PaaS}", journal = j-TOIT, volume = "15", number = "3", pages = "10:1--10:??", month = sep, year = "2015", CODEN = "????", DOI = "https://doi.org/10.1145/2792980", ISSN = "1533-5399 (print), 1557-6051 (electronic)", ISSN-L = "1533-5399", bibdate = "Sat Dec 19 18:06:52 MST 2015", bibsource = "http://www.acm.org/pubs/contents/journals/toit/; https://www.math.utah.edu/pub/tex/bib/java2010.bib; https://www.math.utah.edu/pub/tex/bib/toit.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Building Infrastructure-as-a-Service (IaaS) applications today is a complex, repetitive, and error-prone endeavor, as IaaS does not provide abstractions on top of virtual machines. This article presents JCloudScale, a Java-based middleware for moving elastic applications to IaaS clouds, with minimal adjustments to the application code. We discuss the architecture and technical features, as well as evaluate our system with regard to user acceptance and performance overhead. Our user study reveals that JCloudScale allows many participants to build IaaS applications more efficiently, compared to industrial Platform-as-a-Service (PaaS) solutions. Additionally, unlike PaaS, JCloudScale does not lead to a control loss and vendor lock-in.", acknowledgement = ack-nhfb, articleno = "10", fjournal = "ACM Transactions on Internet Technology (TOIT)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780", } @Article{Zeng:2015:PPH, author = "Junyuan Zeng and Yangchun Fu and Zhiqiang Lin", title = "{PEMU}: a Pin Highly Compatible Out-of-{VM} Dynamic Binary Instrumentation Framework", journal = j-SIGPLAN, volume = "50", number = "7", pages = "147--160", month = jul, year = "2015", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2817817.2731201", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Feb 16 12:01:42 MST 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Over the past 20 years, we have witnessed a widespread adoption of dynamic binary instrumentation (DBI) for numerous program analyses and security applications including program debugging, profiling, reverse engineering, and malware analysis. To date, there are many DBI platforms, and the most popular one is Pin, which provides various instrumentation APIs for process instrumentation. However, Pin does not support the instrumentation of OS kernels. In addition, the execution of the instrumentation and analysis routine is always inside the virtual machine (VM). Consequently, it cannot support any out-of-VM introspection that requires strong isolation. Therefore, this paper presents PEMU, a new open source DBI framework that is compatible with Pin-APIs, but supports out-of-VM introspection for both user level processes and OS kernels. Unlike in-VM instrumentation in which there is no semantic gap, for out-of-VM introspection we have to bridge the semantic gap and provide abstractions (i.e., APIs) for programmers. One important feature of PEMU is its API compatibility with Pin. As such, many Pin plugins are able to execute atop PEMU without any source code modification. We have implemented PEMU, and our experimental results with the SPEC 2006 benchmarks show that PEMU introduces reasonable overhead.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "VEE '15 conference proceedings.", } @Article{Zhang:2015:LOS, author = "Minjia Zhang and Jipeng Huang and Man Cao and Michael D. Bond", title = "Low-overhead software transactional memory with progress guarantees and strong semantics", journal = j-SIGPLAN, volume = "50", number = "8", pages = "97--108", month = aug, year = "2015", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2858788.2688510", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Feb 16 12:01:42 MST 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Software transactional memory offers an appealing alternative to locks by improving programmability, reliability, and scalability. However, existing STMs are impractical because they add high instrumentation costs and often provide weak progress guarantees and/or semantics. This paper introduces a novel STM called LarkTM that provides three significant features. (1) Its instrumentation adds low overhead except when accesses actually conflict, enabling low single-thread overhead and scaling well on low-contention workloads. (2) It uses eager concurrency control mechanisms, yet naturally supports flexible conflict resolution, enabling strong progress guarantees. (3) It naturally provides strong atomicity semantics at low cost. LarkTM's design works well for low-contention workloads, but adds significant overhead under higher contention, so we design an adaptive version of LarkTM that uses alternative concurrency control for high-contention objects. An implementation and evaluation in a Java virtual machine show that the basic and adaptive versions of LarkTM not only provide low single-thread overhead, but their multithreaded performance compares favorably with existing high-performance STMs.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "PPoPP '15 conference proceedings.", } @Article{Zhang:2015:MCV, author = "Xinyan Zhang and Keqiu Li and Yong Zhang", title = "Minimum-cost virtual machine migration strategy in datacenter", journal = j-CCPE, volume = "27", number = "17", pages = "5177--5187", day = "10", month = dec, year = "2015", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.3554", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Tue Feb 9 06:13:20 MST 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", onlinedate = "21 May 2015", } @Article{Zhang:2015:MIM, author = "Wei Zhang and Sundaresan Rajasekaran and Shaohua Duan and Timothy Wood and Mingfa Zhuy", title = "Minimizing Interference and Maximizing Progress for {Hadoop} Virtual Machines", journal = j-SIGMETRICS, volume = "42", number = "4", pages = "62--71", month = mar, year = "2015", CODEN = "????", DOI = "https://doi.org/10.1145/2788402.2788411", ISSN = "0163-5999 (print), 1557-9484 (electronic)", ISSN-L = "0163-5999", bibdate = "Wed Jun 3 16:05:37 MDT 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigmetrics.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Virtualization promised to dramatically increase server utilization levels, yet many data centers are still only lightly loaded. In some ways, big data applications are an ideal fit for using this residual capacity to perform meaningful work, but the high level of interference between interactive and batch processing workloads currently prevents this from being a practical solution in virtualized environments. Further, the variable nature of spare capacity may make it difficult to meet big data application deadlines. In this work we propose two schedulers: one in the virtualization layer designed to minimize interference on high priority interactive services, and one in the Hadoop framework that helps batch processing jobs meet their own performance deadlines. Our approach uses performance models to match Hadoop tasks to the servers that will benefit them the most, and deadline-aware scheduling to effectively order incoming jobs. We use admission control to meet deadlines even when resources are overloaded. The combination of these schedulers allows data center administrators to safely mix resource intensive Hadoop jobs with latency sensitive web applications, and still achieve predictable performance for both. We have implemented our system using Xen and Hadoop, and our evaluation shows that our schedulers allow a mixed cluster to reduce web response times by more than ten fold compared to the existing Xen Credit Scheduler, while meeting more Hadoop deadlines and lowering total task execution times by 6.5\%.", acknowledgement = ack-nhfb, fjournal = "ACM SIGMETRICS Performance Evaluation Review", journal-URL = "http://portal.acm.org/toc.cfm?id=J618", } @Article{Zhang:2015:SSP, author = "Yonglong Zhang and Bin Li and Zhiqiu Huang and Jin Wang and Junwu Zhu", title = "{SGAM}: strategy-proof group buying-based auction mechanism for virtual machine allocation in clouds", journal = j-CCPE, volume = "27", number = "18", pages = "5577--5589", day = "25", month = dec, year = "2015", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.3605", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Tue Feb 9 06:13:20 MST 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", onlinedate = "27 Jul 2015", } @Article{Zhao:2015:UPP, author = "Yong Zhao and Jia Rao and Xiaobo Zhou and Qing Yi", title = "Understanding Parallel Performance Under Interferences in Multi-tenant Clouds", journal = j-SIGMETRICS, volume = "43", number = "1", pages = "447--448", month = jun, year = "2015", CODEN = "????", DOI = "https://doi.org/10.1145/2796314.2745886", ISSN = "0163-5999 (print), 1557-9484 (electronic)", ISSN-L = "0163-5999", bibdate = "Fri Sep 18 06:59:51 MDT 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigmetrics.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "The performance of parallel programs is notoriously difficult to reason in virtualized environments. Although performance degradations caused by virtualization and interferences have been well studied, there is little understanding why different parallel programs have unpredictable slow- downs. We find that unpredictable performance is the result of complex interplays between the design of the program, the memory hierarchy of the hosting system, and the CPU scheduling in the hypervisor. We develop a profiling tool, vProfile, to decompose parallel runtime into three parts: compute, steal and synchronization. With the help of time breakdown, we devise two optimizations at the hypervisor to reduce slowdowns.", acknowledgement = ack-nhfb, fjournal = "ACM SIGMETRICS Performance Evaluation Review", journal-URL = "http://portal.acm.org/toc.cfm?id=J618", } @Article{Zhong:2015:VBM, author = "Xianming Zhong and Chengcheng Xiang and Miao Yu and Zhengwei Qi and Haibing Guan", title = "A Virtualization Based Monitoring System for Mini-intrusive Live Forensics", journal = j-INT-J-PARALLEL-PROG, volume = "43", number = "3", pages = "455--471", month = jun, year = "2015", CODEN = "IJPPE5", DOI = "https://doi.org/10.1007/s10766-013-0285-2", ISSN = "0885-7458 (print), 1573-7640 (electronic)", ISSN-L = "0885-7458", bibdate = "Sat Aug 8 12:34:16 MDT 2015", bibsource = "http://link.springer.com/journal/10766/43/3; https://www.math.utah.edu/pub/tex/bib/intjparallelprogram.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer.com/article/10.1007/s10766-013-0285-2", acknowledgement = ack-nhfb, fjournal = "International Journal of Parallel Programming", journal-URL = "http://link.springer.com/journal/10766", } @Article{Zou:2015:CDA, author = "Tao Zou and Ronan Bras and Marcos Vaz Salles and Alan Demers and Johannes Gehrke", title = "{ClouDiA}: a deployment advisor for public clouds", journal = j-VLDB-J, volume = "24", number = "5", pages = "633--653", month = oct, year = "2015", CODEN = "VLDBFR", DOI = "https://doi.org/10.1007/s00778-014-0375-9", ISSN = "1066-8888 (print), 0949-877X (electronic)", ISSN-L = "1066-8888", bibdate = "Fri Sep 18 06:51:09 MDT 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; https://www.math.utah.edu/pub/tex/bib/vldbj.bib", abstract = "An increasing number of distributed data-driven applications are moving into shared public clouds. By sharing resources and operating at scale, public clouds promise higher utilization and lower costs than private clusters. To achieve high utilization, however, cloud providers inevitably allocate virtual machine instances non-contiguously; i.e., instances of a given application may end-up in physically distant machines in the cloud. This allocation strategy can lead to large differences in average latency between instances. For a large class of applications, this difference can result in significant performance degradation, unless care is taken in how application components are mapped to instances. In this paper, we propose ClouDiA, a general deployment advisor that selects application node deployments minimizing either (i) the largest latency between application nodes, or (ii) the longest critical path among all application nodes. ClouDiA employs a number of algorithmic techniques, including mixed-integer programming and constraint programming techniques, to efficiently search the space of possible mappings of application nodes to instances. Through experiments with synthetic and real applications in Amazon EC2, we show that mean latency is a robust metric to model communication cost in these applications and that our search techniques yield a 15---55 \% reduction in time-to-solution or service response time, without any need for modifying application code.", acknowledgement = ack-nhfb, fjournal = "VLDB Journal: Very Large Data Bases", journal-URL = "http://portal.acm.org/toc.cfm?id=J869", } @Article{Abe:2016:UVM, author = "Yoshihisa Abe and Roxana Geambasu and Kaustubh Joshi and Mahadev Satyanarayanan", title = "Urgent Virtual Machine Eviction with Enlightened Post-Copy", journal = j-SIGPLAN, volume = "51", number = "7", pages = "51--64", month = jul, year = "2016", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/3007611.2892252", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat Sep 16 10:18:12 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Virtual machine (VM) migration demands distinct properties under resource oversubscription and workload surges. We present enlightened post-copy, a new mechanism for VMs under contention that evicts the target VM with fast execution transfer and short total duration. This design contrasts with common live migration, which uses the down time of the migrated VM as its primary metric; it instead focuses on recovering the aggregate performance of the VMs being affected. In enlightened post-copy, the guest OS identifies memory state that is expected to encompass the VM's working set. The hypervisor accordingly transfers its state, mitigating the performance impact on the migrated VM resulting from post-copy transfer. We show that our implementation, with modest instrumentation in guest Linux, resolves VM contention up to several times faster than live migration.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "VEE '16 conference proceedings.", } @Article{Agrawal:2016:EIU, author = "Gaurav Agrawal and Deep Medhi", title = "Embedding {IP} unique shortest path topology on a wavelength-routed network: normal and survivable design", journal = j-IEEE-TRANS-NETWORKING, volume = "24", number = "2", pages = "1109--1124", month = apr, year = "2016", CODEN = "IEANEP", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Tue Oct 18 12:04:13 MDT 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "In this paper, we address the network virtualization problem of embedding a unique shortest path-based IP topology using lightpaths in a wavelength-routed network. We present an integer linear programming formulation and propose a 2-phase heuristic approach to solve this problem. We extend the model and the heuristic by addressing survivability in an integrated cross-layer framework, where the objective is to allocate a light-path topology that remains connected in the event of any single physical link failure while providing the IP network with unique shortest paths for all node-pairs. We consider a number of measures to show effectiveness of our approach and to discuss the impact on normal and survivable topology design, in terms of the number of transreceivers deployed.", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771", } @Article{Al-Ayyoub:2016:VBC, author = "Mahmoud Al-Ayyoub and Yaser Jararweh and Ahmad Doulat and Haythem A. Bany Salameh and Ahmad {Al Abed Al Aziz} and Mohammad Alsmirat and Abdallah A. Khreishah", title = "Virtualization-based {Cognitive Radio Networks}", journal = j-J-SYST-SOFTW, volume = "117", number = "??", pages = "15--29", month = jul, year = "2016", CODEN = "JSSODM", ISSN = "0164-1212 (print), 1873-1228 (electronic)", ISSN-L = "0164-1212", bibdate = "Thu May 19 08:19:13 MDT 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0164121216000479", acknowledgement = ack-nhfb, fjournal = "Journal of Systems and Software", journal-URL = "http://www.sciencedirect.com/science/journal/01641212/", } @Article{Amin:2016:JST, author = "Nada Amin and Ross Tate", title = "{Java} and {Scala}'s type systems are unsound: the existential crisis of null pointers", journal = j-SIGPLAN, volume = "51", number = "10", pages = "838--848", month = oct, year = "2016", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/3022671.2984004", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat Sep 16 10:18:13 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "We present short programs that demonstrate the unsoundness of Java and Scala's current type systems. In particular, these programs provide parametrically polymorphic functions that can turn any type into any type without (down)casting. Fortunately, parametric polymorphism was not integrated into the Java Virtual Machine (JVM), so these examples do not demonstrate any unsoundness of the JVM. Nonetheless, we discuss broader implications of these findings on the field of programming languages.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "OOPSLA '16 conference proceedings.", } @Article{Amit:2016:BMP, author = "Nadav Amit and Abel Gordon and Nadav Har'El and Muli Ben-Yehuda and Alex Landau and Assaf Schuster and Dan Tsafrir", title = "Bare-metal performance for virtual machines with exitless interrupts", journal = j-CACM, volume = "59", number = "1", pages = "108--116", month = jan, year = "2016", CODEN = "CACMA2", DOI = "https://doi.org/10.1145/2845648", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Fri Jan 15 16:12:33 MST 2016", bibsource = "http://www.acm.org/pubs/contents/journals/cacm/; https://www.math.utah.edu/pub/tex/bib/cacm2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://cacm.acm.org/magazines/2015/1/195734/fulltext", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79", } @Article{Anjo:2016:DML, author = "Ivo Anjo and Jo{\~a}o Cachopo", title = "Design of a Method-Level Speculation framework for boosting irregular {JVM} applications", journal = j-J-PAR-DIST-COMP, volume = "87", number = "??", pages = "13--25", month = jan, year = "2016", CODEN = "JPDCER", ISSN = "0743-7315 (print), 1096-0848 (electronic)", ISSN-L = "0743-7315", bibdate = "Mon Dec 21 18:24:37 MST 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2010.bib; https://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0743731515001720", acknowledgement = ack-nhfb, fjournal = "Journal of Parallel and Distributed Computing", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", } @Article{Antonescu:2016:SSB, author = "Alexandru-Florian Antonescu and Torsten Braun", title = "Simulation of {SLA}-based {VM}-scaling algorithms for cloud-distributed applications", journal = j-FUT-GEN-COMP-SYS, volume = "54", number = "??", pages = "260--273", month = jan, year = "2016", CODEN = "FGSEVI", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Thu Oct 15 11:00:07 MDT 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X15000321", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X/", } @Article{Aral:2016:NAE, author = "Atakan Aral and Tolga Ovatman", title = "Network-aware embedding of virtual machine clusters onto federated cloud infrastructure", journal = j-J-SYST-SOFTW, volume = "120", number = "??", pages = "89--104", month = oct, year = "2016", CODEN = "JSSODM", ISSN = "0164-1212 (print), 1873-1228 (electronic)", ISSN-L = "0164-1212", bibdate = "Tue Aug 23 11:40:41 MDT 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0164121216301078", acknowledgement = ack-nhfb, fjournal = "Journal of Systems and Software", journal-URL = "http://www.sciencedirect.com/science/journal/01641212/", } @Article{Arianyan:2016:NHC, author = "Ehsan Arianyan and Hassan Taheri and Saeed Sharifian", title = "Novel heuristics for consolidation of virtual machines in cloud data centers using multi-criteria resource management solutions", journal = j-J-SUPERCOMPUTING, volume = "72", number = "2", pages = "688--717", month = feb, year = "2016", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-015-1603-9", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Thu Apr 7 12:01:24 MDT 2016", bibsource = "http://link.springer.com/journal/11227/72/2; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer.com/article/10.1007/s11227-015-1603-9", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Aroca:2016:PEA, author = "Jordi Arjona Aroca and Antonio Fern{\'a}ndez Anta and Miguel A. Mosteiro and Christopher Thraves and Lin Wang", title = "Power-efficient assignment of virtual machines to physical machines", journal = j-FUT-GEN-COMP-SYS, volume = "54", number = "??", pages = "82--94", month = jan, year = "2016", CODEN = "FGSEVI", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Thu Oct 15 11:00:07 MDT 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X15000072", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X/", } @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-SIGPLAN, volume = "51", number = "4", pages = "263--276", month = apr, year = "2016", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2954679.2872377", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Jun 9 17:13:59 MDT 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib; https://www.math.utah.edu/pub/tex/bib/opersysrev.bib; https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.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 = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "ASPLOS '16 conference proceedings.", } @Article{Ayoubi:2016:TPB, author = "Sara Ayoubi and Yiheng Chen and Chadi Assi", title = "Towards Promoting Backup-Sharing in Survivable Virtual Network Design", journal = j-IEEE-TRANS-NETWORKING, volume = "24", number = "5", pages = "3218--3231", month = oct, year = "2016", CODEN = "IEANEP", DOI = "https://doi.org/10.1109/TNET.2015.2510864", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Sat Jan 21 07:15:39 MST 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "In a virtualized infrastructure where multiple virtual networks or tenants are running atop the same physical network e.g., a data center network, a single facility node e.g., a server failure can bring down multiple virtual machines, disconnecting their corresponding services and leading to millions of dollars in penalty cost. To overcome losses, tenants or virtual networks can be augmented with a dedicated set of backup nodes and links provisioned with enough backup resources to assume any single facility node failure. This approach is commonly referred to as Survivable Virtual Network SVN design. The achievable reliability guarantee of the resultant SVN could come at the expense of lowering the substrate network utilization efficiency, and subsequently its admissibility, since the provisioned backup resources are reserved and remain idle until failures occur. Backup-sharing can replace the dedicated survivability scheme to circumvent the inconvenience of idle resources and reduce the footprints of backup resources. Indeed the problem of SVN design with backup-sharing has recurred multiple times in the literature. In most of the existing work, designing an SVN is bounded to a fixed number of backup nodes; further backup-sharing is only explored and optimized during the embedding phase. This renders the existing redesign techniques agnostic to the backup resource sharing in the substrate network, and highly dependent on the efficiency of the adopted mapping approach. In this paper, we diverge from this dogmatic approach, and introduce ProRed, a novel prognostic redesign technique that promotes the backup resource sharing at the virtual network level, prior to the embedding phase. Our numerical results prove that this redesign technique achieves lower-cost mapping solutions and greatly enhances the achievable backup sharing, boosting the overall network's admissibility.", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771", } @Article{Banerjee:2016:SNA, author = "Amitabha Banerjee and Rishi Mehta and Zach Shen", title = "Supporting {NUMA}-Aware {I/O} in Virtual Machines", journal = j-IEEE-MICRO, volume = "36", number = "4", pages = "28--36", month = jul # "\slash " # aug, year = "2016", CODEN = "IEMIDZ", DOI = "https://doi.org/10.1109/MM.2016.59", ISSN = "0272-1732 (print), 1937-4143 (electronic)", ISSN-L = "0272-1732", bibdate = "Wed Aug 17 10:37:35 MDT 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeemicro.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.computer.org/csdl/mags/mi/2016/04/mmi2016040028-abs.html", abstract-URL = "https://www.computer.org/csdl/mags/mi/2016/04/mmi2016040028-abs.html", acknowledgement = ack-nhfb, journal-URL = "http://www.computer.org/csdl/mags/mi/index.html", } @Article{Ben-Yehuda:2016:NPM, author = "Muli Ben-Yehuda and Orna Agmon Ben-Yehuda and Dan Tsafrir", title = "The nom Profit-Maximizing Operating System", journal = j-SIGPLAN, volume = "51", number = "7", pages = "145--160", month = jul, year = "2016", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/3007611.2892250", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat Sep 16 10:18:12 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "In the near future, cloud providers will sell their users virtual machines with CPU, memory, network, and storage resources whose prices constantly change according to market-driven supply and demand conditions. Running traditional operating systems in these virtual machines is a poor fit: traditional operating systems are not aware of changing resource prices and their sole aim is to maximize performance with no consideration of costs. Consequently, they yield low profits. We present nom, a profit-maximizing operating system designed for cloud computing platforms with dynamic resource prices. Applications running on nom aim to maximize profits by optimizing simultaneously for performance and resource costs. The nom kernel provides them with direct access to the underlying hardware and full control over their private software stacks. Since nom applications know there is no single ``best'' software stack, they adapt their stacks' behavior on the fly according to the current price of available resources and their private utility from them, which differs between applications. We show that in addition to achieving up to 3.9x better throughput and up to 9.1x better latency, nom applications yield up to 11.1x higher profits when compared with the same applications running on Linux and OSv.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "VEE '16 conference proceedings.", } @Article{Burtsev:2016:APV, author = "Anton Burtsev and David Johnson and Mike Hibler and Eric Eide and John Regehr", title = "Abstractions for Practical Virtual Machine Replay", journal = j-SIGPLAN, volume = "51", number = "7", pages = "93--106", month = jul, year = "2016", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/3007611.2892257", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat Sep 16 10:18:12 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Efficient deterministic replay of whole operating systems is feasible and useful, so why isn't replay a default part of the software stack? While implementing deterministic replay is hard, we argue that the main reason is the lack of general abstractions for understanding and addressing the significant engineering challenges involved in the development of a replay engine for a modern VMM. We present a design blueprint---a set of abstractions, general principles, and low-level implementation details---for efficient deterministic replay in a modern hypervisor. We build and evaluate our architecture in Xen, a full-featured hypervisor. Our architecture can be readily followed and adopted, enabling replay as a ubiquitous part of a modern virtualization stack.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "VEE '16 conference proceedings.", } @Article{Chen:2016:CDD, author = "Yuting Chen and Ting Su and Chengnian Sun and Zhendong Su and Jianjun Zhao", title = "Coverage-directed differential testing of {JVM} implementations", journal = j-SIGPLAN, volume = "51", number = "6", pages = "85--99", month = jun, year = "2016", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2980983.2908095", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Mon Sep 5 07:32:25 MDT 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2010.bib; https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Java virtual machine (JVM) is a core technology, whose reliability is critical. Testing JVM implementations requires painstaking effort in designing test classfiles (*.class) along with their test oracles. An alternative is to employ binary fuzzing to differentially test JVMs by blindly mutating seeding classfiles and then executing the resulting mutants on different JVM binaries for revealing inconsistent behaviors. However, this blind approach is not cost effective in practice because most of the mutants are invalid and redundant. This paper tackles this challenge by introducing classfuzz, a coverage-directed fuzzing approach that focuses on representative classfiles for differential testing of JVMs' startup processes. Our core insight is to (1) mutate seeding classfiles using a set of predefined mutation operators (mutators) and employ Markov Chain Monte Carlo (MCMC) sampling to guide mutator selection, and (2) execute the mutants on a reference JVM implementation and use coverage uniqueness as a discipline for accepting representative ones. The accepted classfiles are used as inputs to differentially test different JVM implementations and find defects. We have implemented classfuzz and conducted an extensive evaluation of it against existing fuzz testing algorithms. Our evaluation results show that classfuzz can enhance the ratio of discrepancy-triggering classfiles from 1.7\% to 11.9\%. We have also reported 62 JVM discrepancies, along with the test classfiles, to JVM developers. Many of our reported issues have already been confirmed as JVM defects, and some even match recent clarifications and changes to the Java SE 8 edition of the JVM specification.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "PLDI '16 conference proceedings.", } @Article{Chen:2016:ICA, author = "Renhai Chen and Yi Wang and Jingtong Hu and Duo Liu and Zili Shao and Yong Guan", title = "Image-Content-Aware {I/O} Optimization for Mobile Virtualization", journal = j-TECS, volume = "16", number = "1", pages = "12:1--12:??", month = nov, year = "2016", CODEN = "????", DOI = "https://doi.org/10.1145/2950059", ISSN = "1539-9087 (print), 1558-3465 (electronic)", ISSN-L = "1539-9087", bibdate = "Thu Nov 3 16:48:38 MDT 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/tecs.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Mobile virtualization introduces extra layers in software stacks, which leads to performance degradation. Notably, each I/O operation has to pass through several software layers to reach the NAND-flash-based storage systems. This article targets at optimizing I/O for mobile virtualization, since I/O becomes one of major performance bottlenecks that seriously affects the performance of mobile devices. Among all the I/O operations, a large percentage is to update metadata. Frequently updated metadata not only degrade overall I/O performance but also severely reduce flash memory lifetime. In this article, we propose a novel I/O optimization technique to identify the metadata of a guest file system that is stored in a virtual machine image file and frequently updated. Then, these metadata are stored in a small additional non-volatile memory (NVM), which is faster and more endurable to greatly improve flash memory's performance and lifetime. To the best of our knowledge, this is the first work to identify the file system metadata from regular data in a guest OS image file with NVM optimization. The proposed scheme is evaluated on a real hardware embedded platform. The experimental results show that the proposed techniques can improve write performance to 45.21\% in mobile devices with virtualization.", acknowledgement = ack-nhfb, articleno = "12", fjournal = "ACM Transactions on Embedded Computing Systems", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J840", remark = "Special issue on VIPES, special issue on ICESS2015 and regular papers.", } @Article{Chen:2016:OVM, author = "Tao Chen and Xiaofeng Gao and Guihai Chen", title = "Optimized Virtual Machine Placement with Traffic-Aware Balancing in Data Center Networks", journal = j-SCI-PROG, volume = "2016", number = "??", pages = "3101658:1--3101658:10", month = "????", year = "2016", CODEN = "SCIPEV", DOI = "https://doi.org/10.1155/2016/3101658", ISSN = "1058-9244 (print), 1875-919X (electronic)", ISSN-L = "1058-9244", bibdate = "Tue Sep 20 07:53:40 MDT 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/sciprogram.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.hindawi.com/journals/sp/2016/3101658/", acknowledgement = ack-nhfb, fjournal = "Scientific Programming", journal-URL = "https://www.hindawi.com/journals/sp/", journalabr = "Sci. Prog", } @Article{Chen:2016:SDN, author = "Jiann-Liang Chen and Yi-Wei Ma and Hung-Yi Kuo and Chu-Sing Yang and Wen-Chien Hung", title = "Software-Defined Network Virtualization Platform for Enterprise Network Resource Management", journal = j-IEEE-TRANS-EMERG-TOP-COMPUT, volume = "4", number = "2", pages = "179--186", month = apr # "\slash " # jun, year = "2016", DOI = "https://doi.org/10.1109/TETC.2015.2478757", ISSN = "2168-6750 (print), 2376-4562 (electronic)", bibdate = "Thu Sep 21 14:02:06 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransemergtopcomput.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Emerging Topics in Computing", journal-URL = "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6245516", } @Article{Cheng:2016:OIL, author = "Luwei Cheng and Francis C. M. Lau", title = "Offloading Interrupt Load Balancing from {SMP} Virtual Machines to the Hypervisor", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "27", number = "11", pages = "3298--3310", month = nov, year = "2016", CODEN = "ITDSEO", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Tue Oct 11 05:43:52 MDT 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.computer.org/csdl/trans/td/2016/11/07425234-abs.html", acknowledgement = ack-nhfb, journal-URL = "http://www.computer.org/tpds/archives.htm", } @Article{Cheng:2016:RTC, author = "Luwei Cheng and Francis C. M. Lau", title = "Revisiting {TCP} Congestion Control in a Virtual Cluster Environment", journal = j-IEEE-TRANS-NETWORKING, volume = "24", number = "4", pages = "2154--2167", month = aug, year = "2016", CODEN = "IEANEP", DOI = "https://doi.org/10.1109/TNET.2015.2451161", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Fri Oct 28 17:19:55 MDT 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Virtual machines VMs are widely adopted today to provide elastic computing services in datacenters, and they still heavily rely on TCP for congestion control. VM scheduling delays due to CPU sharing can cause frequent spurious retransmit timeouts RTOs. Using current detection methods, we find that such spurious RTOs cannot be effectively identified because of the retransmission ambiguity caused by the delayed ACK DelACK mechanism. Disabling DelACK would add significant CPU overhead to the VMs and thus degrade the network's performance. In this paper, we first report our practical experience about TCP's reaction to VM scheduling delays. We then provide an analysis of the problem that has two components corresponding to VM preemption on the sender side and the receiver side, respectively. Finally, we propose PVTCP, a ParaVirtualized approach to counteract the distortion of congestion information caused by the hypervisor scheduler. PVTCP is completely embedded in the guest OS and requires no modification in the hypervisor. Taking incast congestion as an example, we evaluate our solution in a 21-node testbed. The results show that PVTCP has high adaptability in virtualized environments and deals satisfactorily with the throughput collapse problem.", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771", } @Article{Cheng:2016:VMN, author = "Kun Cheng and Yuebin Bai and Yongwang Zhao and Yao Ma and Duo Lu and Yuanfeng Peng and Minxuan Zhou", title = "{$ H V^2 M $}: a novel approach to boost inter-{VM} network performance for {Xen}-based {HVMs}", journal = j-J-SYST-SOFTW, volume = "114", number = "??", pages = "54--68", month = apr, year = "2016", CODEN = "JSSODM", ISSN = "0164-1212 (print), 1873-1228 (electronic)", ISSN-L = "0164-1212", bibdate = "Fri Feb 5 17:57:27 MST 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0164121215002782", acknowledgement = ack-nhfb, fjournal = "Journal of Systems and Software", journal-URL = "http://www.sciencedirect.com/science/journal/01641212/", } @Article{Cruz:2016:DCG, author = "Flavio Cruz and Ricardo Rocha and Seth Copen Goldstein", title = "Declarative coordination of graph-based parallel programs", journal = j-SIGPLAN, volume = "51", number = "8", pages = "4:1--4:??", month = aug, year = "2016", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/3016078.2851153", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat Sep 16 10:18:12 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Declarative programming has been hailed as a promising approach to parallel programming since it makes it easier to reason about programs while hiding the implementation details of parallelism from the programmer. However, its advantage is also its disadvantage as it leaves the programmer with no straightforward way to optimize programs for performance. In this paper, we introduce Coordinated Linear Meld (CLM), a concurrent forward-chaining linear logic programming language, with a declarative way to coordinate the execution of parallel programs allowing the programmer to specify arbitrary scheduling and data partitioning policies. Our approach allows the programmer to write graph-based declarative programs and then optionally to use coordination to fine-tune parallel performance. In this paper we specify the set of coordination facts, discuss their implementation in a parallel virtual machine, and show---through example---how they can be used to optimize parallel execution. We compare the performance of CLM programs against the original uncoordinated Linear Meld and several other frameworks.", acknowledgement = ack-nhfb, articleno = "4", fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "PPoPP '16 conference proceedings.", } @Article{Dall:2016:AVP, author = "Christoffer Dall and Shih-Wei Li and Jin Tack Lim and Jason Nieh and Georgios Koloventzos", title = "{ARM} virtualization: performance and architectural implications", journal = j-COMP-ARCH-NEWS, volume = "44", number = "3", pages = "304--316", month = jun, year = "2016", CODEN = "CANED2", DOI = "https://doi.org/10.1145/3007787.3001169", ISSN = "0163-5964 (print), 1943-5851 (electronic)", ISSN-L = "0163-5964", bibdate = "Thu Jan 12 18:43:43 MST 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigarch.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 multicore 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. 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 changes to ARM's hardware virtualization support that can potentially bridge the gap to bring its faster VM-to-hypervisor transition mechanism to modern Type 2 hypervisors running real applications. These changes have been incorporated into the latest ARM architecture.", acknowledgement = ack-nhfb, fjournal = "ACM SIGARCH Computer Architecture News", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89", remark = "ISCA '16 conference proceedings.", } @Article{daSilva:2016:TAV, author = "Rodrigo A. C. da Silva and Nelson L. S. da Fonseca", title = "Topology-Aware Virtual Machine Placement in Data Centers", journal = j-J-GRID-COMP, volume = "14", number = "1", pages = "75--90", month = mar, year = "2016", CODEN = "????", DOI = "https://doi.org/10.1007/s10723-015-9343-x", ISSN = "1570-7873 (print), 1572-9184 (electronic)", ISSN-L = "1570-7873", bibdate = "Mon May 30 08:02:34 MDT 2016", bibsource = "http://link.springer.com/journal/10723/14/1; https://www.math.utah.edu/pub/tex/bib/jgridcomp.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer.com/article/10.1007/s10723-015-9343-x", acknowledgement = ack-nhfb, fjournal = "Journal of Grid Computing", journal-URL = "http://link.springer.com/journal/10723", } @Article{Degenbaev:2016:ITG, author = "Ulan Degenbaev and Jochen Eisinger and Manfred Ernst and Ross McIlroy and Hannes Payer", title = "Idle time garbage collection scheduling", journal = j-SIGPLAN, volume = "51", number = "6", pages = "570--583", month = jun, year = "2016", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2980983.2908106", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Mon Sep 5 07:32:25 MDT 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Efficient garbage collection is increasingly important in today's managed language runtime systems that demand low latency, low memory consumption, and high throughput. Garbage collection may pause the application for many milliseconds to identify live memory, free unused memory, and compact fragmented regions of memory, even when employing concurrent garbage collection. In animation-based applications that require 60 frames per second, these pause times may be observable, degrading user experience. This paper introduces idle time garbage collection scheduling to increase the responsiveness of applications by hiding expensive garbage collection operations inside of small, otherwise unused idle portions of the application's execution, resulting in smoother animations. Additionally we take advantage of idleness to reduce memory consumption while allowing higher memory use when high throughput is required. We implemented idle time garbage collection scheduling in V8, an open-source, production JavaScript virtual machine running within Chrome. We present performance results on various benchmarks running popular webpages and show that idle time garbage collection scheduling can significantly improve latency and memory consumption. Furthermore, we introduce a new metric called frame time discrepancy to quantify the quality of the user experience and precisely measure the improvements that idle time garbage collection provides for a WebGL-based game benchmark. Idle time garbage collection is shipped and enabled by default in Chrome.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "PLDI '16 conference proceedings.", } @Article{Dragga:2016:GGC, author = "Chris Dragga and Douglas J. Santry", title = "{GCTrees}: Garbage Collecting Snapshots", journal = j-TOS, volume = "12", number = "1", pages = "4:1--4:??", month = feb, year = "2016", CODEN = "????", DOI = "https://doi.org/10.1145/2857056", ISSN = "1553-3077 (print), 1553-3093 (electronic)", ISSN-L = "1553-3077", bibdate = "Mon Feb 29 06:03:46 MST 2016", bibsource = "http://www.acm.org/pubs/contents/journals/tos/; https://www.math.utah.edu/pub/tex/bib/tos.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "File-system snapshots have been a key component of enterprise storage management since their inception. Creating and managing them efficiently, while maintaining flexibility and low overhead, has been a constant struggle. Although the current state-of-the-art mechanism---hierarchical reference counting---performs reasonably well for traditional small-file workloads, these workloads are increasingly vanishing from the enterprise data center, replaced instead with virtual machine and database workloads. These workloads center around a few very large files, violating the assumptions that allow hierarchical reference counting to operate efficiently. To better cope with these workloads, we introduce Generational Chain Trees (GCTrees), a novel method of space management that uses concepts of block lineage across snapshots rather than explicit reference counting. As a proof of concept, we create a prototype file system---gcext4, a modified version of ext4 that uses GCTrees as a basis for snapshots and copy-on-write. In evaluating this prototype empirically, we find that although they have a somewhat higher overhead for traditional workloads, GCTrees have dramatically lower overhead than hierarchical reference counting for large-file workloads, improving by a factor of 34 or more in some cases. Furthermore, gcext4 performs comparably to ext4 across all workloads, showing that GCTrees impose minor cost for their benefits.", acknowledgement = ack-nhfb, articleno = "4", fjournal = "ACM Transactions on Storage", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J960", } @Article{Egger:2016:ECL, author = "Bernhard Egger and Younghyun Cho and Changyeon Jo and Eunbyun Park and Jaejin Lee", title = "Efficient Checkpointing of Live Virtual Machines", journal = j-IEEE-TRANS-COMPUT, volume = "65", number = "10", pages = "3041--3054", month = "????", year = "2016", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.2016.2519890", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Tue Sep 13 06:19:58 MDT 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Computers", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", } @Article{Esposito:2016:VAV, author = "Flavio Esposito and Ibrahim Matta and Yuefeng Wang", title = "{VINEA}: An Architecture for Virtual Network Embedding Policy Programmability", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "27", number = "11", pages = "3381--3396", month = nov, year = "2016", CODEN = "ITDSEO", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Tue Oct 11 05:43:52 MDT 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.computer.org/csdl/trans/td/2016/11/07401050-abs.html", acknowledgement = ack-nhfb, journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=71", } @Article{Gandhi:2016:APE, author = "Jayneel Gandhi and Mark D. Hill and Michael M. Swift", title = "Agile paging: exceeding the best of nested and shadow paging", journal = j-COMP-ARCH-NEWS, volume = "44", number = "3", pages = "707--718", month = jun, year = "2016", CODEN = "CANED2", DOI = "https://doi.org/10.1145/3007787.3001212", ISSN = "0163-5964 (print), 1943-5851 (electronic)", ISSN-L = "0163-5964", bibdate = "Thu Jan 12 18:43:43 MST 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigarch.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Virtualization provides benefits for many workloads, but the overheads of virtualizing memory are not universally low. The cost comes from managing two levels of address translation---one in the guest virtual machine (VM) and the other in the host virtual machine monitor (VMM)---with either nested or shadow paging. Nested paging directly performs a two-level page walk that makes TLB misses slower than unvirtualized native, but enables fast page tables changes. Alternatively, shadow paging restores native TLB miss speeds, but requires costly VMM intervention on page table updates. This paper proposes agile paging that combines both techniques and exceeds the best of both. A virtualized page walk starts with shadow paging and optionally switches in the same page walk to nested paging where frequent page table updates would cause costly VMM interventions. Agile paging enables most TLB misses to be handled as fast as native while most page table changes avoid VMM intervention. It requires modest changes to hardware (e.g., demark when to switch) and VMM policies (e.g., predict good switching opportunities). We emulate the proposed hardware and prototype the software in Linux with KVM on x86-64. Agile paging performs more than 12\% better than the best of the two techniques and comes within 4\% of native execution for all workloads.", acknowledgement = ack-nhfb, fjournal = "ACM SIGARCH Computer Architecture News", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89", remark = "ISCA '16 conference proceedings.", } @Article{Gao:2016:VCD, author = "Xianming Gao and Baosheng Wang and Xiaozhe Zhang", title = "{VR-Cluster}: Dynamic Migration for Resource Fragmentation Problem in Virtual Router Platform", journal = j-SCI-PROG, volume = "2016", number = "??", pages = "3976965:1--3976965:14", month = "????", year = "2016", CODEN = "SCIPEV", DOI = "https://doi.org/10.1155/2016/3976965", ISSN = "1058-9244 (print), 1875-919X (electronic)", ISSN-L = "1058-9244", bibdate = "Tue Sep 20 07:53:40 MDT 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/sciprogram.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.hindawi.com/journals/sp/2016/3976965/", acknowledgement = ack-nhfb, fjournal = "Scientific Programming", journal-URL = "https://www.hindawi.com/journals/sp/", journalabr = "Sci. Prog", } @Article{Garcia:2016:CMP, author = "P. Garcia and T. Gomes and J. Monteiro and A. Tavares and M. Ekpanyapong", title = "On-Chip Message Passing Sub-System for Embedded Inter-Domain Communication", journal = j-IEEE-COMPUT-ARCHIT-LETT, volume = "15", number = "1", pages = "33--36", month = jan # "\slash " # jun, year = "2016", CODEN = "????", DOI = "https://doi.org/10.1109/LCA.2015.2419260", ISSN = "1556-6056 (print), 1556-6064 (electronic)", ISSN-L = "1556-6056", bibdate = "Thu Jun 20 17:18:18 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeecomputarchitlett.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "This letter describes the architecture of an inter-domain message passing hardware sub-system targeting the embedded virtualization field. Embedded virtualization is characterized by application-specific solutions, where functionality is partitioned into a small, fixed number of Virtual Machines, typically under real-time constraints, which must communicate for synchronization and status signaling. In light of the growing use of custom hardware, especially supported by (re)configurable platforms, we show how our hardware sub-system can provide virtualization-safe data transfers, without the need for Hypervisor (software) mediation, through the use of translate-once and virtual-interface hardware mechanisms, allowing direct memory-to-memory copies between different partitions' input/output buffers, in both direct-transfer and publish-subscribe modes. Our experiments show our architecture is especially suited for the real time domain, outperforming an equivalent software solution in latencies, throughput and jitter, and outperforming state of the art hardware solutions for small message sizes ($ < 512 $ B).", acknowledgement = ack-nhfb, affiliation = "Garcia, P (Reprint Author), Univ Minho, Dept Ctr Algoritmi, P-4800 Braga, Portugal. Garcia, P.; Gomes, T.; Monteiro, J.; Tavares, A., Univ Minho, Dept Ctr Algoritmi, P-4800 Braga, Portugal. Ekpanyapong, M., Asian Inst Technol, Dept Microelect \& Embedded Syst, Khlong Luang, Thailand.", author-email = "pgarcia@dei.uminho.pt tgomes@dei.uminho.pt jmonteiro@dei.uminho.pt atavares@dei.uminho.pt mongkol@ait.ac.th", da = "2019-06-20", doc-delivery-number = "DY1XQ", eissn = "1556-6064", fjournal = "IEEE Computer Architecture Letters", funding-acknowledgement = "FCT [SFRH/BD/77813/2011]", funding-text = "This work was supported in part by a grant from FCT, reference SFRH/BD/77813/2011. P. Garcia is the corresponding author.", journal-iso = "IEEE Comput. Archit. Lett.", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=10208", keywords = "application program interfaces; application-specific solutions; configurable platforms; direct memory-to-memory copies; direct-transfer modes; embedded interdomain communication; embedded systems; embedded virtualization field; Hardware; interdomain message passing hardware subsystem; message passing; Message passing; on-chip message passing subsystem; partition input/output buffers; publish subscribe modes; Publish-subscribe; real time domain; real-time constraints; Software; status signaling; synchronisation; synchronization; Throughput; translate-once mechanism; Virtual machine monitors; virtual machines; virtual-interface hardware mechanisms; virtualisation; Virtualization; virtualization-safe data transfers", number-of-cited-references = "15", ORCID-numbers = "Monteiro, Joao L/0000-0002-3287-3995 Monteiro, Joao/0000-0002-3287-3995 Tavares, Adriano/0000-0001-8316-6927 Gomes, Tiago/0000-0002-8496-8179 Garcia, Paulo/0000-0002-1041-5205", research-areas = "Computer Science", researcherid-numbers = "Monteiro, Joao L/H-7751-2012 Monteiro, Joao/Q-6857-2019 Tavares, Adriano/M-5257-2013", times-cited = "1", unique-id = "Garcia:2016:CMP", web-of-science-categories = "Computer Science, Hardware \& Architecture", } @Article{Guanciale:2016:PSM, author = "Roberto Guanciale and Hamed Nemati and Mads Dam and Christoph Baumann", title = "Provably secure memory isolation for {Linux} on {ARM}", journal = j-J-COMP-SECUR, volume = "24", number = "6", pages = "793--837", month = "????", year = "2016", CODEN = "JCSIET", DOI = "https://doi.org/10.3233/JCS-160558", ISSN = "0926-227X (print), 1875-8924 (electronic)", ISSN-L = "0926-227X", bibdate = "Mon Feb 27 15:51:12 MST 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib; https://www.math.utah.edu/pub/tex/bib/linux.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, journal-URL = "http://content.iospress.com/journals/journal-of-computer-security", } @Article{Guo:2016:FNB, author = "Jian Guo and Fangming Liu and John C. S. Lui and Hai Jin", title = "Fair network bandwidth allocation in {IaaS} datacenters via a cooperative game approach", journal = j-IEEE-TRANS-NETWORKING, volume = "24", number = "2", pages = "873--886", month = apr, year = "2016", CODEN = "IEANEP", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Tue Oct 18 12:04:13 MDT 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "With wide application of virtualization technology, tenants are able to access isolated cloud services by renting the shared resources in Infrastructure-as-a-Service (IaaS) datacenters. Unlike resources such as CPU and memory, datacenter network, which relies on traditional transport-layer protocols, suffers unfairness due to a lack of virtual machine (VM)-level bandwidth guarantees. In this paper, we model the datacenter bandwidth allocation as a cooperative game, toward VM-based fairness across the datacenter with two main objectives: (1) guarantee bandwidth for VMs based on their base bandwidth requirements, and (2) share residual bandwidth in proportion to the weights of VMs. Through a bargaining game approach, we propose a bandwidth allocation algorithm, Falloc, to achieve the asymmetric Nash bargaining solution (NBS) in datacenter networks, which exactly meets our objectives. The cooperative structure of the algorithm is exploited to develop an online algorithm for practical real-world implementation. We validate Falloc with experiments under diverse scenarios and show that by adapting to different network requirements of VMs, Falloc can achieve fairness among VMs and balance the tradeoff between bandwidth guarantee and proportional bandwidth sharing. Our large-scale trace-driven simulations verify that Falloc achieves high utilization while maintaining fairness among VMs in datacenters.", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771", } @Article{Hale:2016:EHP, author = "Kyle C. Hale and Peter A. Dinda", title = "Enabling Hybrid Parallel Runtimes Through Kernel and Virtualization Support", journal = j-SIGPLAN, volume = "51", number = "7", pages = "161--175", month = jul, year = "2016", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/3007611.2892255", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat Sep 16 10:18:12 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "In our hybrid runtime (HRT) model, a parallel runtime system and the application are together transformed into a specialized OS kernel that operates entirely in kernel mode and can thus implement exactly its desired abstractions on top of fully privileged hardware access. We describe the design and implementation of two new tools that support the HRT model. The first, the Nautilus Aerokernel, is a kernel framework specifically designed to enable HRTs for x64 and Xeon Phi hardware. Aerokernel primitives are specialized for HRT creation and thus can operate much faster, up to two orders of magnitude faster, than related primitives in Linux. Aerokernel primitives also exhibit much lower variance in their performance, an important consideration for some forms of parallelism. We have realized several prototype HRTs, including one based on the Legion runtime, and we provide application macrobenchmark numbers for our Legion HRT. The second tool, the hybrid virtual machine (HVM), is an extension to the Palacios virtual machine monitor that allows a single virtual machine to simultaneously support a traditional OS and software stack alongside an HRT with specialized hardware access. The HRT can be booted in a time comparable to a Linux user process startup, and functions in the HRT, which operate over the user process's memory, can be invoked by the process with latencies not much higher than those of a function call.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "VEE '16 conference proceedings.", } @Article{Hand:2016:TPH, author = "Steve Hand", title = "Technical Perspective: High-performance virtualization: are we done?", journal = j-CACM, volume = "59", number = "1", pages = "107--107", month = jan, year = "2016", CODEN = "CACMA2", DOI = "https://doi.org/10.1145/2845910", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Fri Jan 15 16:12:33 MST 2016", bibsource = "http://www.acm.org/pubs/contents/journals/cacm/; https://www.math.utah.edu/pub/tex/bib/cacm2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://cacm.acm.org/magazines/2015/1/195736/fulltext", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J79", } @Article{Hao:2016:IRO, author = "Zheng Hao and Dong Xiaoshe and Zhu Zhengdong and Chen Baoke and Bai Xiuxiu and Zhang Xingjun and Wang Endong", title = "Improving the Reliability of the Operating System Inside a {VM}", journal = j-COMP-J, volume = "59", number = "5", pages = "715--740", month = may, year = "2016", CODEN = "CMPJA6", DOI = "https://doi.org/10.1093/comjnl/bxv111", ISSN = "0010-4620 (print), 1460-2067 (electronic)", ISSN-L = "0010-4620", bibdate = "Wed May 11 07:49:41 MDT 2016", bibsource = "http://comjnl.oxfordjournals.org/content/59/5.toc; https://www.math.utah.edu/pub/tex/bib/compj2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://comjnl.oxfordjournals.org/content/59/5/715", acknowledgement = ack-nhfb, fjournal = "Computer Journal", journal-URL = "http://comjnl.oxfordjournals.org/", onlinedate = "December 9, 2015", } @Article{Haque:2016:ACV, author = "Syed Arefinul Haque and Salekul Islam and Md. Jahidul Islam and Jean-Charles Gr{\'e}goire", title = "An architecture for client virtualization: a case study", journal = j-COMP-NET-AMSTERDAM, volume = "100", number = "??", pages = "75--89", day = "8", month = may, year = "2016", CODEN = "????", ISSN = "1389-1286 (print), 1872-7069 (electronic)", ISSN-L = "1389-1286", bibdate = "Thu May 12 08:55:09 MDT 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib; https://www.math.utah.edu/pub/tex/bib/pvm.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1389128616300421", acknowledgement = ack-nhfb, fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)", journal-URL = "http://www.sciencedirect.com/science/journal/13891286/", } @Article{Hong:2016:AAQ, author = "Cheol-Ho Hong and Kyungwoon Lee and Hyunchan Park and Chuck Yoo", title = "{ANCS}: Achieving {QoS} through Dynamic Allocation of Network Resources in Virtualized Clouds", journal = j-SCI-PROG, volume = "2016", number = "??", pages = "4708195:1--4708195:10", month = "????", year = "2016", CODEN = "SCIPEV", DOI = "https://doi.org/10.1155/2016/4708195", ISSN = "1058-9244 (print), 1875-919X (electronic)", ISSN-L = "1058-9244", bibdate = "Tue Sep 20 07:53:42 MDT 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/sciprogram.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.hindawi.com/journals/sp/2016/4708195/", acknowledgement = ack-nhfb, fjournal = "Scientific Programming", journal-URL = "https://www.hindawi.com/journals/sp/", journalabr = "Sci. Prog", } @Article{Hong:2016:OCT, author = "Ding-Yong Hong and Chun-Chen Hsu and Cheng-Yi Chou and Wei-Chung Hsu and Pangfeng Liu and Jan-Jan Wu", title = "Optimizing Control Transfer and Memory Virtualization in Full System Emulators", journal = j-TACO, volume = "12", number = "4", pages = "47:1--47:??", month = jan, year = "2016", CODEN = "????", DOI = "https://doi.org/10.1145/2837027", ISSN = "1544-3566 (print), 1544-3973 (electronic)", ISSN-L = "1544-3566", bibdate = "Tue Feb 16 15:36:38 MST 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/taco.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Full system emulators provide virtual platforms for several important applications, such as kernel and system software development, co-verification with cycle accurate CPU simulators, or application development for hardware still in development. Full system emulators usually use dynamic binary translation to obtain reasonable performance. This paper focuses on optimizing the performance of full system emulators. First, we optimize performance by enabling classic control transfer optimizations of dynamic binary translation in full system emulation, such as indirect branch target caching and block chaining. Second, we improve the performance of memory virtualization of cross-ISA virtual machines by improving the efficiency of the software translation lookaside buffer (software TLB). We implement our optimizations on QEMU, an industrial-strength full system emulator, along with the Android emulator. Experimental results show that our optimizations achieve an average speedup of 1.98X for ARM-to-X86-64 QEMU running SPEC CINT2006 benchmarks with train inputs. Our optimizations also achieve an average speedup of 1.44X and 1.40X for IA32-to-X86-64 QEMU and AArch64-to-X86-64 QEMU on SPEC CINT2006. We use a set of real applications downloaded from Google Play as benchmarks for the Android emulator. Experimental results show that our optimizations achieve an average speedup of 1.43X for the Android emulator running these applications.", acknowledgement = ack-nhfb, articleno = "47", fjournal = "ACM Transactions on Architecture and Code Optimization (TACO)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J924", } @Article{Hoque:2016:AAT, author = "Endadul Hoque and Hyojeong Lee and Rahul Potharaju and Charles Killian and Cristina Nita-Rotaru", title = "Automated Adversarial Testing of Unmodified Wireless Routing Implementations", journal = j-IEEE-TRANS-NETWORKING, volume = "24", number = "6", pages = "3369--3382", month = dec, year = "2016", CODEN = "IEANEP", DOI = "https://doi.org/10.1109/TNET.2016.2520474", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Sat Jan 21 07:15:40 MST 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Numerous routing protocols have been designed and subjected to model checking and simulations. However, model checking the design or testing the simulator-based prototype of a protocol does not guarantee that the implementation is free of bugs and vulnerabilities. Testing implementations beyond their basic functionality also known as adversarial testing can increase protocol robustness. We focus on automated adversarial testing of real-world implementations of wireless routing protocols. In our previous work we created Turret, a platform that uses a network emulator and virtualization to test unmodified binaries of general distributed systems. Based on Turret, we create Turret-W designed specifically for wireless routing protocols. Turret-W includes new functionalities such as differentiating routing messages from data messages to enable evaluation of attacks on the control plane and the data plane separately, support for several additional protocols e.g., those that use homogeneous\slash heterogeneous packet formats, those that run on geographic forwarding not just IP, those that operate at the data link layer instead of the network layer, support for several additional attacks e.g., replay attacks and for establishment of adversarial side-channels that allow for collusion. Turret-W can test not only general routing attacks, but also wireless specific attacks such as wormhole. Using Turret-W on publicly available implementations of five representative routing protocols, we re-discovered 37 attacks and 3 bugs. All these bugs and 5 of the total attacks were not previously reported to the best of our knowledge.", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771", } @Article{Huang:2016:BKB, author = "Yu-Ju Huang and Hsuan-Heng Wu and Yeh-Ching Chung and Wei-Chung Hsu", title = "Building a {KVM}-based Hypervisor for a Heterogeneous System Architecture Compliant System", journal = j-SIGPLAN, volume = "51", number = "7", pages = "3--15", month = jul, year = "2016", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/3007611.2892246", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat Sep 16 10:18:12 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Heterogeneous System Architecture (HSA) is an architecture developed by the HSA foundation aiming at reducing programmability barriers as well as improving communication efficiency for heterogeneous computing. For example, HSA allows heterogeneous computing devices to share the same virtual address space. This feature allows programmers to bypass explicit data copying between devices, as was required in the past. HSA features such as job dispatching through user level queues and memory based signaling help to reduce communication latency between the host and other computing devices. While the new features in HSA enable more efficient heterogeneous computing, they also introduce new challenges to system virtualization, especially in memory virtualization and I/O virtualization. This work investigates the issues involved in HSA virtualization and implements a KVM-based hypervisor that supports the main features of HSA inside guest operating systems. Furthermore, this work shows that with the newly introduced hypervisor for HSA, system resources in HSA-compliant AMD Kaveri can be effectively shared between multiple guest operating systems.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "VEE '16 conference proceedings.", } @Article{Jiang:2016:FAF, author = "Jianhua Jiang and Yunzhao Feng and Milan Parmar and Keqin Li", title = "{FP-ABC}: Fast and Parallel {ABC} Based Energy-Efficiency Live {VM} Allocation Policy in Data Centers", journal = j-SCI-PROG, volume = "2016", number = "??", pages = "9524379:1--9524379:9", month = "????", year = "2016", CODEN = "SCIPEV", DOI = "https://doi.org/10.1155/2016/9524379", ISSN = "1058-9244 (print), 1875-919X (electronic)", ISSN-L = "1058-9244", bibdate = "Tue Sep 20 07:53:40 MDT 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/sciprogram.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.hindawi.com/journals/sp/2016/9524379/", acknowledgement = ack-nhfb, fjournal = "Scientific Programming", journal-URL = "https://www.hindawi.com/journals/sp/", journalabr = "Sci. Prog", } @Article{Junior:2016:PEV, author = "Francisco Heron de Carvalho Junior and Cenez Ara{\'u}jo Rezende", title = "Performance evaluation of virtual execution environments for intensive computing on usual representations of multidimensional arrays", journal = j-SCI-COMPUT-PROGRAM, volume = "132 (part 1)", number = "??", pages = "29--49", day = "15", month = dec, year = "2016", CODEN = "SCPGD4", ISSN = "0167-6423 (print), 1872-7964 (electronic)", ISSN-L = "0167-6423", bibdate = "Fri Nov 25 16:43:48 MST 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/scicomputprogram.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167642316300065", acknowledgement = ack-nhfb, fjournal = "Science of Computer Programming", journal-URL = "http://www.sciencedirect.com/science/journal/01676423/", } @Article{Kang:2016:MPV, author = "Junbin Kang and Chunming Hu and Tianyu Wo and Ye Zhai and Benlong Zhang and Jinpeng Huai", title = "{MultiLanes}: Providing Virtualized Storage for {OS}-Level Virtualization on Manycores", journal = j-TOS, volume = "12", number = "3", pages = "12:1--12:??", month = jun, year = "2016", CODEN = "????", DOI = "https://doi.org/10.1145/2801155", ISSN = "1553-3077 (print), 1553-3093 (electronic)", ISSN-L = "1553-3077", bibdate = "Sat Mar 25 07:00:06 MDT 2017", bibsource = "http://www.acm.org/pubs/contents/journals/tos/; https://www.math.utah.edu/pub/tex/bib/tos.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "OS-level virtualization is often used for server consolidation in data centers because of its high efficiency. However, the sharing of storage stack services among the colocated containers incurs contention on shared kernel data structures and locks within I/O stack, leading to severe performance degradation on manycore platforms incorporating fast storage technologies (e.g., SSDs based on nonvolatile memories). This article presents MultiLanes, a virtualized storage system for OS-level virtualization on manycores. MultiLanes builds an isolated I/O stack on top of a virtualized storage device for each container to eliminate contention on kernel data structures and locks between them, thus scaling them to manycores. Meanwhile, we propose a set of techniques to tune the overhead induced by storage-device virtualization to be negligible, and to scale the virtualized devices to manycores on the host, which itself scales poorly. To reduce the contention within each single container, we further propose SFS, which runs multiple file-system instances through the proposed virtualized storage devices, distributes all files under each directory among the underlying file-system instances, then stacks a unified namespace on top of them. The evaluation of our prototype system built for Linux container (LXC) on a 32-core machine with both a RAM disk and a modern flash-based SSD demonstrates that MultiLanes scales much better than Linux in micro- and macro-benchmarks, bringing significant performance improvements, and that MultiLanes with SFS can further reduce the contention within each single container.", acknowledgement = ack-nhfb, articleno = "12", fjournal = "ACM Transactions on Storage", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J960", } @Article{Kansal:2016:EAV, author = "Nidhi Jain Kansal and Inderveer Chana", title = "Energy-aware Virtual Machine Migration for Cloud Computing --- A Firefly Optimization Approach", journal = j-J-GRID-COMP, volume = "14", number = "2", pages = "327--345", month = jun, year = "2016", CODEN = "????", DOI = "https://doi.org/10.1007/s10723-016-9364-0", ISSN = "1570-7873 (print), 1572-9184 (electronic)", ISSN-L = "1570-7873", bibdate = "Mon May 30 08:02:34 MDT 2016", bibsource = "http://link.springer.com/journal/10723/14/2; https://www.math.utah.edu/pub/tex/bib/jgridcomp.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer.com/article/10.1007/s10723-016-9364-0", acknowledgement = ack-nhfb, fjournal = "Journal of Grid Computing", journal-URL = "http://link.springer.com/journal/10723", } @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{Katsaros:2016:EFE, author = "Gregory Katsaros and Pascal Stichler and Josep Subirats and Jordi Guitart", title = "Estimation and forecasting of ecological efficiency of virtual machines", journal = j-FUT-GEN-COMP-SYS, volume = "55", number = "??", pages = "480--494", month = feb, year = "2016", CODEN = "FGSEVI", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Fri Dec 4 07:08:16 MST 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X15000035", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X/", } @Article{Kertesz:2016:PBV, author = "A. Kertesz and J. D. Dombi and A. Benyi", title = "A Pliant-based Virtual Machine Scheduling Solution to Improve the Energy Efficiency of {IaaS} Clouds", journal = j-J-GRID-COMP, volume = "14", number = "1", pages = "41--53", month = mar, year = "2016", CODEN = "????", DOI = "https://doi.org/10.1007/s10723-015-9336-9", ISSN = "1570-7873 (print), 1572-9184 (electronic)", ISSN-L = "1570-7873", bibdate = "Mon May 30 08:02:34 MDT 2016", bibsource = "http://link.springer.com/journal/10723/14/1; https://www.math.utah.edu/pub/tex/bib/jgridcomp.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer.com/article/10.1007/s10723-015-9336-9", acknowledgement = ack-nhfb, fjournal = "Journal of Grid Computing", journal-URL = "http://link.springer.com/journal/10723", } @Article{Kim:2016:DOF, author = "Junghyun Kim and Gangwon Jo and Jaehoon Jung and Jungwon Kim and Jaejin Lee", title = "A distributed {OpenCL} framework using redundant computation and data replication", journal = j-SIGPLAN, volume = "51", number = "6", pages = "553--569", month = jun, year = "2016", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2980983.2908094", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Mon Sep 5 07:32:25 MDT 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/pvm.bib; https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Applications written solely in OpenCL or CUDA cannot execute on a cluster as a whole. Most previous approaches that extend these programming models to clusters are based on a common idea: designating a centralized host node and coordinating the other nodes with the host for computation. However, the centralized host node is a serious performance bottleneck when the number of nodes is large. In this paper, we propose a scalable and distributed OpenCL framework called SnuCL-D for large-scale clusters. SnuCL-D's remote device virtualization provides an OpenCL application with an illusion that all compute devices in a cluster are confined in a single node. To reduce the amount of control-message and data communication between nodes, SnuCL-D replicates the OpenCL host program execution and data in each node. We also propose a new OpenCL host API function and a queueing optimization technique that significantly reduce the overhead incurred by the previous centralized approaches. To show the effectiveness of SnuCL-D, we evaluate SnuCL-D with a microbenchmark and eleven benchmark applications on a large-scale CPU cluster and a medium-scale GPU cluster.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "PLDI '16 conference proceedings.", } @Article{Kim:2016:SCD, author = "Channoh Kim and Sungmin Kim and Hyeon Gyu Cho and Dooyoung Kim and Jaehyeok Kim and Young H. Oh and Hakbeom Jang and Jae W. Lee", title = "Short-circuit dispatch: accelerating virtual machine interpreters on embedded processors", journal = j-COMP-ARCH-NEWS, volume = "44", number = "3", pages = "291--303", month = jun, year = "2016", CODEN = "CANED2", DOI = "https://doi.org/10.1145/3007787.3001168", ISSN = "0163-5964 (print), 1943-5851 (electronic)", ISSN-L = "0163-5964", bibdate = "Thu Jan 12 18:43:43 MST 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigarch.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Interpreters are widely used to implement high-level language virtual machines (VMs), especially on resource-constrained embedded platforms. Many scripting languages employ interpreter-based VMs for their advantages over native code compilers, such as portability, smaller resource footprint, and compact codes. For efficient interpretation a script (program) is first compiled into an intermediate representation, or bytecodes. The canonical interpreter then runs an infinite loop that fetches, decodes, and executes one bytecode at a time. This bytecode dispatch loop is a well-known source of inefficiency, typically featuring a large jump table with a hard-to-predict indirect jump. Most existing techniques to optimize this loop focus on reducing the misprediction rate of this indirect jump in both hardware and software. However, these techniques are much less effective on embedded processors with shallow pipelines and low IPCs. Instead, we tackle another source of inefficiency more prominent on embedded platforms--redundant computation in the dispatch loop. To this end, we propose Short-Circuit Dispatch (SCD), a low-cost architectural extension that enables fast, hardware-based bytecode dispatch with fewer instructions. The key idea of SCD is to overlay the software-created bytecode jump table on a branch target buffer (BTB). Once a bytecode is fetched, the BTB is looked up using the bytecode, instead of PC, as key. If it hits, the interpreter directly jumps to the target address retrieved from the BTB; otherwise, it goes through the original dispatch path. This effectively eliminates redundant computation in the dispatcher code for decode, bound check, and target address calculation, thus significantly reducing total instruction count. Our simulation results demonstrate that SCD achieves geomean speedups of 19.9\% and 14.1\% for two production-grade script interpreters for Lua and JavaScript, respectively. Moreover, our fully synthesizable RTL design based on a RISC-V embedded processor shows that SCD improves the EDP of the Lua interpreter by 24.2\%, while increasing the chip area by only 0.72\% at a 40nm technology node.", acknowledgement = ack-nhfb, fjournal = "ACM SIGARCH Computer Architecture News", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89", remark = "ISCA '16 conference proceedings.", } @Article{Knodel:2016:MLR, author = "Oliver Knodel and Paul R. Genssler and Rainer G. Spallek", title = "Migration of long-running Tasks between Reconfigurable Resources using Virtualization", journal = j-COMP-ARCH-NEWS, volume = "44", number = "4", pages = "56--61", month = sep, year = "2016", CODEN = "CANED2", DOI = "https://doi.org/10.1145/3039902.3039913", ISSN = "0163-5964 (print), 1943-5851 (electronic)", ISSN-L = "0163-5964", bibdate = "Thu Jan 12 18:43:44 MST 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigarch.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Computing performance and scalability are the essential basics in modern data centres. Field Programmable Gate Arrays (FPGAs) provide a promising opportunity to improve performance, security and energy efficiency. Especially background acceleration of computationally complex and long-running tasks is an important field of application. A flexible use of reconfigurable devices within a cloud context requires an abstraction of the actual hardware through virtualization. In this paper we present an approach inspired by paravirtualized machines for the integration of reconfigurable hardware into cloud services. Using partial reconfiguration our hardware and software framework virtualizes a single physical FPGA to enable multiple independent user designs. Essential components are the management of those virtual user-defined accelerators (vFPGA) and their migration between physical FPGAs to achieve higher system-wide utilization. The migration requires saving and restoring the internal state or context of the vFPGA. We demonstrate the application possibilities and the resource trade-off of our approach by transferring a running design from one physical FPGA to another. Moreover, we present future perspectives for the use of FPGAs in cloud-based environments.", acknowledgement = ack-nhfb, fjournal = "ACM SIGARCH Computer Architecture News", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89", remark = "HEART '16 conference proceedings.", } @Article{Kokkinos:2016:SLM, author = "Panagiotis Kokkinos and Dimitris Kalogeras and Anna Levin and Emmanouel Varvarigos", title = "Survey: Live Migration and Disaster Recovery over Long-Distance Networks", journal = j-COMP-SURV, volume = "49", number = "2", pages = "26:1--26:??", month = sep, year = "2016", CODEN = "CMSVAN", DOI = "https://doi.org/10.1145/2940295", ISSN = "0360-0300 (print), 1557-7341 (electronic)", ISSN-L = "0360-0300", bibdate = "Tue Nov 8 16:12:56 MST 2016", bibsource = "http://www.acm.org/pubs/contents/journals/surveys/; https://www.math.utah.edu/pub/tex/bib/compsurv.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "We study the virtual machine live migration (LM) and disaster recovery (DR) from a networking perspective, considering long-distance networks, for example, between data centers. These networks are usually constrained by limited available bandwidth, increased latency and congestion, or high cost of use when dedicated network resources are used, while their exact characteristics cannot be controlled. LM and DR present several challenges due to the large amounts of data that need to be transferred over long-distance networks, which increase with the number of migrated or protected resources. In this context, our work presents the way LM and DR are currently being performed and their operation in long-distance networking environments, discussing related issues and bottlenecks and surveying other works. We also present the way networks are evolving today and the new technologies and protocols (e.g., software-defined networking, or SDN, and flexible optical networks) that can be used to boost the efficiency of LM and DR over long distances. Traffic redirection in a long-distance environment is also an important part of the whole equation, since it directly affects the transparency of LM and DR. Related works and solutions both from academia and the industry are presented.", acknowledgement = ack-nhfb, articleno = "26", fjournal = "ACM Computing Surveys", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204", } @Article{Koskinen:2016:RCR, author = "Eric Koskinen and Junfeng Yang", title = "Reducing crash recoverability to reachability", journal = j-SIGPLAN, volume = "51", number = "1", pages = "97--108", month = jan, year = "2016", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2914770.2837648", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Jun 9 17:13:57 MDT 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Software applications run on a variety of platforms (filesystems, virtual slices, mobile hardware, etc.) that do not provide 100\% uptime. As such, these applications may crash at any unfortunate moment losing volatile data and, when re-launched, they must be able to correctly recover from potentially inconsistent states left on persistent storage. From a verification perspective, crash recovery bugs can be particularly frustrating because, even when it has been formally proved for a program that it satisfies a property, the proof is foiled by these external events that crash and restart the program. In this paper we first provide a hierarchical formal model of what it means for a program to be crash recoverable. Our model captures the recoverability of many real world programs, including those in our evaluation which use sophisticated recovery algorithms such as shadow paging and write-ahead logging. Next, we introduce a novel technique capable of automatically proving that a program correctly recovers from a crash via a reduction to reachability. Our technique takes an input control-flow automaton and transforms it into an encoding that blends the capture of snapshots of pre-crash states into a symbolic search for a proof that recovery terminates and every recovered execution simulates some crash-free execution. Our encoding is designed to enable one to apply existing abstraction techniques in order to do the work that is necessary to prove recoverability. We have implemented our technique in a tool called Eleven82, capable of analyzing C programs to detect recoverability bugs or prove their absence. We have applied our tool to benchmark examples drawn from industrial file systems and databases, including GDBM, LevelDB, LMDB, PostgreSQL, SQLite, VMware and ZooKeeper. Within minutes, our tool is able to discover bugs or prove that these fragments are crash recoverable.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "POPL '16 conference proceedings.", } @Article{Kumar:2016:HTA, author = "Mohan Raj Velayudhan Kumar and Shriram Raghunathan", title = "Heterogeneity and thermal aware adaptive heuristics for energy efficient consolidation of virtual machines in infrastructure clouds", journal = j-J-COMP-SYS-SCI, volume = "82", number = "2", pages = "191--212", month = mar, year = "2016", CODEN = "JCSSBM", DOI = "https://doi.org/10.1016/j.jcss.2015.07.005", ISSN = "0022-0000 (print), 1090-2724 (electronic)", ISSN-L = "0022-0000", bibdate = "Tue Jan 29 15:27:32 MST 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jcompsyssci.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S002200001500080X", acknowledgement = ack-nhfb, fjournal = "Journal of Computer and System Sciences", journal-URL = "http://www.sciencedirect.com/science/journal/00220000", } @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-SIGPLAN, volume = "51", number = "4", pages = "49--65", month = apr, year = "2016", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2954679.2872378", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Jun 9 17:13:59 MDT 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.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 = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "ASPLOS '16 conference proceedings.", } @Article{Lama:2016:APP, author = "Palden Lama and Yanfei Guo and Changjun Jiang and Xiaobo Zhou", title = "Autonomic Performance and Power Control for Co-Located {Web} Applications in Virtualized Datacenters", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "27", number = "5", pages = "1289--1302", month = may, year = "2016", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2015.2453971", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Fri Apr 15 13:45:22 MDT 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.computer.org/csdl/trans/td/2016/05/07152934-abs.html", abstract-URL = "http://www.computer.org/csdl/trans/td/2016/05/07152934-abs.html", acknowledgement = ack-nhfb, journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=71", } @Article{Lee:2016:ACS, author = "Byeongcheol Lee", title = "Adaptive Correction of Sampling Bias in Dynamic Call Graphs", journal = j-TACO, volume = "12", number = "4", pages = "45:1--45:??", month = jan, year = "2016", CODEN = "????", DOI = "https://doi.org/10.1145/2840806", ISSN = "1544-3566 (print), 1544-3973 (electronic)", ISSN-L = "1544-3566", bibdate = "Tue Feb 16 15:36:38 MST 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/taco.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "This article introduces a practical low-overhead adaptive technique of correcting sampling bias in profiling dynamic call graphs. Timer-based sampling keeps the overhead low but sampling bias lowers the accuracy when either observable call events or sampling actions are not equally spaced in time. To mitigate sampling bias, our adaptive correction technique weights each sample by monitoring time-varying spacing of call events and sampling actions. We implemented and evaluated our adaptive correction technique in Jikes RVM, a high-performance virtual machine. In our empirical evaluation, our technique significantly improved the sampling accuracy without measurable overhead and resulted in effective feedback directed inlining.", acknowledgement = ack-nhfb, articleno = "45", fjournal = "ACM Transactions on Architecture and Code Optimization (TACO)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J924", } @Article{Lee:2016:HSC, author = "Yuan-Cheng Lee and Chih-Wen Hsueh", title = "Hardware\slash Software Co-Design of Memory Page Translation for Mobile Virtualization", journal = j-IEEE-TRANS-COMPUT, volume = "65", number = "10", pages = "3070--3082", month = "????", year = "2016", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.2016.2519907", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Tue Sep 13 06:19:58 MDT 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Computers", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", } @Article{Li:2016:EEM, author = "Hongjian Li and Guofeng Zhu and Chengyuan Cui and Hong Tang and Yusheng Dou and Chen He", title = "Energy-efficient migration and consolidation algorithm of virtual machines in data centers for cloud computing", journal = j-COMPUTING, volume = "98", number = "3", pages = "303--317", month = mar, year = "2016", CODEN = "CMPTA2", DOI = "https://doi.org/10.1007/s00607-015-0467-4", ISSN = "0010-485X (print), 1436-5057 (electronic)", ISSN-L = "0010-485X", bibdate = "Fri Feb 9 14:54:03 MST 2018", bibsource = "http://link.springer.com/journal/607/98/3; https://www.math.utah.edu/pub/tex/bib/computing.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Computing", journal-URL = "http://link.springer.com/journal/607", } @Article{Li:2016:ICV, author = "Mingfu Li and Jingping Bi and Zhongcheng Li", title = "Improving consolidation of virtual machine based on virtual switching overhead estimation", journal = j-J-NETW-COMPUT-APPL, volume = "59", number = "??", pages = "158--167", month = jan, year = "2016", CODEN = "JNCAF3", ISSN = "1084-8045 (print), 1095-8592 (electronic)", ISSN-L = "1084-8045", bibdate = "Mon Feb 8 11:55:17 MST 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S108480451500171X", acknowledgement = ack-nhfb, fjournal = "Journal of Network and Computer Applications", journal-URL = "http://www.sciencedirect.com/science/journal/10848045", } @Article{Li:2016:SSO, author = "Xi Li and Anthony Ventresque and John Murphy", title = "{SOC}: Satisfaction-Oriented Virtual Machine Consolidation in Enterprise Data Centers", journal = j-INT-J-PARALLEL-PROG, volume = "44", number = "1", pages = "130--150", month = feb, year = "2016", CODEN = "IJPPE5", DOI = "https://doi.org/10.1007/s10766-014-0333-6", ISSN = "0885-7458 (print), 1573-7640 (electronic)", ISSN-L = "0885-7458", bibdate = "Mon Jan 25 08:22:48 MST 2016", bibsource = "http://link.springer.com/journal/10766/44/1; https://www.math.utah.edu/pub/tex/bib/intjparallelprogram.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer.com/article/10.1007/s10766-014-0333-6", acknowledgement = ack-nhfb, fjournal = "International Journal of Parallel Programming", journal-URL = "http://link.springer.com/journal/10766", } @Article{Li:2016:VMT, author = "Hongxing Li and Chuan Wu and Zongpeng Li and Francis C. M. Lau", title = "Virtual machine trading in a federation of clouds: individual profit and social welfare maximization", journal = j-IEEE-TRANS-NETWORKING, volume = "24", number = "3", pages = "1827--1840", month = jun, year = "2016", CODEN = "IEANEP", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Fri Sep 9 11:16:43 MDT 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "By sharing resources among different cloud providers, the paradigm of federated clouds exploits temporal availability of resources and geographical diversity of operational costs for efficient job service. While interoperability issues across different cloud platforms in a cloud federation have been extensively studied, fundamental questions on cloud economics remain: When and how should a cloud trade resources (e.g., virtual machines) with others, such that its net profit is maximized over the long run, while a close-to-optimal social welfare in the entire federation can also be guaranteed? To answer this question, a number of important, interrelated decisions, including job scheduling, server provisioning, and resource pricing, should be dynamically and jointly made, while the long-term profit optimality is pursued. In this work, we design efficient algorithms for intercloud virtual machine (VM) trading and scheduling in a cloud federation. For VM transactions among clouds, we design a double-auction-based mechanism that is strategy-proof, individual-rational, ex-post budget-balanced, and efficient to execute over time. Closely combined with the auction mechanism is a dynamic VM trading and scheduling algorithm, which carefully decides the true valuations of VMs in the auction, optimally schedules stochastic job arrivals with different service level agreements (SLAs) onto the VMs, and judiciously turns on and off servers based on the current electricity prices. Through rigorous analysis, we show that each individual cloud, by carrying out the dynamic algorithm in the online double auction, can achieve a time-averaged profit arbitrarily close to the offline optimum. Asymptotic optimality in social welfare is also achieved under homogeneous cloud settings. We carry out simulations to verify the effectiveness of our algorithms, and examine the achievable social welfare under heterogeneous cloud settings, as driven by the real-world Google cluster usage traces.", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771", } @Article{Lin:2016:BSC, author = "Po-Ching Lin and Ying-Dar Lin and Cheng-Ying Wu and Yuan-Cheng Lai and Yi-Chih Kao", title = "Balanced Service Chaining in Software-Defined Networks with Network Function Virtualization", journal = j-COMPUTER, volume = "49", number = "11", pages = "68--76", month = nov, year = "2016", CODEN = "CPTRB4", ISSN = "0018-9162 (print), 1558-0814 (electronic)", ISSN-L = "0018-9162", bibdate = "Thu Nov 17 05:45:00 MST 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/computer2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.computer.org/csdl/mags/co/2016/11/mco2016110068-abs.html", acknowledgement = ack-nhfb, journal-URL = "http://www.computer.org/portal/web/csdl/magazines/computer", } @Article{Lin:2016:HTS, author = "Weiwei Lin and Wentai Wu and James Z. Wang", title = "A Heuristic Task Scheduling Algorithm for Heterogeneous Virtual Clusters", journal = j-SCI-PROG, volume = "2016", number = "??", pages = "7040276:1--7040276:10", month = "????", year = "2016", CODEN = "SCIPEV", DOI = "https://doi.org/10.1155/2016/7040276", ISSN = "1058-9244 (print), 1875-919X (electronic)", ISSN-L = "1058-9244", bibdate = "Tue Sep 20 07:53:42 MDT 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/sciprogram.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.hindawi.com/journals/sp/2016/7040276/", acknowledgement = ack-nhfb, fjournal = "Scientific Programming", journal-URL = "https://www.hindawi.com/journals/sp/", journalabr = "Sci. Prog", } @Article{Lin:2016:JOQ, author = "Shih-Chun Lin and Pu Wang and Min Luo", title = "Jointly optimized {QoS}-aware virtualization and routing in software defined networks", journal = j-COMP-NET-AMSTERDAM, volume = "96", number = "??", pages = "69--78", day = "26", month = feb, year = "2016", CODEN = "????", ISSN = "1389-1286 (print), 1872-7069 (electronic)", ISSN-L = "1389-1286", bibdate = "Fri Feb 5 18:59:02 MST 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S138912861500256X", acknowledgement = ack-nhfb, fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)", journal-URL = "http://www.sciencedirect.com/science/journal/13891286/", } @Article{Lu:2016:VCV, author = "Yaojie Lu and Seyedamin Rooholamin and Sotirios G. Ziavras", title = "Vector Coprocessor Virtualization for Simultaneous Multithreading", journal = j-TECS, volume = "15", number = "3", pages = "57:1--57:??", month = jul, year = "2016", CODEN = "????", DOI = "https://doi.org/10.1145/2898364", ISSN = "1539-9087 (print), 1558-3465 (electronic)", ISSN-L = "1539-9087", bibdate = "Thu Jul 21 17:18:13 MDT 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/multithreading.bib; https://www.math.utah.edu/pub/tex/bib/tecs.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Vector coprocessors (VPs), commonly being assigned exclusively to a single thread/core, are not often performance and energy efficient due to mismatches with the vector needs of individual applications. We present in this article an easy-to-implement VP virtualization technique that, when applied, enables a multithreaded VP to simultaneously execute multiple threads of similar or arbitrary vector lengths to achieve improved aggregate utilization. With a vector register file (VRF) virtualization technique invented to dynamically allocate physical vector registers to threads, our VP virtualization approach improves programmer productivity by providing at runtime a distinct physical register name space to each competing thread, thus eliminating the need to solve register-name conflicts statically. We applied our virtualization technique to a multithreaded VP and prototyped an FPGA-based multicore processor system that supports VP sharing as well as power gating for better energy efficiency. Under the dynamic creation of disparate threads, our benchmarking results show impressive VP speedups of up to 333\% and total energy savings of up to 37\% with proper thread scheduling and power gating compared to a similar-sized system that allows VP access to just one thread at a time.", acknowledgement = ack-nhfb, articleno = "57", fjournal = "ACM Transactions on Embedded Computing Systems", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J840", } @Article{Luo:2016:OMM, author = "Qiuming Luo and Feng Xiao and Zhong Ming and Hao Li and Jianyong Chen and Jianhua Zhang", title = "Optimizing the Memory Management of a Virtual Machine Monitor on a {NUMA} System", journal = j-COMPUTER, volume = "49", number = "6", pages = "66--74", month = jun, year = "2016", CODEN = "CPTRB4", DOI = "https://doi.org/10.1109/MC.2016.169", ISSN = "0018-9162 (print), 1558-0814 (electronic)", ISSN-L = "0018-9162", bibdate = "Tue Jun 21 15:00:51 MDT 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/computer2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://csdl.computer.org/csdl/mags/co/2016/06/mco2016060066-abs.html", abstract-URL = "http://csdl.computer.org/csdl/mags/co/2016/06/mco2016060066-abs.html", acknowledgement = ack-nhfb, journal-URL = "http://www.computer.org/portal/web/csdl/magazines/computer", } @Article{Maio:2016:MEC, author = "Vincenzo {De Maio} and Radu Prodan and Shajulin Benedict and Gabor Kecskemeti", title = "Modelling energy consumption of network transfers and virtual machine migration", journal = j-FUT-GEN-COMP-SYS, volume = "56", number = "??", pages = "388--406", month = mar, year = "2016", CODEN = "FGSEVI", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Sat Dec 12 06:47:21 MST 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X15002307", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X/", } @Article{Mann:2016:MAV, author = "Zolt{\'a}n {\'A}d{\'a}m Mann", title = "Multicore-Aware Virtual Machine Placement in Cloud Data Centers", journal = j-IEEE-TRANS-COMPUT, volume = "65", number = "11", pages = "3357--3369", month = nov, year = "2016", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.2016.2529629", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Tue Oct 11 05:14:24 MDT 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Computers", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", } @Article{Martini:2016:SOA, author = "Barbara Martini and Federica Paganelli", title = "A Service-Oriented Approach for Dynamic Chaining of Virtual Network Functions over Multi-Provider Software-Defined Networks", journal = j-FUTURE-INTERNET, volume = "8", number = "2", pages = "24", day = "01", month = jun, year = "2016", CODEN = "????", DOI = "https://doi.org/10.3390/fi8020024", ISSN = "1999-5903", ISSN-L = "1999-5903", bibdate = "Thu Nov 21 16:50:55 MST 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/future-internet.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.mdpi.com/1999-5903/8/2/24", abstract = "Emerging technologies such as Software-Defined Networks (SDN) and Network Function Virtualization (NFV) promise to address cost reduction and flexibility in network operation while enabling innovative network service delivery models. However, operational network service delivery solutions still need to be developed that actually exploit these technologies, especially at the multi-provider level. Indeed, the implementation of network functions as software running over a virtualized infrastructure and provisioned on a service basis let one envisage an ecosystem of network services that are dynamically and flexibly assembled by orchestrating Virtual Network Functions even across different provider domains, thereby coping with changeable user and service requirements and context conditions. In this paper we propose an approach that adopts Service-Oriented Architecture (SOA) technology-agnostic architectural guidelines in the design of a solution for orchestrating and dynamically chaining Virtual Network Functions. We discuss how SOA, NFV, and SDN may complement each other in realizing dynamic network function chaining through service composition specification, service selection, service delivery, and placement tasks. Then, we describe the architecture of a SOA-inspired NFV orchestrator, which leverages SDN-based network control capabilities to address an effective delivery of elastic chains of Virtual Network Functions. Preliminary results of prototype implementation and testing activities are also presented. The benefits for Network Service Providers are also described that derive from the adaptive network service provisioning in a multi-provider environment through the orchestration of computing and networking services to provide end users with an enhanced service experience.", acknowledgement = ack-nhfb, journal-URL = "https://www.mdpi.com/journal/futureinternet", remark = "Special Issue Ecosystemic Evolution Feeded by Smart Systems.", } @Article{Marz:2016:RPC, author = "Stephen Marz and Brad {Vander Zanden}", title = "Reducing Power Consumption and Latency in Mobile Devices Using an Event Stream Model", journal = j-TECS, volume = "16", number = "1", pages = "11:1--11:??", month = nov, year = "2016", CODEN = "????", DOI = "https://doi.org/10.1145/2964203", ISSN = "1539-9087 (print), 1558-3465 (electronic)", ISSN-L = "1539-9087", bibdate = "Thu Nov 3 16:48:38 MDT 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2010.bib; https://www.math.utah.edu/pub/tex/bib/tecs.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Most consumer-based mobile devices use asynchronous events to awaken apps. Currently, event handling is implemented in either an application or an application framework such as Java's virtual machine (VM) or Microsoft's .NET, and it uses a ``polling loop'' that periodically queries an event queue to determine if an event has occurred. These loops must awaken the process, check for an event, and then put the process back to sleep many times per second. This constant arousal prevents the CPU from being put into a deep sleep state, which increases power consumption. Additionally, the process cannot check for events while it sleeps, and this delay in handling events increases latency, which is the time that elapses between when an event occurs and when the application responds to the event. We call this model of event handling a ``pull'' model because it needs to query hardware devices or software queues in order to ``pull'' events from them. Recent advances in input devices support direct, informative interrupts to the kernel when an event occurs. This allows us to develop a much more efficient event-handling model called the ``Event Stream Model'' (ESM). This model is a push model that allows a process to sleep as long as no event occurs but then immediately awakens a process when an event occurs. This model eliminates the polling loop, thus eliminating latency-inducing sleep between polls and reducing unnecessary power consumption. To work properly, the ESM model must be implemented in the kernel rather than in the application. In this article, we describe how we implemented the ESM model in Android operating system (OS). Our results show that with the event stream model, power consumption is reduced by up to 23.8\% in certain circumstances, and latency is reduced by an average of 13.6ms.", acknowledgement = ack-nhfb, articleno = "11", fjournal = "ACM Transactions on Embedded Computing Systems", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J840", remark = "Special issue on VIPES, special issue on ICESS2015 and regular papers.", } @Article{Masdari:2016:OVM, author = "Mohammad Masdari and Sayyid Shahab Nabavi and Vafa Ahmadi", title = "An overview of virtual machine placement schemes in cloud computing", journal = j-J-NETW-COMPUT-APPL, volume = "66", number = "??", pages = "106--127", month = may, year = "2016", CODEN = "JNCAF3", ISSN = "1084-8045 (print), 1095-8592 (electronic)", ISSN-L = "1084-8045", bibdate = "Mon Jun 20 11:42:21 MDT 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1084804516000291", acknowledgement = ack-nhfb, fjournal = "Journal of Network and Computer Applications", journal-URL = "http://www.sciencedirect.com/science/journal/10848045", } @Article{Merrifield:2016:PIE, author = "Timothy Merrifield and H. Reza Taheri", title = "Performance Implications of Extended Page Tables on Virtualized x86 Processors", journal = j-SIGPLAN, volume = "51", number = "7", pages = "25--35", month = jul, year = "2016", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/3007611.2892258", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat Sep 16 10:18:12 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.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. In this paper, we present a detailed accounting of the TLB miss processing costs on virtualized x86 servers for an exhaustive set of workloads, in particular, two very demanding industry standard workloads. We show that an implementation of the TPC-C workload that actively uses 475 GB of memory on a 72-CPU Haswell-EP server spends 20\% of its time processing TLB misses when the application runs in a VM. Although this is a non-trivial amount, it is only 4.2\% higher than the TLB miss processing costs on bare metal. The multi-VM VMmark benchmark sees 12.3\% in TLB miss processing, but only 4.3\% of that can be attributed to virtualization overheads. 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 = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "VEE '16 conference proceedings.", } @Article{Nathan:2016:SRO, author = "Senthil Nathan and Umesh Bellur and Purushottam Kulkarni", title = "On Selecting the Right Optimizations for Virtual Machine Migration", journal = j-SIGPLAN, volume = "51", number = "7", pages = "37--49", month = jul, year = "2016", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/3007611.2892247", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat Sep 16 10:18:12 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "To reduce the migration time of a virtual machine and network traffic generated during migration, existing works have proposed a number of optimizations to pre-copy live migration. These optimizations are delta compression, page skip, deduplication, and data compression. The cost-benefit analysis of these optimizations may preclude the use of certain optimizations in specific scenarios. However, no study has compared the performance {\&} cost of these optimizations, and identified the impact of application behaviour on performance gain. Hence, it is not clear for a given migration scenario and an application, what is the best optimization that one must employ? In this paper, we present a comprehensive empirical study using a large number of workloads to provide recommendations on selection of optimizations for pre-copy live migration. The empirical study reveals that page skip is an important optimization as it reduces network traffic by 20\% with negligible additional CPU cost. Data compression yields impressive gains in reducing network traffic (37\%) but at the cost of a significant increase in CPU consumption (5$ \times $). De-duplication needs to be applied with utmost care as the increase in CPU utilization might outweigh the benefits considerably. The combination of page skip and data compression works the best across workloads and results in a significant reduction in network traffic (40\%).", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "VEE '16 conference proceedings.", } @Article{No:2016:MMC, author = "Jaechun No and Sung-soon Park", title = "{MultiCache}: Multilayered Cache Implementation for {I/O} Virtualization", journal = j-SCI-PROG, volume = "2016", number = "??", pages = "3780163:1--3780163:13", month = "????", year = "2016", CODEN = "SCIPEV", DOI = "https://doi.org/10.1155/2016/3780163", ISSN = "1058-9244 (print), 1875-919X (electronic)", ISSN-L = "1058-9244", bibdate = "Tue Sep 20 07:53:40 MDT 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/sciprogram.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.hindawi.com/journals/sp/2016/3780163/", acknowledgement = ack-nhfb, fjournal = "Scientific Programming", journal-URL = "https://www.hindawi.com/journals/sp/", journalabr = "Sci. Prog", } @Article{OLoughlin:2016:SVM, author = "John O'Loughlin and Lee Gillam", title = "Sibling virtual machine co-location confirmation and avoidance tactics for Public Infrastructure Clouds", journal = j-J-SUPERCOMPUTING, volume = "72", number = "3", pages = "961--984", month = mar, year = "2016", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-016-1627-9", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Thu Apr 7 12:01:25 MDT 2016", bibsource = "http://link.springer.com/journal/11227/72/3; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer.com/content/pdf/10.1007/s11227-016-1627-9.pdf", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @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 = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.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{Ouyang:2016:SUV, author = "Jiannan Ouyang and John R. Lange and Haoqiang Zheng", title = "{Shoot4U}: Using {VMM} Assists to Optimize {TLB} Operations on Preempted {vCPUs}", journal = j-SIGPLAN, volume = "51", number = "7", pages = "17--23", month = jul, year = "2016", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/3007611.2892245", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat Sep 16 10:18:12 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Virtual Machine based approaches to workload consolidation, as seen in IaaS cloud as well as datacenter platforms, have long had to contend with performance degradation caused by synchronization primitives inside the guest environments. These primitives can be affected by virtual CPU preemptions by the host scheduler that can introduce delays that are orders of magnitude longer than those primitives were designed for. While a significant amount of work has focused on the behavior of spinlock primitives as a source of these performance issues, spinlocks do not represent the entirety of synchronization mechanisms that are susceptible to scheduling issues when running in a virtualized environment. In this paper we address the virtualized performance issues introduced by TLB shootdown operations. Our profiling study, based on the PARSEC benchmark suite, has shown that up to 64\% of a VM's CPU time can be spent on TLB shootdown operations under certain workloads. In order to address this problem, we present a paravirtual TLB shootdown scheme named Shoot4U. Shoot4U completely eliminates TLB shootdown preemptions by invalidating guest TLB entries from the VMM and allowing guest TLB shootdown operations to complete without waiting for remote virtual CPUs to be scheduled. Our performance evaluation using the PARSEC benchmark suite demonstrates that Shoot4U can reduce benchmark runtime by up to 85\% compared an unmodified Linux kernel, and up to 44\% over a state-of-the-art paravirtual TLB shootdown scheme.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "VEE '16 conference proceedings.", } @Article{Pape:2016:LIS, author = "Tobias Pape and Tim Felgentreff and Robert Hirschfeld and Anton Gulenko and Carl Friedrich Bolz", title = "Language-independent storage strategies for tracing {JIT}-based virtual machines", journal = j-SIGPLAN, volume = "51", number = "2", pages = "104--113", month = feb, year = "2016", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2936313.2816716", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Jun 9 17:13:58 MDT 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2010.bib; https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Storage strategies have been proposed as a run-time optimization for the PyPy Python implementation and have shown promising results for optimizing execution speed and memory requirements. However, it remained unclear whether the approach works equally well in other dynamic languages. Furthermore, while PyPy is based on RPython, a language to write VMs with reusable components such as a tracing just-in-time compiler and garbage collection, the strategies design itself was not generalized to be reusable across languages implemented using that same toolchain. In this paper, we present a general design and implementation for storage strategies and show how they can be reused across different RPython-based languages. We evaluate the performance of our implementation for RSqueak, an RPython-based VM for Squeak/Smalltalk and show that storage strategies may indeed offer performance benefits for certain workloads in other dynamic programming languages.We furthermore evaluate the generality of our implementation by applying it to Topaz, a Ruby VM, and Pycket, a Racket implementation.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "DLS '15 conference proceedings.", } @Article{Park:2016:VCB, author = "Joonseok Park and Youngmin An and Taejun Kang and Keunhyuk Yeom", title = "Virtual cloud bank: consumer-centric service recommendation process and architectural perspective for cloud service brokers", journal = j-COMPUTING, volume = "98", number = "11", pages = "1153--1184", month = nov, year = "2016", CODEN = "CMPTA2", DOI = "https://doi.org/10.1007/s00607-016-0497-6", ISSN = "0010-485X (print), 1436-5057 (electronic)", ISSN-L = "0010-485X", bibdate = "Fri Feb 9 14:54:06 MST 2018", bibsource = "http://link.springer.com/journal/607/98/11; https://www.math.utah.edu/pub/tex/bib/computing.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Computing", journal-URL = "http://link.springer.com/journal/607", } @Article{Paulo:2016:EDD, author = "Jo{\~a}o Paulo and Jos{\'e} Pereira", title = "Efficient Deduplication in a Distributed Primary Storage Infrastructure", journal = j-TOS, volume = "12", number = "4", pages = "20:1--20:??", month = aug, year = "2016", CODEN = "????", DOI = "https://doi.org/10.1145/2876509", ISSN = "1553-3077 (print), 1553-3093 (electronic)", ISSN-L = "1553-3077", bibdate = "Sat Mar 25 07:00:07 MDT 2017", bibsource = "http://www.acm.org/pubs/contents/journals/tos/; https://www.math.utah.edu/pub/tex/bib/tos.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "A large amount of duplicate data typically exists across volumes of virtual machines in cloud computing infrastructures. Deduplication allows reclaiming these duplicates while improving the cost-effectiveness of large-scale multitenant infrastructures. However, traditional archival and backup deduplication systems impose prohibitive storage overhead for virtual machines hosting latency-sensitive applications. Primary deduplication systems reduce such penalty but rely on special cluster filesystems, centralized components, or restrictive workload assumptions. Also, some of these systems reduce storage overhead by confining deduplication to off-peak periods that may be scarce in a cloud environment. We present DEDIS, a dependable and fully decentralized system that performs cluster-wide off-line deduplication of virtual machines' primary volumes. DEDIS works on top of any unsophisticated storage backend, centralized or distributed, as long as it exports a basic shared block device interface. Also, DEDIS does not rely on data locality assumptions and incorporates novel optimizations for reducing deduplication overhead and increasing its reliability. The evaluation of an open-source prototype shows that minimal I/O overhead is achievable even when deduplication and intensive storage I/O are executed simultaneously. Also, our design scales out and allows collocating DEDIS components and virtual machines in the same servers, thus, sparing the need of additional hardware.", acknowledgement = ack-nhfb, articleno = "20", fjournal = "ACM Transactions on Storage", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J960", } @Article{Peng:2016:RTE, author = "Yaqiong Peng and Song Wu and Hai Jin", title = "{Robinhood}: Towards Efficient Work-Stealing in Virtualized Environments", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "27", number = "8", pages = "2363--2376", month = aug, year = "2016", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2015.2492563", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Tue Jul 19 06:55:24 MDT 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://csdl.computer.org/csdl/trans/td/2016/08/07300465-abs.html", abstract-URL = "http://csdl.computer.org/csdl/trans/td/2016/08/07300465-abs.html", acknowledgement = ack-nhfb, journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=71", } @Article{Peng:2016:TCT, author = "Yang Peng and Kai Chen and Guohui Wang and Wei Bai and Yangming Zhao and Hao Wang and Yanhui Geng and Zhiqiang Ma and Lin Gu", title = "Towards Comprehensive Traffic Forecasting in Cloud Computing: Design and Application", journal = j-IEEE-TRANS-NETWORKING, volume = "24", number = "4", pages = "2210--2222", month = aug, year = "2016", CODEN = "IEANEP", DOI = "https://doi.org/10.1109/TNET.2015.2458892", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Fri Oct 28 17:19:55 MDT 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "In this paper, we present our effort towards comprehensive traffic forecasting for big data applications using external, light-weighted file system monitoring. Our idea is motivated by the key observations that rich traffic demand information already exists in the log and meta-data files of many big data applications, and that such information can be readily extracted through run-time file system monitoring. As the first step, we use Hadoop as a concrete example to explore our methodology and develop a system called HadoopWatch to predict traffic demands of Hadoop applications. We further implement HadoopWatch in a small-scale testbed with 10 physical servers and 30 virtual machines. Our experiments over a series of MapReduce applications demonstrate that HadoopWatch can forecast the traffic demand with almost 100\% accuracy and time advance. Furthermore, it makes no modification on the Hadoop framework, and introduces little overhead to the application performance. Finally, to showcase the utility of accurate traffic prediction made by HadoopWatch, we design and implement a simple HadoopWatch-enabled network optimization module into the HadoopWatch controller, and with realistic Hadoop job benchmarks we find that even a simple algorithm can leverage the forecasting results provided by HadoopWatch to significantly improve the Hadoop job completion time by up to 14.72\%.", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771", } @Article{Petrashko:2016:CGL, author = "Dmitry Petrashko and Vlad Ureche and Ondrej Lhot{\'a}k and Martin Odersky", title = "Call graphs for languages with parametric polymorphism", journal = j-SIGPLAN, volume = "51", number = "10", pages = "394--409", month = oct, year = "2016", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/3022671.2983991", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat Sep 16 10:18:13 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "The performance of contemporary object oriented languages depends on optimizations such as devirtualization, inlining, and specialization, and these in turn depend on precise call graph analysis. Existing call graph analyses do not take advantage of the information provided by the rich type systems of contemporary languages, in particular generic type arguments. Many existing approaches analyze Java bytecode, in which generic types have been erased. This paper shows that this discarded information is actually very useful as the context in a context-sensitive analysis, where it significantly improves precision and keeps the running time small. Specifically, we propose and evaluate call graph construction algorithms in which the contexts of a method are (i) the type arguments passed to its type parameters, and (ii) the static types of the arguments passed to its term parameters. The use of static types from the caller as context is effective because it allows more precise dispatch of call sites inside the callee. Our evaluation indicates that the average number of contexts required per method is small. We implement the analysis in the Dotty compiler for Scala, and evaluate it on programs that use the type-parametric Scala collections library and on the Dotty compiler itself. The context-sensitive analysis runs 1.4x faster than a context-insensitive one and discovers 20\% more monomorphic call sites at the same time. When applied to method specialization, the imprecision in a context-insensitive call graph would require the average method to be cloned 22 times, whereas the context-sensitive call graph indicates a much more practical 1.00 to 1.50 clones per method. We applied the proposed analysis to automatically specialize generic methods. The resulting automatic transformation achieves the same performance as state-of-the-art techniques requiring manual annotations, while reducing the size of the generated bytecode by up to 5 $ \times $.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "OOPSLA '16 conference proceedings.", } @Article{Pietri:2016:MVM, author = "Ilia Pietri and Rizos Sakellariou", title = "Mapping Virtual Machines onto Physical Machines in Cloud Computing: a Survey", journal = j-COMP-SURV, volume = "49", number = "3", pages = "49:1--49:??", month = nov, year = "2016", CODEN = "CMSVAN", DOI = "https://doi.org/10.1145/2983575", ISSN = "0360-0300 (print), 1557-7341 (electronic)", ISSN-L = "0360-0300", bibdate = "Tue Nov 8 16:12:56 MST 2016", bibsource = "http://www.acm.org/pubs/contents/journals/surveys/; https://www.math.utah.edu/pub/tex/bib/compsurv.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Cloud computing enables users to provision resources on demand and execute applications in a way that meets their requirements by choosing virtual resources that fit their application resource needs. Then, it becomes the task of cloud resource providers to accommodate these virtual resources onto physical resources. This problem is a fundamental challenge in cloud computing as resource providers need to map virtual resources onto physical resources in a way that takes into account the providers' optimization objectives. This article surveys the relevant body of literature that deals with this mapping problem and how it can be addressed in different scenarios and through different objectives and optimization techniques. The evaluation aspects of different solutions are also considered. The article aims at both identifying and classifying research done in the area adopting a categorization that can enhance understanding of the problem.", acknowledgement = ack-nhfb, articleno = "49", fjournal = "ACM Computing Surveys", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204", } @Article{Piraghaj:2016:VMC, author = "Sareh Fotuhi Piraghaj and Rodrigo N. Calheiros and Jeffrey Chan and Amir Vahid Dastjerdi and Rajkumar Buyya", title = "Virtual Machine Customization and Task Mapping Architecture for Efficient Allocation of Cloud Data Center Resources", journal = j-COMP-J, volume = "59", number = "2", pages = "208--224", month = feb, year = "2016", CODEN = "CMPJA6", DOI = "https://doi.org/10.1093/comjnl/bxv106", ISSN = "0010-4620 (print), 1460-2067 (electronic)", ISSN-L = "0010-4620", bibdate = "Thu Feb 4 06:36:17 MST 2016", bibsource = "http://comjnl.oxfordjournals.org/content/59/2.toc; https://www.math.utah.edu/pub/tex/bib/compj2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://comjnl.oxfordjournals.org/content/59/2/208", acknowledgement = ack-nhfb, fjournal = "Computer Journal", journal-URL = "http://comjnl.oxfordjournals.org/", onlinedate = "November 30, 2015", } @Article{Plotkin:2016:SNV, author = "Gordon D. Plotkin and Nikolaj Bj{\o}rner and Nuno P. Lopes and Andrey Rybalchenko and George Varghese", title = "Scaling network verification using symmetry and surgery", journal = j-SIGPLAN, volume = "51", number = "1", pages = "69--83", month = jan, year = "2016", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2914770.2837657", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Jun 9 17:13:57 MDT 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "On the surface, large data centers with about 100,000 stations and nearly a million routing rules are complex and hard to verify. However, these networks are highly regular by design; for example they employ fat tree topologies with backup routers interconnected by redundant patterns. To exploit these regularities, we introduce network transformations: given a reachability formula and a network, we transform the network into a simpler to verify network and a corresponding transformed formula, such that the original formula is valid in the network if and only if the transformed formula is valid in the transformed network. Our network transformations exploit network surgery (in which irrelevant or redundant sets of nodes, headers, ports, or rules are ``sliced'' away) and network symmetry (say between backup routers). The validity of these transformations is established using a formal theory of networks. In particular, using Van Benthem--Hennessy--Milner style bisimulation, we show that one can generally associate bisimulations to transformations connecting networks and formulas with their transforms. Our work is a development in an area of current wide interest: applying programming language techniques (in our case bisimulation and modal logic) to problems in switching networks. We provide experimental evidence that our network transformations can speed up by 65x the task of verifying the communication between all pairs of Virtual Machines in a large datacenter network with about 100,000 VMs. An all-pair reachability calculation, which formerly took 5.5 days, can be done in 2 hours, and can be easily parallelized to complete in minutes.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "POPL '16 conference proceedings.", } @Article{Prades:2016:CAX, author = "Javier Prades and Carlos Rea{\~n}o and Federico Silla", title = "{CUDA} acceleration for {Xen} virtual machines in {InfiniBand} clusters with {rCUDA}", journal = j-SIGPLAN, volume = "51", number = "8", pages = "35:1--35:??", month = aug, year = "2016", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/3016078.2851181", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat Sep 16 10:18:12 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Many data centers currently use virtual machines (VMs) to achieve a more efficient usage of hardware resources. However, current virtualization solutions, such as Xen, do not easily provide graphics processing unit (GPU) accelerators to applications running in the virtualized domain with the flexibility usually required in data centers (i.e., managing virtual GPU instances and concurrently sharing them among several VMs). Remote GPU virtualization frameworks such as the rCUDA solution may address this problem. In this work we analyze the use of the rCUDA framework to accelerate scientific applications running inside Xen VMs. Results show that the use of the rCUDA framework is a feasible approach, featuring a very low overhead if an InfiniBand fabric is already present in the cluster.", acknowledgement = ack-nhfb, articleno = "35", fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "PPoPP '16 conference proceedings.", } @Article{Qiang:2016:SCF, author = "Weizhong Qiang and Kang Zhang and Weiqi Dai and Hai Jin", title = "Secure cryptographic functions via virtualization-based outsourced computing", journal = j-CCPE, volume = "28", number = "11", pages = "3149--3163", day = "10", month = aug, year = "2016", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.3706", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Tue Sep 13 08:30:11 MDT 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", } @Article{Radhakrishnan:2016:ECC, author = "A. Radhakrishnan and V. Kavitha", title = "Energy conservation in cloud data centers by minimizing virtual machines migration through artificial neural network", journal = j-COMPUTING, volume = "98", number = "11", pages = "1185--1202", month = nov, year = "2016", CODEN = "CMPTA2", DOI = "https://doi.org/10.1007/s00607-016-0499-4", ISSN = "0010-485X (print), 1436-5057 (electronic)", ISSN-L = "0010-485X", bibdate = "Fri Feb 9 14:54:06 MST 2018", bibsource = "http://link.springer.com/journal/607/98/11; https://www.math.utah.edu/pub/tex/bib/computing.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Computing", journal-URL = "http://link.springer.com/journal/607", } @Article{Reano:2016:TRG, author = "Carlos Rea{\~n}o and Federico Silla", title = "Tuning remote {GPU} virtualization for {InfiniBand} networks", journal = j-J-SUPERCOMPUTING, volume = "72", number = "12", pages = "4520--4545", month = dec, year = "2016", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-016-1754-3", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Sat Jun 24 10:31:30 MDT 2017", bibsource = "http://link.springer.com/journal/11227/72/12; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Ren:2016:SMO, author = "Yi Ren and Ling Liu and Qi Zhang and Qingbo Wu and Jianbo Guan and Jinzhu Kong and Huadong Dai and Lisong Shao", title = "Shared-Memory Optimizations for Inter-Virtual-Machine Communication", journal = j-COMP-SURV, volume = "48", number = "4", pages = "49:1--49:??", month = may, year = "2016", CODEN = "CMSVAN", DOI = "https://doi.org/10.1145/2847562", ISSN = "0360-0300 (print), 1557-7341 (electronic)", ISSN-L = "0360-0300", bibdate = "Mon May 2 16:19:12 MDT 2016", bibsource = "http://www.acm.org/pubs/contents/journals/surveys/; https://www.math.utah.edu/pub/tex/bib/compsurv.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Virtual machines (VMs) and virtualization are one of the core computing technologies today. Inter-VM communication is not only prevalent but also one of the leading costs for data-intensive systems and applications in most data centers and cloud computing environments. One way to improve inter-VM communication efficiency is to support coresident VM communication using shared-memory-based methods and resort to the traditional TCP/IP for communications between VMs that are located on different physical machines. In recent years, several independent kernel development efforts have been dedicated to improving communication efficiency between coresident VMs using shared-memory channels, and the development efforts differ from one another in terms of where and how the shared-memory channel is established. In this article, we provide a comprehensive overview of the design choices and techniques for performance optimization of coresident inter-VM communication. We examine the key issues for improving inter-VM communication using shared-memory-based mechanisms, such as implementation choices in the software stack, seamless agility for dynamic addition or removal of coresident VMs, and multilevel transparency, as well as advanced requirements in reliability, security, and stability. An in-depth comparison of state-of-the-art research efforts, implementation techniques, evaluation methods, and performance is conducted. We conjecture that this comprehensive survey will not only provide the foundation for developing the next generation of inter-VM communication optimization mechanisms but also offers opportunities to both cloud infrastructure providers and cloud service providers and consumers for improving communication efficiency between coresident VMs in virtualized computing platforms.", acknowledgement = ack-nhfb, articleno = "49", fjournal = "ACM Computing Surveys", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204", } @Article{Ritson:2016:BWM, author = "Carl G. Ritson and Scott Owens", title = "Benchmarking weak memory models", journal = j-SIGPLAN, volume = "51", number = "8", pages = "24:1--24:??", month = aug, year = "2016", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/3016078.2851150", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat Sep 16 10:18:12 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "To achieve good multi-core performance, modern microprocessors have weak memory models, rather than enforce sequential consistency. This gives the programmer a wide scope for choosing exactly how to implement various aspects of inter-thread communication through the system's shared memory. However, these choices come with both semantic and performance consequences, often in tension with each other. In this paper, we focus on the performance side, and define techniques for evaluating the impact of various choices in using weak memory models, such as where to put fences, and which fences to use. We make no attempt to judge certain strategies as best or most efficient, and instead provide the techniques that will allow the programmer to understand the performance implications when identifying and resolving any semantic/performance trade-offs. In particular, our technique supports the reasoned selection of macrobenchmarks to use in investigating trade-offs in using weak memory models. We demonstrate our technique on both synthetic benchmarks and real-world applications for the Linux Kernel and OpenJDK Hotspot Virtual Machine on the ARMv8 and POWERv7 architectures.", acknowledgement = ack-nhfb, articleno = "24", fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "PPoPP '16 conference proceedings.", } @Article{Robinson:2016:CCM, author = "Forrest J. Robinson and Michael R. Jantz and Prasad A. Kulkarni", title = "Code cache management in managed language {VMs} to reduce memory consumption for embedded systems", journal = j-SIGPLAN, volume = "51", number = "5", pages = "11--20", month = may, year = "2016", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/2980930.2907958", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Mon Sep 5 07:32:24 MDT 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "The compiled native code generated by a just-in-time (JIT) compiler in managed language virtual machines (VM) is placed in a region of memory called the code cache. Code cache management (CCM) in a VM is responsible to find and evict methods from the code cache to maintain execution correctness and manage program performance for a given code cache size or memory budget. Effective CCM can also boost program speed by enabling more aggressive JIT compilation, powerful optimizations, and improved hardware instruction cache and I-TLB performance. Though important, CCM is an overlooked component in VMs. We find that the default CCM policies in Oracle's production-grade HotSpot VM perform poorly even at modest memory pressure. We develop a detailed simulation-based framework to model and evaluate the potential efficiency of many different CCM policies in a controlled and realistic, but VM-independent environment. We make the encouraging discovery that effective CCM policies can sustain high program performance even for very small cache sizes. Our simulation study provides the rationale and motivation to improve CCM strategies in existing VMs. We implement and study the properties of several CCM policies in HotSpot. We find that in spite of working within the bounds of the HotSpot VM's current CCM sub-system, our best CCM policy implementation in HotSpot improves program performance over the default CCM algorithm by 39\%, 41\%, 55\%, and 50\% with code cache sizes that are 90\%, 75\%, 50\%, and 25\% of the desired cache size, on average.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "LCTES '16 conference proceedings.", } @Article{Rodriguez-Silva:2016:IVR, author = "Daniel A. Rodr{\'\i}guez-Silva and Jaime Loureiro-Acu{\~n}a and Francisco J. Gonz{\'a}lez-Casta{\~n}o and Cristina L{\'o}pez-Bravo", title = "Improving the virtualization of rich applications by combining {VNC} and streaming protocols at the hypervisor layer", journal = j-SPE, volume = "46", number = "5", pages = "625--644", month = may, year = "2016", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/spe.2328", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Wed Jun 8 07:13:22 MDT 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", } @Article{Salimian:2016:AFT, author = "Leili Salimian and Faramarz Safi Esfahani and Mohammad-Hossein Nadimi-Shahraki", title = "An adaptive fuzzy threshold-based approach for energy and performance efficient consolidation of virtual machines", journal = j-COMPUTING, volume = "98", number = "6", pages = "641--660", month = jun, year = "2016", CODEN = "CMPTA2", DOI = "https://doi.org/10.1007/s00607-015-0474-5", ISSN = "0010-485X (print), 1436-5057 (electronic)", ISSN-L = "0010-485X", bibdate = "Fri Feb 9 14:54:04 MST 2018", bibsource = "http://link.springer.com/journal/607/98/6; https://www.math.utah.edu/pub/tex/bib/computing.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Computing", journal-URL = "http://link.springer.com/journal/607", } @Article{Samant:2016:HBS, author = "Durgesh Samant and Umesh Bellur", title = "Handling Boot Storms in Virtualized Data Centers --- A Survey", journal = j-COMP-SURV, volume = "49", number = "1", pages = "16:1--16:??", month = jul, year = "2016", CODEN = "CMSVAN", DOI = "https://doi.org/10.1145/2932709", ISSN = "0360-0300 (print), 1557-7341 (electronic)", ISSN-L = "0360-0300", bibdate = "Tue Nov 8 16:12:55 MST 2016", bibsource = "http://www.acm.org/pubs/contents/journals/surveys/; https://www.math.utah.edu/pub/tex/bib/compsurv.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Large-scale virtual machine (VM) deployment in virtualized data centers is a very slow process. This is primarily due to the resource bottlenecks that are created at the storage, network, and host physical machines when a large number of VMs are requested simultaneously. For companies that provide virtual desktops to their employees, it is common to encounter such requests each day, when their employees turn up for work. In addition, a large number of VMs are often required to be deployed instantly, in order to absorb a spike in the workload, at online e-commerce websites. In such scenarios, long deployment times are unacceptable, and reducing them is of paramount importance. In this article, we first abstract out the key techniques suggested in the literature to speed up this deployment process. We follow this with a classification of these techniques into a taxonomy and propose a framework that can be used to compare them. Finally, we identify problem areas that warrant further research and bring out the shortcomings of the current state-of-the-art solutions.", acknowledgement = ack-nhfb, articleno = "16", fjournal = "ACM Computing Surveys", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204", } @Article{Sarimbekov:2016:WCJ, author = "Aibek Sarimbekov and Lukas Stadler and Lubom{\'\i}r Bulej and Andreas Sewe and Andrej Podzimek and Yudi Zheng and Walter Binder", title = "Workload characterization of {JVM} languages", journal = j-SPE, volume = "46", number = "8", pages = "1053--1089", month = aug, year = "2016", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/spe.2337", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Tue Sep 13 08:44:22 MDT 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2010.bib; https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", } @Article{Sarkar:2016:VEC, author = "Vivek Sarkar", title = "Virtualizing the Edge of the Cloud: the New Frontier", journal = j-SIGPLAN, volume = "51", number = "7", pages = "1--1", month = jul, year = "2016", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/3007611.2892243", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat Sep 16 10:18:12 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Over the last two decades, virtualization technologies have turned datacenter infrastructure into multitenant, dynamically provisionable, elastic resource, and formed the basis for the wide adoption of cloud computing. Many of today's cloud applications, however, are based on continuous interactions with end users and their devices, and the trend is only expected to intensify with the expansion of the Internet of Things. The consequent bandwidth and latency requirements of these emerging workloads push the cloud boundary outside of traditional datacenters, giving rise to an edge tier in the end-device-to-cloud-backend infrastructure. Computational resources embedded in anything from standalone microservers to WiFi routers and small cell access points, and their open APIs, present opportunities for deploying application logic and state closer to where it is being used, addressing both latency and backhaul bandwidth problems. This talk will look at the role that existing virtualization technologies can play in providing in this edge tier the required flexibility, dynamic provisioning and isolation, and will outline open problems that require development of new solutions. We will also discuss the opportunities to leverage these technologies to further deal with the diversity in the end-user device and IoT space.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "VEE '16 conference proceedings.", } @Article{Sgandurra:2016:EAT, author = "Daniele Sgandurra and Emil Lupu", title = "Evolution of Attacks, Threat Models, and Solutions for Virtualized Systems", journal = j-COMP-SURV, volume = "48", number = "3", pages = "46:1--46:??", month = feb, year = "2016", CODEN = "CMSVAN", DOI = "https://doi.org/10.1145/2856126", ISSN = "0360-0300 (print), 1557-7341 (electronic)", ISSN-L = "0360-0300", bibdate = "Tue Feb 9 09:29:36 MST 2016", bibsource = "http://www.acm.org/pubs/contents/journals/surveys/; https://www.math.utah.edu/pub/tex/bib/compsurv.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Virtualization technology enables Cloud providers to efficiently use their computing services and resources. Even if the benefits in terms of performance, maintenance, and cost are evident, however, virtualization has also been exploited by attackers to devise new ways to compromise a system. To address these problems, research security solutions have evolved considerably over the years to cope with new attacks and threat models. In this work, we review the protection strategies proposed in the literature and show how some of the solutions have been invalidated by new attacks, or threat models, that were previously not considered. The goal is to show the evolution of the threats, and of the related security and trust assumptions, in virtualized systems that have given rise to complex threat models and the corresponding sophistication of protection strategies to deal with such attacks. We also categorize threat models, security and trust assumptions, and attacks against a virtualized system at the different layers-in particular, hardware, virtualization, OS, and application.", acknowledgement = ack-nhfb, articleno = "46", fjournal = "ACM Computing Surveys", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204", } @Article{Shi:2016:OAF, author = "Weijie Shi and Linquan Zhang and Chuan Wu and Zongpeng Li and Francis C. M. Lau", title = "An Online Auction Framework for Dynamic Resource Provisioning in Cloud Computing", journal = j-IEEE-TRANS-NETWORKING, volume = "24", number = "4", pages = "2060--2073", month = aug, year = "2016", CODEN = "IEANEP", DOI = "https://doi.org/10.1109/TNET.2015.2444657", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Fri Oct 28 17:19:55 MDT 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Auction mechanisms have recently attracted substantial attention as an efficient approach to pricing and allocating resources in cloud computing. This work, to the authors' knowledge, represents the first online combinatorial auction designed for the cloud computing paradigm, which is general and expressive enough to both: (1) optimize system efficiency across the temporal domain instead of at an isolated time point; and (2) model dynamic provisioning of heterogeneous virtual machine VM types in practice. The final result is an online auction framework that is truthful, computationally efficient, and guarantees a competitive ratio \approx 3.30 in social welfare in typical scenarios. The framework consists of three main steps: (1) a tailored primal-dual algorithm that decomposes the long-term optimization into a series of independent one-shot optimization problems, with a small additive loss in competitive ratio; (2) a randomized subframework that applies primal-dual optimization for translating a centralized cooperative social welfare approximation algorithm into an auction mechanism, retaining the competitive ratio while adding truthfulness; and (3) a primal-dual algorithm for approximating the one-shot optimization with a ratio close to e. We also propose two extensions: (1) a binary search algorithm that improves the average-case performance; (2) an improvement to the online auction framework when a minimum budget spending fraction is guaranteed, which produces a better competitive ratio. The efficacy of the online auction framework is validated through theoretical analysis and trace-driven simulation studies. We are also in the hope that the framework can be instructive in auction design for other related problems.", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771", } @Article{Shi:2016:PPA, author = "Xiaoyu Shi and Jin Dong and Seddik M. Djouadi and Yong Feng and Xiao Ma and Yefu Wang", title = "{PAPMSC}: Power-Aware Performance Management Approach for Virtualized {Web} Servers via Stochastic Control", journal = j-J-GRID-COMP, volume = "14", number = "1", pages = "171--191", month = mar, year = "2016", CODEN = "????", DOI = "https://doi.org/10.1007/s10723-015-9341-z", ISSN = "1570-7873 (print), 1572-9184 (electronic)", ISSN-L = "1570-7873", bibdate = "Mon May 30 08:02:34 MDT 2016", bibsource = "http://link.springer.com/journal/10723/14/1; https://www.math.utah.edu/pub/tex/bib/jgridcomp.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer.com/article/10.1007/s10723-015-9341-z", acknowledgement = ack-nhfb, fjournal = "Journal of Grid Computing", journal-URL = "http://link.springer.com/journal/10723", } @Article{Shuja:2016:SMD, author = "Junaid Shuja and Abdullah Gani and Kashif Bilal and Atta Ur Rehman Khan and Sajjad A. Madani and Samee U. Khan and Albert Y. Zomaya", title = "A Survey of Mobile Device Virtualization: Taxonomy and State of the Art", journal = j-COMP-SURV, volume = "49", number = "1", pages = "1:1--1:??", month = jul, year = "2016", CODEN = "CMSVAN", DOI = "https://doi.org/10.1145/2897164", ISSN = "0360-0300 (print), 1557-7341 (electronic)", ISSN-L = "0360-0300", bibdate = "Tue Nov 8 16:12:55 MST 2016", bibsource = "http://www.acm.org/pubs/contents/journals/surveys/; https://www.math.utah.edu/pub/tex/bib/compsurv.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Recent growth in the processing and memory resources of mobile devices has fueled research within the field of mobile virtualization. Mobile virtualization enables multiple persona on a single mobile device by hosting heterogeneous operating systems (OSs) concurrently. However, adding a virtualization layer to resource-constrained mobile devices with real-time requirements can lead to intolerable performance overheads. Hardware virtualization extensions that support efficient virtualization have been incorporated in recent mobile processors. Prior to hardware virtualization extensions, virtualization techniques that are enabled by performance prohibitive and resource consuming software were adopted for mobile devices. Moreover, mobile virtualization solutions lack standard procedures for device component sharing and interfacing between multiple OSSs. The objective of this article is to survey software- and hardware-based mobile virtualization techniques in light of the recent advancements fueled by the hardware support for mobile virtualization. Challenges and issues faced in virtualization of CPU, memory, I/O, interrupt, and network interfaces are highlighted. Moreover, various performance parameters are presented in a detailed comparative analysis to quantify the efficiency of mobile virtualization techniques and solutions.", acknowledgement = ack-nhfb, articleno = "1", fjournal = "ACM Computing Surveys", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204", } @Article{Solaimani:2016:OAD, author = "Mohiuddin Solaimani and Mohammed Iftekhar and Latifur Khan and Bhavani Thuraisingham and Joe Ingram and Sadi Evren Seker", title = "Online anomaly detection for multi-source {VMware} using a distributed streaming framework", journal = j-SPE, volume = "46", number = "11", pages = "1479--1497", month = nov, year = "2016", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/spe.2390", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Tue Nov 15 15:25:10 MST 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", } @Article{Spink:2016:HAC, author = "Tom Spink and Harry Wagstaff and Bj{\"o}rn Franke", title = "Hardware-Accelerated Cross-Architecture Full-System Virtualization", journal = j-TACO, volume = "13", number = "4", pages = "36:1--36:??", month = dec, year = "2016", CODEN = "????", DOI = "https://doi.org/10.1145/2996798", ISSN = "1544-3566 (print), 1544-3973 (electronic)", ISSN-L = "1544-3566", bibdate = "Wed Dec 28 16:24:46 MST 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/taco.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Hardware virtualization solutions provide users with benefits ranging from application isolation through server consolidation to improved disaster recovery and faster server provisioning. While hardware assistance for virtualization is supported by all major processor architectures, including Intel, ARM, PowerPC, and MIPS, these extensions are targeted at virtualization of the same architecture, for example, an x86 guest on an x86 host system. Existing techniques for cross-architecture virtualization, for example, an ARM guest on an x86 host, still incur a substantial overhead for CPU, memory, and I/O virtualization due to the necessity for software emulation of these mismatched system components. In this article, we present a new hardware-accelerated hypervisor called C aptive, employing a range of novel techniques that exploit existing hardware virtualization extensions for improving the performance of full-system cross-platform virtualization. We illustrate how (1) guest memory management unit (MMU) events and operations can be mapped onto host memory virtualization extensions, eliminating the need for costly software MMU emulation, (2) a block-based dynamic binary translation engine inside the virtual machine can improve CPU virtualization performance, (3) memory-mapped guest I/O can be efficiently translated to fast I/O specific calls to emulated devices, and (4) the cost for asynchronous guest interrupts can be reduced. For an ARM-based Linux guest system running on an x86 host with Intel VT support, we demonstrate application performance levels, based on SPEC CPU2006 benchmarks, of up to 5.88$ \times $ over state-of-the-art Qemu and 2.5$ \times $ on average, achieving a guest dynamic instruction throughput of up to 1280 MIPS (million instructions per second) and 915.52 MIPS, on average.", acknowledgement = ack-nhfb, articleno = "36", fjournal = "ACM Transactions on Architecture and Code Optimization (TACO)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J924", } @Article{Sun:2016:NTE, author = "Gang Sun and Dan Liao and Vishal Anand and Dongcheng Zhao and Hongfang Yu", title = "A new technique for efficient live migration of multiple virtual machines", journal = j-FUT-GEN-COMP-SYS, volume = "55", number = "??", pages = "74--86", month = feb, year = "2016", CODEN = "FGSEVI", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Fri Dec 4 07:08:16 MST 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X15002848", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X/", } @Article{Suzuki:2016:GGV, author = "Yusuke Suzuki and Shinpei Kato and Hiroshi Yamada and Kenji Kono", title = "{GPUvm}: {GPU} Virtualization at the Hypervisor", journal = j-IEEE-TRANS-COMPUT, volume = "65", number = "9", pages = "2752--2766", month = "????", year = "2016", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.2015.2506582", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Wed Aug 10 09:04:52 MDT 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Computers", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", } @Article{Toosi:2016:AMC, author = "Adel Nadjaran Toosi and Kurt Vanmechelen and Farzad Khodadadi and Rajkumar Buyya", title = "An Auction Mechanism for Cloud Spot Markets", journal = j-TAAS, volume = "11", number = "1", pages = "2:1--2:??", month = apr, year = "2016", CODEN = "????", DOI = "https://doi.org/10.1145/2843945", ISSN = "1556-4665 (print), 1556-4703 (electronic)", ISSN-L = "1556-4665", bibdate = "Thu Apr 21 08:51:10 MDT 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/taas.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Dynamic forms of resource pricing have recently been introduced by cloud providers that offer Infrastructure as a Service (IaaS) capabilities in order to maximize profits and balance resource supply and demand. The design of a mechanism that efficiently prices perishable cloud resources in line with a provider's profit maximization goal remains an open research challenge, however. In this article, we propose the Online Extended Consensus Revenue Estimate mechanism in the setting of a recurrent, multiunit and single price auction for IaaS cloud resources. The mechanism is envy-free, has a high probability of being truthful, and generates a near optimal profit for the provider. We combine the proposed auction design with a scheme for dynamically calculating reserve prices based on data center Power Usage Effectiveness (PUE) and electricity costs. Our simulation-based evaluation of the mechanism demonstrates its effectiveness under a broad variety of market conditions. In particular, we show how it improves on the classical uniform price auction, and we investigate the value of prior knowledge on the execution time of virtual machines for maximizing profit. We also developed a system prototype and conducted a small-scale experimental study with a group of 10 users that confirms the truthfulness property of the mechanism in a real test environment.", acknowledgement = ack-nhfb, articleno = "2", fjournal = "ACM Transactions on Autonomous and Adaptive Systems (TAAS)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1010", } @Article{Trajano:2016:TPL, author = "Alex F. R. Trajano and Marcial P. Fernandez", title = "Two-phase load balancing of {In-Memory Key-Value Storages} using {Network Functions Virtualization (NFV)}", journal = j-J-NETW-COMPUT-APPL, volume = "69", number = "??", pages = "1--13", month = jul, year = "2016", CODEN = "JNCAF3", ISSN = "1084-8045 (print), 1095-8592 (electronic)", ISSN-L = "1084-8045", bibdate = "Mon Jun 20 11:42:22 MDT 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1084804516300789", acknowledgement = ack-nhfb, fjournal = "Journal of Network and Computer Applications", journal-URL = "http://www.sciencedirect.com/science/journal/10848045", } @Article{Varvello:2016:MPC, author = "Matteo Varvello and Rafael Laufer and Feixiong Zhang and T. V. Lakshman", title = "Multilayer Packet Classification With Graphics Processing Units", journal = j-IEEE-TRANS-NETWORKING, volume = "24", number = "5", pages = "2728--2741", month = oct, year = "2016", CODEN = "IEANEP", DOI = "https://doi.org/10.1109/TNET.2015.2491265", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Sat Jan 21 07:15:39 MST 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "The rapid growth of server virtualization has ignited a wide adoption of software-based virtual switches, with significant interest in speeding up their performance. In a similar trend, software-defined networking SDN, with its strong reliance on rule-based flow classification, has also created renewed interest in multi-dimensional packet classification. However, despite these recent advances, the performance of current software-based packet classifiers is still limited, mostly by the low parallelism of general-purpose CPUs. In this paper, we explore how to accelerate packet classification using the high parallelism and latency-hiding capabilities of graphic processing units GPUs. We implement GPU-accelerated versions for both linear and tuple search, currently deployed in virtual switches, and also introduce a novel algorithm called Bloom search. These algorithms are integrated with high-speed packet I/O to build GSwitch, a GPU-accelerated software switch, and also to extend Open vSwitch. Our experimental evaluation indicates that, under realistic rule sets, GSwitch is at least 7 $ {\times } $ faster than an equally-priced CPU classifier. We also show that our GPU-accelerated Open vSwitch outperforms the classic Open vSwitch implementation by a factor of 10, on average.", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771", } @Article{Venkatesan:2016:SCA, author = "Vimalraj Venkatesan and Y. C. Tay and Qingsong Wei", title = "Sizing Cleancache Allocation for Virtual Machines' Transcendent Memory", journal = j-IEEE-TRANS-COMPUT, volume = "65", number = "6", pages = "1949--1963", month = "????", year = "2016", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.2015.2456025", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Tue May 31 08:56:47 MDT 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Computers -", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", } @Article{Verdu:2016:PSA, author = "Javier Verdu and Alex Pajuelo", title = "Performance Scalability Analysis of {JavaScript} Applications with {Web Workers}", journal = j-IEEE-COMPUT-ARCHIT-LETT, volume = "15", number = "2", pages = "105--108", month = jul # "\slash " # dec, year = "2016", CODEN = "????", DOI = "https://doi.org/10.1109/LCA.2015.2494585", ISSN = "1556-6056 (print), 1556-6064 (electronic)", ISSN-L = "1556-6056", bibdate = "Thu Jun 20 17:18:18 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeecomputarchitlett.bib; https://www.math.utah.edu/pub/tex/bib/java2010.bib; https://www.math.utah.edu/pub/tex/bib/multithreading.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Web applications are getting closer to the performance of native applications taking advantage of new standard-based technologies. The recent HTML5 standard includes, among others, the Web Workers API that allows executing JavaScript applications on multiple threads, or workers. However, the internals of the browser's JavaScript virtual machine does not expose direct relation between workers and running threads in the browser and the utilization of logical cores in the processor. As a result, developers do not know how performance actually scales on different environments and therefore what is the optimal number of workers on parallel JavaScript codes. This paper presents the first performance scalability analysis of parallel web apps with multiple workers. We focus on two case studies representative of different worker execution models. Our analyses show performance scaling on different parallel processor microarchitectures and on three major web browsers in the market. Besides, we study the impact of co-running applications on the web app performance. The results provide insights for future approaches to automatically find out the optimal number of workers that provide the best tradeoff between performance and resource usage to preserve system responsiveness and user experience, especially on environments with unexpected changes on system workload.", acknowledgement = ack-nhfb, affiliation = "Verdu, J (Reprint Author), BarcelonaTECH UPC, Dept Comp Architecture, Barcelona, Spain. Verdu, Javier; Pajuelo, Alex, BarcelonaTECH UPC, Dept Comp Architecture, Barcelona, Spain.", author-email = "jverdu@ac.upc.edu mpajuelo@ac.upc.edu", da = "2019-06-20", doc-delivery-number = "EH9MM", eissn = "1556-6064", fjournal = "IEEE Computer Architecture Letters", funding-acknowledgement = "Spanish Ministry of Economy and Competitiveness (MINECO) [TIN2012-34557]", funding-text = "This work has been supported by the Spanish Ministry of Economy and Competitiveness (MINECO) under contract TIN2012-34557.", journal-iso = "IEEE Comput. Archit. Lett.", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=10208", keywords = "HTML5; javascript; multithreading; parallelism; web apps; web workers", number-of-cited-references = "12", oa = "Green Published", ORCID-numbers = "Pajuelo, Alex/0000-0002-5510-6860 Verdu Mula, Javier/0000-0003-4485-2419", research-areas = "Computer Science", times-cited = "1", unique-id = "Verdu:2016:PSA", web-of-science-categories = "Computer Science, Hardware \& Architecture", } @Article{Vinco:2016:CMV, author = "Sara Vinco and Valerio Guarnieri and Franco Fummi", title = "Code Manipulation for Virtual Platform Integration", journal = j-IEEE-TRANS-COMPUT, volume = "65", number = "9", pages = "2694--2708", month = sep, year = "2016", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.2015.2500573", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Wed Aug 10 09:04:52 MDT 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Computers", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", } @Article{Waldspurger:2016:SSL, author = "Carl Waldspurger and Emery Berger and Abhishek Bhattacharjee and Kevin Pedretti and Simon Peter and Chris Rossbach", title = "Sweet Spots and Limits for Virtualization", journal = j-SIGPLAN, volume = "51", number = "7", pages = "177--177", month = jul, year = "2016", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/3007611.2892249", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat Sep 16 10:18:12 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "This year at VEE, we added a panel to discuss the state of virtualization: what problems are solved? what problems are important? and what problems may not be worth solving? The panelist are experts in areas ranging from hardware virtualization up to language-level virtualization.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "VEE '16 conference proceedings.", } @Article{Wang:2016:BPF, author = "Yang Wang and Qian Hu and Xiaojun Cao", title = "A branch-and-price framework for optimal virtual network embedding", journal = j-COMP-NET-AMSTERDAM, volume = "94", number = "??", pages = "318--326", day = "15", month = jan, year = "2016", CODEN = "????", ISSN = "1389-1286 (print), 1872-7069 (electronic)", ISSN-L = "1389-1286", bibdate = "Fri Feb 5 18:54:57 MST 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1389128615004089", acknowledgement = ack-nhfb, fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)", journal-URL = "http://www.sciencedirect.com/science/journal/13891286/", } @Article{Wang:2016:CIK, author = "Huang Wang and Xianglan Chen and Huaping Chen", title = "A Cross-{ISA} Kernelized High-Performance Parallel Emulator", journal = j-INT-J-PARALLEL-PROG, volume = "44", number = "6", pages = "1118--1141", month = dec, year = "2016", CODEN = "IJPPE5", DOI = "https://doi.org/10.1007/s10766-015-0379-0", ISSN = "0885-7458 (print), 1573-7640 (electronic)", ISSN-L = "0885-7458", bibdate = "Tue Sep 20 10:50:01 MDT 2016", bibsource = "http://link.springer.com/journal/10766/44/6; https://www.math.utah.edu/pub/tex/bib/intjparallelprogram.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer.com/article/10.1007/s10766-015-0379-0", acknowledgement = ack-nhfb, fjournal = "International Journal of Parallel Programming", journal-URL = "http://link.springer.com/journal/10766", keywords = "Cross-ISA emulator; Dynamic binary translation; QEMU; Virtual machine; xKEMU", } @Article{Wang:2016:DMB, author = "Zhigang Wang and Xiaolin Wang and Fang Hou and Yingwei Luo and Zhenlin Wang", title = "Dynamic Memory Balancing for Virtualization", journal = j-TACO, volume = "13", number = "1", pages = "2:1--2:??", month = apr, year = "2016", CODEN = "????", DOI = "https://doi.org/10.1145/2851501", ISSN = "1544-3566 (print), 1544-3973 (electronic)", ISSN-L = "1544-3566", bibdate = "Tue Apr 5 16:27:36 MDT 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/taco.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Allocating memory dynamically for virtual machines (VMs) according to their demands provides significant benefits as well as great challenges. Efficient memory resource management requires knowledge of the memory demands of applications or systems at runtime. A widely proposed approach is to construct a miss ratio curve (MRC) for a VM, which not only summarizes the current working set size (WSS) of the VM but also models the relationship between its performance and the target memory allocation size. Unfortunately, the cost of monitoring and maintaining the MRC structures is nontrivial. This article first introduces a low-cost WSS tracking system with effective optimizations on data structures, as well as an efficient mechanism to decrease the frequency of monitoring. We also propose a Memory Balancer (MEB), which dynamically reallocates guest memory based on the predicted WSS. Our experimental results show that our prediction schemes yield a high accuracy of 95.2\% and low overhead of 2\%. Furthermore, the overall system throughput can be significantly improved with MEB, which brings a speedup up to 7.4 for two to four VMs and 4.54 for an overcommitted system with 16 VMs.", acknowledgement = ack-nhfb, articleno = "2", fjournal = "ACM Transactions on Architecture and Code Optimization (TACO)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J924", } @Article{Wang:2016:ECA, author = "Bei Wang and Yuxia Cheng and Wenzhi Chen and Qinming He and Yang Xiang and Mohammad Mehedi Hassan and Abdulhameed Alelaiwi", title = "Efficient consolidation-aware {VCPU} scheduling on multicore virtualization platform", journal = j-FUT-GEN-COMP-SYS, volume = "56", number = "??", pages = "229--237", month = mar, year = "2016", CODEN = "FGSEVI", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Sat Dec 12 06:47:21 MST 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X15002605", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X/", } @Article{Wang:2016:PDI, author = "Shangguang Wang and Ao Zhou and Ching-Hsien Hsu and Xuanyu Xiao and Fangchun Yang", title = "Provision of Data-Intensive Services Through Energy- and {QoS}-Aware Virtual Machine Placement in National Cloud Data Centers", journal = j-IEEE-TRANS-EMERG-TOP-COMPUT, volume = "4", number = "2", pages = "290--300", month = apr # "\slash " # jun, year = "2016", DOI = "https://doi.org/10.1109/TETC.2015.2508383", ISSN = "2168-6750 (print), 2376-4562 (electronic)", bibdate = "Thu Sep 21 14:02:06 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransemergtopcomput.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Emerging Topics in Computing", journal-URL = "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6245516", } @Article{Wang:2016:TSN, author = "Yang Wang and Phanvu Chau and Fuyu Chen", title = "Towards a secured network virtualization", journal = j-COMP-NET-AMSTERDAM, volume = "104", number = "??", pages = "55--65", day = "20", month = jul, year = "2016", CODEN = "????", ISSN = "1389-1286 (print), 1872-7069 (electronic)", ISSN-L = "1389-1286", bibdate = "Fri Jun 3 11:42:22 MDT 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1389128616301219", acknowledgement = ack-nhfb, fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)", journal-URL = "http://www.sciencedirect.com/science/journal/13891286/", } @Article{Wei:2016:PVR, author = "Yi Wei and M. Brian Blake", title = "Proactive virtualized resource management for service workflows in the cloud", journal = j-COMPUTING, volume = "98", number = "5", pages = "523--538", month = may, year = "2016", CODEN = "CMPTA2", DOI = "https://doi.org/10.1007/s00607-014-0419-4", ISSN = "0010-485X (print), 1436-5057 (electronic)", ISSN-L = "0010-485X", bibdate = "Fri Feb 9 14:54:04 MST 2018", bibsource = "http://link.springer.com/journal/607/98/5; https://www.math.utah.edu/pub/tex/bib/computing.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Computing", journal-URL = "http://link.springer.com/journal/607", } @Article{Weng:2016:CMV, author = "Chuliang Weng and Qian Liu and Kenli Li and Deqing Zou", title = "{CloudMon}: Monitoring Virtual Machines in Clouds", journal = j-IEEE-TRANS-COMPUT, volume = "65", number = "12", pages = "3787--3793", month = "????", year = "2016", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.2016.2560809", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Thu Nov 10 05:41:07 MST 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Computers", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", } @Article{West:2016:VSK, author = "Richard West and Ye Li and Eric Missimer and Matthew Danish", title = "A Virtualized Separation Kernel for Mixed-Criticality Systems", journal = j-TOCS, volume = "34", number = "3", pages = "8:1--8:??", month = sep, year = "2016", CODEN = "ACSYEC", DOI = "https://doi.org/10.1145/2935748", ISSN = "0734-2071 (print), 1557-7333 (electronic)", ISSN-L = "0734-2071", bibdate = "Sat Sep 17 16:09:15 MDT 2016", bibsource = "http://www.acm.org/pubs/contents/journals/tocs/; https://www.math.utah.edu/pub/tex/bib/tocs.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Multi- and many-core processors are becoming increasingly popular in embedded systems. Many of these processors now feature hardware virtualization capabilities, as found on the ARM Cortex A15 and x86 architectures with Intel VT-x or AMD-V support. Hardware virtualization provides a way to partition physical resources, including processor cores, memory, and I/O devices, among guest virtual machines (VMs). Each VM is then able to host tasks of a specific criticality level, as part of a mixed-criticality system with different timing and safety requirements. However, traditional virtual machine systems are inappropriate for mixed-criticality computing. They use hypervisors to schedule separate VMs on physical processor cores. The costs of trapping into hypervisors to multiplex and manage machine physical resources on behalf of separate guests are too expensive for many time-critical tasks. Additionally, traditional hypervisors have memory footprints that are often too large for many embedded computing systems. In this article, we discuss the design of the Quest-V separation kernel, which partitions services of different criticality levels across separate VMs, or sandboxes. Each sandbox encapsulates a subset of machine physical resources that it manages without requiring intervention from a hypervisor. In Quest-V, a hypervisor is only needed to bootstrap the system, recover from certain faults, and establish communication channels between sandboxes. This not only reduces the memory footprint of the most privileged protection domain but also removes it from the control path during normal system operation, thereby heightening security.", acknowledgement = ack-nhfb, articleno = "8", fjournal = "ACM Transactions on Computer Systems", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J774", } @Article{Williams:2016:EEH, author = "Dan Williams and Yaohui Hu and Umesh Deshpande and Piush K. Sinha and Nilton Bila and Kartik Gopalan and Hani Jamjoom", title = "Enabling Efficient Hypervisor-as-a-Service Clouds with Ephemeral Virtualization", journal = j-SIGPLAN, volume = "51", number = "7", pages = "79--92", month = jul, year = "2016", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/3007611.2892254", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat Sep 16 10:18:12 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "When considering a hypervisor, cloud providers must balance conflicting requirements for simple, secure code bases with more complex, feature-filled offerings. This paper introduces Dichotomy, a new two-layer cloud architecture in which the roles of the hypervisor are split. The cloud provider runs a lean hyperplexor that has the sole task of multiplexing hardware and running more substantial hypervisors (called featurevisors) that implement features. Cloud users choose featurevisors from a selection of lightly-modified hypervisors potentially offered by third-parties in an ``as-a-service'' model for each VM. Rather than running the featurevisor directly on the hyperplexor using nested virtualization, Dichotomy uses a new virtualization technique called ephemeral virtualization which efficiently (and repeatedly) transfers control of a VM between the hyperplexor and featurevisor using memory mapping techniques. Nesting overhead is only incurred when the VM is accessed by the featurevisor. We have implemented Dichotomy in KVM/QEMU and demonstrate average switching times of 80 ms, two to three orders of magnitude faster than live VM migration. We show that, for the featurevisor applications we evaluated, VMs hosted in Dichotomy deliver up to 12\% better performance than those hosted on nested hypervisors, and continue to show benefit even when the featurevisor applications run as often as every 2.5~seconds.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "VEE '16 conference proceedings.", } @Article{Wu:2016:IBP, author = "Song Wu and Songqiao Tao and Xiao Ling and Hao Fan and Hai Jin and Shadi Ibrahim", title = "{iShare}: Balancing {I/O} performance isolation and disk {I/O} efficiency in virtualized environments", journal = j-CCPE, volume = "28", number = "2", pages = "386--399", month = feb, year = "2016", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.3496", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Tue Feb 9 06:13:21 MST 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", onlinedate = "28 May 2015", } @Article{Xie:2016:GCF, author = "Yi Xie and Yu Wang and Haitao He and Yang Xiang and Shunzheng Yu and Xincheng Liu", title = "A General Collaborative Framework for Modeling and Perceiving Distributed Network Behavior", journal = j-IEEE-TRANS-NETWORKING, volume = "24", number = "5", pages = "3162--3176", month = oct, year = "2016", CODEN = "IEANEP", DOI = "https://doi.org/10.1109/TNET.2015.2512609", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Sat Jan 21 07:15:39 MST 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Collaborative Anomaly Detection CAD is an emerging field of network security in both academia and industry. It has attracted a lot of attention, due to the limitations of traditional fortress-style defense modes. Even though a number of pioneer studies have been conducted in this area, few of them concern about the universality issue. This work focuses on two aspects of it. First, a unified collaborative detection framework is developed based on network virtualization technology. Its purpose is to provide a generic approach that can be applied to designing specific schemes for various application scenarios and objectives. Second, a general behavior perception model is proposed for the unified framework based on hidden Markov random field. Spatial Markovianity is introduced to model the spatial context of distributed network behavior and stochastic interaction among interconnected nodes. Algorithms are derived for parameter estimation, forward prediction, backward smooth, and the normality evaluation of both global network situation and local behavior. Numerical experiments using extensive simulations and several real datasets are presented to validate the proposed solution. Performance-related issues and comparison with related works are discussed.", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771", } @Article{Xu:2016:CBA, author = "Jiwei Xu and Wenbo Zhang and Zhenyu Zhang and Tao Wang and Tao Huang", title = "Clustering-based acceleration for virtual machine image deduplication in the cloud environment", journal = j-J-SYST-SOFTW, volume = "121", number = "??", pages = "144--156", month = nov, year = "2016", CODEN = "JSSODM", ISSN = "0164-1212 (print), 1873-1228 (electronic)", ISSN-L = "0164-1212", bibdate = "Thu Sep 15 06:53:44 MDT 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0164121216000534", acknowledgement = ack-nhfb, fjournal = "Journal of Systems and Software", journal-URL = "http://www.sciencedirect.com/science/journal/01641212/", } @Article{Xu:2016:HIA, author = "Fei Xu and Fangming Liu and Hai Jin", title = "Heterogeneity and Interference-Aware Virtual Machine Provisioning for Predictable Performance in the Cloud", journal = j-IEEE-TRANS-COMPUT, volume = "65", number = "8", pages = "2470--2483", month = "????", year = "2016", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.2015.2481403", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Mon Jul 11 18:58:52 MDT 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Computers -", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", } @Article{Xu:2016:SER, author = "Xin Xu and H. Howie Huang", title = "On Soft Error Reliability of Virtualization Infrastructure", journal = j-IEEE-TRANS-COMPUT, volume = "65", number = "12", pages = "3727--3739", month = "????", year = "2016", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.2016.2560817", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Thu Nov 10 05:41:07 MST 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Computers", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", } @Article{Xu:2016:SHS, author = "Xin Xu and Bhavesh Davda", title = "{SRVM}: Hypervisor Support for Live Migration with Passthrough {SR-IOV} Network Devices", journal = j-SIGPLAN, volume = "51", number = "7", pages = "65--77", month = jul, year = "2016", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/3007611.2892256", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat Sep 16 10:18:12 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.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. Our experimental results show that SRVM can effectively migrate all memory state, and there is no data loss or corruption in applications after live migration. SRVM does not increase VM downtime. It only costs limited resources (an extra CPU core), and there is no significant runtime overhead in VM network performance. In fact, since the VF can continue to be used during the pre-copy phase, it offers network throughput which is 9.6 times and network latency which is 98\% lower compared to other solutions that switch to para-virtualization mode during live migration.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "VEE '16 conference proceedings.", } @Article{Yamanaka:2016:TFF, author = "Hiroaki Yamanaka and Eiji Kawai and Shinji Shimojo", title = "A technique for full flow virtualization of multi-tenant {OpenFlow} networks", journal = j-COMP-NET-AMSTERDAM, volume = "102", number = "??", pages = "1--19", day = "19", month = jun, year = "2016", CODEN = "????", ISSN = "1389-1286 (print), 1872-7069 (electronic)", ISSN-L = "1389-1286", bibdate = "Mon May 23 08:59:35 MDT 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1389128616300585", acknowledgement = ack-nhfb, fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)", journal-URL = "http://www.sciencedirect.com/science/journal/13891286/", } @Article{You:2016:SRB, author = "Yi-Ping You and Jian-Ru Chen", title = "A static region-based compiler for the {Dalvik} virtual machine", journal = j-SPE, volume = "46", number = "8", pages = "1109--1130", month = aug, year = "2016", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/spe.2344", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Tue Sep 13 08:44:22 MDT 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", } @Article{Zeng:2016:VEF, author = "Lingfang Zeng and Shijie Xu and Yang Wang", title = "{VMBackup}: an efficient framework for online virtual machine image backup and recovery", journal = j-CCPE, volume = "28", number = "9", pages = "2630--2643", day = "25", month = jun, year = "2016", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.3724", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Wed Jun 8 06:47:20 MDT 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", } @Article{Zhang:2016:CGS, author = "Youhui Zhang and Peng Qu and Jiang Cihang and Weimin Zheng", title = "A Cloud Gaming System Based on User-Level Virtualization and Its Resource Scheduling", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "27", number = "5", pages = "1239--1252", month = may, year = "2016", CODEN = "ITDSEO", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Fri Apr 15 13:45:22 MDT 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.computer.org/csdl/trans/td/2016/05/07109163.pdf", abstract-URL = "http://www.computer.org/csdl/trans/td/2016/05/07109163-abs.html", acknowledgement = ack-nhfb, journal-URL = "http://www.computer.org/tpds/archives.htm", } @Article{Zhang:2016:GDL, author = "Jiao Zhang and Fengyuan Ren and Ran Shu and Tao Huang and Yunjie Liu", title = "Guaranteeing Delay of Live Virtual Machine Migration by Determining and Provisioning Appropriate Bandwidth", journal = j-IEEE-TRANS-COMPUT, volume = "65", number = "9", pages = "2910--2917", month = "????", year = "2016", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.2015.2500560", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Wed Aug 10 09:04:52 MDT 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Computers", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", } @Article{Zhang:2016:MAV, author = "Tianwei Zhang and Ruby B. Lee", title = "Monitoring and Attestation of Virtual Machine Security Health in Cloud Computing", journal = j-IEEE-MICRO, volume = "36", number = "5", pages = "28--37", month = sep # "\slash " # oct, year = "2016", CODEN = "IEMIDZ", ISSN = "0272-1732 (print), 1937-4143 (electronic)", ISSN-L = "0272-1732", bibdate = "Tue Nov 1 14:24:13 MDT 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeemicro.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.computer.org/csdl/mags/mi/2016/05/mmi2016050028-abs.html", acknowledgement = ack-nhfb, journal-URL = "http://www.computer.org/csdl/mags/mi/index.html", } @Article{Zhao:2016:SHC, author = "Qian Zhao and Motoki Amagasaki and Masahiro Iida and Morihiro Kuga and Toshinori Sueyoshi", title = "A Study of Heterogeneous Computing Design Method based on Virtualization Technology", journal = j-COMP-ARCH-NEWS, volume = "44", number = "4", pages = "86--91", month = sep, year = "2016", CODEN = "CANED2", DOI = "https://doi.org/10.1145/3039902.3039918", ISSN = "0163-5964 (print), 1943-5851 (electronic)", ISSN-L = "0163-5964", bibdate = "Thu Jan 12 18:43:44 MST 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigarch.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "One challenge for the heterogeneous computing with the FPGA is how to bridge the development gap between SW and HW designs. The high level synthesis (HLS) technique allows producing hardware with high level languages like C. Design tools based on the HLS like Xilinx SDSoC and SDAccel are developed to speedup SW/HW co-designs. However, the developers still require much circuit design skills to use these tools more efficiently. In this paper, we propose a heterogeneous computing platform based on the virtualization technology, namely hCODE.With the help of the virtualization, the HW and SW design can be totally separated. This brings multiple benefits like accelerating a program without modifying or recompiling it, enable high portability and scalability across different HW and operating system.", acknowledgement = ack-nhfb, fjournal = "ACM SIGARCH Computer Architecture News", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89", remark = "HEART '16 conference proceedings.", } @Article{Zheng:2016:VMC, author = "Qinghua Zheng and Rui Li and Xiuqi Li and Nazaraf Shah and Jianke Zhang and Feng Tian and Kuo-Ming Chao and Jia Li", title = "Virtual machine consolidated placement based on multi-objective biogeography-based optimization", journal = j-FUT-GEN-COMP-SYS, volume = "54", number = "??", pages = "95--122", month = jan, year = "2016", CODEN = "FGSEVI", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Thu Oct 15 11:00:07 MDT 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X15000564", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X/", } @Article{Zhou:2016:VMP, author = "Zhou Zhou and Zhigang Hu and Keqin Li", title = "Virtual Machine Placement Algorithm for Both Energy-Awareness and {SLA} Violation Reduction in Cloud Data Centers", journal = j-SCI-PROG, volume = "2016", number = "??", pages = "5612039:1--5612039:11", month = "????", year = "2016", CODEN = "SCIPEV", DOI = "https://doi.org/10.1155/2016/5612039", ISSN = "1058-9244 (print), 1875-919X (electronic)", ISSN-L = "1058-9244", bibdate = "Tue Sep 20 07:53:42 MDT 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/sciprogram.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.hindawi.com/journals/sp/2016/5612039/", acknowledgement = ack-nhfb, fjournal = "Scientific Programming", journal-URL = "https://www.hindawi.com/journals/sp/", journalabr = "Sci. Prog", } @Article{Abdelaziz:2017:SDW, author = "Ahmed Abdelaziz and Ang Tan Fong and Abdullah Gani and Suleman Khan and Faiz Alotaibi and Muhammad Khurram Khan", title = "On Software-Defined Wireless Network {(SDWN)} Network Virtualization: Challenges and Open Issues", journal = j-COMP-J, volume = "60", number = "10", pages = "1510--1519", day = "1", month = oct, year = "2017", CODEN = "CMPJA6", DOI = "https://doi.org/10.1093/comjnl/bxx063", ISSN = "0010-4620 (print), 1460-2067 (electronic)", ISSN-L = "0010-4620", bibdate = "Thu Nov 16 10:43:39 MST 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://academic.oup.com/comjnl/article/60/10/1510/4321712", acknowledgement = ack-nhfb, fjournal = "The Computer Journal", journal-URL = "http://comjnl.oxfordjournals.org/", } @Article{Agarwal:2017:TAT, author = "Neha Agarwal and Thomas F. Wenisch", title = "{Thermostat}: Application-transparent Page Management for Two-tiered Main Memory", journal = j-COMP-ARCH-NEWS, volume = "45", number = "1", pages = "631--644", month = mar, year = "2017", CODEN = "CANED2", DOI = "https://doi.org/10.1145/3093337.3037706", ISSN = "0163-5964 (print), 1943-5851 (electronic)", ISSN-L = "0163-5964", bibdate = "Mon Jun 5 18:01:58 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigarch.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.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 = "ACM SIGARCH Computer Architecture News", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89", remark = "ASPLOS'17 conference proceedings", } @Article{Alam:2017:DIY, author = "Hanna Alam and Tianhao Zhang and Mattan Erez and Yoav Etsion", title = "Do-It-Yourself Virtual Memory Translation", journal = j-COMP-ARCH-NEWS, volume = "45", number = "2", pages = "457--468", month = may, year = "2017", CODEN = "CANED2", DOI = "https://doi.org/10.1145/3140659.3080209", ISSN = "0163-5964 (print), 1943-5851 (electronic)", ISSN-L = "0163-5964", bibdate = "Fri Sep 15 11:09:14 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigarch.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 = "ACM SIGARCH Computer Architecture News", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89", } @Article{Arroba:2017:DVF, author = "Patricia Arroba and Jos{\'e} M. Moya and Jos{\'e} L. Ayala and Rajkumar Buyya", title = "Dynamic {Voltage} and {Frequency Scaling}-aware dynamic consolidation of virtual machines for energy efficient cloud data centers", journal = j-CCPE, volume = "29", number = "10", pages = "", day = "25", month = may, year = "2017", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.4067", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Mon Jul 24 08:22:36 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", } @Article{Auler:2017:HIP, author = "Rafael Auler and Carlos Eduardo Millani and Alexandre Brisighello and Alisson Linhares and Edson Borin", title = "Handling {IoT} platform heterogeneity with {COISA}, a compact {OpenISA} virtual platform", journal = j-CCPE, volume = "29", number = "22", pages = "??--??", day = "25", month = nov, year = "2017", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.3932", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Sat Dec 30 09:11:59 MST 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", } @Article{Ayoubi:2017:RMC, author = "Sara Ayoubi and Chadi Assi and Yiheng Chen and Tarek Khalifa and Khaled Bashir Shaban", title = "Restoration methods for cloud multicast virtual networks", journal = j-J-NETW-COMPUT-APPL, volume = "78", number = "??", pages = "180--190", day = "15", month = jan, year = "2017", CODEN = "JNCAF3", ISSN = "1084-8045 (print), 1095-8592 (electronic)", ISSN-L = "1084-8045", bibdate = "Fri Mar 31 07:48:43 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1084804516302764", acknowledgement = ack-nhfb, fjournal = "Journal of Network and Computer Applications", journal-URL = "http://www.sciencedirect.com/science/journal/10848045", } @Article{Barrett:2017:VMW, author = "Edd Barrett and Carl Friedrich Bolz-Tereick and Rebecca Killick and Sarah Mount and Laurence Tratt", title = "Virtual machine warmup blows hot and cold", journal = j-PACMPL, volume = "1", number = "OOPSLA", pages = "52:1--52:??", month = oct, year = "2017", CODEN = "????", DOI = "https://doi.org/10.1145/3133876", ISSN = "2475-1421", bibdate = "Wed Jan 10 09:45:26 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/pacmpl.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, articleno = "52", fjournal = "Proceedings of the ACM on Programming Languages", journal-URL = "https://pacmpl.acm.org/", } @Article{Bassem:2017:MCP, author = "Christine Bassem and Azer Bestavros", title = "Multi-Capacity Bin Packing with Dependent Items and its Application to the Packing of Brokered Workloads in Virtualized Environments", journal = j-FUT-GEN-COMP-SYS, volume = "72", number = "??", pages = "129--144", month = jul, year = "2017", CODEN = "FGSEVI", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Mon Jul 24 19:02:16 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X16302771", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Beckert:2017:RTA, author = "Matthias Beckert and Rolf Ernst", title = "Response Time Analysis for Sporadic Server Based Budget Scheduling in Real Time Virtualization Environments", journal = j-TECS, volume = "16", number = "5s", pages = "161:1--161:??", month = oct, year = "2017", CODEN = "????", DOI = "https://doi.org/10.1145/3126559", ISSN = "1539-9087 (print), 1558-3465 (electronic)", ISSN-L = "1539-9087", bibdate = "Thu Oct 17 18:16:33 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tecs.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Virtualization techniques for embedded real-time systems typically employ TDMA scheduling to achieve temporal isolation among different virtualized applications. Recent work already introduced sporadic server based solutions relying on budgets instead of a fixed TDMA schedule. While providing better average-case response times for IRQs and tasks, a formal response time analysis for the worst-case is still missing. In order to confirm the advantage of a sporadic server based budget scheduling, this paper provides a worst-case response time analysis. To improve the sporadic server based budget scheduling even more, we provide a background scheduling implementation which will also be covered by the formal analysis. We show correctness of the analysis approach and compare it against TDMA based systems. In addition to that, we provide response time measurements from a working hypervisor implementation on an ARM based development board.", acknowledgement = ack-nhfb, articleno = "161", fjournal = "ACM Transactions on Embedded Computing Systems", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J840", } @Article{Belay:2017:IOS, author = "Adam Belay and George Prekas and Mia Primorac and Ana Klimovic and Samuel Grossman and Christos Kozyrakis and Edouard Bugnion", title = "The {IX} Operating System: Combining Low Latency, High Throughput, and Efficiency in a Protected Dataplane", journal = j-TOCS, volume = "34", number = "4", pages = "11:1--11:??", month = jan, year = "2017", CODEN = "ACSYEC", DOI = "https://doi.org/10.1145/2997641", ISSN = "0734-2071 (print), 1557-7333 (electronic)", ISSN-L = "0734-2071", bibdate = "Mon Jul 24 09:40:46 MDT 2017", bibsource = "http://www.acm.org/pubs/contents/journals/tocs/; https://www.math.utah.edu/pub/tex/bib/tocs.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "The conventional wisdom is that aggressive networking requirements, such as high packet rates for small messages and $ \mu $ s-scale tail latency, are best addressed outside the kernel, in a user-level networking stack. We present ix, a dataplane operating system that provides high I/O performance and high resource efficiency while maintaining the protection and isolation benefits of existing kernels. ix uses hardware virtualization to separate management and scheduling functions of the kernel (control plane) from network processing (dataplane). The dataplane architecture builds upon a native, zero-copy API and optimizes for both bandwidth and latency by dedicating hardware threads and networking queues to dataplane instances, processing bounded batches of packets to completion, and eliminating coherence traffic and multicore synchronization. The control plane dynamically adjusts core allocations and voltage/frequency settings to meet service-level objectives. We demonstrate that ix outperforms Linux and a user-space network stack significantly in both throughput and end-to-end latency. Moreover, ix improves the throughput of a widely deployed, key-value store by up to 6.$ 4 \times $ and reduces tail latency by more than $ 2 \times $ . With three varying load patterns, the control plane saves 46\%--54\% of processor energy, and it allows background jobs to run at 35\%--47\% of their standalone throughput.", acknowledgement = ack-nhfb, articleno = "11", fjournal = "ACM Transactions on Computer Systems", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J774", } @Article{Bianchi:2017:MRB, author = "Francesco Bianchi and Francesco {Lo Presti}", title = "A {Markov} Reward based Resource-Latency Aware Heuristic for the Virtual Network Embedding Problem", journal = j-SIGMETRICS, volume = "44", number = "4", pages = "57--68", month = mar, year = "2017", CODEN = "????", DOI = "https://doi.org/10.1145/3092819.3092827", ISSN = "0163-5999 (print), 1557-9484 (electronic)", ISSN-L = "0163-5999", bibdate = "Wed Jun 7 17:10:14 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigmetrics.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "An ever increasing use of virtualization in various emerging scenarios, e.g.: Cloud Computing, Software Defined Networks, Data Streaming Processing, asks Infrastructure Providers (InPs) to optimize the allocation of the virtual network requests (VNRs) into a substrate network while satisfying QoS requirements. In this work, we propose MCRM, a two-stage virtual network embedding (VNE) algorithm with delay and placement constraints. Our solution revolves around a novel notion of similarity between virtual and physical nodes. To this end, taking advantage of Markov Reward theory, we define a set of metrics for each physical and virtual node which captures the amount of resources in a node neighborhood as well as the degree of proximity among nodes. By defining a notion of similarity between nodes we then simply map virtual nodes to the most similar physical node in the substrate network. We have thoroughly evaluated our algorithm through simulation. Our experiments show that MCRM achieves good performance results in terms of blocking probability and revenues for the InP, as well as a high and uniform utilization of resources, while satisfying the delay and placement requirements.", acknowledgement = ack-nhfb, fjournal = "ACM SIGMETRICS Performance Evaluation Review", journal-URL = "http://portal.acm.org/toc.cfm?id=J618", } @Article{Briggs:2017:COI, author = "Kim T. Briggs and Baoguo Zhou and Gerhard W. Dueck", title = "Cold object identification in the {Java Virtual Machine}", journal = j-SPE, volume = "47", number = "1", pages = "79--95", month = jan, year = "2017", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/spe.2396", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Sat Feb 18 10:00:11 MST 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2010.bib; https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", } @Article{Bruno:2017:NPG, author = "Rodrigo Bruno and Lu{\'\i}s Picciochi Oliveira and Paulo Ferreira", title = "{NG2C}: pretenuring garbage collection with dynamic generations for {HotSpot} big data applications", journal = j-SIGPLAN, volume = "52", number = "9", pages = "2--13", month = sep, year = "2017", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/3156685.3092272", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Dec 1 18:56:13 MST 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2010.bib; https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Big Data applications suffer from unpredictable and unacceptably high pause times due to Garbage Collection (GC). This is the case in latency-sensitive applications such as on-line credit-card fraud detection, graph-based computing for analysis on social networks, etc. Such pauses compromise latency requirements of the whole application stack and result from applications' aggressive buffering/caching of data, exposing an ill-suited GC design, which assumes that most objects will die young and does not consider that applications hold large amounts of middle-lived data in memory. To avoid such pauses, we propose NG2C, a new GC algorithm that combines pretenuring with user-defined dynamic generations. By being able to allocate objects into different generations, NG2C is able to group objects with similar lifetime profiles in the same generation. By allocating objects with similar lifetime profiles close to each other, i.e. in the same generation, we avoid object promotion (copying between generations) and heap fragmentation (which leads to heap compactions) both responsible for most of the duration of HotSpot GC pause times. NG2C is implemented for the OpenJDK 8 HotSpot Java Virtual Machine, as an extension of the Garbage First GC. We evaluate NG2C using Cassandra, Lucene, and GraphChi with three different GCs: Garbage First (G1), Concurrent Mark Sweep (CMS), and NG2C. Results show that NG2C decreases the worst observable GC pause time by up to 94.8\% for Cassandra, 85.0\% for Lucene and 96.45\% for GraphChi, when compared to current collectors (G1 and CMS). In addition, NG2c has no negative impact on application throughput or memory usage.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "ISMM '17 conference proceedings.", } @Article{Canali:2017:ICP, author = "Claudia Canali and Riccardo Lancellotti", title = "Identifying Communication Patterns between Virtual Machines in Software-Defined Data Centers", journal = j-SIGMETRICS, volume = "44", number = "4", pages = "49--56", month = mar, year = "2017", CODEN = "????", DOI = "https://doi.org/10.1145/3092819.3092826", ISSN = "0163-5999 (print), 1557-9484 (electronic)", ISSN-L = "0163-5999", bibdate = "Wed Jun 7 17:10:14 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigmetrics.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Modern cloud data centers typically exploit management strategies to reduce the overall energy consumption. While most of the solutions focus on the energy consumption due to computational elements, the advent of the Software-Defined Network paradigm opens the possibility for more complex strategies taking into account the network traffic exchange within the data center. However, a network-aware Virtual Machine (VM) allocation requires the knowledge of data communication patterns, so that VMs exchanging significant amount of data can be placed on the same physical host or on low cost communication paths. In Infrastructure as a Service data centers, the information about VMs traffic exchange is not easily available unless a specialized monitoring function is deployed over the data center infrastructure. The main contribution of this paper is a methodology to infer VMs communication patterns starting from input/output network traffic time series of each VM and without relaying on a special purpose monitoring. Our reference scenario is a software-defined data center hosting a multi-tier application deployed using horizontal replication. The proposed methodology has two main goals to support a network-aware VMs allocation: first, to identify couples of intensively communicating VMs through correlation-based analysis of the time series; second, to identify VMs belonging to the same vertical stack of a multi-tier application. We evaluate the methodology by comparing different correlation indexes, clustering algorithms and time granularities to monitor the network traffic. The experimental results demonstrate the capability of the proposed approach to identify interacting VMs, even in a challenging scenario where the traffic patterns are similar in every VM belonging to the same application tier.", acknowledgement = ack-nhfb, fjournal = "ACM SIGMETRICS Performance Evaluation Review", journal-URL = "http://portal.acm.org/toc.cfm?id=J618", } @Article{Canali:2017:SAV, author = "Claudia Canali and Riccardo Lancellotti", title = "Scalable and automatic virtual machines placement based on behavioral similarities", journal = j-COMPUTING, volume = "99", number = "6", pages = "575--595", month = jun, year = "2017", CODEN = "CMPTA2", DOI = "https://doi.org/10.1007/s00607-016-0498-5", ISSN = "0010-485X (print), 1436-5057 (electronic)", ISSN-L = "0010-485X", bibdate = "Fri Feb 9 14:54:09 MST 2018", bibsource = "http://link.springer.com/journal/607/99/6; https://www.math.utah.edu/pub/tex/bib/computing.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Computing", journal-URL = "http://link.springer.com/journal/607", } @Article{Cao:2017:EMN, author = "Zizhong Cao and Shivendra S. Panwar and Murali Kodialam and T. V. Lakshman", title = "Enhancing Mobile Networks With Software Defined Networking and Cloud Computing", journal = j-IEEE-TRANS-NETWORKING, volume = "25", number = "3", pages = "1431--1444", month = jun, year = "2017", CODEN = "IEANEP", DOI = "https://doi.org/10.1109/TNET.2016.2638463", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Tue Oct 3 16:29:32 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "In the past decade, mobile devices and applications have experienced an explosive growth, and users are expecting higher data rates and better quality services every year. In this paper, we propose several ideas to increase the functionality and capacity of wireless networks using software-defined networking SDN and cloud computing technologies. Connections between users and services in mobile networks typically have to pass through a required set of middleboxes. The complex routing is one of the major impetus for the SDN paradigm, which enables flexible policy-aware routing in the next generation mobile networks. In addition, the high costs of middleboxes and limited capabilities of mobile devices call for revolutionary virtualization technologies enabled by cloud computing. Based on these, we consider an online routing problem for mobile networks with SDN and cloud computing. In this problem, connection requests are given one at a time as in a real mobile system, and the objective is to steer traffic flows to maximize the total amount of traffic accepted over time, subject to capacity, budget, policy, and quality of service constraints. A fast log-competitive approximation algorithm is developed based on time-dependent duals.", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771", } @Article{Cao:2017:VNM, author = "Yang Cao and Wenfei Fan and Shuai Ma", title = "Virtual Network Mapping in Cloud Computing: a Graph Pattern Matching Approach", journal = j-COMP-J, volume = "60", number = "3", pages = "60--??", month = mar, year = "2017", CODEN = "CMPJA6", ISSN = "????", ISSN-L = "0010-4620", bibdate = "Sat Mar 11 14:16:28 MST 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://academic.oup.com/comjnl/article/60/3/287/2608063/Virtual-Network-Mapping-in-Cloud-Computing-A-Graph", acknowledgement = ack-nhfb, fjournal = "The Computer Journal", journal-URL = "http://comjnl.oxfordjournals.org/", } @Article{Carabas:2017:EEV, author = "Mihai Carabas and Pantelimon George Popescu", title = "Energy-efficient virtualized clusters", journal = j-FUT-GEN-COMP-SYS, volume = "74", number = "??", pages = "151--157", month = sep, year = "2017", CODEN = "FGSEVI", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Mon Jul 24 19:02:17 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X15003313", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Ceselli:2017:MEC, author = "Alberto Ceselli and Marco Premoli and Stefano Secci", title = "Mobile Edge Cloud Network Design Optimization", journal = j-IEEE-TRANS-NETWORKING, volume = "25", number = "3", pages = "1818--1831", month = jun, year = "2017", CODEN = "IEANEP", DOI = "https://doi.org/10.1109/TNET.2017.2652850", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Tue Oct 3 16:29:32 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Major interest is currently given to the integration of clusters of virtualization servers, also referred to as \lq cloudlets' or \lq edge clouds', into the access network to allow higher performance and reliability in the access to mobile edge computing services. We tackle the edge cloud network design problem for mobile access networks. The model is such that the virtual machines VMs are associated with mobile users and are allocated to cloudlets. Designing an edge cloud network implies first determining where to install cloudlet facilities among the available sites, then assigning sets of access points, such as base stations to cloudlets, while supporting VM orchestration and considering partial user mobility information, as well as the satisfaction of service-level agreements. We present link-path formulations supported by heuristics to compute solutions in reasonable time. We qualify the advantage in considering mobility for both users and VMs as up to 20\% less users not satisfied in their SLA with a little increase of opened facilities. We compare two VM mobility modes, bulk and live migration, as a function of mobile cloud service requirements, determining that a high preference should be given to live migration, while bulk migrations seem to be a feasible alternative on delay-stringent tiny-disk services, such as augmented reality support, and only with further relaxation on network constraints.", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771", } @Article{Chamanara:2017:QSH, author = "Javad Chamanara and Birgitta K{\"o}nig-Ries and H. V. Jagadish", title = "{QUIS}: in-situ heterogeneous data source querying", journal = j-PROC-VLDB-ENDOWMENT, volume = "10", number = "12", pages = "1877--1880", month = aug, year = "2017", CODEN = "????", DOI = "https://doi.org/10.14778/3137765.3137798", ISSN = "2150-8097", bibdate = "Tue Oct 10 17:16:19 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; https://www.math.utah.edu/pub/tex/bib/vldbe.bib", abstract = "Existing data integration frameworks are poorly suited for the special requirements of scientists. To answer a specific research question, often, excerpts of data from different sources need to be integrated. The relevant parts and the set of underlying sources may differ from query to query. The analyses also oftentimes involve frequently changing data and exploratory querying. Additionally, The data sources not only store data in different formats, but also provide inconsistent data access functionality. The classic Extract-Transform-Load (ETL) approach seems too complex and time-consuming and does not fit well with interest and expertise of the scientists. With QUIS (QUery In-Situ), we provide a solution for this problem. QUIS is an open source heterogeneous in-situ data querying system. It utilizes a federated query virtualization approach that is built upon plugged-in adapters. QUIS takes a user query and transforms appropriate portions of it into the corresponding computation model on individual data sources and executes it. It complements the segments of the query that the target data sources can not execute. Hence, it guarantees full syntax and semantic support for its language on all data sources. QUIS's in-situ querying facility almost eliminates the time to prepare the data while maintaining a competitive performance and steady scalability. The present demonstration illustrates interesting features of the system: virtual Schemas, heterogeneous joins, and visual query results. We provide a realistic data processing scenario to examine the system's features. Users can interact with QUIS using its desktop workbench, command line interface, or from any R client including RStudio Server.", acknowledgement = ack-nhfb, fjournal = "Proceedings of the VLDB Endowment", journal-URL = "http://portal.acm.org/citation.cfm?id=J1174", } @Article{Chari:2017:BEH, author = "Guido Chari and Diego Garbervetsky and Stefan Marr", title = "Building efficient and highly run-time adaptable virtual machines", journal = j-SIGPLAN, volume = "52", number = "2", pages = "60--71", month = feb, year = "2017", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/3093334.2989234", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat Sep 16 10:18:15 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Programming language virtual machines (VMs) realize language semantics, enforce security properties, and execute applications efficiently. Fully Reflective Execution Environments (EEs) are VMs that additionally expose their whole structure and behavior to applications. This enables developers to observe and adapt VMs at run time. However, there is a belief that reflective EEs are not viable for practical usages because such flexibility would incur a high performance overhead. To refute this belief, we built a reflective EE on top of a highly optimizing dynamic compiler. We introduced a new optimization model that, based on the conjecture that variability of low-level (EE-level) reflective behavior is low in many scenarios, mitigates the most significant sources of the performance overheads related to the reflective capabilities in the EE. Our experiments indicate that reflective EEs can reach peak performance in the order of standard VMs. Concretely, that (a) if reflective mechanisms are not used the execution overhead is negligible compared to standard VMs, (b) VM operations can be redefined at language-level without incurring in significant overheads, (c) for several software adaptation tasks, applying the reflection at the VM level is not only lightweight in terms of engineering effort, but also competitive in terms of performance in comparison to other ad-hoc solutions.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "DLS '16 conference proceedings.", } @Article{Chen:2017:MLF, author = "Xian Chen and Wenzhi Chen and Zhongyong Lu and Yu Zhang and Rui Chang and Mohammad Mehedi Hassan and Abdulhameed Alelaiwi and Yang Xiang", title = "{MBSA}: a lightweight and flexible storage architecture for virtual machines", journal = j-CCPE, volume = "29", number = "16", pages = "", day = "25", month = aug, year = "2017", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.4028", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Mon Jul 24 08:22:39 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", } @Article{Cinque:2017:IHF, author = "Marcello Cinque and Antonio Pecchia", title = "On the injection of hardware faults in virtualized multicore systems", journal = j-J-PAR-DIST-COMP, volume = "106", number = "??", pages = "50--61", month = aug, year = "2017", CODEN = "JPDCER", ISSN = "0743-7315 (print), 1096-0848 (electronic)", ISSN-L = "0743-7315", bibdate = "Sat Aug 19 13:10:31 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0743731517300849", acknowledgement = ack-nhfb, fjournal = "Journal of Parallel and Distributed Computing", journal-URL = "http://www.sciencedirect.com/science/journal/07437315", } @Article{Cui:2017:PFE, author = "Lei Cui and Zhiyu Hao and Yaqiong Peng and Xiaochun Yun", title = "{Piccolo}: A Fast and Efficient Rollback System for Virtual Machine Clusters", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "28", number = "8", pages = "2328--2341", month = aug, year = "2017", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2017.2668403", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Tue Jul 25 18:46:21 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.computer.org/csdl/trans/td/2017/08/07852513-abs.html", acknowledgement = ack-nhfb, journal-URL = "http://www.computer.org/tpds/archives.htm", } @Article{Cui:2017:PJP, author = "Lin Cui and Fung Po Tso and Dimitrios P. Pezaros and Weijia Jia and Wei Zhao", title = "{PLAN}: Joint Policy- and Network-Aware {VM} Management for Cloud Data Centers", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "28", number = "4", pages = "1163--1175", month = apr, year = "2017", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2016.2604811", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Thu Mar 16 07:06:21 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.computer.org/csdl/trans/td/2017/04/07556964-abs.html", acknowledgement = ack-nhfb, journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=71", } @Article{Cui:2017:TAV, author = "Yong Cui and Zhenjie Yang and Shihan Xiao and Xin Wang and Shenghui Yan", title = "Traffic-Aware Virtual Machine Migration in Topology-Adaptive {DCN}", journal = j-IEEE-TRANS-NETWORKING, volume = "25", number = "6", pages = "3427--3440", month = dec, year = "2017", CODEN = "IEANEP", DOI = "https://doi.org/10.1109/TNET.2017.2744643", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Thu Jan 18 06:52:57 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Virtual machine VM migration is a key technique for network resource optimization in modern data center networks. Previous work generally focuses on how to place the VMs efficiently in a static network topology by migrating the VMs with large traffic demands to close servers. As the flow demands between VMs change, however, a great cost will be paid for the VM migration. In this paper, we propose a new paradigm for VM migration by dynamically constructing adaptive topologies based on the VM demands to lower the cost of both VM migration and communication. We formulate the traffic-aware VM migration problem in an adaptive topology and show its NP-hardness. For periodic traffic, we develop a novel progressive-decompose-rounding algorithm to schedule VM migration in polynomial time with a proved approximation ratio. For highly dynamic flows, we design an online decision-maker ODM algorithm with proved performance bound. Extensive trace-based simulations show that PDR and ODM can achieve about four times flow throughput among VMs with less than a quarter of the migration cost compared to other state-of-art VM migration solutions. We finally implement an OpenvSwitch-based testbed and demonstrate the efficiency of our solutions.", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771", } @Article{dAntras:2017:HXU, author = "Amanieu d'Antras and Cosmin Gorgovan and Jim Garside and John Goodacre and Mikel Luj{\'a}n", title = "{HyperMAMBO-X64}: Using Virtualization to Support High-Performance Transparent Binary Translation", journal = j-SIGPLAN, volume = "52", number = "7", pages = "228--241", month = jul, year = "2017", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/3140607.3050756", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat Sep 16 10:18:17 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Current computer architectures --- ARM, MIPS, PowerPC, SPARC, x86 --- have evolved from a 32-bit architecture to a 64-bit one. Computer architects often consider whether it could be possible to eliminate hardware support for a subset of the instruction set as to reduce hardware complexity, which could improve performance, reduce power usage and accelerate processor development. This paper considers the scenario where we want to eliminate 32-bit hardware support from the ARMv8 architecture. Dynamic binary translation can be used for this purpose and generally comes in one of two forms: application-level translators that translate a single user mode process on top of a native operating system, and system-level translators that translate an entire operating system and all its processes. Application-level translators can have good performance but is not totally transparent; system-level translators may be 100\% compatible but performance suffers. HyperMAMBO-X64 uses a new approach that gets the best of both worlds, being able to run the translator as an application under the hypervisor but still react to the behavior of guest operating systems. It works with complete transparency with regards to the virtualized system whilst delivering performance close to that provided by hardware execution. A key factor in the low overhead of HyperMAMBO-X64 is its deep integration with the virtualization and memory management features of ARMv8. These are exploited to support caching of translations across multiple address spaces while ensuring that translated code remains consistent with the source instructions it is based on. We show how these attributes are achieved without sacrificing either performance or accuracy.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "VEE '17 conference proceedings.", } @Article{daSilva:2017:ARA, author = "Marcelo Pereira da Silva and Rafael Rodrigues Obelheiro and Guilherme Piegas Koslovski", title = "{{\em Adaptive Remus\/}}: adaptive checkpointing for {Xen}-based virtual machine replication", journal = j-INT-J-PAR-EMER-DIST-SYS, volume = "32", number = "4", pages = "348--367", year = "2017", CODEN = "????", DOI = "https://doi.org/10.1080/17445760.2016.1162302", ISSN = "1744-5760 (print), 1744-5779 (electronic)", ISSN-L = "1744-5760", bibdate = "Thu Jun 22 15:15:03 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjparemerdistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www.tandfonline.com/toc/gpaa20/32/4", acknowledgement = ack-nhfb, fjournal = "International Journal of Parallel, Emergent and Distributed Systems: IJPEDS", journal-URL = "http://www.tandfonline.com/loi/gpaa20", onlinedate = "24 May 2016", } @Article{Deng:2017:DWT, author = "Liang Deng and Peng Liu and Jun Xu and Ping Chen and Qingkai Zeng", title = "Dancing with Wolves: Towards Practical Event-driven {VMM} Monitoring", journal = j-SIGPLAN, volume = "52", number = "7", pages = "83--96", month = jul, year = "2017", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/3140607.3050750", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat Sep 16 10:18:17 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "This paper presents a novel framework that enables practical event-driven monitoring for untrusted virtual machine monitors (VMMs) in cloud computing. Unlike previous approaches for VMM monitoring, our framework neither relies on a higher privilege level nor requires any special hardware support. Instead, we place the trusted monitor at the same privilege level and in the same address space with the untrusted VMM to achieve superior efficiency, while proposing a unique mutual-protection mechanism to ensure the integrity of the monitor. Our security analysis demonstrates that our framework can provide high-assurance for event-driven VMM monitoring, even if the highest-privilege VMM is fully compromised. The experimental results show that our framework only incurs trivial performance overhead for enforcing event-driven monitoring policies, exhibiting tremendous performance improvement on previous approaches.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "VEE '17 conference proceedings.", } @Article{Deshpande:2017:TSL, author = "Umesh Deshpande and Kate Keahey", title = "Traffic-sensitive Live Migration of Virtual Machines", journal = j-FUT-GEN-COMP-SYS, volume = "72", number = "??", pages = "118--128", month = jul, year = "2017", CODEN = "FGSEVI", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Mon Jul 24 19:02:16 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X16301133", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @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 = "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{Diaz:2017:OAV, author = "Jos{\'e} Luis D{\'\i}az and Joaqu{\'\i}n Entrialgo and Manuel Garc{\'\i}a and Javier Garc{\'\i}a and Daniel Fernando Garc{\'\i}a", title = "Optimal allocation of virtual machines in multi-cloud environments with reserved and on-demand pricing", journal = j-FUT-GEN-COMP-SYS, volume = "71", number = "??", pages = "129--144", month = jun, year = "2017", CODEN = "FGSEVI", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Thu Mar 9 14:20:18 MST 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X17301954", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Dou:2017:EAV, author = "Wanchun Dou and Xiaolong Xu and Shunmei Meng and Xuyun Zhang and Chunhua Hu and Shui Yu and Jian Yang", title = "An energy-aware virtual machine scheduling method for service {QoS} enhancement in clouds over big data", journal = j-CCPE, volume = "29", number = "14", pages = "", day = "25", month = jul, year = "2017", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.3909", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Mon Jul 24 08:22:38 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", } @Article{Duan:2017:EAS, author = "Hancong Duan and Chao Chen and Geyong Min and Yu Wu", title = "Energy-aware scheduling of virtual machines in heterogeneous cloud computing systems", journal = j-FUT-GEN-COMP-SYS, volume = "74", number = "??", pages = "142--150", month = sep, year = "2017", CODEN = "FGSEVI", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Mon Jul 24 19:02:17 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X16300292", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Duan:2017:LBM, author = "Jun Duan and Yuanyuan Yang", title = "A Load Balancing and Multi-Tenancy Oriented Data Center Virtualization Framework", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "28", number = "8", pages = "2131--2144", month = aug, year = "2017", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2017.2657633", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Tue Jul 25 18:46:21 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.computer.org/csdl/trans/td/2017/08/07831441-abs.html", acknowledgement = ack-nhfb, journal-URL = "http://www.computer.org/tpds/archives.htm", } @Article{Dutra:2017:EVS, author = "Diego L. C. Dutra and Edilson C. Corr{\^e}a and Claudio L. Amorim", title = "An efficient virtual system clock for the wireless {Raspberry Pi} computer platform", journal = j-CCPE, volume = "29", number = "22", pages = "??--??", day = "25", month = nov, year = "2017", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.3960", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Sat Dec 30 09:11:59 MST 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", } @Article{Eramo:2017:ASF, author = "Vincenzo Eramo and Emanuele Miucci and Mostafa Ammar and Francesco Giacinto Lavacca", title = "An Approach for Service Function Chain Routing and Virtual Function Network Instance Migration in Network Function Virtualization Architectures", journal = j-IEEE-TRANS-NETWORKING, volume = "25", number = "4", pages = "2008--2025", month = aug, year = "2017", CODEN = "IEANEP", DOI = "https://doi.org/10.1109/TNET.2017.2668470", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Tue Oct 3 16:29:33 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Network function virtualization foresees the virtualization of service functions and their execution on virtual machines. Any service is represented by a service function chain SFC that is a set of VNFs to be executed according to a given order. The running of VNFs needs the instantiation of VNF Instances VNFIs that in general are software modules executed on virtual machines. The virtualization challenges include: 1 where to instantiate VNFIs; ii how many resources to allocate to each VNFI; iii how to route SFC requests to the appropriate VNFIs in the right sequence; and iv when and how to migrate VNFIs in response to changes to SFC request intensity and location. We develop an approach that uses three algorithms that are used back-to-back resulting in VNFI placement, SFC routing, and VNFI migration in response to changing workload. The objective is to first minimize the rejection of SFC bandwidth and second to consolidate VNFIs in as few servers as possible so as to reduce the energy consumed. The proposed consolidation algorithm is based on a migration policy of VNFIs that considers the revenue loss due to QoS degradation that a user suffers due to information loss occurring during the migrations. The objective is to minimize the total cost given by the energy consumption and the revenue loss due to QoS degradation. We evaluate our suite of algorithms on a test network and show performance gains that can be achieved over using other alternative naive algorithms.", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771", } @Article{Escheikh:2017:VWA, author = "Mohamed Escheikh and Kamel Barkaoui and Hana Jouini", title = "Versatile workload-aware power management performability analysis of server virtualized systems", journal = j-J-SYST-SOFTW, volume = "125", number = "??", pages = "365--379", month = mar, year = "2017", CODEN = "JSSODM", ISSN = "0164-1212 (print), 1873-1228 (electronic)", ISSN-L = "0164-1212", bibdate = "Sat Feb 4 12:20:39 MST 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "//www.sciencedirect.com/science/article/pii/S0164121216302588", acknowledgement = ack-nhfb, fjournal = "Journal of Systems and Software", journal-URL = "http://www.sciencedirect.com/science/journal/01641212/", } @Article{Estrada:2017:UDP, author = "Zachary J. Estrada and Read Sprabery and Lok Yan and Zhongzhi Yu and Roy Campbell and Zbigniew Kalbarczyk and Ravishankar K. Iyer", title = "Using {OS} Design Patterns to Provide Reliability and Security as-a-Service for {VM}-based Clouds", journal = j-SIGPLAN, volume = "52", number = "7", pages = "157--170", month = jul, year = "2017", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/3140607.3050759", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat Sep 16 10:18:17 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "This paper extends the concepts behind cloud services to offer hypervisor-based reliability and security monitors for cloud virtual machines. Cloud VMs can be heterogeneous and as such guest OS parameters needed for monitoring can vary across different VMs and must be obtained in some way. Past work involves running code inside the VM, which is unacceptable for a cloud environment. We solve this problem by recognizing that there are common OS design patterns that can be used to infer monitoring parameters from the guest OS. We extract information about the cloud user's guest OS with the user's existing VM image and knowledge of OS design patterns as the only inputs to analysis. To demonstrate the range of monitoring functionality possible with this technique, we implemented four sample monitors: a guest OS process tracer, an OS hang detector, a return-to-user attack detector, and a process-based keylogger detector.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "VEE '17 conference proceedings.", } @Article{Fard:2017:DVC, author = "Seyed Yahya Zahedi Fard and Mohamad Reza Ahmadi and Sahar Adabi", title = "A dynamic {VM} consolidation technique for {QoS} and energy consumption in cloud environment", journal = j-J-SUPERCOMPUTING, volume = "73", number = "10", pages = "4347--4368", month = oct, year = "2017", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-017-2016-8", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Mon Oct 2 11:08:36 MDT 2017", bibsource = "http://link.springer.com/journal/11227/73/10; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "See erratum \cite{Fard:2017:EDV}.", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Fard:2017:EDV, author = "Seyed Yahya Zahedi Fard and Mohamad Reza Ahmadi and Sahar Adabi", title = "Erratum to: {A dynamic VM consolidation technique for QoS and energy consumption in cloud environment}", journal = j-J-SUPERCOMPUTING, volume = "73", number = "10", pages = "4369--4372", month = oct, year = "2017", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-017-2079-6", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Mon Oct 2 11:08:36 MDT 2017", bibsource = "http://link.springer.com/journal/11227/73/10; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "See \cite{Fard:2017:DVC}.", URL = "http://link.springer.com/content/pdf/10.1007/s11227-017-2079-6.pdf", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @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 = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.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{Firoozjaei:2017:SCN, author = "Mahdi Daghmehchi Firoozjaei and Jaehoon (Paul) Jeong and Hoon Ko and Hyoungshick Kim", title = "Security challenges with network functions virtualization", journal = j-FUT-GEN-COMP-SYS, volume = "67", number = "??", pages = "315--324", month = feb, year = "2017", CODEN = "FGSEVI", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Tue Nov 22 14:20:56 MST 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X16302321", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X/", } @Article{Fu:2017:MCD, author = "Silvery Fu and Jiangchuan Liu and Wenwu Zhu", title = "Multimedia Content Delivery with Network Function Virtualization: The Energy Perspective", journal = j-IEEE-MULTIMEDIA, volume = "24", number = "3", pages = "38--47", month = jul # "\slash " # sep, year = "2017", CODEN = "IEMUE4", DOI = "https://doi.org/10.1109/MMUL.2017.3051514", ISSN = "1070-986X (print), 1941-0166 (electronic)", ISSN-L = "1070-986X", bibdate = "Mon Jan 15 08:09:13 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeemultimedia.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.computer.org/csdl/mags/mu/2017/03/mmu2017030038-abs.html", acknowledgement = ack-nhfb, journal-URL = "http://www.computer.org/multimedia/", } @Article{Gandhi:2017:APE, author = "Jayneel Gandhi and Mark D. Hill and Michael M. Swift", title = "Agile Paging for Efficient Memory Virtualization", journal = j-IEEE-MICRO, volume = "37", number = "3", pages = "80--86", month = may # "\slash " # jun, year = "2017", CODEN = "IEMIDZ", DOI = "https://doi.org/10.1109/MM.2017.67", ISSN = "0272-1732 (print), 1937-4143 (electronic)", ISSN-L = "0272-1732", bibdate = "Thu Jun 15 05:55:13 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeemicro.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.computer.org/csdl/mags/mi/2017/03/mmi2017030080-abs.html", acknowledgement = ack-nhfb, journal-URL = "http://www.computer.org/csdl/mags/mi/index.html", } @Article{Garg:2017:CGA, author = "Anshuj Garg and Debadatta Mishra and Purushottam Kulkarni", title = "{Catalyst}: {GPU}-assisted rapid memory deduplication in virtualization environments", journal = j-SIGPLAN, volume = "52", number = "7", pages = "44--59", month = jul, year = "2017", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/3140607.3050760", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat Sep 16 10:18:17 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Content based page sharing techniques improve memory efficiency in virtualized systems by identifying and merging identical pages. Kernel Same-page Merging (KSM), a Linux kernel utility for page sharing, sequentially scans memory pages of virtual machines to deduplicate pages. Sequential scanning of pages has several undesirable side effects---wasted CPU cycles when no sharing opportunities exist, and rate of discovery of sharing being dependent on the scanning rate and corresponding CPU availability. In this work, we exploit presence of GPUs on modern systems to enable rapid memory sharing through targeted scanning of pages. Our solution, Catalyst, works in two phases, the first where pages of virtual machines are processed by the GPU to identify likely pages for sharing and a second phase that performs page-level similarity checks on a targeted set of shareable pages. Opportunistic usage of the GPU to produce sharing hints enables rapid and low-overhead duplicate detection, and sharing of memory pages in virtualization environments. We evaluate Catalyst against various benchmarks and workloads to demonstrate that Catalyst can achieve higher memory sharing in lesser time compared to different scan rate configurations of KSM, at lower or comparable compute costs.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "VEE '17 conference proceedings.", } @Article{Gasiunas:2017:FBA, author = "Vaidas Gasiunas and David Dominguez-Sal and Ralph Acker and Aharon Avitzur and Ilan Bronshtein and Rushan Chen and Eli Ginot and Norbert Martinez-Bazan and Michael M{\"u}ller and Alexander Nozdrin and Weijie Ou and Nir Pachter and Dima Sivov and Eliezer Levy", title = "Fiber-based architecture for {NFV} cloud databases", journal = j-PROC-VLDB-ENDOWMENT, volume = "10", number = "12", pages = "1682--1693", month = aug, year = "2017", CODEN = "????", DOI = "https://doi.org/10.14778/3137765.3137774", ISSN = "2150-8097", bibdate = "Tue Oct 10 17:16:19 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; https://www.math.utah.edu/pub/tex/bib/vldbe.bib", abstract = "The telco industry is gradually shifting from using monolithic software packages deployed on custom hardware to using modular virtualized software functions deployed on cloudified data centers using commodity hardware. This transformation is referred to as Network Function Virtualization (NFV). The scalability of the databases (DBs) underlying the virtual network functions is the cornerstone for reaping the benefits from the NFV transformation. This paper presents an industrial experience of applying shared-nothing techniques in order to achieve the scalability of a DB in an NFV setup. The special combination of requirements in NFV DBs are not easily met with conventional execution models. Therefore, we designed a special shared-nothing architecture that is based on cooperative multi-tasking using user-level threads (fibers). We further show that the fiber-based approach outperforms the approach built using conventional multi-threading and meets the variable deployment needs of the NFV transformation. Furthermore, fibers yield a simpler-to-maintain software and enable controlling a trade-off between long-duration computations and real-time requests.", acknowledgement = ack-nhfb, fjournal = "Proceedings of the VLDB Endowment", journal-URL = "http://portal.acm.org/citation.cfm?id=J1174", } @Article{Gschwind:2017:OED, author = "M. Gschwind and T. Kaldewey and D. K. Tam", title = "Optimizing the efficiency of deep learning through accelerator virtualization", journal = j-IBM-JRD, volume = "61", number = "4", pages = "12:1--12:11", month = "????", year = "2017", CODEN = "IBMJAE", ISSN = "0018-8646 (print), 2151-8556 (electronic)", ISSN-L = "0018-8646", bibdate = "Sat Sep 16 09:55:16 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/ibmjrd.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://ieeexplore.ieee.org/document/8030299/", acknowledgement = ack-nhfb, journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520", } @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 = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.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{Ha:2017:PPE, author = "Tuan Minh Ha and Masaki Samejima and Norihisa Komoda", title = "Power and Performance Estimation for Fine-Grained Server Power Capping via Controlling Heterogeneous Applications", journal = j-TMIS, volume = "8", number = "4", pages = "11:1--11:??", month = sep, year = "2017", CODEN = "????", DOI = "https://doi.org/10.1145/3086449", ISSN = "2158-656X (print), 2158-6578 (electronic)", ISSN-L = "2158-656X", bibdate = "Mon Jan 22 17:26:40 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/tmis.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Power capping is a method to save power consumption of servers by limiting performance of the servers. Although users frequently run applications on different virtual machines (VMs) for keeping their performance and having them isolated from the other applications, power capping may degrade performance of all the applications running on the server. We present fine-grained power capping by limiting performance of each application individually. For keeping performance defined in Quality of Service (QoS) requirements, it is important to estimate applications' performance and power consumption after the fine-grained power capping is applied. We propose the estimation method of physical CPU usage when limiting virtual CPU usage of applications on VMs. On servers where multiple VMs run, VM's usage of physical CPU is interrupted by the other VMs, and a hypervisor uses physical CPU to control VMs. These VMs' and hypervisor's behaviors make it difficult to estimate performance and power consumption by straightforward methods, such as linear regression and polynomial regression. The proposed method uses Piecewise Linear Regression to estimate physical CPU usage by assuming that VM's access to physical CPU is not interrupted by the other VMs. Then we estimate how much physical CPU usage is reduced by the interruption. Because physical CPU usage is not stable soon after limiting CPU usage, the proposed method estimates a convergence value of CPU usage after many interruptions are repeated.", acknowledgement = ack-nhfb, articleno = "11", fjournal = "ACM Transactions on Management Information Systems (TMIS)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1320", } @Article{Hallawi:2017:MCC, author = "Huda Hallawi and J{\"o}rn Mehnen and Hongmei He", title = "Multi-Capacity Combinatorial Ordering {GA} in Application to Cloud resources allocation and efficient virtual machines consolidation", journal = j-FUT-GEN-COMP-SYS, volume = "69", number = "??", pages = "1--10", month = apr, year = "2017", CODEN = "FGSEVI", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Thu Dec 22 12:17:02 MST 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X16304630", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X/", } @Article{Hankendi:2017:SCS, author = "Can Hankendi and Ayse Kivilcim Coskun", title = "Scale \& Cap: Scaling-Aware Resource Management for Consolidated Multi-threaded Applications", journal = j-TODAES, volume = "22", number = "2", pages = "30:1--30:??", month = mar, year = "2017", CODEN = "ATASFO", DOI = "https://doi.org/10.1145/2994145", ISSN = "1084-4309 (print), 1557-7309 (electronic)", ISSN-L = "1084-4309", bibdate = "Fri Jul 21 10:49:30 MDT 2017", bibsource = "http://www.acm.org/pubs/contents/journals/todaes/; https://www.math.utah.edu/pub/tex/bib/multithreading.bib; https://www.math.utah.edu/pub/tex/bib/todaes.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "As the number of cores per server node increases, designing multi-threaded applications has become essential to efficiently utilize the available hardware parallelism. Many application domains have started to adopt multi-threaded programming; thus, efficient management of multi-threaded applications has become a significant research problem. Efficient execution of multi-threaded workloads on cloud environments, where applications are often consolidated by means of virtualization, relies on understanding the multi-threaded specific characteristics of the applications. Furthermore, energy cost and power delivery limitations require data center server nodes to work under power caps, which bring additional challenges to runtime management of consolidated multi-threaded applications. This article proposes a dynamic resource allocation technique for consolidated multi-threaded applications for power-constrained environments. Our technique takes into account application characteristics specific to multi-threaded applications, such as power and performance scaling, to make resource distribution decisions at runtime to improve the overall performance, while accurately tracking dynamic power caps. We implement and evaluate our technique on state-of-the-art servers and show that the proposed technique improves the application performance by up to 21\% under power caps compared to a default resource manager.", acknowledgement = ack-nhfb, articleno = "30", fjournal = "ACM Transactions on Design Automation of Electronic Systems", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J776", } @Article{Hao:2017:OAV, author = "Fang Hao and Murali Kodialam and T. V. Lakshman and Sarit Mukherjee", title = "Online Allocation of Virtual Machines in a Distributed Cloud", journal = j-IEEE-TRANS-NETWORKING, volume = "25", number = "1", pages = "238--249", month = feb, year = "2017", CODEN = "IEANEP", DOI = "https://doi.org/10.1109/TNET.2016.2575779", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Sat Mar 25 08:05:37 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "One of the primary functions of a cloud service provider is to allocate cloud resources to users upon request. Requests arrive in real-time and resource placement decisions must be made as and when a request arrives, without any prior knowledge of future arrivals. In addition, when a cloud service provider operates a geographically diversified cloud that consists of a large number of small data centers, the resource allocation problem becomes even more complex. This is due to the fact that resource request can have additional constraints on data center location, service delay guarantee, and so on, which is especially true for the emerging network function virtualization application. In this paper, we propose a generalized resource placement methodology that can work across different cloud architectures, resource request constraints, with real-time request arrivals and departures. The proposed algorithms are online in the sense that allocations are made without any knowledge of resource requests that arrive in the future, and the current resource allocations are made in such a manner as to permit the acceptance of as many future arrivals as possible. We derive worst case competitive ratio for the algorithms. We show through experiments and case studies the superior performance of the algorithms in practice.", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771", } @Article{Hetzelt:2017:SAE, author = "Felicitas Hetzelt and Robert Buhren", title = "Security Analysis of Encrypted Virtual Machines", journal = j-SIGPLAN, volume = "52", number = "7", pages = "129--142", month = jul, year = "2017", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/3140607.3050763", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat Sep 16 10:18:17 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Cloud computing has become indispensable in today's computer landscape. The flexibility it offers for customers as well as for providers has become a crucial factor for large parts of the computer industry. Virtualization is the key technology that allows for sharing of hardware resources among different customers. The controlling software component, called hypervisor, provides a virtualized view of the computer resources and ensures separation of different guest virtual machines. However, this important cornerstone of cloud computing is not necessarily trustworthy or bug-free. To mitigate this threat AMD introduced Secure Encrypted Virtualization, short SEV, which transparently encrypts a virtual machines memory. In this paper we analyse to what extend the proposed features can resist a malicious hypervisor and discuss the tradeoffs imposed by additional protection mechanisms. To do so, we developed a model of SEV's security capabilities based on the available documentation as actual silicon implementations are not yet on the market. We found that the first proposed version of SEV is not up to the task owing to three design shortcomings. First the virtual machine control block is not encrypted and handled directly by the hypervisor, allowing it to bypass VM memory encryption by executing conveniently chosen gadgets. Secondly, the general purpose registers are not encrypted upon vmexit, leaking potentially sensitive data. Finally, the control over the nested pagetables allows a malicious hypervisor to closely monitor the execution state of a VM and attack it with memory replay attacks.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "VEE '17 conference proceedings.", } @InProceedings{Hirai:2017:DEV, author = "Yoichi Hirai", booktitle = "{Financial Cryptography and Data Security}", title = "Defining the {Ethereum} Virtual Machine for Interactive Theorem Provers", publisher = pub-SV, address = pub-SV:adr, pages = "??--??", year = "2017", DOI = "https://doi.org/10.1007/978-3-319-70278-0_33", bibdate = "Thu Nov 30 15:51:20 MST 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer.com/chapter/10.1007/978-3-319-70278-0_33", acknowledgement = ack-nhfb, } @Article{Hong:2017:FFF, author = "Cheol-Ho Hong and Ivor Spence and Dimitrios S. Nikolopoulos", title = "{FairGV}: Fair and Fast {GPU} Virtualization", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "28", number = "12", pages = "3472--3485", month = dec, year = "2017", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2017.2717908", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Thu Nov 16 10:34:01 MST 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.computer.org/csdl/trans/td/2017/12/07954729-abs.html", acknowledgement = ack-nhfb, journal-URL = "http://www.computer.org/tpds/archives.htm", } @Article{Hong:2017:GVS, author = "Cheol-Ho Hong and Ivor Spence and Dimitrios S. Nikolopoulos", title = "{GPU} Virtualization and Scheduling Methods: a Comprehensive Survey", journal = j-COMP-SURV, volume = "50", number = "3", pages = "35:1--35:??", month = oct, year = "2017", CODEN = "CMSVAN", DOI = "https://doi.org/10.1145/3068281", ISSN = "0360-0300 (print), 1557-7341 (electronic)", ISSN-L = "0360-0300", bibdate = "Sat Jan 20 09:25:00 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/compsurv.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "The integration of graphics processing units (GPUs) on high-end compute nodes has established a new accelerator-based heterogeneous computing model, which now permeates high-performance computing. The same paradigm nevertheless has limited adoption in cloud computing or other large-scale distributed computing paradigms. Heterogeneous computing with GPUs can benefit the Cloud by reducing operational costs and improving resource and energy efficiency. However, such a paradigm shift would require effective methods for virtualizing GPUs, as well as other accelerators. In this survey article, we present an extensive and in-depth survey of GPU virtualization techniques and their scheduling methods. We review a wide range of virtualization techniques implemented at the GPU library, driver, and hardware levels. Furthermore, we review GPU scheduling methods that address performance and fairness issues between multiple virtual machines sharing GPUs. We believe that our survey delivers a perspective on the challenges and opportunities for virtualization of heterogeneous computing environments.", acknowledgement = ack-nhfb, articleno = "35", fjournal = "ACM Computing Surveys", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204", } @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 = "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{Hu:2017:TFC, author = "Yang Hu and Mingcong Song and Tao Li", title = "Towards {``Full Containerization''} in Containerized Network Function Virtualization", journal = j-COMP-ARCH-NEWS, volume = "45", number = "1", pages = "467--481", month = mar, year = "2017", CODEN = "CANED2", DOI = "https://doi.org/10.1145/3093337.3037713", ISSN = "0163-5964 (print), 1943-5851 (electronic)", ISSN-L = "0163-5964", bibdate = "Mon Jun 5 18:01:58 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigarch.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. Experimental results show that NetContainer outperforms conventional page coloring-based memory allocator by 48\% in terms of successful call rate.", acknowledgement = ack-nhfb, fjournal = "ACM SIGARCH Computer Architecture News", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89", remark = "ASPLOS'17 conference proceedings", } @Article{Hussein:2017:OPR, author = "Ahmed Hussein and Mathias Payer and Antony L. Hosking and Chris Vick", title = "One Process to Reap Them All: Garbage Collection as-a-Service", journal = j-SIGPLAN, volume = "52", number = "7", pages = "171--186", month = jul, year = "2017", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/3140607.3050754", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat Sep 16 10:18:17 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Ubiquitous mobile platforms such as Android rely on managed language run-time environments, also known as language virtual machines (VMs), to run a diverse range of user applications (apps). Each app runs in its own private VM instance, and each VM makes its own private local decisions in managing its use of processor and memory resources. Moreover, the operating system and the hardware do not communicate their low-level decisions regarding power management with the high-level app environment. This lack of coordination across layers and across apps restricts more effective global use of resources on the device. We address this problem by devising and implementing a global memory manager service for Android that optimizes memory usage, run-time performance, and power consumption globally across all apps running on the device. The service focuses on the impact of garbage collection (GC) along these dimensions, since GC poses a significant overhead within managed run-time environments. Our prototype collects system-wide statistics from all running VMs, makes centralized decisions about memory management across apps and across software layers, and also collects garbage centrally. Furthermore, the global memory manager coordinates with the power manager to tune collector scheduling. In our evaluation, we illustrate the impact of such a central memory management service in reducing total energy consumption (up to 18\%) and increasing throughput (up to 12\%), and improving memory utilization and adaptability to user activities.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "VEE '17 conference proceedings.", } @Article{Jiang:2017:DFA, author = "Jianhua Jiang and Yunzhao Feng and Jia Zhao and Keqin Li", title = "{DataABC}: a fast {ABC} based energy-efficient live {VM} consolidation policy with data-intensive energy evaluation model", journal = j-FUT-GEN-COMP-SYS, volume = "74", number = "??", pages = "132--141", month = sep, year = "2017", CODEN = "FGSEVI", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Mon Jul 24 19:02:17 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X16301236", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Jin:2017:WCM, author = "Yichao Jin and Yonggang Wen", title = "When Cloud Media Meet Network Function Virtualization: Challenges and Applications", journal = j-IEEE-MULTIMEDIA, volume = "24", number = "3", pages = "72--82", month = jul # "\slash " # sep, year = "2017", CODEN = "IEMUE4", DOI = "https://doi.org/10.1109/MMUL.2017.3051519", ISSN = "1070-986X (print), 1941-0166 (electronic)", ISSN-L = "1070-986X", bibdate = "Mon Jan 15 08:09:13 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeemultimedia.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.computer.org/csdl/mags/mu/2017/03/mmu2017030072-abs.html", acknowledgement = ack-nhfb, journal-URL = "http://www.computer.org/multimedia/", } @Article{Joe:2017:EDI, author = "Hyunwoo Joe and Hyungshin Kim", title = "Effects of dynamic isolation for full virtualized {RTOS} and {GPOS} guests", journal = j-FUT-GEN-COMP-SYS, volume = "70", number = "??", pages = "26--41", month = may, year = "2017", CODEN = "FGSEVI", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Fri Feb 3 18:47:37 MST 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X16308020", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X/", } @Article{Kanizo:2017:OVB, author = "Yossi Kanizo and Ori Rottenstreich and Itai Segall and Jose Yallouz and Yossi Kanizo and Ori Rottenstreich and Itai Segall and Jose Yallouz", title = "Optimizing Virtual Backup Allocation for Middleboxes", journal = j-IEEE-TRANS-NETWORKING, volume = "25", number = "5", pages = "2759--2772", month = oct, year = "2017", CODEN = "IEANEP", DOI = "https://doi.org/10.1109/TNET.2017.2703080", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Fri Jan 12 17:57:12 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "In enterprise networks, network functions, such as address translation, firewall, and deep packet inspection, are often implemented in middleboxes. Those can suffer from temporary unavailability due to misconfiguration or software and hardware malfunction. Traditionally, middlebox survivability is achieved by an expensive active-standby deployment where each middlebox has a backup instance, which is activated in case of a failure. Network function virtualization NFV is a novel networking paradigm allowing flexible, scalable and inexpensive implementation of network services. In this paper, we suggest a novel approach for planning and deploying backup schemes for network functions that guarantee high levels of survivability with significant reduction in resource consumption. In the suggested backup scheme, we take advantage of the flexibility and resource-sharing abilities of the NFV paradigm in order to maintain only a few backup servers, where each can serve one of multiple functions when corresponding middleboxes are unavailable. We describe different goals that network designers can consider when determining which functions to implement in each of the backup servers. We rely on a graph theoretical model to find properties of efficient assignments and to develop algorithms that can find them. Extensive experiments show, for example, that under realistic function failure probabilities, and reasonable capacity limitations, one can obtain 99.9\% survival probability with half the number of servers, compared with standard techniques.", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771", } @Article{Kannan:2017:HDH, author = "Sudarsun Kannan and Ada Gavrilovska and Vishal Gupta and Karsten Schwan", title = "{HeteroOS}: {OS} Design for Heterogeneous Memory Management in Datacenter", journal = j-COMP-ARCH-NEWS, volume = "45", number = "2", pages = "521--534", month = may, year = "2017", CODEN = "CANED2", DOI = "https://doi.org/10.1145/3140659.3080245", ISSN = "0163-5964 (print), 1943-5851 (electronic)", ISSN-L = "0163-5964", bibdate = "Fri Sep 15 11:09:14 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigarch.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 system. 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 pro-active 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 shows up to 2x performance improvement compared to the state-of-the-art VMM-exclusive approach.", acknowledgement = ack-nhfb, fjournal = "ACM SIGARCH Computer Architecture News", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89", } @Article{Kao:2017:TEF, author = "Chia Hung Kao", title = "Testing and evaluation framework for virtualization technologies", journal = j-COMPUTING, volume = "99", number = "7", pages = "657--677", month = jul, year = "2017", CODEN = "CMPTA2", DOI = "https://doi.org/10.1007/s00607-016-0517-6", ISSN = "0010-485X (print), 1436-5057 (electronic)", ISSN-L = "0010-485X", bibdate = "Fri Feb 9 14:54:09 MST 2018", bibsource = "http://link.springer.com/journal/607/99/7; https://www.math.utah.edu/pub/tex/bib/computing.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Computing", journal-URL = "http://link.springer.com/journal/607", } @Article{Karnagel:2017:AWP, author = "Tomas Karnagel and Dirk Habich and Wolfgang Lehner", title = "Adaptive work placement for query processing on heterogeneous computing resources", journal = j-PROC-VLDB-ENDOWMENT, volume = "10", number = "7", pages = "733--744", month = mar, year = "2017", CODEN = "????", ISSN = "2150-8097", bibdate = "Mon Mar 27 20:45:15 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; https://www.math.utah.edu/pub/tex/bib/vldbe.bib", abstract = "The hardware landscape is currently changing from homogeneous multi-core systems towards heterogeneous systems with many different computing units, each with their own characteristics. This trend is a great opportunity for data-base systems to increase the overall performance if the heterogeneous resources can be utilized efficiently. To achieve this, the main challenge is to place the right work on the right computing unit. Current approaches tackling this placement for query processing assume that data cardinalities of intermediate results can be correctly estimated. However, this assumption does not hold for complex queries. To overcome this problem, we propose an adaptive placement approach being independent of cardinality estimation of intermediate results. Our approach is incorporated in a novel adaptive placement sequence. Additionally, we implement our approach as an extensible virtualization layer, to demonstrate the broad applicability with multiple database systems. In our evaluation, we clearly show that our approach significantly improves OLAP query processing on heterogeneous hardware, while being adaptive enough to react to changing cardinalities of intermediate query results.", acknowledgement = ack-nhfb, fjournal = "Proceedings of the VLDB Endowment", journal-URL = "http://portal.acm.org/citation.cfm?id=J1174", } @Article{Kawai:2017:VWD, author = "Takaaki Kawai and Shigeru Kaneda and Mineo Takai and Hiroshi Mineno", title = "A Virtual {WLAN} Device Model for High-Fidelity Wireless Network Emulation", journal = j-TOMACS, volume = "27", number = "3", pages = "17:1--17:??", month = sep, year = "2017", CODEN = "ATMCEZ", DOI = "https://doi.org/10.1145/3067664", ISSN = "1049-3301 (print), 1558-1195 (electronic)", ISSN-L = "1049-3301", bibdate = "Fri Sep 8 08:36:06 MDT 2017", bibsource = "http://www.acm.org/pubs/contents/journals/tomacs/; https://www.math.utah.edu/pub/tex/bib/tomacs.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "The recent popularization of mobile devices has increased the amount of communication traffic. Hence, it is necessary both in academia and industry to research load distribution methods for mobile networks. An evaluation environment for large-scale networks that behaves like a practical system is necessary to evaluate these methods, and either a physical environment or simulation environment can be used. However, physical and simulation environments each have their advantages and disadvantages. A physical environment is suitable for practical operation because it is possible to obtain data from a real environment. In contrast, the cost for a large number of nodes and the difficulty of field preparation are its disadvantages. Reproducing radio propagation is also a challenge. Network simulators solve the disadvantages of the physical environment by modeling the entire evaluation environment. However, they do not exactly reproduce the physical environment because the nodes are abstracted. This article presents an evaluation environment that combines a network simulator and virtual machines with virtual wireless Local Area Network (LAN) devices. The virtual machines reproduce the physical environment with high fidelity by running the programs of the physical machines, and the virtual wireless LAN devices make it possible to emulate wireless LAN communication using default operating system drivers. A network simulator and virtual machines also reduce the cost for nodes, ease the burden of field preparation, and reproduce radio propagation by modeling the evaluation environment. In the evaluation, the proposed method decreased the difference from the physical environment to 5\% in terms of transmission control protocol throughput. In the case of user datagram protocol, the proposed method decreased the difference from the physical environment down to 1.7\%. The number of virtual machines available on a host machine and the practical use of the proposed method are also discussed.", acknowledgement = ack-nhfb, articleno = "17", fjournal = "ACM Transactions on Modeling and Computer Simulation", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J781", } @Article{Khosravi:2017:OVM, author = "Atefeh Khosravi and Adel Nadjaran Toosi and Rajkumar Buyya", title = "Online virtual machine migration for renewable energy usage maximization in geographically distributed cloud data centers", journal = j-CCPE, volume = "29", number = "18", pages = "", day = "25", month = sep, year = "2017", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.4125", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Mon Sep 4 17:02:01 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", } @Article{Kunjir:2017:TAM, author = "Mayuresh Kunjir and Shivnath Babu", title = "{Thoth} in action: memory management in modern data analytics", journal = j-PROC-VLDB-ENDOWMENT, volume = "10", number = "12", pages = "1917--1920", month = aug, year = "2017", CODEN = "????", DOI = "https://doi.org/10.14778/3137765.3137808", ISSN = "2150-8097", bibdate = "Tue Oct 10 17:16:19 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; https://www.math.utah.edu/pub/tex/bib/vldbe.bib", abstract = "Allocation and usage of memory in modern data-processing platforms is based on an interplay of algorithms at multiple levels: (i) at the resource-management level across containers allocated by resource managers like Mesos and Yarn, (ii) at the container level among the OS and processes such as the Java Virtual Machine (JVM), (iii) at the framework level for caching, aggregation, data shuffles, and application data structures, and (iv) at the JVM level across various pools such as the Young and Old Generation as well as the heap versus off-heap. We use Thoth, a data-driven platform for multi-system cluster management, to build a deep understanding of different interplays in memory management options. Through multiple memory management apps built in Thoth, we demonstrate how Thoth can deal with multiple levels of memory management as well as multi-tenant nature of clusters.", acknowledgement = ack-nhfb, fjournal = "Proceedings of the VLDB Endowment", journal-URL = "http://portal.acm.org/citation.cfm?id=J1174", } @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 = "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{Lee:2017:EBG, author = "Jinho Lee and Heesu Kim and Sungjoo Yoo and Kiyoung Choi and H. Peter Hofstee and Gi-Joon Nam and Mark R. Nutter and Damir Jamsek", title = "{ExtraV}: boosting graph processing near storage with a coherent accelerator", journal = j-PROC-VLDB-ENDOWMENT, volume = "10", number = "12", pages = "1706--1717", month = aug, year = "2017", CODEN = "????", DOI = "https://doi.org/10.14778/3137765.3137776", ISSN = "2150-8097", bibdate = "Tue Oct 10 17:16:19 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; https://www.math.utah.edu/pub/tex/bib/vldbe.bib", abstract = "In this paper, we propose ExtraV, a framework for near-storage graph processing. It is based on the novel concept of graph virtualization, which efficiently utilizes a cache-coherent hardware accelerator at the storage side to achieve performance and flexibility at the same time. ExtraV consists of four main components: (1) host processor, (2) main memory, (3) AFU (Accelerator Function Unit) and (4) storage. The AFU, a hardware accelerator, sits between the host processor and storage. Using a coherent interface that allows main memory accesses, it performs graph traversal functions that are common to various algorithms while the program running on the host processor (called the host program) manages the overall execution along with more application-specific tasks. Graph virtualization is a high-level programming model of graph processing that allows designers to focus on algorithm-specific functions. Realized by the accelerator, graph virtualization gives the host programs an illusion that the graph data reside on the main memory in a layout that fits with the memory access behavior of host programs even though the graph data are actually stored in a multi-level, compressed form in storage. We prototyped ExtraV on a Power8 machine with a CAPI-enabled FPGA. Our experiments on a real system prototype offer significant speedup compared to state-of-the-art software only implementations.", acknowledgement = ack-nhfb, fjournal = "Proceedings of the VLDB Endowment", journal-URL = "http://portal.acm.org/citation.cfm?id=J1174", } @Article{Lee:2017:PEH, author = "Kihong Lee and DongWoo Lee and Sungkil Lee and Young Ik Eom", title = "Power-efficient and high-performance block {I/O} framework for mobile virtualization systems", journal = j-J-SUPERCOMPUTING, volume = "73", number = "4", pages = "1307--1321", month = apr, year = "2017", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-016-1810-z", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Sat Jun 24 10:31:33 MDT 2017", bibsource = "http://link.springer.com/journal/11227/73/4; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Lei:2017:NHC, author = "Zhou Lei and Exiong Sun and Shengbo Chen and Jiang Wu and Wenfeng Shen", title = "A Novel Hybrid-Copy Algorithm for Live Migration of Virtual Machine", journal = j-FUTURE-INTERNET, volume = "9", number = "3", pages = "37", day = "18", month = jul, year = "2017", CODEN = "????", DOI = "https://doi.org/10.3390/fi9030037", ISSN = "1999-5903", ISSN-L = "1999-5903", bibdate = "Thu Nov 21 16:50:57 MST 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/future-internet.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.mdpi.com/1999-5903/9/3/37", abstract = "Live migration of virtual machines is an important approach for dynamic resource scheduling in cloud environment. The hybrid-copy algorithm is an excellent algorithm that combines the pre-copy algorithm with the post-copy algorithm to remedy the defects of the pre-copy algorithm and the post-copy algorithm. Currently, the hybrid-copy algorithm only copies all memory pages once in advance. In a write-intensive workload, copy memory pages once may be enough. However, more iterative copy rounds can significantly reduce the page faults in a read-intensive workload. In this paper, we propose a new parameter to decide the appropriate time to stop the iterative copy phase based on real-time situation. We use a Markov model to forecast the memory access pattern. Based on the predicted results and the analysis of the actual situation, the memory page transfer order would be adjusted to reduce the invalid transfers. The novel hybrid-copy algorithm is implemented on the Xen platform. The experimental results demonstrate that our mechanism has good performance both on read-intensive workloads and write-intensive workloads.", acknowledgement = ack-nhfb, journal-URL = "https://www.mdpi.com/journal/futureinternet", remark = "Special Issue Future Computing for Real Time Intelligent Systems.", } @Article{Li:2017:AET, author = "Hong-Wei Li and Yu-Sung Wu and Yi-Yung Chen and Chieh-Min Wang and Yen-Nun Huang", title = "Application Execution Time Prediction for Effective {CPU} Provisioning in Virtualization Environment", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "28", number = "11", pages = "3074--3088", month = nov, year = "2017", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2017.2707543", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Thu Oct 12 06:58:13 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.computer.org/csdl/trans/td/2017/11/07933268-abs.html", acknowledgement = ack-nhfb, journal-URL = "http://www.computer.org/tpds/archives.htm", } @Article{Li:2017:BNB, author = "Zhihua Li and Chengyu Yan and Xinrong Yu and Ning Yu", title = "{Bayesian} network-based Virtual Machines consolidation method", journal = j-FUT-GEN-COMP-SYS, volume = "69", number = "??", pages = "75--87", month = apr, year = "2017", CODEN = "FGSEVI", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Thu Dec 22 12:17:02 MST 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X16307415", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X/", } @Article{Li:2017:CSN, author = "Ning Li and Hong Jiang and Dan Feng and Zhan Shi", title = "Customizable {SLO} and Its Near-Precise Enforcement for Storage Bandwidth", journal = j-TOS, volume = "13", number = "1", pages = "6:1--6:??", month = mar, year = "2017", CODEN = "????", DOI = "https://doi.org/10.1145/2998454", ISSN = "1553-3077 (print), 1553-3093 (electronic)", ISSN-L = "1553-3077", bibdate = "Sat Mar 25 07:00:07 MDT 2017", bibsource = "http://www.acm.org/pubs/contents/journals/tos/; https://www.math.utah.edu/pub/tex/bib/tos.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Cloud service is being adopted as a utility for large numbers of tenants by renting Virtual Machines (VMs). But for cloud storage, unpredictable IO characteristics make accurate Service-Level-Objective (SLO) enforcement challenging. As a result, it has been very difficult to support simple-to-use and technology-agnostic SLO specifying a particular value for a specific metric (e.g., storage bandwidth). This is because the quality of SLO enforcement depends on performance error and fluctuation that measure the precision of SLO enforcement. High precision of SLO enforcement is critical for user-oriented performance customization and user experiences. To address this challenge, this article presents V-Cup, a framework for VM-oriented customizable SLO and its near-precise enforcement. It consists of multiple auto-tuners, each of which exports an interface for a tenant to customize the desired storage bandwidth for a VM and enable the storage bandwidth of the VM to converge on the target value with a predictable precision. We design and implement V-Cup in the Xen hypervisor based on the fair sharing scheduler for VM-level resource management. Our V-Cup prototype evaluation shows that it achieves satisfying performance guarantees through near-precise SLO enforcement.", acknowledgement = ack-nhfb, articleno = "6", fjournal = "ACM Transactions on Storage", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J960", } @Article{Liang:2017:VVB, author = "Hongliang Liang and Mingyu Li and Jian Xu and Wenying Hu and Xiaoxiao Pei and Xiaodong Jia and Yan Song", title = "{vmOS}: a virtualization-based, secure desktop system", journal = j-COMPUT-SECUR, volume = "65", number = "??", pages = "329--343", month = mar, year = "2017", CODEN = "CPSEDU", DOI = "https://doi.org/10.1016/j.cose.2016.10.008", ISSN = "0167-4048 (print), 1872-6208 (electronic)", ISSN-L = "0167-4048", bibdate = "Mon Sep 23 09:46:48 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.sciencedirect.com/science/article/pii/S0167404816301390", acknowledgement = ack-nhfb, fjournal = "Computers \& Security", journal-URL = "https://www.sciencedirect.com/science/journal/01674048", } @Article{Lopez-Pires:2017:MOV, author = "Fabio L{\'o}pez-Pires and Benjam{\'\i}n Bar{\'a}n", title = "Many-Objective Virtual Machine Placement", journal = j-J-GRID-COMP, volume = "15", number = "2", pages = "161--176", month = jun, year = "2017", CODEN = "????", DOI = "https://doi.org/10.1007/s10723-017-9399-x", ISSN = "1570-7873 (print), 1572-9184 (electronic)", ISSN-L = "1570-7873", bibdate = "Mon Oct 2 10:16:50 MDT 2017", bibsource = "http://link.springer.com/journal/10723/15/2; https://www.math.utah.edu/pub/tex/bib/jgridcomp.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://link.springer.com/article/10.1007/s10723-017-9399-x", acknowledgement = ack-nhfb, fjournal = "Journal of Grid Computing", journal-URL = "http://link.springer.com/journal/10723", } @Article{Lopez:2017:KTC, author = "Lorena Isabel Barona L{\'o}pez and {\'A}ngel Leonardo Valdivieso Caraguay and Marco Antonio Sotelo Monge and Luis Javier Garc{\'\i}a Villalba", title = "Key Technologies in the Context of Future Networks: Operational and Management Requirements", journal = j-FUTURE-INTERNET, volume = "9", number = "1", pages = "1", day = "22", month = dec, year = "2017", CODEN = "????", DOI = "https://doi.org/10.3390/fi9010001", ISSN = "1999-5903", ISSN-L = "1999-5903", bibdate = "Thu Nov 21 16:50:56 MST 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/future-internet.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.mdpi.com/1999-5903/9/1/1", abstract = "The concept of Future Networks is based on the premise that current infrastructures require enhanced control, service customization, self-organization and self-management capabilities to meet the new needs in a connected society, especially of mobile users. In order to provide a high-performance mobile system, three main fields must be improved: radio, network, and operation and management. In particular, operation and management capabilities are intended to enable business agility and operational sustainability, where the addition of new services does not imply an excessive increase in capital or operational expenditures. In this context, a set of key-enabled technologies have emerged in order to aid in this field. Concepts such as Software Defined Network (SDN), Network Function Virtualization (NFV) and Self-Organized Networks (SON) are pushing traditional systems towards the next 5G network generation.This paper presents an overview of the current status of these promising technologies and ongoing works to fulfill the operational and management requirements of mobile infrastructures. This work also details the use cases and the challenges, taking into account not only SDN, NFV, cloud computing and SON but also other paradigms.", acknowledgement = ack-nhfb, journal-URL = "https://www.mdpi.com/journal/futureinternet", remark = "Collection Information Systems Security.", } @Article{Lu:2017:FPL, author = "Kai Lu and Wenzhe Zhang and Xiaoping Wang and Mikel Luj{\'a}n and Andy Nisbet", title = "Flexible Page-level Memory Access Monitoring Based on Virtualization Hardware", journal = j-SIGPLAN, volume = "52", number = "7", pages = "201--213", month = jul, year = "2017", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/3140607.3050751", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat Sep 16 10:18:17 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Page protection is often used to achieve memory access monitoring in many applications, dealing with program-analysis, checkpoint-based failure recovery, and garbage collection in managed runtime systems. Typically, low overhead access monitoring is limited by the relatively large page-level granularity of memory management unit hardware support for virtual memory protection. In this paper, we improve upon traditional page-level mechanisms by additionally using hardware support for virtualization in order to achieve fine and flexible granularities that can be smaller than a page. We first introduce a memory allocator based on page protection that can achieve fine-grained monitoring. Second, we explain how virtualization hardware support can be used to achieve dynamic adjustment of the monitoring granularity. In all, we propose a process-level virtual machine to achieve dynamic and fine-grained monitoring. Any application can run on our process-level virtual machine without modification. Experimental results for an incremental checkpoint tool provide a use-case to demonstrate our work. Comparing with traditional page-based checkpoint, our work can effectively reduce the amount of checkpoint data and improve performance.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "VEE '17 conference proceedings.", } @Article{Luckow:2017:HTP, author = "Kasper S{\o}e Luckow and Bent Thomsen and Stephan Erbs Korsholm", title = "{HVM$_{TP}$}: a time predictable and portable {Java Virtual Machine} for hard real-time embedded systems", journal = j-CCPE, volume = "29", number = "22", pages = "??--??", day = "25", month = nov, year = "2017", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.3828", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Sat Dec 30 09:11:59 MST 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/java2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", } @Article{Mann:2017:WBA, author = "Zolt{\'a}n {\'A}d{\'a}m Mann and M{\'a}t{\'e} Szab{\'o}", title = "Which is the best algorithm for virtual machine placement optimization?", journal = j-CCPE, volume = "29", number = "10", pages = "", day = "25", month = may, year = "2017", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.4083", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Mon Jul 24 08:22:36 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", } @Article{Meier:2017:PVM, author = "Remigius Meier and Armin Rigo and Thomas R. Gross", title = "Parallel virtual machines with {RPython}", journal = j-SIGPLAN, volume = "52", number = "2", pages = "48--59", month = feb, year = "2017", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/3093334.2989233", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat Sep 16 10:18:15 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/python.bib; https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "The RPython framework takes an interpreter for a dynamic language as its input and produces a Virtual Machine{\^A} (VM) for that language. RPython is being used to develop PyPy, a high-performance Python interpreter. However, the produced VM does not support parallel execution since the framework relies on a Global Interpreter Lock{\^A} (GIL): PyPy serialises the execution of multi-threaded Python programs. We describe the rationale and design of a new parallel execution model for RPython that allows the generation of parallel virtual machines while leaving the language semantics unchanged. This model then allows different implementations of concurrency control, and we discuss an implementation based on a GIL and an implementation based on Software Transactional Memory{\^A} (STM). To evaluate the benefits of either choice, we adapt PyPy to work with both implementations (GIL and STM). The evaluation shows that PyPy with STM improves the runtime of a set of multi-threaded Python programs over PyPy with a GIL by factors in the range of 1.87 $ \times $ up to 5.96 $ \times $ when executing on a processor with 8 cores.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "DLS '16 conference proceedings.", } @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 = "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{Modi:2017:VLS, author = "Chirag N. Modi and Kamatchi Acha", title = "Virtualization layer security challenges and intrusion detection\slash prevention systems in cloud computing: a comprehensive review", journal = j-J-SUPERCOMPUTING, volume = "73", number = "3", pages = "1192--1234", month = mar, year = "2017", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-016-1805-9", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Sat Jun 24 10:31:32 MDT 2017", bibsource = "http://link.springer.com/journal/11227/73/3; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Mohapatra:2017:PEV, author = "Subasish Mohapatra and Subhadarshini Mohanty and Arunima Hota and Shradha Pattanayak", title = "Performance Evaluation of Virtualization in a Private Cloud Test Bed", journal = j-INT-J-COMP-APPL, volume = "162", number = "??", pages = "20--27", month = mar, year = "2017", CODEN = "????", DOI = "https://doi.org/10.5120/ijca2017913386", ISSN = "0975-8887", ISSN-L = "0975-8887", bibdate = "Fri Jan 24 09:33:46 MST 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcompappl.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.ijcaonline.org/archives/volume162/number7/27256-2017913386/", acknowledgement = ack-nhfb, ajournal = "Intern. J. of Computer Applications", articleno = "7", fjournal = "International Journal of Computer Applications", journal-URL = "https://www.ijcaonline.org/", } @Article{Montella:2017:VCB, author = "Raffaele Montella and Giulio Giunta and Giuliano Laccetti and Marco Lapegna and Carlo Palmieri and Carmine Ferraro and Valentina Pelliccia and Cheol-Ho Hong and Ivor Spence and Dimitrios S. Nikolopoulos", title = "On the Virtualization of {CUDA} Based {GPU} Remoting on {ARM} and x86 Machines in the {GVirtuS} Framework", journal = j-INT-J-PARALLEL-PROG, volume = "45", number = "5", pages = "1142--1163", month = oct, year = "2017", CODEN = "IJPPE5", DOI = "https://doi.org/10.1007/s10766-016-0462-1", ISSN = "0885-7458 (print), 1573-7640 (electronic)", ISSN-L = "0885-7458", bibdate = "Sat Nov 18 09:27:28 MST 2017", bibsource = "http://link.springer.com/journal/10766/45/5; https://www.math.utah.edu/pub/tex/bib/intjparallelprogram.bib; https://www.math.utah.edu/pub/tex/bib/pvm.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "International Journal of Parallel Programming", journal-URL = "http://link.springer.com/journal/10766", } @Article{Nam:2017:JNE, author = "Tran Manh Nam and Nguyen Huu Thanh and Hoang Trung Hieu and Nguyen Tien Manh and Nguyen Van Huynh and Hoang Duong Tuan", title = "Joint network embedding and server consolidation for energy-efficient dynamic data center virtualization", journal = j-COMP-NET-AMSTERDAM, volume = "125", number = "??", pages = "76--89", day = "9", month = oct, year = "2017", CODEN = "????", ISSN = "1389-1286 (print), 1872-7069 (electronic)", ISSN-L = "1389-1286", bibdate = "Thu Sep 21 06:52:31 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1389128617302517", acknowledgement = ack-nhfb, fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)", journal-URL = "http://www.sciencedirect.com/science/journal/13891286/", } @Article{Nezarat:2017:GTB, author = "Amin Nezarat and Yaser Shams", title = "A game theoretic-based distributed detection method for {VM}-to-hypervisor attacks in cloud environment", journal = j-J-SUPERCOMPUTING, volume = "73", number = "10", pages = "4407--4427", month = oct, year = "2017", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-017-2025-7", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Mon Oct 2 11:08:36 MDT 2017", bibsource = "http://link.springer.com/journal/11227/73/10; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Nitu:2017:SBQ, author = "Vlad Nitu and Pierre Olivier and Alain Tchana and Daniel Chiba and Antonio Barbalace and Daniel Hagimont and Binoy Ravindran", title = "Swift Birth and Quick Death: Enabling Fast Parallel Guest Boot and Destruction in the {Xen} Hypervisor", journal = j-SIGPLAN, volume = "52", number = "7", pages = "1--14", month = jul, year = "2017", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/3140607.3050758", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat Sep 16 10:18:17 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "The ability to quickly set up and tear down a virtual machine is critical for today's cloud elasticity, as well as in numerous other scenarios: guest migration/consolidation, event-driven invocation of micro-services, dynamically adaptive unikernel-based applications, micro-reboots for security or stability, etc. In this paper, we focus on the process of setting up/freeing the hypervisor and host control layer data structures at boot/destruction time, showing that it does not scale in current virtualization solutions. In addition to the direct overhead of long VM set-up/destruction times, we demonstrate by experimentation the indirect costs on real world auto scaling systems. Focusing on the popular Xen hypervisor, we identify three critical issues hindering the scalability of the boot and destruction processes: serialized boot, unscalable interactions with the Xenstore at guest creation time, and remote NUMA memory scrubbing at destruction time. For each of these issues we present the design and implementation of a solution in the Xen infrastructure: parallel boot with fine-grained locking, caching of Xenstore data, and local NUMA scrubbing. We evaluate these solutions using micro-benchmarks, macro-benchmarks, and real world datacenter traces. Results show that our work improves the current Xen implementation by a significant factor, for example macro-benchmarks indicate a speedup of more than 4X in high-load scenarios.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "VEE '17 conference proceedings.", } @Article{Ogino:2017:VNE, author = "Nagao Ogino and Takeshi Kitahara and Shin'ichi Arakawa and Masayuki Murata", title = "Virtual network embedding with multiple priority classes sharing substrate resources", journal = j-COMP-NET-AMSTERDAM, volume = "112", number = "??", pages = "52--66", day = "15", month = jan, year = "2017", CODEN = "????", ISSN = "1389-1286 (print), 1872-7069 (electronic)", ISSN-L = "1389-1286", bibdate = "Fri Mar 10 12:06:17 MST 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1389128616303395", acknowledgement = ack-nhfb, fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)", journal-URL = "http://www.sciencedirect.com/science/journal/13891286/", } @Article{Peng:2017:SMA, author = "Zhiping Peng and Bo Xu and Antonio Marcel Gates and Delong Cui and Weiwei Lin", title = "A Study of a Multi-Agent Organizational Framework with Virtual Machine Clusters as the Unit of Granularity in Cloud Computing", journal = j-COMP-J, volume = "60", number = "7", pages = "1032--1043", day = "1", month = jul, year = "2017", CODEN = "CMPJA6", ISSN = "0010-4620 (print), 1460-2067 (electronic)", ISSN-L = "0010-4620", bibdate = "Thu Nov 16 10:43:46 MST 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://academic.oup.com/comjnl/article/60/7/1032/2608048", acknowledgement = ack-nhfb, fjournal = "The Computer Journal", journal-URL = "http://comjnl.oxfordjournals.org/", } @Article{Pimas:2017:GCE, author = "Javier Pim{\'a}s and Javier Burroni and Jean Baptiste Arnaud and Stefan Marr", title = "Garbage collection and efficiency in dynamic metacircular runtimes: an experience report", journal = j-SIGPLAN, volume = "52", number = "11", pages = "39--50", month = nov, year = "2017", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/3170472.3133845", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Dec 1 18:56:13 MST 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "In dynamic object-oriented languages, low-level mechanisms such as just-in-time compilation, object allocation, garbage collection (GC) and method dispatch are often handled by virtual machines (VMs). VMs are typically implemented using static languages, allowing only few changes at run time. In such systems, the VM is not part of the language and interfaces to memory management or method dispatch are fixed, not allowing for arbitrary adaptation. Furthermore, the implementation can typically not be inspected or debugged with standard tools used to work on application code. This paper reports on our experience building Bee, a dynamic Smalltalk runtime, written in Smalltalk. Bee is a Dynamic Metacircular Runtime (DMR) and seamlessly integrates the VM into the application and thereby overcomes many restrictions of classic VMs, for instance by allowing arbitrary code modifications of the VM at run time. Furthermore, the approach enables developers to use their standard tools for application code also for the VM, allowing them to inspect, debug, understand, and modify a DMR seamlessly. We detail our experience of implementing GC, compilation, and optimizations in a DMR. We discuss examples where we found that DMRs can improve understanding of the system, provide tighter control of the software stack, and facilitate research. We also show that the Bee DMR matches and surpass the performance of a widely used Smalltalk VM.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "DLS '17 conference proceedings.", } @Article{Pinto:2017:TTA, author = "Sandro Pinto and Jorge Pereira and Tiago Gomes and Mongkol Ekpanyapong and Adriano Tavares", title = "Towards a {TrustZone}-Assisted Hypervisor for Real-Time Embedded Systems", journal = j-IEEE-COMPUT-ARCHIT-LETT, volume = "16", number = "2", pages = "158--161", month = jul # "\slash " # dec, year = "2017", CODEN = "????", DOI = "https://doi.org/10.1109/LCA.2016.2617308", ISSN = "1556-6056 (print), 1556-6064 (electronic)", ISSN-L = "1556-6056", bibdate = "Thu Jun 20 17:18:18 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeecomputarchitlett.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Virtualization technology starts becoming more and more widespread in the embedded space. The penalties incurred by standard software-based virtualization is pushing research towards hardware-assisted solutions. Among the existing commercial off-the-shelf technologies for secure virtualization, ARM TrustZone is attracting particular attention. However, it is often seen with some scepticism due to the dual-OS limitation of existing state-of-the-art solutions. This letter presents the implementation of a TrustZone-based hypervisor for real-time embedded systems, which allows multiple RTOS partitions on the same hardware platform. The results demonstrate that virtualization overhead is less than 2 percent for a 10 milliseconds guest-switching rate, and the system remains deterministic. This work goes beyond related work by implementing a TrustZone-assisted solution that allows the execution of an arbitrary number of guest OSes while providing the foundation to drive next generation of secure virtualization solutions for resource-constrained embedded devices.", acknowledgement = ack-nhfb, affiliation = "Pinto, S (Reprint Author), Univ Minho, Dept Ctr Algoritmi, P-4704553 Braga, Portugal. Pinto, Sandro; Pereira, Jorge; Gomes, Tiago; Tavares, Adriano, Univ Minho, Dept Ctr Algoritmi, P-4704553 Braga, Portugal. Ekpanyapong, Mongkol, Asian Inst Technol, Pathum Thani 12120, Thailand.", author-email = "sandro.pinto@algoritmi.uminho.pt jorge.m.pereira@algoritmi.uminho.pt tiago.m.gomes@algoritmi.uminho.pt mongkol@ait.ac.th adriano.tavares@algoritmi.uminho.pt", da = "2019-06-20", doc-delivery-number = "FR2AX", eissn = "1556-6064", fjournal = "IEEE Computer Architecture Letters", funding-acknowledgement = "COMPETE [POCI-01-0145-FEDER-007043]; FCT - Fundacao para a Ciencia e Tecnologia [SFRH/BD/91530/2012, UID/CEC/00319/2013]", funding-text = "This work has been supported by COMPETE: POCI-01-0145-FEDER-007043 and FCT --- Fundacao para a Ciencia e Tecnologia (grant SFRH/BD/91530/2012 and UID/CEC/00319/2013).", journal-iso = "IEEE Comput. Archit. Lett.", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=10208", keywords = "ARM; embedded systems; monitor; real-time; RODOS; TrustZone; Virtualization", number-of-cited-references = "12", ORCID-numbers = "Gomes, Tiago/0000-0002-4071-9015 Salgado Pinto, Sandro Emanuel/0000-0003-4580-7484 Tavares, Adriano/0000-0001-8316-6927", research-areas = "Computer Science", researcherid-numbers = "Gomes, Tiago/A-4751-2016 Salgado Pinto, Sandro Emanuel/D-6725-2015 Tavares, Adriano/M-5257-2013", times-cited = "3", unique-id = "Pinto:2017:TTA", web-of-science-categories = "Computer Science, Hardware \& Architecture", } @Article{Pizlo:2017:JVM, author = "Filip Pizlo", title = "The {JavaScriptCore} virtual machine (invited talk)", journal = j-SIGPLAN, volume = "52", number = "11", pages = "1--1", month = nov, year = "2017", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/3170472.3148567", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Dec 1 18:56:13 MST 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2010.bib; https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "JavaScriptCore (JSC) is an open-source high-performance implementation of JavaScript. JSC is used in the WebKit open source browser engine as well as a system framework on macOS and iOS. This talk will give a broad high-level overview of JSC's performance-oriented architecture, including specific details about the object model, garbage collector, optimizing compilers, type inference, and deoptimization.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "DLS '17 conference proceedings.", } @Article{Psychas:2017:NPV, author = "Konstantinos Psychas and Javad Ghaderi", title = "On Non-Preemptive {VM} Scheduling in the Cloud", journal = j-POMACS, volume = "1", number = "2", pages = "35:1--35:29", month = dec, year = "2017", CODEN = "????", DOI = "https://doi.org/10.1145/3154493", ISSN = "2476-1249", ISSN-L = "2476-1249", bibdate = "Mon Mar 29 10:31:26 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/pomacs.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1145/3154493", abstract = "We study the problem of scheduling VMs (Virtual Machines) in a distributed server platform, motivated by cloud computing applications. The VMs arrive dynamically over time to the system, and require a certain amount of resources (e.g. memory, CPU, etc) \ldots{}", acknowledgement = ack-nhfb, articleno = "35", fjournal = "Proceedings of the ACM on Measurement and Analysis of Computing Systems (POMACS)", journal-URL = "https://dl.acm.org/loi/pomacs", } @Article{Rajabzadeh:2017:EAF, author = "Mehdi Rajabzadeh and Abolfazl Toroghi Haghighat", title = "Energy-aware framework with {Markov} chain-based parallel simulated annealing algorithm for dynamic management of virtual machines in cloud data centers", journal = j-J-SUPERCOMPUTING, volume = "73", number = "5", pages = "2001--2017", month = may, year = "2017", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-016-1900-y", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Sat Jun 24 10:31:33 MDT 2017", bibsource = "http://link.springer.com/journal/11227/73/5; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Rampersaud:2017:SAO, author = "Safraz Rampersaud and Daniel Grosu", title = "Sharing-Aware Online Virtual Machine Packing in Heterogeneous Resource Clouds", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "28", number = "7", pages = "2046--2059", month = jul, year = "2017", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2016.2641937", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Thu Jun 15 05:46:52 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.computer.org/csdl/trans/td/2017/07/07792170-abs.html", acknowledgement = ack-nhfb, journal-URL = "http://www.computer.org/tpds/archives.htm", } @Article{Ren:2017:DPA, author = "Shenyuan Ren and Ligang He and Huanzhou Zhu and Zhuoer Gu and Wei Song and Jiandong Shang", title = "Developing power-aware scheduling mechanisms for computing systems virtualized by {Xen}", journal = j-CCPE, volume = "29", number = "3", pages = "??--??", day = "10", month = feb, year = "2017", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.3888", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Sat Feb 18 10:07:19 MST 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", } @Article{Ren:2017:NLN, author = "Jianbao Ren and Yong Qi and Yuehua Dai and Yu Xuan and Yi Shi", title = "{Nosv}: a lightweight nested-virtualization {VMM} for hosting high performance computing on cloud", journal = j-J-SYST-SOFTW, volume = "124", number = "??", pages = "137--152", month = feb, year = "2017", CODEN = "JSSODM", ISSN = "0164-1212 (print), 1873-1228 (electronic)", ISSN-L = "0164-1212", bibdate = "Thu Dec 8 12:35:59 MST 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0164121216302151", acknowledgement = ack-nhfb, fjournal = "Journal of Systems and Software", journal-URL = "http://www.sciencedirect.com/science/journal/01641212/", } @Article{Richards:2017:VAK, author = "Gregor Richards and Ellen Arteca and Alexi Turcotte", title = "The {VM} already knew that: leveraging compile-time knowledge to optimize gradual typing", journal = j-PACMPL, volume = "1", number = "OOPSLA", pages = "55:1--55:??", month = oct, year = "2017", CODEN = "????", DOI = "https://doi.org/10.1145/3133879", ISSN = "2475-1421", bibdate = "Wed Jan 10 09:45:26 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/pacmpl.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, articleno = "55", fjournal = "Proceedings of the ACM on Programming Languages", journal-URL = "https://pacmpl.acm.org/", } @Article{Rodrigues:2017:HMM, author = "T. G. Rodrigues and K. Suto and H. Nishiyama and N. Kato", title = "Hybrid Method for Minimizing Service Delay in Edge Cloud Computing Through {VM} Migration and Transmission Power Control", journal = j-IEEE-TRANS-COMPUT, volume = "66", number = "5", pages = "810--819", month = may, year = "2017", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.2016.2620469", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Thu Apr 6 07:46:06 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Computers", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", keywords = "Cloud computing; cloudlet; Delays; Edge cloud computing; Mobile handsets; Power control; Process control; Proposals; resource management; Servers; service delay minimization; transmission power control; virtualization", } @Article{Rodriguez:2017:BDS, author = "Maria A. Rodriguez and Rajkumar Buyya", title = "Budget-Driven Scheduling of Scientific Workflows in {IaaS} Clouds with Fine-Grained Billing Periods", journal = j-TAAS, volume = "12", number = "2", pages = "5:1--5:??", month = may, year = "2017", CODEN = "????", DOI = "https://doi.org/10.1145/3041036", ISSN = "1556-4665 (print), 1556-4703 (electronic)", ISSN-L = "1556-4665", bibdate = "Mon Jul 24 18:16:40 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/taas.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "With the advent of cloud computing and the availability of data collected from increasingly powerful scientific instruments, workflows have become a prevailing mean to achieve significant scientific advances at an increased pace. Scheduling algorithms are crucial in enabling the efficient automation of these large-scale workflows, and considerable effort has been made to develop novel heuristics tailored for the cloud resource model. The majority of these algorithms focus on coarse-grained billing periods that are much larger than the average execution time of individual tasks. Instead, our work focuses on emerging finer-grained pricing schemes (e.g., per-minute billing) that provide users with more flexibility and the ability to reduce the inherent wastage that results from coarser-grained ones. We propose a scheduling algorithm whose objective is to optimize a workflow's execution time under a budget constraint; quality of service requirement that has been overlooked in favor of optimizing cost under a deadline constraint. Our proposal addresses fundamental challenges of clouds such as resource elasticity, abundance, and heterogeneity, as well as resource performance variation and virtual machine provisioning delays. The simulation results demonstrate our algorithm's responsiveness to environmental uncertainties and its ability to generate high-quality schedules that comply with the budget constraint while achieving faster execution times when compared to state-of-the-art algorithms.", acknowledgement = ack-nhfb, articleno = "5", fjournal = "ACM Transactions on Autonomous and Adaptive Systems (TAAS)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1010", } @Article{Roh:2017:JFV, author = "Heejun Roh and Cheoulhoon Jung and Kyunghwi Kim and Sangheon Pack and Wonjun Lee", title = "Joint flow and virtual machine placement in hybrid cloud data centers", journal = j-J-NETW-COMPUT-APPL, volume = "85", number = "??", pages = "4--13", day = "1", month = may, year = "2017", CODEN = "JNCAF3", ISSN = "1084-8045 (print), 1095-8592 (electronic)", ISSN-L = "1084-8045", bibdate = "Sat Jul 29 15:40:53 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1084804516303101", acknowledgement = ack-nhfb, fjournal = "Journal of Network and Computer Applications", journal-URL = "http://www.sciencedirect.com/science/journal/10848045", } @Article{Rosa:2017:ARC, author = "Andrea Ros{\`a} and Eduardo Rosales and Walter Binder", title = "Accurate reification of complete supertype information for dynamic analysis on the {JVM}", journal = j-SIGPLAN, volume = "52", number = "12", pages = "104--116", month = dec, year = "2017", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/3170492.3136061", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Dec 1 18:56:14 MST 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2010.bib; https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Reflective supertype information (RSI) is useful for many instrumentation-based dynamic analyses on the Java Virtual Machine (JVM). On the one hand, while such information can be obtained when performing the instrumentation within the same JVM process executing the instrumented program, in-process instrumentation severely limits the code coverage of the analysis. On the other hand, performing the instrumentation in a separate process can achieve full code coverage, but complete RSI is generally not available, often requiring expensive runtime checks in the instrumented program. Providing accurate and complete RSI in the instrumentation process is challenging because of dynamic class loading and classloader namespaces. In this paper, we present a novel technique to accurately reify complete RSI in a separate instrumentation process. We implement our technique in the dynamic analysis framework DiSL and evaluate it on a task profiler, achieving speedups of up to 45\% for an analysis with full code coverage.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "GPCE '17 conference proceedings.", } @Article{Rottenstreich:2017:MDN, author = "Ori Rottenstreich and Isaac Keslassy and Yoram Revah and Aviran Kadosh", title = "Minimizing Delay in Network Function Virtualization with Shared Pipelines", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "28", number = "1", pages = "156--169", month = jan, year = "2017", CODEN = "ITDSEO", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Thu Dec 15 06:44:55 MST 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.computer.org/csdl/trans/td/2017/01/07457328-abs.html", acknowledgement = ack-nhfb, journal-URL = "http://www.computer.org/tpds/archives.htm", } @Article{Roychowdhury:2017:ABS, author = "Sohini Roychowdhury and Paul Hage and Joseph Vasquez", title = "{Azure}-Based Smart Monitoring System for Anemia-Like Pallor", journal = j-FUTURE-INTERNET, volume = "9", number = "3", pages = "39", day = "26", month = jul, year = "2017", CODEN = "????", DOI = "https://doi.org/10.3390/fi9030039", ISSN = "1999-5903", ISSN-L = "1999-5903", bibdate = "Thu Nov 21 16:50:57 MST 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/future-internet.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.mdpi.com/1999-5903/9/3/39", abstract = "Increasing costs of diagnostic healthcare have necessitated the development of hardware independent non-invasive Point of Care (POC) systems. Although anemia prevalence rates in global populations vary between 10\% and 60\% in various demographic groups, smart monitoring systems have not yet been developed for screening and tracking anemia-like pallor. In this work, we present two cloud platform-hosted POC applications that are directed towards smart monitoring of anemia-like pallor through eye and tongue pallor site images. The applications consist of a front-end graphical user interface (GUI) module and two different back-end image processing and machine learning modules. Both applications are hosted on a browser accessible tomcat server ported to an Azure Virtual Machine (VM). We observe that the first application spatially segments regions of interest from pallor site images with higher pallor classification accuracy and relatively longer processing times when compared to the lesser accurate yet faster second application. Also, both applications achieve 65\%-98\% accuracy in separating normal images from images with pallor or abnormalities. The optimized front-end module is significantly light-weight with a run-through time ratio of 10-5 with respect to the back-end modules. Thus, the proposed applications are portable and hardware independent, allowing for their use in pallor monitoring and screening tasks.", acknowledgement = ack-nhfb, journal-URL = "https://www.mdpi.com/journal/futureinternet", } @Article{Ryoo:2017:RTD, author = "Jee Ho Ryoo and Nagendra Gulur and Shuang Song and Lizy K. John", title = "Rethinking {TLB} Designs in Virtualized Environments: a Very Large Part-of-Memory {TLB}", journal = j-COMP-ARCH-NEWS, volume = "45", number = "2", pages = "469--480", month = may, year = "2017", CODEN = "CANED2", DOI = "https://doi.org/10.1145/3140659.3080210", ISSN = "0163-5964 (print), 1943-5851 (electronic)", ISSN-L = "0163-5964", bibdate = "Fri Sep 15 11:09:14 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigarch.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "With increasing deployment of virtual machines for cloud services and server applications, memory address translation overheads in virtualized environments have received great attention. In the radix-4 type of page tables used in x86 architectures, a TLB-miss necessitates up to 24 memory references for one guest to host translation. While dedicated page walk caches and such recent enhancements eliminate many of these memory references, our measurements on the Intel Skylake processors indicate that many programs in virtualized mode of execution still spend hundreds of cycles for translations that do not hit in the TLBs. This paper presents an innovative scheme to reduce the cost of address translations by using a very large Translation Lookaside Buffer that is part of memory, the POM-TLB. In the POM-TLB, only one access is required instead of up to 24 accesses required in commonly used 2D walks with radix-4 type of page tables. Even if many of the 24 accesses may hit in the page walk caches, the aggregated cost of the many hits plus the overhead of occasional misses from page walk caches still exceeds the cost of one access to the POM-TLB. Since the POM-TLB is part of the memory space, TLB entries (as opposed to multiple page table entries) can be cached in large L2 and L3 data caches, yielding significant benefits. Through detailed evaluation running SPEC, PARSEC and graph workloads, we demonstrate that the proposed POM-TLB improves performance by approximately 10\% on average. The improvement is more than 16\% for 5 of the benchmarks. It is further seen that a POM-TLB of 16MB size can eliminate nearly all TLB misses in 8-core systems.", acknowledgement = ack-nhfb, fjournal = "ACM SIGARCH Computer Architecture News", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89", } @Article{Santanna:2017:DIS, author = "Francisco Sant'anna and Roberto Ierusalimschy and Noemi Rodriguez and Silvana Rossetto and Adriano Branco", title = "The Design and Implementation of the Synchronous Language {C{\'e}U}", journal = j-TECS, volume = "16", number = "4", pages = "98:1--98:26", month = aug, year = "2017", CODEN = "????", DOI = "https://doi.org/10.1145/3035544", ISSN = "1539-9087 (print), 1558-3465 (electronic)", ISSN-L = "1539-9087", bibdate = "Mon Aug 14 18:53:33 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/tecs.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "C {\'e}U is a synchronous language targeting soft real-time systems. It is inspired by Esterel and has a simple semantics with fine-grain control over program execution. C{\'e}U uses an event-triggered notion of time that enables compile-time checks to detect conflicting concurrent statements, resulting in deterministic and concurrency-safe programs. We present the particularities of our design in comparison to Esterel, such as stack-based internal events, concurrency checks, safe integration with C, and first-class timers. We also present two implementation back ends: one aiming for resource efficiency and interoperability with C, and another as a virtual machine that allows remote reprogramming.", acknowledgement = ack-nhfb, articleno = "98", fjournal = "ACM Transactions on Embedded Computing Systems", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J840", } @Article{Shen:2017:DAV, author = "Haiying Shen and Liuhua Chen", title = "Distributed Autonomous Virtual Resource Management in Datacenters Using Finite-{Markov} Decision Process", journal = j-IEEE-TRANS-NETWORKING, volume = "25", number = "6", pages = "3836--3849", month = dec, year = "2017", CODEN = "IEANEP", DOI = "https://doi.org/10.1109/TNET.2017.2759276", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Thu Jan 18 06:52:57 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "To provide robust infrastructure as a service, clouds currently perform load balancing by migrating virtual machines VMs from heavily loaded physical machines PMs to lightly loaded PMs. Previous reactive load balancing algorithms migrate VMs upon the occurrence of load imbalance, while previous proactive load balancing algorithms predict PM overload to conduct VM migration. However, both methods cannot maintain long-term load balance and produce high overhead and delay due to migration VM selection and destination PM selection. To overcome these problems, in this paper, we propose a proactive Markov Decision Process MDP-based load balancing algorithm. We handle the challenges of allying MDP in virtual resource management in cloud datacenters, which allows a PM to proactively find an optimal action to transit to a lightly loaded state that will maintain for a longer period of time. We also apply the MDP to determine destination PMs to achieve long-term PM load balance state. Our algorithm reduces the numbers of service level agreement SLA violations by long-term load balance maintenance, and also reduces the load balancing overhead e.g., CPU time and energy and delay by quickly identifying VMs and destination PMs to migrate. We further propose enhancement methods for higher performance. First, we propose a cloud profit oriented reward system in the MDP model so that when the MDP tries to maximize the rewards for load balance, it concurrently improves the actual profit of the datacenter. Second, we propose a new MDP model, which considers the actions for both migrating a VM out of a PM and migrating a VM into a PM, in order to reduce the overhead and improve the effectiveness of load balancing. Our trace-driven experiments show that our algorithm outperforms both previous reactive and proactive load balancing algorithms in terms of SLA violation, load balancing efficiency, and long-term load balance maintenance. Our experimental results also show the effectiveness of our proposed enhancement methods.", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771", } @Article{Shen:2017:SLC, author = "Zhiming Shen and Qin Jia and Gur-Eyal Sela and Weijia Song and Hakim Weatherspoon and Robbert {Van Renesse}", title = "{Supercloud}: a Library Cloud for Exploiting Cloud Diversity", journal = j-TOCS, volume = "35", number = "2", pages = "6:1--6:??", month = oct, year = "2017", CODEN = "ACSYEC", DOI = "https://doi.org/10.1145/3132038", ISSN = "0734-2071 (print), 1557-7333 (electronic)", ISSN-L = "0734-2071", bibdate = "Tue Oct 10 17:48:24 MDT 2017", bibsource = "http://www.acm.org/pubs/contents/journals/tocs/; https://www.math.utah.edu/pub/tex/bib/tocs.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Infrastructure-as-a-Service (IaaS) cloud providers hide available interfaces for virtual machine (VM) placement and migration, CPU capping, memory ballooning, page sharing, and I/O throttling, limiting the ways in which applications can optimally configure resources or respond to dynamically shifting workloads. Given these interfaces, applications could migrate VMs in response to diurnal workloads or changing prices, adjust resources in response to load changes, and so on. This article proposes a new abstraction that we call a Library Cloud and that allows users to customize the diverse available cloud resources to best serve their applications. We built a prototype of a Library Cloud that we call the Supercloud. The Supercloud encapsulates applications in a virtual cloud under users' full control and can incorporate one or more availability zones within a cloud provider or across different providers. The Supercloud provides virtual machine, storage, and networking complete with a full set of management operations, allowing applications to optimize performance. In this article, we demonstrate various innovations enabled by the Library Cloud.", acknowledgement = ack-nhfb, articleno = "6", fjournal = "ACM Transactions on Computer Systems", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J774", } @Article{Silla:2017:BRG, author = "Federico Silla and Sergio Iserte and Carlos Rea{\~n}o and Javier Prades", title = "On the benefits of the remote {GPU} virtualization mechanism: The {rCUDA} case", journal = j-CCPE, volume = "29", number = "13", pages = "", day = "10", month = jul, year = "2017", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.4072", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Mon Jul 24 08:22:38 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/pvm.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", } @Article{Sohrabi:2017:EEA, author = "Sahar Sohrabi and Yun Yang and Irene Moser and Aldeida Aleti", title = "Energy-efficient adaptive virtual machine migration mechanism for private clouds", journal = j-CCPE, volume = "29", number = "18", pages = "", day = "25", month = sep, year = "2017", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.4170", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Mon Sep 4 17:02:01 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", } @Article{Song:2017:EPU, author = "Wonjun Song and Hyung-Joon Jung and Jung Ho Ahn and Jae W. Lee and John Kim", title = "Evaluation of Performance Unfairness in {NUMA} System Architecture", journal = j-IEEE-COMPUT-ARCHIT-LETT, volume = "16", number = "1", pages = "26--29", month = jan # "\slash " # jun, year = "2017", CODEN = "????", DOI = "https://doi.org/10.1109/LCA.2016.2602876", ISSN = "1556-6056 (print), 1556-6064 (electronic)", ISSN-L = "1556-6056", bibdate = "Thu Jun 20 17:18:18 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeecomputarchitlett.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "NUMA (Non-uniform memory access) system architectures are commonly used in high-performance computing and datacenters. Within each architecture, a processor-interconnect is used for communication between the different sockets and examples of such interconnect include Intel QPI and AMD HyperTransport. In this work, we explore the impact of the processor-interconnect on overall performance-in particular, we explore the impact on performance fairness from the 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 paper is the first to demonstrate the opposite can occur in a commodity NUMA servers where remote nodes receive higher bandwidth (and perform better). This problem occurs because router micro-architectures for processor-interconnects commonly employ external concentration. While accessing remote memory can occur in any NUMA system, performance unfairness (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 executing workload on the Xen virtualization platform. We then provide analysis using synthetic workloads to better understand the source of unfairness.", acknowledgement = ack-nhfb, affiliation = "Song, W (Reprint Author), Korea Adv Inst Sci \& Technol, Daejeon, South Korea. Song, Wonjun; Jung, Hyung-Joon; Kim, John, Korea Adv Inst Sci \& Technol, Daejeon, South Korea. Ahn, Jung Ho; Lee, Jae W., Seoul Natl Univ, Seoul, South Korea.", author-email = "iamwonjunsong@kaist.edu hans7taiji@kaist.edu gajh@snu.ac.kr jaewlee@snu.ac.kr jjk12@kaist.edu", da = "2019-06-20", doc-delivery-number = "EY5PB", eissn = "1556-6064", fjournal = "IEEE Computer Architecture Letters", funding-acknowledgement = "Google Faculty Research Award, National Research Foundation of Korea [NRF-2013R1A2A2A01069132, NRF-2014R1A2A1A11052936, NRF-2015M3C4A7065647]; MSIP under the ITRC [IITP-2016-H8501-16-1005]", funding-text = "This work was supported in part by Google Faculty Research Award, National Research Foundation of Korea (NRF-2013R1A2A2A01069132, NRF-2014R1A2A1A11052936, and NRF-2015M3C4A7065647), and in part by MSIP under the ITRC (IITP-2016-H8501-16-1005).", journal-iso = "IEEE Comput. Archit. Lett.", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=10208", keywords = "NUMA; processor-interconnect; unfairness", number-of-cited-references = "8", research-areas = "Computer Science", researcherid-numbers = "Kim, John/C-1792-2011", times-cited = "1", unique-id = "Song:2017:EPU", web-of-science-categories = "Computer Science, Hardware \& Architecture", } @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-COMP-ARCH-NEWS, volume = "45", number = "1", pages = "765--777", month = mar, year = "2017", CODEN = "CANED2", DOI = "https://doi.org/10.1145/3093337.3037753", ISSN = "0163-5964 (print), 1943-5851 (electronic)", ISSN-L = "0163-5964", bibdate = "Mon Jun 5 18:01:58 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigarch.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.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 unfairness 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 identify 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 unfairness (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 unfairness 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 = "ACM SIGARCH Computer Architecture News", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89", remark = "ASPLOS'17 conference proceedings", } @Article{Sotiriadis:2017:VMC, author = "Stelios Sotiriadis and Nik Bessis and Euripides G. M. Petrakis and Cristiana Amza and Catalin Negru and Mariana Mocanu", title = "Virtual machine cluster mobility in inter-cloud platforms", journal = j-FUT-GEN-COMP-SYS, volume = "74", number = "??", pages = "179--189", month = sep, year = "2017", CODEN = "FGSEVI", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Mon Jul 24 19:02:17 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X16300206", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @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 = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.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{Srikanth:2017:CVU, author = "Akhilesh Srikanth and Burak Sahin and William R. Harris", title = "Complexity verification using guided theorem enumeration", journal = j-SIGPLAN, volume = "52", number = "1", pages = "639--652", month = jan, year = "2017", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/3093333.3009864", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat Sep 16 10:18:14 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Determining if a given program satisfies a given bound on the amount of resources that it may use is a fundamental problem with critical practical applications. Conventional automatic verifiers for safety properties cannot be applied to address this problem directly because such verifiers target properties expressed in decidable theories; however, many practical bounds are expressed in nonlinear theories, which are undecidable. In this work, we introduce an automatic verification algorithm, CAMPY, that determines if a given program P satisfies a given resource bound B, which may be expressed using polynomial, exponential, and logarithmic terms. The key technical contribution behind our verifier is an interpolating theorem prover for non-linear theories that lazily learns a sufficiently accurate approximation of non-linear theories by selectively grounding theorems of the nonlinear theory that are relevant to proving that P satisfies B. To evaluate CAMPY, we implemented it to target Java Virtual Machine bytecode. We applied CAMPY to verify that over 20 solutions submitted for programming problems hosted on popular online coding platforms satisfy or do not satisfy expected complexity bounds.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "POPL '17 conference proceedings.", } @Article{Stefanovici:2017:TSS, author = "Ioan Stefanovici and Bianca Schroeder and Greg O'Shea and Eno Thereska", title = "Treating the Storage Stack Like a Network", journal = j-TOS, volume = "13", number = "1", pages = "2:1--2:??", month = mar, year = "2017", CODEN = "????", DOI = "https://doi.org/10.1145/3032968", ISSN = "1553-3077 (print), 1553-3093 (electronic)", ISSN-L = "1553-3077", bibdate = "Sat Mar 25 07:00:07 MDT 2017", bibsource = "http://www.acm.org/pubs/contents/journals/tos/; https://www.math.utah.edu/pub/tex/bib/tos.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "In a data center, an IO from an application to distributed storage traverses not only the network but also several software stages with diverse functionality. This set of ordered stages is known as the storage or IO stack. Stages include caches, hypervisors, IO schedulers, file systems, and device drivers. Indeed, in a typical data center, the number of these stages is often larger than the number of network hops to the destination. Yet, while packet routing is fundamental to networks, no notion of IO routing exists on the storage stack. The path of an IO to an endpoint is predetermined and hard coded. This forces IO with different needs (e.g., requiring different caching or replica selection) to flow through a one-size-fits-all IO stack structure, resulting in an ossified IO stack. This article proposes sRoute, an architecture that provides a routing abstraction for the storage stack. sRoute comprises a centralized control plane and ``sSwitches'' on the data plane. The control plane sets the forwarding rules in each sSwitch to route IO requests at runtime based on application-specific policies. A key strength of our architecture is that it works with unmodified applications and Virtual Machines (VMs). This article shows significant benefits of customized IO routing to data center tenants: for example, a factor of 10 for tail IO latency, more than 60\% better throughput for a customized replication protocol, a factor of 2 in throughput for customized caching, and enabling live performance debugging in a running system.", acknowledgement = ack-nhfb, articleno = "2", fjournal = "ACM Transactions on Storage", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J960", } @Article{Steindorfer:2017:TSP, author = "Michael J. Steindorfer and Jurgen J. Vinju", title = "Towards a software product line of trie-based collections", journal = j-SIGPLAN, volume = "52", number = "3", pages = "168--172", month = mar, year = "2017", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/3093335.2993251", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat Sep 16 10:18:15 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Collection data structures in standard libraries of programming languages are designed to excel for the average case by carefully balancing memory footprint and runtime performance. These implicit design decisions and hard-coded trade-offs do constrain users from using an optimal variant for a given problem. Although a wide range of specialized collections is available for the Java Virtual Machine (JVM), they introduce yet another dependency and complicate user adoption by requiring specific Application Program Interfaces (APIs) incompatible with the standard library. A product line for collection data structures would relieve library designers from optimizing for the general case. Furthermore, a product line allows evolving the potentially large code base of a collection family efficiently. The challenge is to find a small core framework for collection data structures which covers all variations without exhaustively listing them, while supporting good performance at the same time. We claim that the concept of Array Mapped Tries (AMTs) embodies a high degree of commonality in the sub-domain of immutable collection data structures. AMTs are flexible enough to cover most of the variability, while minimizing code bloat in the generator and the generated code. We implemented a Data Structure Code Generator (DSCG) that emits immutable collections based on an AMT skeleton foundation. The generated data structures outperform competitive hand-optimized implementations, and the generator still allows for customization towards specific workloads.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "GPCE '16 conference proceedings.", } @Article{Suneja:2017:SIL, author = "Sahil Suneja and Ricardo Koller and Canturk Isci and Eyal de Lara and Ali Hashemi and Arnamoy Bhattacharyya and Cristiana Amza", title = "Safe Inspection of Live Virtual Machines", journal = j-SIGPLAN, volume = "52", number = "7", pages = "97--111", month = jul, year = "2017", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/3140607.3050766", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat Sep 16 10:18:17 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "With DevOps automation and an everything-as-code approach to lifecycle management for cloud-native applications, challenges emerge from an operational visibility and control perspective. Once a VM is deployed in production it typically becomes a hands-off entity in terms of restrictions towards inspecting or tuning it, for the fear of negatively impacting its operation. We present CIVIC (Cloning and Injection based VM Inspection for Cloud), a new mechanism that enables safe inspection of unmodified production VMs on-the-fly. CIVIC restricts all impact and side-effects of inspection or analysis operations inside a live clone of the production VM. New functionality over the replicated VM state is introduced using code injection. In this paper, we describe the design and implementation of our solution over KVM/QEMU. We demonstrate four of its use-cases-(i) safe reuse of system monitoring agents, (ii) impact-heavy problem diagnostics and troubleshooting, (iii) attaching an intrusive anomaly detector to a live service, and (iv) live tuning of a webserver's configuration parameters. Our evaluation shows CIVIC is nimble and lightweight in terms of memory footprint as well as clone activation time (6.5s), and has a low impact on the original VM ({$<$} 10\%).", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "VEE '17 conference proceedings.", } @Article{Taheri:2017:VBB, author = "Javid Taheri and Albert Y. Zomaya and Andreas Kassler", title = "{vmBBProfiler}: a black-box profiling approach to quantify sensitivity of virtual machines to shared cloud resources", journal = j-COMPUTING, volume = "99", number = "12", pages = "1149--1177", month = dec, year = "2017", CODEN = "CMPTA2", DOI = "https://doi.org/10.1007/s00607-017-0552-y", ISSN = "0010-485X (print), 1436-5057 (electronic)", ISSN-L = "0010-485X", bibdate = "Fri Feb 9 14:54:11 MST 2018", bibsource = "http://link.springer.com/journal/607/99/12; https://www.math.utah.edu/pub/tex/bib/computing.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer.com/content/pdf/10.1007/s00607-017-0552-y.pdf", acknowledgement = ack-nhfb, fjournal = "Computing", journal-URL = "http://link.springer.com/journal/607", } @Article{Tan:2017:EPP, author = "Tian Tan and Yue Li and Jingling Xue", title = "Efficient and precise points-to analysis: modeling the heap by merging equivalent automata", journal = j-SIGPLAN, volume = "52", number = "6", pages = "278--291", month = jun, year = "2017", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/3140587.3062360", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat Sep 16 10:18:17 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Mainstream points-to analysis techniques for object-oriented languages rely predominantly on the allocation-site abstraction to model heap objects. We present MAHJONG, a novel heap abstraction that is specifically developed to address the needs of an important class of type-dependent clients, such as call graph construction, devirtualization and may-fail casting. By merging equivalent automata representing type-consistent objects that are created by the allocation-site abstraction, MAHJONG enables an allocation-site-based points-to analysis to run significantly faster while achieving nearly the same precision for type-dependent clients. MAHJONG is simple conceptually, efficient, and drops easily on any allocation-site-based points-to analysis. We demonstrate its effectiveness by discussing some insights on why it is a better alternative of the allocation-site abstraction for type-dependent clients and evaluating it extensively on 12 large real-world Java programs with five context-sensitive points-to analyses and three widely used type-dependent clients. MAHJONG is expected to provide significant benefits for many program analyses where call graphs are required.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "PLDI '17 conference proceedings.", } @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 = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.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{Tighe:2017:TAA, author = "Michael Tighe and Michael Bauer", title = "Topology and Application Aware Dynamic {VM} Management in the Cloud", journal = j-J-GRID-COMP, volume = "15", number = "2", pages = "273--294", month = jun, year = "2017", CODEN = "????", DOI = "https://doi.org/10.1007/s10723-017-9397-z", ISSN = "1570-7873 (print), 1572-9184 (electronic)", ISSN-L = "1570-7873", bibdate = "Mon Oct 2 10:16:50 MDT 2017", bibsource = "http://link.springer.com/journal/10723/15/2; https://www.math.utah.edu/pub/tex/bib/jgridcomp.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://link.springer.com/article/10.1007/s10723-017-9397-z; https://link.springer.com/content/pdf/10.1007/s10723-017-9397-z.pdf", acknowledgement = ack-nhfb, fjournal = "Journal of Grid Computing", journal-URL = "http://link.springer.com/journal/10723", } @Article{Trinder:2017:SRI, author = "Phil Trinder and Natalia Chechina and Nikolaos Papaspyrou and Konstantinos Sagonas and Simon Thompson and Stephen Adams and Stavros Aronis and Robert Baker and Eva Bihari and Olivier Boudeville and Francesco Cesarini and Maurizio {Di Stefano} and Sverker Eriksson and Vikt{\'o}ria F{\"o}rd{\H{o}}s and Amir Ghaffari and Aggelos Giantsios and Rickard Green and Csaba Hoch and David Klaftenegger and Huiqing Li and Kenneth Lundin and Kenneth Mackenzie and Katerina Roukounaki and Yiannis Tsiouris and Kjell Winblad", title = "Scaling Reliably: Improving the Scalability of the {Erlang} Distributed Actor Platform", journal = j-TOPLAS, volume = "39", number = "4", pages = "17:1--17:??", month = sep, year = "2017", CODEN = "ATPSDT", DOI = "https://doi.org/10.1145/3107937", ISSN = "0164-0925 (print), 1558-4593 (electronic)", ISSN-L = "0164-0925", bibdate = "Tue Sep 19 06:38:32 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/hash.bib; https://www.math.utah.edu/pub/tex/bib/toplas.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Distributed actor languages are an effective means of constructing scalable reliable systems, and the Erlang programming language has a well-established and influential model. While the Erlang model conceptually provides reliable scalability, it has some inherent scalability limits and these force developers to depart from the model at scale. This article establishes the scalability limits of Erlang systems and reports the work of the EU RELEASE project to improve the scalability and understandability of the Erlang reliable distributed actor model. We systematically study the scalability limits of Erlang and then address the issues at the virtual machine, language, and tool levels. More specifically: (1) We have evolved the Erlang virtual machine so that it can work effectively in large-scale single-host multicore and NUMA architectures. We have made important changes and architectural improvements to the widely used Erlang/OTP release. (2) We have designed and implemented Scalable Distributed (SD) Erlang libraries to address language-level scalability issues and provided and validated a set of semantics for the new language constructs. (3) To make large Erlang systems easier to deploy, monitor, and debug, we have developed and made open source releases of five complementary tools, some specific to SD Erlang. Throughout the article we use two case studies to investigate the capabilities of our new technologies and tools: a distributed hash table based Orbit calculation and Ant Colony Optimisation (ACO). Chaos Monkey experiments show that two versions of ACO survive random process failure and hence that SD Erlang preserves the Erlang reliability model. While we report measurements on a range of NUMA and cluster architectures, the key scalability experiments are conducted on the Athos cluster with 256 hosts (6,144 cores). Even for programs with no global recovery data to maintain, SD Erlang partitions the network to reduce network traffic and hence improves performance of the Orbit and ACO benchmarks above 80 hosts. ACO measurements show that maintaining global recovery data dramatically limits scalability; however, scalability is recovered by partitioning the recovery data. We exceed the established scalability limits of distributed Erlang, and do not reach the limits of SD Erlang for these benchmarks at this scale (256 hosts, 6,144 cores).", acknowledgement = ack-nhfb, articleno = "17", fjournal = "ACM Transactions on Programming Languages and Systems", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J783", } @Article{Tsai:2017:JSD, author = "Po-An Tsai and Nathan Beckmann and Daniel Sanchez", title = "{Jenga}: Software-Defined Cache Hierarchies", journal = j-COMP-ARCH-NEWS, volume = "45", number = "2", pages = "652--665", month = may, year = "2017", CODEN = "CANED2", DOI = "https://doi.org/10.1145/3140659.3080214", ISSN = "0163-5964 (print), 1943-5851 (electronic)", ISSN-L = "0163-5964", bibdate = "Fri Sep 15 11:09:14 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigarch.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Caches are traditionally organized as a rigid hierarchy, with multiple levels of progressively larger and slower memories. Hierarchy allows a simple, fixed design to benefit a wide range of applications, since working sets settle at the smallest (i.e., fastest and most energy-efficient) level they fit in. However, rigid hierarchies also add overheads, because each level adds latency and energy even when it does not fit the working set. These overheads are expensive on emerging systems with heterogeneous memories, where the differences in latency and energy across levels are small. Significant gains are possible by specializing the hierarchy to applications. We propose Jenga, a reconfigurable cache hierarchy that dynamically and transparently specializes itself to applications. Jenga builds virtual cache hierarchies out of heterogeneous, distributed cache banks using simple hardware mechanisms and an OS runtime. In contrast to prior techniques that trade energy and bandwidth for performance (e.g., dynamic bypassing or prefetching), Jenga eliminates accesses to unwanted cache levels. Jenga thus improves both performance and energy efficiency. On a 36-core chip with a 1 GB DRAM cache, Jenga improves energy-delay product over a combination of state-of-the-art techniques by 23\% on average and by up to 85\%.", acknowledgement = ack-nhfb, fjournal = "ACM SIGARCH Computer Architecture News", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89", } @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 = "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{Vissicchio:2017:SUH, author = "Stefano Vissicchio and Laurent Vanbever and Luca Cittadini and Geoffrey G. Xie and Olivier Bonaventure", title = "Safe Update of Hybrid {SDN} Networks", journal = j-IEEE-TRANS-NETWORKING, volume = "25", number = "3", pages = "1649--1662", month = jun, year = "2017", CODEN = "IEANEP", DOI = "https://doi.org/10.1109/TNET.2016.2642586", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Tue Oct 3 16:29:32 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "The support for safe network updates, i.e., live modification of device behavior without service disruption, is a critical primitive for current and future networks. Several techniques have been proposed by previous works to implement such a primitive. Unfortunately, existing techniques are not generally applicable to any network architecture, and typically require high overhead e.g., additional memory to guarantee strong consistency i.e., traversal of either initial or final paths, but never a mix of them during the update. In this paper, we deeply study the problem of computing operational sequences to safely and quickly update arbitrary networks. We characterize cases, for which this computation is easy, and revisit previous algorithmic contributions in the new light of our theoretical findings. We also propose and thoroughly evaluate a generic sequence-computation approach, based on two new algorithms that we combine to overcome limitations of prior proposals. Our approach always finds an operational sequence that provably guarantees strong consistency throughout the update, with very limited overhead. Moreover, it can be applied to update networks running any combination of centralized and distributed control-planes, including different families of IGPs, OpenFlow or other SDN protocols, and hybrid SDN networks. Our approach therefore supports a large set of use cases, ranging from traffic engineering in IGP-only or SDN-only networks to incremental SDN roll-out and advanced requirements e.g., per-flow path selection or dynamic network function virtualization in partial SDN deployments.", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771", } @Article{Wade:2017:AVJ, author = "April W. Wade and Prasad A. Kulkarni and Michael R. Jantz", title = "{AOT} vs. {JIT}: impact of profile data on code quality", journal = j-SIGPLAN, volume = "52", number = "4", pages = "1--10", month = may, year = "2017", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/3140582.3081037", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat Sep 16 10:18:15 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Just-in-time (JIT) compilation during program execution and ahead-of-time (AOT) compilation during software installation are alternate techniques used by managed language virtual machines (VM) to generate optimized native code while simultaneously achieving binary code portability and high execution performance. Profile data collected by JIT compilers at run-time can enable profile-guided optimizations (PGO) to customize the generated native code to different program inputs. AOT compilation removes the speed and energy overhead of online profile collection and dynamic compilation, but may not be able to achieve the quality and performance of customized native code. The goal of this work is to investigate and quantify the implications of the AOT compilation model on the quality of the generated native code for current VMs. First, we quantify the quality of native code generated by the two compilation models for a state-of-the-art (HotSpot) Java VM. Second, we determine how the amount of profile data collected affects the quality of generated code. Third, we develop a mechanism to determine the accuracy or similarity for different profile data for a given program run, and investigate how the accuracy of profile data affects its ability to effectively guide PGOs. Finally, we categorize the profile data types in our VM and explore the contribution of each such category to performance.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "LCTES '17 conference proceedings.", } @Article{Wang:2017:DCT, author = "Xiumin Wang and Xiaoming Chen and Chau Yuen and Weiwei Wu and Meng Zhang and Cheng Zhan", title = "Delay-cost tradeoff for virtual machine migration in cloud data centers", journal = j-J-NETW-COMPUT-APPL, volume = "78", number = "??", pages = "62--72", day = "15", month = jan, year = "2017", CODEN = "JNCAF3", ISSN = "1084-8045 (print), 1095-8592 (electronic)", ISSN-L = "1084-8045", bibdate = "Fri Mar 31 07:48:43 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1084804516302739", acknowledgement = ack-nhfb, fjournal = "Journal of Network and Computer Applications", journal-URL = "http://www.sciencedirect.com/science/journal/10848045", } @Article{Wang:2017:JRJ, author = "Kaiyuan Wang and Sarfraz Khurshid and Milos Gligoric", title = "{JPR}: Replaying {JPF} Traces Using Standard {JVM}", journal = j-SIGSOFT, volume = "42", number = "4", pages = "1--5", month = oct, year = "2017", CODEN = "SFENDP", DOI = "https://doi.org/10.1145/3149485.3149494", ISSN = "0163-5948 (print), 1943-5843 (electronic)", ISSN-L = "0163-5948", bibdate = "Wed Aug 1 17:16:48 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2010.bib; https://www.math.utah.edu/pub/tex/bib/multithreading.bib; https://www.math.utah.edu/pub/tex/bib/sigsoft2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Java PathFinder (JPF) is a backtrackable Java Virtual Machine (JVM), which is implemented in Java and runs on a standard JVM (e.g., Oracle HotSpot). Thus, a JPF developer can use off-the-shelf Java debuggers (e.g., jdb) when debugging code that makes up JPF. JPF explores all non-deterministic executions of a given target program and monitors for property violations. To facilitate debugging of the target program, JPF can capture and replay the execution trace that leads to a property violation. While the deterministic replay is invaluable, the replay with JPF does not allow the developer to attach an off-the-shelf Java debugger to the target program (e.g., step through the application code, set breakpoints, etc.). We present a technique, dubbed JPR, to improve the debugging experience of the JPF captured traces by migrating the JPF traces to a new format that can be executed using the standard JVM. JPR annotates each JPF trace, during the capture phase, with extra data (e.g., instruction index, instruction count, etc.); the annotated trace is then used to instrument Java bytecode to enforce the same execution trace on a standard JVM. JPR is compatible with various optimizations, e.g., state matching and partial-order reduction. We evaluated JPR on all multithreaded Java programs in the official JPF distribution. Our results show that JPR successfully replayed all JPF traces on the standard JVM with reasonable overhead during both recording and replaying.", acknowledgement = ack-nhfb, fjournal = "ACM SIGSOFT Software Engineering Notes", journal-URL = "https://dl.acm.org/citation.cfm?id=J728", } @Article{Wang:2017:RES, author = "Tao Wang and Jiwei Xu and Wenbo Zhang and Jianhua Zhang and Jun Wei and Hua Zhong", title = "{ReSeer}: Efficient search-based replay for multiprocessor virtual machines", journal = j-J-SYST-SOFTW, volume = "126", number = "??", pages = "101--112", month = apr, year = "2017", CODEN = "JSSODM", ISSN = "0164-1212 (print), 1873-1228 (electronic)", ISSN-L = "0164-1212", bibdate = "Fri Feb 10 10:22:09 MST 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0164121216301248", acknowledgement = ack-nhfb, fjournal = "Journal of Systems and Software", journal-URL = "http://www.sciencedirect.com/science/journal/01641212/", } @Article{Wang:2017:RLW, author = "Zhe Wang and Chenggang Wu and Jianjun Li and Yuanming Lai and Xiangyu Zhang and Wei-Chung Hsu and Yueqiang Cheng", title = "{ReRanz}: a Light-Weight Virtual Machine to Mitigate Memory Disclosure Attacks", journal = j-SIGPLAN, volume = "52", number = "7", pages = "143--156", month = jul, year = "2017", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/3140607.3050752", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat Sep 16 10:18:17 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Recent code reuse attacks are able to circumvent various address space layout randomization (ASLR) techniques by exploiting memory disclosure vulnerabilities. To mitigate sophisticated code reuse attacks, we proposed a light-weight virtual machine, ReRanz, which deployed a novel continuous binary code re-randomization to mitigate memory disclosure oriented attacks. In order to meet security and performance goals, costly code randomization operations were outsourced to a separate process, called the ``shuffling process''. The shuffling process continuously flushed the old code and replaced it with a fine-grained randomized code variant. ReRanz repeated the process each time an adversary might obtain the information and upload a payload. Our performance evaluation shows that ReRanz Virtual Machine incurs a very low performance overhead. The security evaluation shows that ReRanz successfully protect the Nginx web server against the Blind-ROP attack.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "VEE '17 conference proceedings.", } @Article{Wang:2017:SMC, author = "Yang Wang and Bharadwaj Veeravalli and Chen-Khong Tham and Shuibing He and Chengzhong Xu", title = "On Service Migrations in the Cloud for Mobile Accesses: a Distributed Approach", journal = j-TAAS, volume = "12", number = "2", pages = "6:1--6:??", month = may, year = "2017", CODEN = "????", DOI = "https://doi.org/10.1145/3050438", ISSN = "1556-4665 (print), 1556-4703 (electronic)", ISSN-L = "1556-4665", bibdate = "Mon Jul 24 18:16:40 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/taas.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "We study the problem of dynamically migrating a service in the cloud to satisfy an online sequence of mobile batch-request demands in a cost-effective way. The service may have single or multiple replicas, each running on a virtual machine. As the origin of mobile accesses frequently changes over time, this problem is particularly important for time-bounded services to achieve enhanced Quality of Service and cost effectiveness. Moving the service closer to the client locations not only reduces the service access latency but also minimizes the network costs for service providers. However, these benefits are not free. The migration comes at a cost of bulk-data transfer and service disruption, and hence, increasing the overall service costs. To gain the benefits of service migration while minimizing the caused monetary costs, we propose an efficient search-based algorithm Dmig to migrate a single server, and then extend it as a scalable algorithm, called mDmig, to the multi-server situation, a more general case in the cloud. Both algorithms are fully distributed, symmetric, and characterized by the effective use of historical access information to conduct virtual migration so that the limitations of local search in the cost reduction can be overcome. To evaluate the algorithms, we compared them with some existing algorithms and an off-line algorithm. Our simulation results showed that the proposed algorithms exhibit better performance in service migration by adapting to the changes of mobile access patterns in a cost-effective way.", acknowledgement = ack-nhfb, articleno = "6", fjournal = "ACM Transactions on Autonomous and Adaptive Systems (TAAS)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1010", } @Article{Wang:2017:UBI, author = "Cheng Wang and Bhuvan Urgaonkar and Neda Nasiriani and George Kesidis", title = "Using Burstable Instances in the Public Cloud: Why, When and How?", journal = j-POMACS, volume = "1", number = "1", pages = "11:1--11:??", month = jun, year = "2017", CODEN = "????", DOI = "https://doi.org/10.1145/3084448", ISSN = "2476-1249", ISSN-L = "2476-1249", bibdate = "Fri Jun 16 09:11:52 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/pomacs.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://dl.acm.org/citation.cfm?id=3084448", abstract = "Amazon EC2 and Google Compute Engine (GCE) have recently introduced a new class of virtual machines called 'burstable' instances that are cheaper than even the smallest traditional/regular instances. These lower prices come with reduced average capacity and increased variance. Using measurements from both EC2 and GCE, we identify key idiosyncrasies of resource capacity dynamism for burstable instances that set them apart from other instance types. Most importantly, certain resources for these instances appear to be regulated by deterministic token bucket like mechanisms. We find widely different types of disclosures by providers of the parameters governing these regulation mechanisms: full disclosure (e.g., CPU capacity for EC2 t2 instances), partial disclosure (e.g., CPU capacity and remote disk IO bandwidth for GCE shared-core instances), or no disclosure (network bandwidth for EC2 t2 instances). A tenant modeling these variations as random phenomena (as some recent work suggests) might make sub-optimal procurement and operation decisions. We present modeling techniques for a tenant to infer the properties of these regulation mechanisms via simple offline measurements. We also present two case studies of how certain memcached workloads might benefit from our modeling when operating on EC2 by: (i) augmenting cheap but low availability in-memory storage offered by spot instances with backup of popular content on burstable instances, and (ii) temporal multiplexing of multiple burstable instances to achieve the CPU or network bandwidth (and thereby throughput) equivalent of a more expensive regular EC2 instance.", acknowledgement = ack-nhfb, articleno = "11", fjournal = "Proceedings of the ACM on Measurement and Analysis of Computing Systems (POMACS)", journal-URL = "http://dl.acm.org/pub.cfm?id=J1567", } @Article{Wei:2017:DCS, author = "Xiaohan Wei and Michael J. Neely", title = "Data Center Server Provision: Distributed Asynchronous Control for Coupled Renewal Systems", journal = j-IEEE-TRANS-NETWORKING, volume = "25", number = "4", pages = "2180--2194", month = aug, year = "2017", CODEN = "IEANEP", DOI = "https://doi.org/10.1109/TNET.2017.2693407", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Tue Oct 3 16:29:33 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "This paper considers a cost minimization problem for data centers with $N$ servers and randomly arriving service requests. A central router decides which server to use for each new request. Each server has three types of states active, idle, and setup with different costs and time durations. The servers operate asynchronously over their own states and can choose one of multiple sleep modes when idle. We develop an online distributed control algorithm so that each server makes its own decisions. The request queues are bounded and the overall time average cost is near optimal with probability 1. First the algorithm does not need probability information for the arrival rate or job sizes. Finally, an improved algorithm that uses a single queue is developed via a ``virtualization'' technique, which is shown to provide the same near optimal costs. Simulation experiments on a real data center traffic trace demonstrate the efficiency of our algorithm compared with other existing algorithms.", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771", } @Article{Wu:2017:ACM, author = "Jiang Wu and Zhou Lei and Shengbo Chen and Wenfeng Shen", title = "An Access Control Model for Preventing Virtual Machine Escape Attack", journal = j-FUTURE-INTERNET, volume = "9", number = "2", pages = "20", day = "02", month = jun, year = "2017", CODEN = "????", DOI = "https://doi.org/10.3390/fi9020020", ISSN = "1999-5903", ISSN-L = "1999-5903", bibdate = "Thu Nov 21 16:50:57 MST 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/future-internet.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.mdpi.com/1999-5903/9/2/20", abstract = "With the rapid development of Internet, the traditional computing environment is making a big migration to the cloud-computing environment. However, cloud computing introduces a set of new security problems. Aiming at the virtual machine (VM) escape attack, we study the traditional attack model and attack scenarios in the cloud-computing environment. In addition, we propose an access control model that can prevent virtual machine escape (PVME) by adapting the BLP (Bell-La Padula) model (an access control model developed by D. Bell and J. LaPadula). Finally, the PVME model has been implemented on full virtualization architecture. The experimental results show that the PVME module can effectively prevent virtual machine escape while only incurring 4\% to 8\% time overhead.", acknowledgement = ack-nhfb, journal-URL = "https://www.mdpi.com/journal/futureinternet", } @Article{Wu:2017:AOA, author = "Song Wu and Yihong Wang and Wei Luo and Sheng Di and Haibao Chen and Xiaolin Xu and Ran Zheng and Hai Jin", title = "{ACStor}: Optimizing Access Performance of Virtual Disk Images in Clouds", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "28", number = "9", pages = "2414--2427", month = sep, year = "2017", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2017.2675988", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Thu Aug 17 10:20:52 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.computer.org/csdl/trans/td/2017/09/07866840-abs.html", acknowledgement = ack-nhfb, journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=71", } @Article{Wu:2017:VPP, author = "Song Wu and Yongchang Li and Xinhou Wang and Hai Jin and Hanhua Chen", title = "{Vshadow}: Promoting Physical Servers into Virtualization World", journal = j-INT-J-PARALLEL-PROG, volume = "45", number = "1", pages = "45--66", month = feb, year = "2017", CODEN = "IJPPE5", DOI = "https://doi.org/10.1007/s10766-015-0385-2", ISSN = "0885-7458 (print), 1573-7640 (electronic)", ISSN-L = "0885-7458", bibdate = "Mon Mar 13 15:25:22 MDT 2017", bibsource = "http://link.springer.com/journal/10766/45/1; https://www.math.utah.edu/pub/tex/bib/intjparallelprogram.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer.com/article/10.1007/s10766-015-0385-2", acknowledgement = ack-nhfb, fjournal = "International Journal of Parallel Programming", journal-URL = "http://link.springer.com/journal/10766", } @Article{Wurthinger:2017:PPE, author = "Thomas W{\"u}rthinger and Christian Wimmer and Christian Humer and Andreas W{\"o}{\ss} and Lukas Stadler and Chris Seaton and Gilles Duboscq and Doug Simon and Matthias Grimmer", title = "Practical partial evaluation for high-performance dynamic language runtimes", journal = j-SIGPLAN, volume = "52", number = "6", pages = "662--676", month = jun, year = "2017", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/3140587.3062381", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat Sep 16 10:18:17 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Most high-performance dynamic language virtual machines duplicate language semantics in the interpreter, compiler, and runtime system. This violates the principle to not repeat yourself. In contrast, we define languages solely by writing an interpreter. The interpreter performs specializations, e.g., augments the interpreted program with type information and profiling information. Compiled code is derived automatically using partial evaluation while incorporating these specializations. This makes partial evaluation practical in the context of dynamic languages: It reduces the size of the compiled code while still compiling all parts of an operation that are relevant for a particular program. When a speculation fails, execution transfers back to the interpreter, the program re-specializes in the interpreter, and later partial evaluation again transforms the new state of the interpreter to compiled code. We evaluate our approach by comparing our implementations of JavaScript, Ruby, and R with best-in-class specialized production implementations. Our general-purpose compilation system is competitive with production systems even when they have been heavily optimized for the one language they support. For our set of benchmarks, our speedup relative to the V8 JavaScript VM is 0.83x, relative to JRuby is 3.8x, and relative to GNU R is 5x.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "PLDI '17 conference proceedings.", } @Article{Xu:2017:BBD, author = "Quanqing Xu and Chao Jin and Mohamed Faruq Bin Mohamed Rasid and Bharadwaj Veeravalli and Khin Mi Mi Aung", title = "Blockchain-based decentralized content trust for {Docker} images", journal = j-MULTIMEDIA-TOOLS-APPLIC, volume = "??", number = "??", month = oct, year = "2017", CODEN = "MTAPFB", DOI = "https://doi.org/10.1007/s11042-017-5224-6", ISSN = "1380-7501 (print), 1573-7721 (electronic)", ISSN-L = "1380-7501", bibdate = "Wed Jan 24 09:11:52 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer.com/article/10.1007/s11042-017-5224-6", acknowledgement = ack-nhfb, fjournal = "Multimedia Tools and Applications", journal-URL = "https://link.springer.com/journal/11042", } @Article{Xu:2017:EIR, author = "Jiwei Xu and Tao Wang and Xiaozhao Xing and Wenbo Zhang and Hua Zhong", title = "Efficient image restoration of virtual machines with reference count based rewriting and caching", journal = j-FUT-GEN-COMP-SYS, volume = "77", number = "??", pages = "87--96", month = dec, year = "2017", CODEN = "FGSEVI", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Sat Sep 23 09:33:17 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X17301218", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @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 = "https://www.math.utah.edu/pub/tex/bib/opersysrev.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.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{Xu:2017:OCV, author = "Cong Xu and Jiahai Yang and Kevin Yin and Hui Yu", title = "Optimal construction of virtual networks for {Cloud}-based {MapReduce} workflows", journal = j-COMP-NET-AMSTERDAM, volume = "112", number = "??", pages = "194--207", day = "15", month = jan, year = "2017", CODEN = "????", ISSN = "1389-1286 (print), 1872-7069 (electronic)", ISSN-L = "1389-1286", bibdate = "Fri Mar 10 12:06:17 MST 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S138912861630367X", acknowledgement = ack-nhfb, fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)", journal-URL = "http://www.sciencedirect.com/science/journal/13891286/", } @Article{Xu:2017:SLB, author = "Minxian Xu and Wenhong Tian and Rajkumar Buyya", title = "A survey on load balancing algorithms for virtual machines placement in cloud computing", journal = j-CCPE, volume = "29", number = "12", pages = "", day = "25", month = jun, year = "2017", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.4123", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Mon Jul 24 08:22:37 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", } @Article{Yan:2017:CAE, author = "Fangfang Yan and Tony T. Lee and Weisheng Hu", title = "Congestion-Aware Embedding of Heterogeneous Bandwidth Virtual Data Centers With Hose Model Abstraction", journal = j-IEEE-TRANS-NETWORKING, volume = "25", number = "2", pages = "806--819", month = apr, year = "2017", CODEN = "IEANEP", DOI = "https://doi.org/10.1109/TNET.2016.2606480", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Mon Jun 5 18:46:21 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Predictable network performance is critical for cloud applications and can be achieved by providing tenants a dedicated virtual data center VDC with bandwidth guarantee. Recently, the extended Hose model was applied to the VDC abstraction to characterize the tradeoff between cost and network performance. The acceptability determination problem of a VDC with heterogeneous bandwidth demand was proved to be NP-complete, even in the simple tree topology. In this paper, we investigate the embedding problem for heterogeneous bandwidth VDC in substrate networks of general topology. The embedding problem involves two coupled sub-problems: virtual machine VM placement and multipath route assignment. First, we formulate the route assignment problem with linear programming to minimize the maximum link utilization, and provide $K$ -widest path load-balanced routing with controllable splitting paths. Next, we propose a polynomial-time heuristic algorithm, referred to as the perturbation algorithm, for the VM placement. The perturbation algorithm is congestion-aware as it detects the bandwidth bottlenecks in the placement process and then selectively relocates some assigned VMs to eliminate congestion. Simulation results show that our algorithm performs better in comparison with the existing well-known algorithms: first-fit, next-fit, and greedy, and very close to the exponential-time complexity backtracking algorithm in typical data center network architectures. For the tree substrate network, the perturbation algorithm performs better than the allocation-range algorithm. For the homogeneous bandwidth VDC requests, the perturbation algorithm produces a higher success rate than the recently proposed HVC-ACE algorithm. Therefore, it provides a compromised solution between time complexity and network performance.", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771", } @Article{Yan:2017: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-COMP-ARCH-NEWS, volume = "45", number = "2", pages = "430--443", month = may, year = "2017", CODEN = "CANED2", DOI = "https://doi.org/10.1145/3140659.3080211", ISSN = "0163-5964 (print), 1943-5851 (electronic)", ISSN-L = "0163-5964", bibdate = "Fri Sep 15 11:09:14 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigarch.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 = "ACM SIGARCH Computer Architecture News", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89", } @Article{Yang:2017:EEV, author = "Ting Yang and Haibo Pen and Wei Li and Albert Y. Zomaya", title = "An energy-efficient virtual machine placement and route scheduling scheme in data center networks", journal = j-FUT-GEN-COMP-SYS, volume = "77", number = "??", pages = "1--11", month = dec, year = "2017", CODEN = "FGSEVI", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Sat Sep 23 09:33:17 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X17310579", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Yang:2017:EJV, author = "Byung-Sun Yang and Jae-Yun Kim and Soo-Mook Moon", title = "Exceptionization: a {Java} {VM} Optimization for Non-{Java} Languages", journal = j-TACO, volume = "14", number = "1", pages = "5:1--5:??", month = apr, year = "2017", CODEN = "????", DOI = "https://doi.org/10.1145/3046681", ISSN = "1544-3566 (print), 1544-3973 (electronic)", ISSN-L = "1544-3566", bibdate = "Mon Jul 24 18:00:58 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2010.bib; https://www.math.utah.edu/pub/tex/bib/taco.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Java virtual machine (JVM) has recently evolved into a general-purpose language runtime environment to execute popular programming languages such as JavaScript, Ruby, Python, and Scala. These languages have complex non-Java features, including dynamic typing and first-class function, so additional language runtimes (engines) are provided on top of the JVM to support them with bytecode extensions. Although there are high-performance JVMs with powerful just-in-time (JIT) compilers, running these languages efficiently on the JVM is still a challenge. This article introduces a simple and novel technique for the JVM JIT compiler called exceptionization to improve the performance of JVM-based language runtimes. We observed that the JVM executing some non-Java languages encounters at least 2 times more branch bytecodes than Java, most of which are highly biased to take only one target. Exceptionization treats such a highly biased branch as some implicit exception-throwing instruction. This allows the JVM JIT compiler to prune the infrequent target of the branch from the frequent control flow, thus compiling the frequent control flow more aggressively with better optimization. If a pruned path were taken, then it would run like a Java exception handler, that is, a catch block. We also devised de-exceptionization, a mechanism to cope with the case when a pruned path is executed more often than expected. Since exceptionization is a generic JVM optimization, independent of any specific language runtime, it would be generally applicable to other language runtimes on the JVM. Our experimental result shows that exceptionization accelerates the performance of several non-Java languages. For example, JavaScript-on-JVM runs faster by as much as 60\% and by 6\% on average, when experimented with the Octane benchmark suite on Oracle's latest Nashorn JavaScript engine and HotSpot 1.9 JVM. Furthermore, the performance of Ruby-on-JVM shows an improvement by as much as 60\% and by 6\% on average, while Python-on-JVM improves by as much as 6\% and by 2\% on average. We found that exceptionization is more effective to apply to the branch bytecode of the language runtime itself than the bytecode corresponding to the application code or the bytecode of the Java class libraries. This implies that the performance benefit of exceptionization comes from better JIT compilation of the language runtime of non-Java languages.", acknowledgement = ack-nhfb, articleno = "5", fjournal = "ACM Transactions on Architecture and Code Optimization (TACO)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J924", } @Article{Yang:2017:RVM, author = "Song Yang and Philipp Wieder and Ramin Yahyapour and Stojan Trajanovski and Xiaoming Fu", title = "Reliable Virtual Machine Placement and Routing in Clouds", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "28", number = "10", pages = "2965--2978", month = oct, year = "2017", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2017.2693273", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Thu Oct 12 06:58:12 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.computer.org/csdl/trans/td/2017/10/07896612-abs.html", acknowledgement = ack-nhfb, journal-URL = "http://www.computer.org/tpds/archives.htm", } @Article{Yang:2017:VMM, author = "Chao-Tung Yang and Jung-Chun Liu and Shuo-Tsung Chen and Kuan-Lung Huang", title = "Virtual machine management system based on the power saving algorithm in cloud", journal = j-J-NETW-COMPUT-APPL, volume = "80", number = "??", pages = "165--180", day = "15", month = feb, year = "2017", CODEN = "JNCAF3", ISSN = "1084-8045 (print), 1095-8592 (electronic)", ISSN-L = "1084-8045", bibdate = "Fri Mar 31 07:48:44 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1084804516302971", acknowledgement = ack-nhfb, fjournal = "Journal of Network and Computer Applications", journal-URL = "http://www.sciencedirect.com/science/journal/10848045", } @Article{Yeh:2017:PFG, author = "Tsung Tai Yeh and Amit Sabne and Putt Sakdhnagool and Rudolf Eigenmann and Timothy G. Rogers", title = "{Pagoda}: Fine-Grained {GPU} Resource Virtualization for Narrow Tasks", journal = j-SIGPLAN, volume = "52", number = "8", pages = "221--234", month = aug, year = "2017", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/3155284.3018754", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Dec 1 18:56:12 MST 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/multithreading.bib; https://www.math.utah.edu/pub/tex/bib/pvm.bib; https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Massively multithreaded GPUs achieve high throughput by running thousands of threads in parallel. To fully utilize the hardware, workloads spawn work to the GPU in bulk by launching large tasks, where each task is a kernel that contains thousands of threads that occupy the entire GPU. GPUs face severe underutilization and their performance benefits vanish if the tasks are narrow, i.e., they contain {$<$} 500 threads. Latency-sensitive applications in network, signal, and image processing that generate a large number of tasks with relatively small inputs are examples of such limited parallelism. This paper presents Pagoda, a runtime system that virtualizes GPU resources, using an OS-like daemon kernel called MasterKernel. Tasks are spawned from the CPU onto Pagoda as they become available, and are scheduled by the MasterKernel at the warp granularity. Experimental results demonstrate that Pagoda achieves a geometric mean speedup of 5.70x over PThreads running on a 20-core CPU, 1.51x over CUDA-HyperQ, and 1.69x over GeMTC, the state-of- the-art runtime GPU task scheduling system.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "PPoPP '17 conference proceedings.", } @Article{Yi:2017:CDC, author = "Xiaomeng Yi and Fangming Liu and Di Niu and Hai Jin and John C. S. Lui", title = "{Cocoa}: Dynamic Container-Based Group Buying Strategies for Cloud Computing", journal = j-TOMPECS, volume = "2", number = "2", pages = "8:1--8:31", month = may, year = "2017", CODEN = "????", DOI = "https://doi.org/10.1145/3022876", ISSN = "2376-3639 (print), 2376-3647 (electronic)", ISSN-L = "2376-3639", bibdate = "Thu Jun 15 12:19:56 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/tompecs.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://dl.acm.org/citation.cfm?id=3022876", abstract = "Although the Infrastructure-as-a-Service (IaaS) cloud offers diverse instance types to users, a significant portion of cloud users, especially those with small and short demands, cannot find an instance type that exactly fits their needs or fully utilize purchased instance-hours. In the meantime, cloud service providers are also faced with the challenge to consolidate small, short jobs, which exhibit strong dynamics, to effectively improve resource utilization. To handle such inefficiencies and improve cloud resource utilization, we propose Cocoa (COmputing in COntAiners), a novel group buying mechanism that organizes jobs with complementary resource demands into groups and allocates them to group buying deals predefined by cloud providers. Each group buying deal offers a resource pool for all the jobs in the deal, which can be implemented as either a virtual machine or a physical server. By running each user job on a virtualized container, our mechanism allows flexible resource sharing among different users in the same group buying deal, while improving resource utilization for cloud providers. To organize jobs with varied resource demands and durations into groups, we model the initial static group organization as a variable-sized vector bin packing problem, and the subsequent dynamic group organization problem as an online multidimensional knapsack problem. Through extensive simulations driven by a large amount of real usage traces from a Google cluster, we evaluate the potential cost reduction achieved by Cocoa. We show that through the effective combination and interaction of the proposed static and dynamic group organization strategies, Cocoa greatly outperforms the existing cloud workload consolidation mechanism, substantiating the feasibility of group buying in cloud computing.", acknowledgement = ack-nhfb, articleno = "8", fjournal = "ACM Transactions on Modeling and Performance Evaluation of Computing Systems (TOMPECS)", journal-URL = "http://dl.acm.org/pub.cfm?id=J1525", } @Article{Youssef:2017:WGE, author = "Ahmed Youssef and Muthucumaru Maheswaran and Lamis Youssef", title = "Wireless {GINI}: an educational platform for hosting virtual wireless networks", journal = j-SPE, volume = "47", number = "1", pages = "21--59", month = jan, year = "2017", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/spe.2399", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Sat Feb 18 10:00:11 MST 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", } @Article{Yut:2017:LRL, author = "Lele Yut and Ce Zhang and Yingxia Shao and Bin Cui", title = "{LDA*}: a robust and large-scale topic modeling system", journal = j-PROC-VLDB-ENDOWMENT, volume = "10", number = "11", pages = "1406--1417", month = aug, year = "2017", CODEN = "????", ISSN = "2150-8097", bibdate = "Tue Sep 5 16:07:00 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; https://www.math.utah.edu/pub/tex/bib/vldbe.bib", abstract = "We present LDA*, a system that has been deployed in one of the largest Internet companies to fulfil their requirements of ``topic modeling as an internal service'' --- relying on thousands of machines, engineers in different sectors submit their data, some are as large as 1.8TB, to LDA* and get results back in hours. LDA* is motivated by the observation that none of the existing topic modeling systems is robust enough --- Each of these existing systems is designed for a specific point in the tradeoff space that can be sub-optimal, sometimes by up to $ 10 \times $, across workloads. Our first contribution is a systematic study of all recently proposed samplers: AliasLDA, F+LDA, LightLDA, and WarpLDA. We discovered a novel system tradeoff among these samplers. Each sampler has different sampling complexity and performs differently, sometimes by $ 5 \times $, on documents with different lengths. Based on this tradeoff, we further developed a hybrid sampler that uses different samplers for different types of documents. This hybrid approach works across a wide range of workloads and outperforms the fastest sampler by up to $ 2 \times $. We then focused on distributed environments in which thousands of workers, each with different performance (due to virtualization and resource sharing), coordinate to train a topic model. Our second contribution is an asymmetric parameter server architecture that pushes some computation to the parameter server side. This architecture is motivated by the skew of the word frequency distribution and a novel tradeoff we discovered between communication and computation. With this architecture, we outperform the traditional, symmetric architecture by up to $ 2 \times $. With these two contributions, together with a carefully engineered implementation, our system is able to outperform existing systems by up to $ 10 \times $ and has already been running to provide topic modeling services for more than six months.", acknowledgement = ack-nhfb, fjournal = "Proceedings of the VLDB Endowment", journal-URL = "http://portal.acm.org/citation.cfm?id=J1174", } @Article{Zeng:2017:NSD, author = "Lingfang Zeng and Yang Wang and Kenneth B. Kent and Ziliang Xiao", title = "{Naplus}: a software distributed shared memory for virtual clusters in the cloud", journal = j-SPE, volume = "47", number = "9", pages = "1201--1220", month = sep, year = "2017", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/spe.2486", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Mon Sep 4 17:17:42 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", } @Article{Zeng:2017:RNN, author = "Lingfang Zeng and Yang Wang and Xiaopeng Fan and Chengzhong Xu", title = "{Raccoon}: A Novel Network {I/O} Allocation Framework for Workload-Aware {VM} Scheduling in Virtual Environments", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "28", number = "9", pages = "2651--2662", month = sep, year = "2017", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2017.2685386", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Thu Aug 17 10:20:52 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.computer.org/csdl/trans/td/2017/09/07883963-abs.html", acknowledgement = ack-nhfb, journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=71", } @Article{Zhang:2017:CAV, author = "Weizhan Zhang and Yuxuan Chen and Xiang Gao and Zhichao Mo and Qinghua Zheng and Zongqing Lu", title = "Cluster-Aware Virtual Machine Collaborative Migration in Media Cloud", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "28", number = "10", pages = "2808--2822", month = oct, year = "2017", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2017.2697381", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Thu Oct 12 06:58:12 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.computer.org/csdl/trans/td/2017/10/07909001-abs.html", acknowledgement = ack-nhfb, journal-URL = "http://www.computer.org/tpds/archives.htm", } @Article{Zhang:2017:CBV, author = "Jiangtao Zhang and Xuan Wang and Hejiao Huang and Shi Chen", title = "Clustering based virtual machines placement in distributed cloud computing", journal = j-FUT-GEN-COMP-SYS, volume = "66", number = "??", pages = "1--10", month = jan, year = "2017", CODEN = "FGSEVI", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Mon Sep 19 06:08:02 MDT 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X16302035", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X/", } @Article{Zhang:2017:MAP, author = "Jinshi Zhang and Eddie Dong and Jian Li and Haibing Guan", title = "{MigVisor}: Accurate Prediction of {VM} Live Migration Behavior using a Working-Set Pattern Model", journal = j-SIGPLAN, volume = "52", number = "7", pages = "30--43", month = jul, year = "2017", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/3140607.3050753", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat Sep 16 10:18:17 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Live migration of a virtual machine (VM) is a powerful technique with benefits of server maintenance, resource management, dynamic workload re-balance, etc. Modern research has effectively reduced the VM live migration (VMLM) time to dozens of milliseconds, but live migration still exhibits failures if it cannot terminate within the given time constraint. The ability to predict this type of failure can avoid wasting networking and computing resources on the VM migration, and the associated system performance degradation caused by wasting these resources. The cost of VM live migration highly depends on the application workload of the VM, which may undergo frequent changes. At the same time, the available system resources for VM migration can also change substantially and frequently. To account for these issues, we present a solution called MigVisor, which can accurately predict the behaviour of VM migration using working-set model. This can enable system managers to predict the migration cost and enhance the system management efficacy. The experimental results prove the design suitability and show that the MigVisor has a high prediction accuracy since the average relative error between the predicted value and the measured value is only 6.2\%~9\%.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "VEE '17 conference proceedings.", } @Article{Zhang:2017:MSM, author = "Qi Zhang and Ling Liu and Gong Su and Arun Iyengar", title = "{MemFlex}: A Shared Memory Swapper for High Performance {VM} Execution", journal = j-IEEE-TRANS-COMPUT, volume = "66", number = "9", pages = "1645--1652", month = sep, year = "2017", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.2017.2686850", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Thu Aug 17 10:06:38 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://ieeexplore.ieee.org/document/7885535/", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Computers", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", } @Article{Zhang:2017:NAV, author = "Weizhe Zhang and Shuo Han and Hui He and Huixiang Chen", title = "Network-aware virtual machine migration in an overcommitted cloud", journal = j-FUT-GEN-COMP-SYS, volume = "76", number = "??", pages = "428--442", month = nov, year = "2017", CODEN = "FGSEVI", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Fri Jul 28 15:45:46 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X1630053X", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Zhang:2017:OAI, author = "Xiaoxi Zhang and Zhiyi Huang and Chuan Wu and Zongpeng Li and Francis C. M. Lau", title = "Online Auctions in {IaaS} Clouds: Welfare and Profit Maximization With Server Costs", journal = j-IEEE-TRANS-NETWORKING, volume = "25", number = "2", pages = "1034--1047", month = apr, year = "2017", CODEN = "IEANEP", DOI = "https://doi.org/10.1109/TNET.2016.2619743", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Mon Jun 5 18:46:21 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Auction design has recently been studied for dynamic resource bundling and virtual machine VM provisioning in IaaS clouds, but is mostly restricted to one-shot or offline setting. This paper targets a more realistic case of online VM auction design, where: 1 cloud users bid for resources into the future to assemble customized VMs with desired occupation durations, possibly located in different data centers; 2 the cloud provider dynamically packs multiple types of resources on heterogeneous physical machines servers into the requested VMs; 3 the operational costs of servers are considered in resource allocation; and 4 both social welfare and the cloud provider's net profit are to be maximized over the system running span. We design truthful, polynomial time auctions to achieve social welfare maximization and/or the provider's profit maximization with good competitive ratios. Our mechanisms consist of two main modules: 1 an online primal-dual optimization framework for VM allocation to maximize the social welfare with server costs, and for revealing the payments through the dual variables to guarantee truthfulness and 2 a randomized reduction algorithm to convert the social welfare maximizing auctions to ones that provide a maximal expected profit for the provider, with competitive ratios comparable to those for social welfare. We adopt a new application of Fenchel duality in our primal-dual framework, which provides richer structures for convex programs than the commonly used Lagrangian duality, and our optimization framework is general and expressive enough to handle various convex server cost functions. The efficacy of the online auctions is validated through careful theoretical analysis and trace-driven simulation studies.", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771", } @Article{Zhou:2017:NFA, author = "Ao Zhou and Shangguang Wang and Ching-Hsien Hsu and Myung Ho Kim and Kok-seng Wong", title = "Network failure-aware redundant virtual machine placement in a cloud data center", journal = j-CCPE, volume = "29", number = "24", pages = "??--??", day = "25", month = dec, year = "2017", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.4290", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Sat Dec 30 09:11:59 MST 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", } @Article{Zhu:2017:NFV, author = "Xiaoqing Zhu and Harilaos Koumaras and Mea Wang and David Hausheer", title = "Network Function Virtualization and Software-Defined Networking: Advancing Multimedia Distribution", journal = j-IEEE-MULTIMEDIA, volume = "24", number = "3", pages = "16--18", month = jul # "\slash " # sep, year = "2017", CODEN = "IEMUE4", ISSN = "1070-986X (print), 1941-0166 (electronic)", ISSN-L = "1070-986X", bibdate = "Mon Jan 15 08:09:13 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeemultimedia.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.computer.org/csdl/mags/mu/2017/03/mmu2017030016.html", acknowledgement = ack-nhfb, journal-URL = "http://www.computer.org/multimedia/", } @Article{Zhu:2017:VLV, author = "Min Zhu and Bibo Tu and Wei Wei and Dan Meng", title = "{HA-VMSI}: a Lightweight Virtual Machine Isolation Approach with Commodity Hardware for {ARM}", journal = j-SIGPLAN, volume = "52", number = "7", pages = "242--256", month = jul, year = "2017", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/3140607.3050767", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat Sep 16 10:18:17 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Once compromising the hypervisor, remote or local adversaries can easily access other customers' sensitive data in the memory and context of guest virtual machines (VMs). VM isolation is an efficient mechanism for protecting the memory of guest VMs from unauthorized access. However, previous VM isolation systems either modify hardware architecture or introduce a software module without being protected, and most of them focus on the x86 architecture. This paper proposes HA-VMSI, a lightweight hardware-assisted VM isolation approach for ARM, to provide runtime protection of guest VMs, even with a compromised hypervisor. In the ARM TrustZone secure world, a thin security monitor is introduced as HA-VMSI's entire TCB. Hence, the security monitor is much less vulnerable and safe from attacks that can compromise the hypervisor. The key of HA-VMSI is decoupling the functions of memory isolation among VMs from the hypervisor into the security monitor. As a result, the hypervisor can only update the Stage-2 page tables of VMs via the security monitor, which inspects and approves each new mapping. It is worth noting that HA-VMSI is more secure and effective than current software approaches, and more flexible and compatible than hardware approaches. We have implemented a prototype for KVM hypervisor with multiple Linux as guest OSes on Juno board. The security assessment and performance evaluation show that HA-VMSI is effective, efficient and practical.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "VEE '17 conference proceedings.", } @Article{Zinner:2017:DTM, author = "Thomas Zinner and Stefan Geissler and Stanislav Lange and Steffen Gebert and Michael Seufert and Phuoc Tran-Gia", title = "A discrete-time model for optimizing the processing time of virtualized network functions", journal = j-COMP-NET-AMSTERDAM, volume = "125", number = "??", pages = "4--14", day = "9", month = oct, year = "2017", CODEN = "????", ISSN = "1389-1286 (print), 1872-7069 (electronic)", ISSN-L = "1389-1286", bibdate = "Thu Sep 21 06:52:31 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1389128617301809", acknowledgement = ack-nhfb, fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)", journal-URL = "http://www.sciencedirect.com/science/journal/13891286/", } @Article{A:2018:AML, author = "Ajay Kumara M. A. and Jaidhar C. D.", title = "Automated multi-level malware detection system based on reconstructed semantic view of executables using machine learning techniques at {VMM}", journal = j-FUT-GEN-COMP-SYS, volume = "79 (part 1)", number = "??", pages = "431--446", year = "2018", CODEN = "FGSEVI", DOI = "https://doi.org/10.1016/j.future.2017.06.002", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Fri Nov 24 15:16:17 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.sciencedirect.com/science/article/pii/S0167739X17311809", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", keywords = "Cyber Physical system; Feature selection technique; Hypervisor; Machine learning; Memory forensic analysis; N-gram feature extraction; Virtual machine introspection", } @Article{Abadi:2018:SCT, author = "Reza Mohamadi Bahram Abadi and Amir Masoud Rahmani and Sasan H. Alizadeh", title = "Server consolidation techniques in virtualized data centers of cloud environments: a systematic literature review", journal = j-SPE, volume = "48", number = "9", pages = "1688--1726", month = sep, year = "2018", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/spe.2582", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Thu Dec 6 16:49:42 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", onlinedate = "17 April 2018", } @Article{Abbasi:2018:VMA, author = "Aaqif Afzaal Abbasi and Hai Jin", title = "{v-Mapper}: An Application-Aware Resource Consolidation Scheme for Cloud Data Centers", journal = j-FUTURE-INTERNET, volume = "10", number = "9", pages = "90", day = "15", month = sep, year = "2018", CODEN = "????", DOI = "https://doi.org/10.3390/fi10090090", ISSN = "1999-5903", ISSN-L = "1999-5903", bibdate = "Thu Nov 21 16:51:02 MST 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/future-internet.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.mdpi.com/1999-5903/10/9/90", abstract = "Cloud computing systems are popular in computing industry for their ease of use and wide range of applications. These systems offer services that can be used over the Internet. Due to their wide popularity and usage, cloud computing systems and their services often face issues resource management related challenges. In this paper, we present v-Mapper, a resource consolidation scheme which implements network resource management concepts through software-defined networking (SDN) control features. The paper makes three major contributions: (1) We propose a virtual machine (VM) placement scheme that can effectively mitigate the VM placement issues for data-intensive applications; (2) We propose a validation scheme that will ensure that a cloud service is entertained only if there are sufficient resources available for its execution and (3) We present a scheduling policy that aims to eliminate network load constraints. We tested our scheme with other techniques in terms of average task processing time, service delay and bandwidth usage. Our results demonstrate that v-Mapper outperforms other techniques and delivers significant improvement in system's performance.", acknowledgement = ack-nhfb, journal-URL = "https://www.mdpi.com/journal/futureinternet", remark = "Special Issue Software Defined Networking (SDN) and Network Function Virtualization (NFV).", } @Article{Ahmadian:2018:ECH, author = "Saba Ahmadian and Onur Mutlu and Hossein Asadi", title = "{ECI-Cache}: a High-Endurance and Cost-Efficient {I/O} Caching Scheme for Virtualized Platforms", journal = j-SIGMETRICS, volume = "46", number = "1", pages = "73--73", month = jun, year = "2018", CODEN = "????", DOI = "https://doi.org/10.1145/3292040.3219646", ISSN = "0163-5999 (print), 1557-9484 (electronic)", ISSN-L = "0163-5999", bibdate = "Fri Jan 18 06:03:57 MST 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigmetrics.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "In recent years, high interest in using Virtual Machines (VMs) in data centers and cloud computing has significantly increased the demand for high-performance data storage systems. A straightforward approach to providing a high-performance storage system is using Solid-State Drives (SSDs). Inclusion of SSDs in storage systems, however, imposes significantly higher cost compared to Hard Disk Drives (HDDs). Recent studies suggest using SSDs as a caching layer for HDD-based storage subsystems in virtualized platforms. Such studies neglect to address the endurance and cost of SSDs, which can significantly affect the efficiency of I/O caching. Moreover, previous studies only configure the cache size to provide the required performance level for each VM, while neglecting other important parameters such as cache write policy and request type, which can adversely affect both performance-per-cost and endurance. In this paper, we propose a new high-Endurance and Cost-efficient I/O caching (ECI-Cache) scheme for virtualized platforms in large-scale data centers, which improves both performance-per-cost and endurance of the SSD cache. ECI-Cache dynamically assigns (1) an efficient cache size for each VM, to maximize the overall performance of the running VMs and (2) an effective write policy for each VM, to enhance the endurance and performance-per-cost of the storage subsystem.", acknowledgement = ack-nhfb, fjournal = "ACM SIGMETRICS Performance Evaluation Review", journal-URL = "http://portal.acm.org/toc.cfm?id=J618", } @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{Alshathri:2018:SLM, author = "Samah Alshathri and Bogdan Ghita and Nathan Clarke", title = "Sharing with Live Migration Energy Optimization Scheduler for Cloud Computing Data Centers", journal = j-FUTURE-INTERNET, volume = "10", number = "9", pages = "86", day = "06", month = sep, year = "2018", CODEN = "????", DOI = "https://doi.org/10.3390/fi10090086", ISSN = "1999-5903", ISSN-L = "1999-5903", bibdate = "Thu Nov 21 16:51:02 MST 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/future-internet.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.mdpi.com/1999-5903/10/9/86", abstract = "The cloud-computing concept has emerged as a powerful mechanism for data storage by providing a suitable platform for data centers. Recent studies show that the energy consumption of cloud computing systems is a key issue. Therefore, we should reduce the energy consumption to satisfy performance requirements, minimize power consumption, and maximize resource utilization. This paper introduces a novel algorithm that could allocate resources in a cloud-computing environment based on an energy optimization method called Sharing with Live Migration (SLM). In this scheduler, we used the Cloud-Sim toolkit to manage the usage of virtual machines (VMs) based on a novel algorithm that learns and predicts the similarity between the tasks, and then allocates each of them to a suitable VM. On the other hand, SLM satisfies the Quality of Services (QoS) constraints of the hosted applications by adopting a migration process. The experimental results show that the algorithm exhibits better performance, while saving power and minimizing the processing time. Therefore, the SLM algorithm demonstrates improved virtual machine efficiency and resource utilization compared to an adapted state-of-the-art algorithm for a similar problem.", acknowledgement = ack-nhfb, journal-URL = "https://www.mdpi.com/journal/futureinternet", } @Article{Alves:2018:VST, author = "Thiago Alves and Rishabh Das and Aaron Werth and Thomas Morris", title = "Virtualization of {SCADA} testbeds for cybersecurity research: a modular approach", journal = j-COMPUT-SECUR, volume = "77", number = "??", pages = "531--546", month = aug, year = "2018", CODEN = "CPSEDU", ISSN = "0167-4048 (print), 1872-6208 (electronic)", ISSN-L = "0167-4048", bibdate = "Mon Sep 23 09:46:55 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.sciencedirect.com/science/article/pii/S0167404818304905", acknowledgement = ack-nhfb, fjournal = "Computers \& Security", journal-URL = "https://www.sciencedirect.com/science/journal/01674048", } @Article{Anglano:2018:PFT, author = "Cosimo Anglano and Massimo Canonico and Marco Guazzone", title = "{Prometheus}: a flexible toolkit for the experimentation with virtualized infrastructures", journal = j-CCPE, volume = "30", number = "11", pages = "??--??", day = "10", month = jun, year = "2018", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.4400", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Sat Aug 4 10:03:14 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://onlinelibrary.wiley.com/doi/abs/10.1002/cpe.4400", acknowledgement = ack-nhfb, fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", } @Article{Anwar:2018:ESS, author = "Nazia Anwar and Huifang Deng", title = "Elastic Scheduling of Scientific Workflows under Deadline Constraints in Cloud Computing Environments", journal = j-FUTURE-INTERNET, volume = "10", number = "1", pages = "5", day = "07", month = jan, year = "2018", CODEN = "????", DOI = "https://doi.org/10.3390/fi10010005", ISSN = "1999-5903", ISSN-L = "1999-5903", bibdate = "Thu Nov 21 16:50:58 MST 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/future-internet.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.mdpi.com/1999-5903/10/1/5", abstract = "Scientific workflow applications are collections of several structured activities and fine-grained computational tasks. Scientific workflow scheduling in cloud computing is a challenging research topic due to its distinctive features. In cloud environments, it has become critical to perform efficient task scheduling resulting in reduced scheduling overhead, minimized cost and maximized resource utilization while still meeting the user-specified overall deadline. This paper proposes a strategy, Dynamic Scheduling of Bag of Tasks based workflows (DSB), for scheduling scientific workflows with the aim to minimize financial cost of leasing Virtual Machines (VMs) under a user-defined deadline constraint. The proposed model groups the workflow into Bag of Tasks (BoTs) based on data dependency and priority constraints and thereafter optimizes the allocation and scheduling of BoTs on elastic, heterogeneous and dynamically provisioned cloud resources called VMs in order to attain the proposed method's objectives. The proposed approach considers pay-as-you-go Infrastructure as a Service (IaaS) clouds having inherent features such as elasticity, abundance, heterogeneity and VM provisioning delays. A trace-based simulation using benchmark scientific workflows representing real world applications, demonstrates a significant reduction in workflow computation cost while the workflow deadline is met. The results validate that the proposed model produces better success rates to meet deadlines and cost efficiencies in comparison to adapted state-of-the-art algorithms for similar problems.", acknowledgement = ack-nhfb, journal-URL = "https://www.mdpi.com/journal/futureinternet", } @Article{Arroba:2018:HMD, author = "Patricia Arroba and Jos{\'e} L. Risco-Mart{\'\i}n and Jos{\'e} M. Moya and Jos{\'e} L. Ayala", title = "Heuristics and metaheuristics for dynamic management of computing and cooling energy in cloud data centers", journal = j-SPE, volume = "48", number = "10", pages = "1775--1804", month = oct, year = "2018", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/spe.2603", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Thu Dec 6 16:49:42 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", onlinedate = "26 June 2018", remark = "Special issue on metaheuristics in cloud computing.", } @Article{Aryania:2018:EAV, author = "Azra Aryania and Hadi S. Aghdasi and Leyli Mohammad Khanli", title = "Energy-Aware Virtual Machine Consolidation Algorithm Based on Ant Colony System", journal = j-J-GRID-COMP, volume = "16", number = "3", pages = "477--491", month = sep, year = "2018", CODEN = "????", DOI = "https://doi.org/10.1007/s10723-018-9428-4", ISSN = "1570-7873 (print), 1572-9184 (electronic)", ISSN-L = "1570-7873", bibdate = "Wed Sep 26 10:02:59 MDT 2018", bibsource = "http://link.springer.com/journal/10723/16/3; https://www.math.utah.edu/pub/tex/bib/jgridcomp.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://link.springer.com/article/10.1007/s10723-018-9428-4", acknowledgement = ack-nhfb, fjournal = "Journal of Grid Computing", journal-URL = "http://link.springer.com/journal/10723", } @Article{Ashraf:2018:MOD, author = "Adnan Ashraf and Ivan Porres", title = "Multi-objective dynamic virtual machine consolidation in the cloud using ant colony system", journal = j-INT-J-PAR-EMER-DIST-SYS, volume = "33", number = "1", pages = "103--120", year = "2018", CODEN = "????", DOI = "https://doi.org/10.1080/17445760.2017.1278601", ISSN = "1744-5760 (print), 1744-5779 (electronic)", ISSN-L = "1744-5760", bibdate = "Sun Dec 17 10:23:32 MST 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjparemerdistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www.tandfonline.com/toc/gpaa20/33/1", acknowledgement = ack-nhfb, fjournal = "International Journal of Parallel, Emergent and Distributed Systems: IJPEDS", journal-URL = "http://www.tandfonline.com/loi/gpaa20", onlinedate = "05 May 2017", } @Article{Asyabi:2018:PHC, author = "Esmail Asyabi and Mohsen Sharifi and Azer Bestavros", title = "{ppXen}: A hypervisor {CPU} scheduler for mitigating performance variability in virtualized clouds", journal = j-FUT-GEN-COMP-SYS, volume = "83", number = "??", pages = "75--84", month = jun, year = "2018", CODEN = "FGSEVI", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Thu Mar 15 17:42:39 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.sciencedirect.com/science/article/pii/S0167739X17310555", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Asyabi:2018:TMT, author = "Esmail Asyabi and SeyedAlireza SanaeeKohroudi and Mohsen Sharifi and Azer Bestavros", title = "{TerrierTail}: Mitigating Tail Latency of Cloud Virtual Machines", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "29", number = "10", pages = "2346--2359", month = oct, year = "2018", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2018.2827075", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Thu Oct 11 14:41:40 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.computer.org/csdl/trans/td/2018/10/08338088-abs.html", acknowledgement = ack-nhfb, journal-URL = "http://www.computer.org/tpds/archives.htm", } @Article{Auernhammer:2018:XEI, author = "F. Auernhammer and R. L. Arndt", title = "{XIVE}: External interrupt virtualization for the cloud infrastructure", journal = j-IBM-JRD, volume = "62", number = "4--5", pages = "5:1--5:10", month = "????", year = "2018", CODEN = "IBMJAE", ISSN = "0018-8646 (print), 2151-8556 (electronic)", ISSN-L = "0018-8646", bibdate = "Thu Sep 13 11:17:13 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/ibmjrd.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://ieeexplore.ieee.org/document/8383690/", acknowledgement = ack-nhfb, journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520", } @Article{Batalla:2018:VVP, author = "Jordi Mongay Batalla and Konrad Sienkiewicz and Waldemar Latoszek and Piotr Krawiec and Constandinos X. Mavromoustakis and George Mastorakis", title = "Validation of virtualization platforms for {I-IoT} purposes", journal = j-J-SUPERCOMPUTING, volume = "74", number = "9", pages = "4227--4241", month = sep, year = "2018", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-016-1844-2", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Thu Oct 10 15:31:14 MDT 2019", bibsource = "http://link.springer.com/journal/11227/74/9; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer.com/content/pdf/10.1007/s11227-016-1844-2.pdf", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Botacin:2018:WWW, author = "Marcus Botacin and Paulo L{\'\i}cio {De Geus} and Andr{\'e} Gr{\'e}gio", title = "Who Watches the Watchmen: a Security-focused Review on Current State-of-the-art Techniques, Tools, and Methods for Systems and Binary Analysis on Modern Platforms", journal = j-COMP-SURV, volume = "51", number = "4", pages = "69:1--69:??", month = sep, year = "2018", CODEN = "CMSVAN", DOI = "https://doi.org/10.1145/3199673", ISSN = "0360-0300 (print), 1557-7341 (electronic)", ISSN-L = "0360-0300", bibdate = "Sat Aug 31 09:04:35 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/compsurv.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Malicious software, a threat users face on a daily basis, have evolved from simple bankers based on social engineering to advanced persistent threats. Recent research and discoveries reveal that malware developers have been using a wide range of anti-analysis and evasion techniques, in-memory attacks, and system subversion, including BIOS and hypervisors. In addition, code-reuse attacks like Returned Oriented Programming emerge as highly potential remote code execution threats. To counteract the broadness of malicious codes, distinct techniques and tools have been proposed, such as transparent malware tracers, system-wide debuggers, live forensics tools, and isolated execution rings. In this work, we present a survey on state-of-the-art techniques that detect, mitigate, and analyze the aforementioned attacks. We show approaches based on Hardware Virtual Machines introspection, System Management Mode instrumentation, Hardware Performance Counters, isolated rings (e.g., Software Guard eXtensions), as well as others based on external hardware. We also discuss upcoming threats based on the very same technologies used for defense. Our main goal is to provide the reader with a broader, more comprehensive understanding of recently surfaced tools and techniques aiming at binary analysis for modern platforms.", acknowledgement = ack-nhfb, articleno = "69", fjournal = "ACM Computing Surveys", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204", } @Article{Brogi:2018:MBA, author = "Antonio Brogi and Davide Neri and Jacopo Soldani", title = "A microservice-based architecture for (customisable) analyses of {Docker} images", journal = j-SPE, volume = "48", number = "8", pages = "1461--1474", month = aug, year = "2018", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/spe.2583", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Sat Aug 4 10:20:33 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://onlinelibrary.wiley.com/doi/abs/10.1002/spe.2583", acknowledgement = ack-nhfb, ajournal = "Softw. Pract. Exp.", fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", onlinedate = "17 April 2018", } @Article{Brogi:2018:TSB, author = "Antonio Brogi and Luca Rinaldi and Jacopo Soldani", title = "{TosKer}: a synergy between {TOSCA} and {Docker} for orchestrating multicomponent applications", journal = j-SPE, volume = "48", number = "11", pages = "2061--2079", month = nov, year = "2018", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/spe.2625", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Thu Dec 6 16:49:42 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "Softw. Pract. Exp.", fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", onlinedate = "09 August 2018", } @Article{Bruno:2018:DVM, author = "Rodrigo Bruno and Paulo Ferreira and Ruslan Synytsky and Tetiana Fydorenchyk and Jia Rao and Hang Huang and Song Wu", title = "Dynamic vertical memory scalability for {OpenJDK} cloud applications", journal = j-SIGPLAN, volume = "53", number = "5", pages = "59--70", month = may, year = "2018", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/3299706.3210567", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Oct 16 14:12:58 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "The cloud is an increasingly popular platform to deploy applications as it lets cloud users to provide resources to their applications as needed. Furthermore, cloud providers are now starting to offer a ``pay-as-you-use'' model in which users are only charged for the resources that are really used instead of paying for a statically sized instance. This new model allows cloud users to save money, and cloud providers to better utilize their hardware. However, applications running on top of runtime environments such as the Java Virtual Machine (JVM) cannot benefit from this new model because they cannot dynamically adapt the amount of used resources at runtime. In particular, if an application needs more memory than what was initially predicted at launch time, the JVM will not allow the application to grow its memory beyond the maximum value defined at launch time. In addition, the JVM will hold memory that is no longer being used by the application. This lack of dynamic vertical scalability completely prevents the benefits of the ``pay-as-you-use'' model, and forces users to over-provision resources, and to lose money on unused resources. We propose a new JVM heap sizing strategy that allows the JVM to dynamically scale its memory utilization according to the application's needs. First, we provide a configurable limit on how much the application can grow its memory. This limit is dynamic and can be changed at runtime, as opposed to the current static limit that can only be set at launch time. Second, we adapt current Garbage Collection policies that control how much the heap can grow and shrink to better fit what is currently being used by the application. The proposed solution is implemented in the OpenJDK 9 HotSpot JVM, the new release of OpenJDK. Changes were also introduced inside the Parallel Scavenge collector and the Garbage First collector (the new by-default collector in HotSpot). Evaluation experiments using real workloads and data show that, with negligible throughput and memory overhead, dynamic vertical memory scalability can be achieved. This allows users to save significant amounts of money by not paying for unused resources, and cloud providers to better utilize their physical machines.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "ISMM '18 proceedings.", } @Article{Castello:2018:EIR, author = "Adri{\'a}n Castell{\'o} and Antonio J. Pe{\~n}a and Rafael Mayo and Judit Planas and Enrique S. Quintana-Ort{\'{\i}} and Pavan Balaji", title = "Exploring the interoperability of remote {GPGPU} virtualization using {rCUDA} and directive-based programming models", journal = j-J-SUPERCOMPUTING, volume = "74", number = "11", pages = "5628--5642", month = nov, year = "2018", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-016-1791-y", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Thu Oct 10 15:31:09 MDT 2019", bibsource = "http://link.springer.com/journal/11227/74/11; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/pvm.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @InCollection{Chen:2018:UVB, author = "Chen Chen and Zhuyun Qi and Yirui Liu and Kai Lei", booktitle = "{Smart Computing and Communication}", title = "Using Virtualization for Blockchain Testing", publisher = pub-SV, address = pub-SV:adr, pages = "289--299", year = "2018", DOI = "https://doi.org/10.1007/978-3-319-73830-7_29", bibdate = "Wed Jan 24 09:11:52 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", series = ser-LNCS, URL = "http://link.springer.com/chapter/10.1007/978-3-319-73830-7_29", acknowledgement = ack-nhfb, } @Article{Condoluci:2018:SVM, author = "Massimo Condoluci and Toktam Mahmoodi", title = "Softwarization and virtualization in {5G} mobile networks: {Benefits}, trends and challenges", journal = j-COMP-NET-AMSTERDAM, volume = "146", number = "??", pages = "65--84", day = "9", month = dec, year = "2018", CODEN = "????", DOI = "https://doi.org/10.1016/j.comnet.2018.09.005", ISSN = "1389-1286 (print), 1872-7069 (electronic)", ISSN-L = "1389-1286", bibdate = "Tue Jan 22 16:29:24 MST 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1389128618302500", acknowledgement = ack-nhfb, fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)", journal-URL = "http://www.sciencedirect.com/science/journal/13891286/", } @Article{Cui:2018:SPA, author = "Lei Cui and Zhiyu Hao and Lun Li and Xiaochun Yun", title = "{SnapFiner}: A Page-Aware Snapshot System for Virtual Machines", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "29", number = "11", pages = "2613--2626", month = nov, year = "2018", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2018.2831202", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Thu Oct 11 14:38:26 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.computer.org/csdl/trans/td/2018/11/08352722-abs.html", acknowledgement = ack-nhfb, journal-URL = "http://www.computer.org/tpds/archives.htm", } @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{Debski:2018:SRA, author = "A. Debski and B. Szczepanik and M. Malawski and S. Spahr and D. Muthig", title = "A Scalable, Reactive Architecture for Cloud Applications", journal = j-IEEE-SOFTWARE, volume = "35", number = "2", pages = "62--71", month = mar # "\slash " # apr, year = "2018", CODEN = "IESOEG", DOI = "https://doi.org/10.1109/MS.2017.265095722", ISSN = "0740-7459 (print), 1937-4194 (electronic)", ISSN-L = "0740-7459", bibdate = "Fri Aug 2 09:25:48 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeesoft.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Software", journal-URL = "http://www.computer.org/portal/web/csdl/magazines/software", keywords = "Akka; blogs; cloud applications; Cloud computing; cloud computing; cloud environment; Command Query Responsibility Segregation; command query responsibility segregation; Computer architecture; CQRS; design patterns; domain-driven design; ES; event sourcing; Event Sourcing; flight scheduling; Load modeling; open-source project; pattern horizontal scalability; performance evaluation; prototype interactive flight-scheduling application; query processing; Query processing; reactive; Reactive Manifesto; Reactive Manifesto guidelines; reference implementation; Scalability; scalability; scalable applications; software architecture; software development; software engineering; tutorials; virtual machines; Web sites", } @Article{Denz:2018:SMB, author = "Robert Denz and Scott Brookes and Martin Osterloh and Stephen Kuhn and Stephen Taylor", title = "Symmetric multiprocessing from boot to virtualization", journal = j-SPE, volume = "48", number = "3", pages = "681--718", month = mar, year = "2018", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/spe.2505", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Sat Aug 4 10:20:31 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://onlinelibrary.wiley.com/doi/abs/10.1002/spe.2505", acknowledgement = ack-nhfb, fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", onlinedate = "07 June 2017", } @Article{Dezhabad:2018:LBD, author = "Naghmeh Dezhabad and Saeed Sharifian", title = "Learning-based dynamic scalable load-balanced firewall as a service in network function-virtualized cloud computing environments", journal = j-J-SUPERCOMPUTING, volume = "74", number = "7", pages = "3329--3358", month = jul, year = "2018", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-018-2387-5", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Thu Oct 10 15:31:13 MDT 2019", bibsource = "http://link.springer.com/journal/11227/74/7; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Enes:2018:BDO, author = "Jonatan Enes and Javier L{\'o}pez Cacheiro and Roberto R. Exp{\'o}sito and Juan Touri{\~n}o", title = "Big Data-Oriented {PaaS} Architecture with Disk-as-a-Resource Capability and Container-Based Virtualization", journal = j-J-GRID-COMP, volume = "16", number = "4", pages = "587--605", month = dec, year = "2018", CODEN = "????", DOI = "https://doi.org/10.1007/s10723-018-9460-4", ISSN = "1570-7873 (print), 1572-9184 (electronic)", ISSN-L = "1570-7873", bibdate = "Fri Oct 11 06:43:45 MDT 2019", bibsource = "http://link.springer.com/journal/10723/16/4; https://www.math.utah.edu/pub/tex/bib/jgridcomp.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://link.springer.com/article/10.1007/s10723-018-9460-4", acknowledgement = ack-nhfb, fjournal = "Journal of Grid Computing", journal-URL = "http://link.springer.com/journal/10723", } @Article{Filelis-Papadopoulos:2018:FSL, author = "Christos K. Filelis-Papadopoulos and George A. Gravvanis and Panagiotis E. Kyziropoulos", title = "A framework for simulating large scale cloud infrastructures", journal = j-FUT-GEN-COMP-SYS, volume = "79 (part 2)", number = "??", pages = "703--714", year = "2018", CODEN = "FGSEVI", DOI = "https://doi.org/10.1016/j.future.2017.06.017", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Fri Nov 24 15:16:17 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.sciencedirect.com/science/article/pii/S0167739X17303230", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", keywords = "Cloud node; Cloud simulation; Hyper-scale data centers; Power consumption; Virtualization", } @Article{Filho:2018:AOV, author = "Manoel C. Silva Filho and Claudio C. Monteiro and Pedro R. M. In{\'a}cio and M{\'a}rio M. Freire", title = "Approaches for optimizing virtual machine placement and migration in cloud environments: a survey", journal = j-J-PAR-DIST-COMP, volume = "111", number = "??", pages = "222--250", month = jan, year = "2018", CODEN = "JPDCER", ISSN = "0743-7315 (print), 1096-0848 (electronic)", ISSN-L = "0743-7315", bibdate = "Tue Oct 24 15:08:48 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S074373151730240X", acknowledgement = ack-nhfb, fjournal = "Journal of Parallel and Distributed Computing", journal-URL = "http://www.sciencedirect.com/science/journal/07437315", } @Article{Fokaefs:2018:DBE, author = "Marios Fokaefs and Cornel Barna and Marin Litoiu", title = "From {DevOps} to {BizOps}: Economic Sustainability for Scalable Cloud Applications", journal = j-TAAS, volume = "12", number = "4", pages = "25:1--25:??", month = jan, year = "2018", CODEN = "????", DOI = "https://doi.org/10.1145/3139290", ISSN = "1556-4665 (print), 1556-4703 (electronic)", ISSN-L = "1556-4665", bibdate = "Wed May 23 05:40:59 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/taas.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Virtualization of resources in cloud computing has enabled developers to commission and recommission resources at will and on demand. This virtualization is a coin with two sides. On one hand, the flexibility in managing virtual resources has enabled developers to efficiently manage their costs; they can easily remove unnecessary resources or add resources temporarily when the demand increases. On the other hand, the volatility of such environment and the velocity with which changes can occur may have a greater impact on the economic position of a stakeholder and the business balance of the overall ecosystem. In this work, we recognise the business ecosystem of cloud computing as an economy of scale and explore the effect of this fact on decisions concerning scaling the infrastructure of web applications to account for fluctuations in demand. The goal is to reveal and formalize opportunities for economically optimal scaling that takes into account not only the cost of infrastructure but also the revenue from service delivery and eventually the profit of the service provider. The end product is a scaling mechanism that makes decisions based on both performance and economic criteria and takes adaptive actions to optimize both performance and profitability for the system.", acknowledgement = ack-nhfb, articleno = "25", fjournal = "ACM Transactions on Autonomous and Adaptive Systems (TAAS)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1010", } @Article{Gad:2018:ZMD, author = "Ramy Gad and Simon Pickartz and Tim S{\"u}{\ss} and Lars Nagel and Stefan Lankes and Antonello Monti and Andr{\'e} Brinkmann", title = "Zeroing memory deallocator to reduce checkpoint sizes in virtualized {HPC} environments", journal = j-J-SUPERCOMPUTING, volume = "74", number = "11", pages = "6236--6257", month = nov, year = "2018", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-018-2548-6", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Thu Oct 10 15:31:09 MDT 2019", bibsource = "http://link.springer.com/journal/11227/74/11; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Gilesh:2018:SSV, author = "M. P. Gilesh and Sanjay Satheesh and S. D. Madhu Kumar and Lillykutty Jacob", title = "Selecting suitable virtual machine migrations for optimal provisioning of virtual data centers", journal = j-SIGAPP, volume = "18", number = "2", pages = "22--32", month = jul, year = "2018", CODEN = "????", DOI = "https://doi.org/10.1145/3243064.3243066", ISSN = "1559-6915 (print), 1931-0161 (electronic)", ISSN-L = "1559-6915", bibdate = "Thu Jan 23 10:25:04 MST 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigapp.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/abs/10.1145/3243064.3243066", abstract = "Maximizing the number of virtual infrastructures spawned out of a data center is a prime concern of cloud service providers to improve their revenue and the customers' quality-of-experience. Optimal placement of topology sensitive virtual data centers \ldots{}", acknowledgement = ack-nhfb, fjournal = "ACM SIGAPP Applied Computing Review", journal-URL = "https://dl.acm.org/loi/sigapp", } @Article{Grimmer:2018:CLI, author = "Matthias Grimmer and Roland Schatz and Chris Seaton and Thomas W{\"u}rthinger and Mikel Luj{\'a}n", title = "Cross-Language Interoperability in a Multi-Language Runtime", journal = j-TOPLAS, volume = "40", number = "2", pages = "8:1--8:??", month = jun, year = "2018", CODEN = "ATPSDT", DOI = "https://doi.org/10.1145/3201898", ISSN = "0164-0925 (print), 1558-4593 (electronic)", ISSN-L = "0164-0925", bibdate = "Thu Oct 18 12:01:50 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2010.bib; https://www.math.utah.edu/pub/tex/bib/toplas.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "In large-scale software applications, programmers often combine different programming languages because this allows them to use the most suitable language for a given problem, to gradually migrate existing projects from one language to another, or to reuse existing source code. However, different programming languages have fundamentally different implementations, which are hard to combine. The composition of language implementations often results in complex interfaces between languages, insufficient flexibility, or poor performance. We propose TruffleVM, a virtual machine (VM) that can execute different programming languages and is able to compose them in a seamless way. TruffleVM supports dynamically-typed languages (e.g., JavaScript and Ruby) as well as statically typed low-level languages (e.g., C). It consists of individual language implementations, which translate source code to an intermediate representation that is executed by a shared VM. TruffleVM composes these different language implementations via generic access. Generic access is a language-agnostic mechanism that language implementations use to access foreign data or call foreign functions. It features language-agnostic messages that the TruffleVM resolves to efficient foreign-language-specific operations at runtime. Generic access supports multiple languages, enables an efficient multi-language development, and ensures high performance. We evaluate generic access with two case studies. The first one explains the transparent composition of JavaScript, Ruby, and C. The second one shows an implementation of the C extensions application programming interface (API) for Ruby. We show that generic access guarantees good runtime performance. It avoids conversion or marshalling of foreign objects at the language boundary and allows the dynamic compiler to perform its optimizations across language boundaries.", acknowledgement = ack-nhfb, articleno = "8", fjournal = "ACM Transactions on Programming Languages and Systems", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J783", } @Article{Guerrero:2018:MOO, author = "Carlos Guerrero and Isaac Lera and Belen Bermejo and Carlos Juiz", title = "Multi-Objective Optimization for Virtual Machine Allocation and Replica Placement in Virtualized {Hadoop}", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "29", number = "11", pages = "2568--2581", month = nov, year = "2018", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2018.2837743", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Thu Oct 11 14:38:26 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.computer.org/csdl/trans/td/2018/11/08360490-abs.html", acknowledgement = ack-nhfb, journal-URL = "http://www.computer.org/tpds/archives.htm", } @Article{Gunleifsen:2018:TCP, author = "H{\aa}kon Gunleifsen and Vasileios Gkioulos and Thomas Kemmerich", title = "A Tiered Control Plane Model for Service Function Chaining Isolation", journal = j-FUTURE-INTERNET, volume = "10", number = "6", pages = "46", day = "04", month = jun, year = "2018", CODEN = "????", DOI = "https://doi.org/10.3390/fi10060046", ISSN = "1999-5903", ISSN-L = "1999-5903", bibdate = "Thu Nov 21 16:51:00 MST 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib; https://www.math.utah.edu/pub/tex/bib/future-internet.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.mdpi.com/1999-5903/10/6/46", abstract = "This article presents an architecture for encryption automation in interconnected Network Function Virtualization (NFV) domains. Current NFV implementations are designed for deployment within trusted domains, where overlay networks with static trusted links are utilized for enabling network security. Nevertheless, within a Service Function Chain (SFC), Virtual Network Function (VNF) flows cannot be isolated and end-to-end encrypted because each VNF requires direct access to the overall SFC data-flow. This restricts both end-users and Service Providers from enabling end-to-end security, and in extended VNF isolation within the SFC data traffic. Encrypting data flows on a per-flow basis results in an extensive amount of secure tunnels, which cannot scale efficiently in manual configurations. Additionally, creating secure data plane tunnels between NFV providers requires secure exchange of key parameters, and the establishment of an east--west control plane protocol. In this article, we present an architecture focusing on these two problems, investigating how overlay networks can be created, isolated, and secured dynamically. Accordingly, we propose an architecture for automated establishment of encrypted tunnels in NFV, which introduces a novel, tiered east--west communication channel between network controllers in a multi-domain environment.", acknowledgement = ack-nhfb, journal-URL = "https://www.mdpi.com/journal/futureinternet", remark = "Special Issue Software Defined Networking (SDN) and Network Function Virtualization (NFV).", } @Article{Gupta:2018:RAV, author = "Madnesh K. Gupta and Tarachand Amgoth", title = "Resource-aware virtual machine placement algorithm for {IaaS} cloud", journal = j-J-SUPERCOMPUTING, volume = "74", number = "1", pages = "122--140", month = jan, year = "2018", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-017-2112-9", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Sat Jan 6 08:59:19 MST 2018", bibsource = "http://link.springer.com/journal/11227/74/1; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Gupta:2018:SCS, author = "Abhishek Gupta and M. Farhan Habib and Uttam Mandal and Pulak Chowdhury and Massimo Tornatore and Biswanath Mukherjee", title = "On service-chaining strategies using {Virtual Network Functions} in operator networks", journal = j-COMP-NET-AMSTERDAM, volume = "133", number = "??", pages = "1--16", day = "14", month = mar, year = "2018", CODEN = "????", DOI = "https://doi.org/10.1016/j.comnet.2018.01.028", ISSN = "1389-1286 (print), 1872-7069 (electronic)", ISSN-L = "1389-1286", bibdate = "Wed Feb 21 15:18:20 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1389128618300379", acknowledgement = ack-nhfb, fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)", journal-URL = "http://www.sciencedirect.com/science/journal/13891286/", } @Article{Hajnal:2018:EVI, author = "Akos Hajnal and Gabor Kecskemeti and Attila Csaba Marosi and Jozsef Kovacs and Peter Kacsuk and Robert Lovas", title = "{ENTICE VM} Image Analysis and Optimised Fragmentation", journal = j-J-GRID-COMP, volume = "16", number = "2", pages = "247--263", month = jun, year = "2018", CODEN = "????", DOI = "https://doi.org/10.1007/s10723-018-9430-x", ISSN = "1570-7873 (print), 1572-9184 (electronic)", ISSN-L = "1570-7873", bibdate = "Wed Sep 26 10:02:59 MDT 2018", bibsource = "http://link.springer.com/journal/10723/16/2; https://www.math.utah.edu/pub/tex/bib/jgridcomp.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://link.springer.com/article/10.1007/s10723-018-9430-x", acknowledgement = ack-nhfb, fjournal = "Journal of Grid Computing", journal-URL = "http://link.springer.com/journal/10723", } @Article{Halacsy:2018:OEE, author = "Gergely Hal{\'a}csy and Zolt{\'a}n {\'A}d{\'a}m Mann", title = "Optimal energy-efficient placement of virtual machines with divisible sizes", journal = j-INFO-PROC-LETT, volume = "138", number = "??", pages = "44--50", month = oct, year = "2018", CODEN = "IFPLAT", DOI = "https://doi.org/10.1016/j.ipl.2018.06.003", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Fri Sep 14 08:04:51 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0020019018301285", acknowledgement = ack-nhfb, fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", } @Article{Han:2018:RAM, author = "Jin Han and Wangyu Zang and Li Liu and Songqing Chen and Meng Yu", title = "Risk-aware multi-objective optimized virtual machine placement in the cloud", journal = j-J-COMP-SECUR, volume = "26", number = "5", pages = "707--730", month = "????", year = "2018", CODEN = "JCSIET", DOI = "https://doi.org/10.3233/JCS-171104", ISSN = "0926-227X (print), 1875-8924 (electronic)", ISSN-L = "0926-227X", bibdate = "Mon Sep 23 05:47:18 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jcompsecur.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, journal-URL = "http://content.iospress.com/journals/journal-of-computer-security", } @Article{Haria:2018:DMH, author = "Swapnil Haria and Mark D. Hill and Michael M. Swift", title = "Devirtualizing Memory in Heterogeneous Systems", journal = j-SIGPLAN, volume = "53", number = "2", pages = "637--650", month = feb, year = "2018", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/3296957.3173194", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Oct 16 14:12:56 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Accelerators are increasingly recognized as one of the major drivers of future computational growth. For accelerators, shared virtual memory (VM) promises to simplify programming and provide safe data sharing with CPUs. Unfortunately, the overheads of virtual memory, which are high for general-purpose processors, are even higher for accelerators. Providing accelerators with direct access to physical memory (PM) in contrast, provides high performance but is both unsafe and more difficult to program. We propose Devirtualized Memory (DVM) to combine the protection of VM with direct access to PM. By allocating memory such that physical and virtual addresses are almost always identical (VA==PA), DVM mostly replaces page-level address translation with faster region-level Devirtualized Access Validation (DAV). Optionally on read accesses, DAV can be overlapped with data fetch to hide VM overheads. DVM requires modest OS and IOMMU changes, and is transparent to the application. Implemented in Linux 4.10, DVM reduces VM overheads in a graph-processing accelerator to just 1.6\% on average. DVM also improves performance by 2.1X over an optimized conventional VM implementation, while consuming 3.9X less dynamic energy for memory management. We further discuss DVM's potential to extend beyond accelerators to CPUs, where it reduces VM overheads to 5\% on average, down from 29\% for conventional VM.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "ASPLOS '18 proceedings.", } @Article{Hausheer:2018:SPS, author = "David Hausheer and Oliver Hohlfeld and Stefan Schmid and Guofei Gu", title = "Security and performance of software-defined networks and functions virtualization", journal = j-COMP-NET-AMSTERDAM, volume = "138", number = "??", pages = "15--17", day = "19", month = jun, year = "2018", CODEN = "????", DOI = "https://doi.org/10.1016/j.comnet.2018.03.025", ISSN = "1389-1286 (print), 1872-7069 (electronic)", ISSN-L = "1389-1286", bibdate = "Thu May 31 13:40:46 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1389128618301452", acknowledgement = ack-nhfb, fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)", journal-URL = "http://www.sciencedirect.com/science/journal/13891286/", } @Article{Hejja:2018:OPA, author = "Khaled Hejja and Xavier Hesselbach", title = "Online power aware coordinated virtual network embedding with {$5$G} delay constraint", journal = j-J-NETW-COMPUT-APPL, volume = "124", number = "??", pages = "121--136", day = "15", month = dec, year = "2018", CODEN = "JNCAF3", ISSN = "1084-8045 (print), 1095-8592 (electronic)", ISSN-L = "1084-8045", bibdate = "Mon Oct 14 14:16:28 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1084804518303151", acknowledgement = ack-nhfb, fjournal = "Journal of Network and Computer Applications", journal-URL = "http://www.sciencedirect.com/science/journal/10848045", } @Article{Hinz:2018:CMI, author = "Mauro Hinz and Guilherme Piegas Koslovski and Charles C. Miers and La{\'e}rcio L. Pilla and Maur{\'\i}cio A. Pillon", title = "A Cost Model for {IaaS} Clouds Based on Virtual Machine Energy Consumption", journal = j-J-GRID-COMP, volume = "16", number = "3", pages = "493--512", month = sep, year = "2018", CODEN = "????", DOI = "https://doi.org/10.1007/s10723-018-9440-8", ISSN = "1570-7873 (print), 1572-9184 (electronic)", ISSN-L = "1570-7873", bibdate = "Wed Sep 26 10:02:59 MDT 2018", bibsource = "http://link.springer.com/journal/10723/16/3; https://www.math.utah.edu/pub/tex/bib/jgridcomp.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://link.springer.com/article/10.1007/s10723-018-9440-8", acknowledgement = ack-nhfb, fjournal = "Journal of Grid Computing", journal-URL = "http://link.springer.com/journal/10723", } @Article{Hsieh:2018:VMA, author = "Han-Chuan Hsieh and Jiann-Liang Chen and Abderrahim Benslimane", title = "{5G} Virtualized Multi-access Edge Computing Platform for {IoT} Applications", journal = j-J-NETW-COMPUT-APPL, volume = "115", number = "??", pages = "94--102", day = "1", month = aug, year = "2018", CODEN = "JNCAF3", DOI = "https://doi.org/10.1016/j.jnca.2018.05.001", ISSN = "1084-8045 (print), 1095-8592 (electronic)", ISSN-L = "1084-8045", bibdate = "Sun May 27 08:10:17 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1084804518301577", acknowledgement = ack-nhfb, fjournal = "Journal of Network and Computer Applications", journal-URL = "http://www.sciencedirect.com/science/journal/10848045", } @Article{Huang:2018:PSC, author = "Sheng-Min Huang and Li-Pin Chang", title = "Providing {SLO} Compliance on {NVMe SSDs} Through Parallelism Reservation", journal = j-TODAES, volume = "23", number = "3", pages = "28:1--28:??", month = apr, year = "2018", CODEN = "ATASFO", DOI = "https://doi.org/10.1145/3174867", ISSN = "1084-4309 (print), 1557-7309 (electronic)", ISSN-L = "1084-4309", bibdate = "Fri Mar 22 16:58:39 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/todaes.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Non-Volatile Memory Express (NVMe) is a specification for next-generation solid-state disks (SSDs). Benefited from the massive internal parallelism and the high-speed PCIe bus, NVMe SSDs achieve extremely high data transfer rates, and they are an ideal solution of shared storage in virtualization environments. Providing virtual machines with Service Level Objective (SLO) compliance on NVMe SSDs is a challenging task, because garbage collection activities inside of NVMe SSDs globally affect the I/O performance of all virtual machines. In this study, we introduce a novel approach, called parallelism reservation, which is inspired by the rich internal parallelism of NVMe SSDs. The degree of parallelism stands for how many flash chips are concurrently active. Our basic idea is to reserve sufficient degrees of parallelism for read, write, and garbage collection operations, making sure that an NVMe SSD delivers stable read and write throughput and reclaims free space at a constant rate. The stable read and write throughput are proportionally distributed among virtual machines for SLO compliance. Our experimental results show that our parallelism reservation approach delivered satisfiable throughput and highly predictable response to virtual machines.", acknowledgement = ack-nhfb, articleno = "28", fjournal = "ACM Transactions on Design Automation of Electronic Systems", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J776", } @Article{Huang:2018:TBI, author = "Jhih-Yu Huang and Pi-Chung Wang and Jhih-Yu Huang and Pi-Chung Wang", title = "{TCAM}-Based {IP} Address Lookup Using Longest Suffix Split", journal = j-IEEE-TRANS-NETWORKING, volume = "26", number = "2", pages = "976--989", month = apr, year = "2018", CODEN = "IEANEP", DOI = "https://doi.org/10.1109/TNET.2018.2815999", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Fri Apr 20 17:34:21 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Ternary content addressable memory TCAM plays an important role in modern routers due to its capability of performing fast IP address lookup. However, it is expensive, space limited, and a major source of power consumption in a router. In addition, because TCAM only reports the first matching entry, updating TCAM entries would be slow due to necessary entry reordering. In this paper, we present a trie-based algorithm, longest suffix split, to reduce the number of TCAM entries for IP address lookup. The algorithm divides route prefixes into two portions, subprefix and suffix. The route prefixes with the same subprefix and similar suffix portions can then be represented by one TCAM entry and one SRAM entry. Each SRAM entry stores one of two succinct data structures, depending on the threshold number of similar suffixes. The experimental results show that our scheme can reduce 50\% to 95\% TCAM entries for the original routing tables. Our scheme also supports incremental updates. Because the drawbacks of TCAM are related to the number of required entries, our scheme significantly improves the feasibility of TCAM-based IP address lookup. While network virtualization may store multiple forwarding information bases in a router, the number of supported virtual routers can be increased by our scheme.", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771", } @Article{Hui:2018:VMA, author = "Yang Hui", title = "A virtual machine anomaly detection system for cloud computing infrastructure", journal = j-J-SUPERCOMPUTING, volume = "74", number = "11", pages = "6126--6134", month = nov, year = "2018", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-018-2518-z", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Thu Oct 10 15:31:09 MDT 2019", bibsource = "http://link.springer.com/journal/11227/74/11; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Huin:2018:ONS, author = "Nicolas Huin and Brigitte Jaumard and Frederic Giroire", title = "Optimal Network Service Chain Provisioning", journal = j-IEEE-TRANS-NETWORKING, volume = "26", number = "3", pages = "1320--1333", month = jun, year = "2018", CODEN = "IEANEP", DOI = "https://doi.org/10.1109/TNET.2018.2833815", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Thu Oct 18 05:31:01 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Service chains consist of a set of network services, such as firewalls or application delivery controllers, which are interconnected through a network to support various applications. While it is not a new concept, there has been an extremely important new trend with the rise of software-defined network SDN and Network Function Virtualization NFV. The combination of SDN and NFV can make the service chain and application provisioning process much shorter and simpler. In this paper, we study the provisioning of service chains jointly with the number/location of virtual network functions VNFs. While chains are often built to support multiple applications, the question arises as how to plan the provisioning of service chains in order to avoid data passing through unnecessary network devices or servers and consuming extra bandwidth and CPU cycles. It requires choosing carefully the number and the location of the VNFs. We propose an exact mathematical model using decomposition methods whose solution is scalable in order to conduct such an investigation. We conduct extensive numerical experiments, and show we can solve exactly the routing of service chain requests in a few minutes for networks with up to 50 nodes, and traffic requests between all pairs of nodes. Detailed analysis is then made on the best compromise between minimizing the bandwidth requirement and minimizing the number of VNFs and optimizing their locations using different data sets.", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771", } @Article{Jia:2018:OSN, author = "Yongzheng Jia and Chuan Wu and Zongpeng Li and Franck Le and Alex Liu and Zongpeng Li and Yongzheng Jia and Chuan Wu and Franck Le and Alex Liu", title = "Online Scaling of {NFV} Service Chains Across Geo-Distributed Datacenters", journal = j-IEEE-TRANS-NETWORKING, volume = "26", number = "2", pages = "699--710", month = apr, year = "2018", CODEN = "IEANEP", DOI = "https://doi.org/10.1109/TNET.2018.2800400", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Fri Apr 20 17:34:21 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Network Function Virtualization NFV is an emerging paradigm that turns hardware-dependent implementation of network functions i.e., middleboxes into software modules running on virtualized platforms, for significant cost reduction and ease of management. Such virtual network functions VNFs commonly constitute service chains, to provide network services that traffic flows need to go through. Efficient deployment of VNFs for network service provisioning is a key to realize the NFV goals. Existing efforts on VNF placement mostly deal with offline or one-time placement, ignoring the fundamental, dynamic deployment and scaling need of VNFs to handle practical time-varying traffic volumes. This work investigates dynamic placement of VNF service chains across geo-distributed datacenters to serve flows between dispersed source and destination pairs, for operational cost minimization of the service chain provider over the entire system span. An efficient online algorithm is proposed, which consists of two main components: 1 A regularization-based approach from online learning literature to convert the offline optimal deployment problem into a sequence of one-shot regularized problems, each to be efficiently solved in one time slot and 2 An online dependent rounding scheme to derive feasible integer solutions from the optimal fractional solutions of the one-shot problems, and to guarantee a good competitive ratio of the online algorithm over the entire time span. We verify our online algorithm with solid theoretical analysis and trace-driven simulations under realistic settings.", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771", } @Article{Jiang:2018:SAR, author = "Han-Peng Jiang and Wei-Mei Chen", title = "Self-adaptive resource allocation for energy-aware virtual machine placement in dynamic computing cloud", journal = j-J-NETW-COMPUT-APPL, volume = "120", number = "??", pages = "119--129", day = "15", month = oct, year = "2018", CODEN = "JNCAF3", ISSN = "1084-8045 (print), 1095-8592 (electronic)", ISSN-L = "1084-8045", bibdate = "Mon Oct 14 14:16:27 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1084804518302352", acknowledgement = ack-nhfb, fjournal = "Journal of Network and Computer Applications", journal-URL = "http://www.sciencedirect.com/science/journal/10848045", } @Article{Jobava:2018:AIT, author = "Akaki Jobava and Anis Yazidi and B. John Oommen and Kyrre Begnum", title = "On achieving intelligent traffic-aware consolidation of virtual machines in a data center using Learning Automata", journal = j-J-COMPUT-SCI, volume = "24", pages = "290--312", month = jan, year = "2018", CODEN = "????", DOI = "https://doi.org/10.1016/j.jocs.2017.08.005", ISSN = "1877-7503 (print), 1877-7511 (electronic)", ISSN-L = "1877-7503", bibdate = "Tue Sep 19 13:54:33 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/jcomputsci.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.sciencedirect.com/science/article/pii/S1877750317300054", acknowledgement = ack-nhfb, ajournal = "J. Comput. Sci.", fjournal = "Journal of Computational Science", journal-URL = "https://www.sciencedirect.com/journal/journal-of-computational-science", } @Article{Kamran:2018:QAV, author = "Kamran and Babar Nazir", title = "{QoS}-aware {VM} placement and migration for hybrid cloud infrastructure", journal = j-J-SUPERCOMPUTING, volume = "74", number = "9", pages = "4623--4646", month = sep, year = "2018", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-017-2071-1", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Thu Oct 10 15:31:14 MDT 2019", bibsource = "http://link.springer.com/journal/11227/74/9; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @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{Kesavaraja:2018:QEC, author = "D. Kesavaraja and A. Shenbagavalli", title = "{QoE} enhancement in cloud virtual machine allocation using {Eagle} strategy of hybrid krill herd optimization", journal = j-J-PAR-DIST-COMP, volume = "118 (Part 2)", number = "??", pages = "267--279", month = "????", year = "2018", CODEN = "JPDCER", DOI = "https://doi.org/10.1016/j.jpdc.2017.08.015", ISSN = "0743-7315 (print), 1096-0848 (electronic)", ISSN-L = "0743-7315", bibdate = "Sat May 19 15:17:55 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0743731517302459", acknowledgement = ack-nhfb, fjournal = "Journal of Parallel and Distributed Computing", journal-URL = "http://www.sciencedirect.com/science/journal/07437315", } @Article{Khorandi:2018:NCO, author = "Sina Mahmoodi Khorandi and Mohsen Sharifi", title = "Non-clairvoyant online scheduling of synchronized jobs on virtual clusters", journal = j-J-SUPERCOMPUTING, volume = "74", number = "6", pages = "2353--2384", month = jun, year = "2018", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-018-2262-4", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Thu Oct 10 15:31:12 MDT 2019", bibsource = "http://link.springer.com/journal/11227/74/6; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Kim:2018:FSS, author = "Myungsun Kim and Soonhyun Noh and Jinhwa Hyeon and Seongsoo Hong", title = "Fair-share scheduling in single-{ISA} asymmetric multicore architecture via scaled virtual runtime and load redistribution", journal = j-J-PAR-DIST-COMP, volume = "111", number = "??", pages = "174--186", month = jan, year = "2018", CODEN = "JPDCER", ISSN = "0743-7315 (print), 1096-0848 (electronic)", ISSN-L = "0743-7315", bibdate = "Tue Oct 24 15:08:48 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0743731517302423", acknowledgement = ack-nhfb, fjournal = "Journal of Parallel and Distributed Computing", journal-URL = "http://www.sciencedirect.com/science/journal/07437315", } @Article{Kim:2018:LIG, author = "Dongkyun Kim and Yong-Hwan Kim and Ki-Hyun Kim and Joo-Beom Kim and Gi-Seong You and Joon-Min Gil", title = "Logically isolated group network for virtual convergence environment over {SD--WAN}", journal = j-J-SUPERCOMPUTING, volume = "74", number = "12", pages = "6742--6752", month = dec, year = "2018", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-018-2282-0", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Thu Oct 10 15:31:10 MDT 2019", bibsource = "http://link.springer.com/journal/11227/74/12; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Kim:2018:PSC, author = "Hyoseung Kim and Ragunathan (Raj) Rajkumar", title = "Predictable Shared Cache Management for Multi-Core Real-Time Virtualization", journal = j-TECS, volume = "17", number = "1", pages = "22:1--22:??", month = jan, year = "2018", CODEN = "????", DOI = "https://doi.org/10.1145/3092946", ISSN = "1539-9087 (print), 1558-3465 (electronic)", ISSN-L = "1539-9087", bibdate = "Thu Oct 17 18:16:34 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tecs.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Real-time virtualization has gained much attention for the consolidation of multiple real-time systems onto a single hardware platform while ensuring timing predictability. However, a shared last-level cache (LLC) on modern multi-core platforms can easily hamper the timing predictability of real-time virtualization due to the resulting temporal interference among consolidated workloads. Since such interference caused by the LLC is highly variable and may have not even existed in legacy systems to be consolidated, it poses a significant challenge for real-time virtualization. In this article, we propose a predictable shared cache management framework for multi-core real-time virtualization. Our framework introduces two hypervisor-level techniques, vLLC and vColoring, that enable the cache allocation of individual tasks running in a virtual machine (VM), which is not achievable by the current state of the art. Our framework also provides a cache management scheme that determines cache allocation to tasks, designs VMs in a cache-aware manner, and minimizes the aggregated utilization of VMs to be consolidated. As a proof of concept, we implemented vLLC and vColoring in the KVM hypervisor running on x86 and ARM multi-core platforms. Experimental results with three different guest OSs (i.e., Linux/RK, vanilla Linux, and MS Windows Embedded) show that our techniques can effectively control the cache allocation of tasks in VMs. Our cache management scheme yields a significant utilization benefit compared to other approaches while satisfying timing constraints.", acknowledgement = ack-nhfb, articleno = "22", fjournal = "ACM Transactions on Embedded Computing Systems", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J840", } @Article{Kimovski:2018:DEE, author = "Dragi Kimovski and Attila Marosi and Sandi Gec and Nishant Saurabh and Attila Kertesz and Gabor Kecskemeti and Vlado Stankovski and Radu Prodan", title = "Distributed environment for efficient virtual machine image management in federated {Cloud} architectures", journal = j-CCPE, volume = "30", number = "20", pages = "e4220:1--e4220:??", day = "25", month = oct, year = "2018", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.4220", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Thu Mar 28 08:07:52 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", onlinedate = "03 July 2017", } @Article{Kontoudis:2018:SAV, author = "Dimitris Kontoudis and Panayotis Fouliras", title = "A statistical approach to virtual server resource management", journal = j-CCPE, volume = "30", number = "4", pages = "??--??", day = "25", month = feb, year = "2018", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.4335", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Sat Aug 4 10:03:11 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://onlinelibrary.wiley.com/doi/abs/10.1002/cpe.4335", acknowledgement = ack-nhfb, fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", } @Article{Kotsifakou:2018:HHP, author = "Maria Kotsifakou and Prakalp Srivastava and Matthew D. Sinclair and Rakesh Komuravelli and Vikram Adve and Sarita Adve", title = "{HPVM}: heterogeneous parallel virtual machine", journal = j-SIGPLAN, volume = "53", number = "1", pages = "68--80", month = jan, year = "2018", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/3200691.3178493", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Oct 16 14:12:56 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/pvm.bib; https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "We propose a parallel program representation for heterogeneous systems, designed to enable performance portability across a wide range of popular parallel hardware, including GPUs, vector instruction sets, multicore CPUs and potentially FPGAs. Our representation, which we call HPVM, is a hierarchical dataflow graph with shared memory and vector instructions. HPVM supports three important capabilities for programming heterogeneous systems: a compiler intermediate representation (IR), a virtual instruction set (ISA), and a basis for runtime scheduling; previous systems focus on only one of these capabilities. As a compiler IR, HPVM aims to enable effective code generation and optimization for heterogeneous systems. As a virtual ISA, it can be used to ship executable programs, in order to achieve both functional portability and performance portability across such systems. At runtime, HPVM enables flexible scheduling policies, both through the graph structure and the ability to compile individual nodes in a program to any of the target devices on a system. We have implemented a prototype HPVM system, defining the HPVM IR as an extension of the LLVM compiler IR, compiler optimizations that operate directly on HPVM graphs, and code generators that translate the virtual ISA to NVIDIA GPUs, Intel's AVX vector units, and to multicore X86-64 processors. Experimental results show that HPVM optimizations achieve significant performance improvements, HPVM translators achieve performance competitive with manually developed OpenCL code for both GPUs and vector hardware, and that runtime scheduling policies can make use of both program and runtime information to exploit the flexible compilation capabilities. Overall, we conclude that the HPVM representation is a promising basis for achieving performance portability and for implementing parallelizing compilers for heterogeneous parallel systems.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "PPoPP '18 proceedings.", } @Article{Kuo:2018:DCV, author = "Tung-Wei Kuo and Bang-Heng Liou and Kate Ching-Ju Lin and Ming-Jer Tsai", title = "Deploying Chains of Virtual Network Functions: On the Relation Between Link and Server Usage", journal = j-IEEE-TRANS-NETWORKING, volume = "26", number = "4", pages = "1562--1576", month = aug, year = "2018", CODEN = "IEANEP", DOI = "https://doi.org/10.1109/TNET.2018.2842798", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Thu Oct 18 05:31:02 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Recently, network function virtualization has been proposed to transform from network hardware appliances to software middleboxes. Normally, a demand needs to invoke several virtual network functions VNFs following the order determined by the service chain along a routing path. In this paper, we study the joint problem of the VNF placement and path selection to better utilize the network. We discover that the relation between the link and server usage plays a crucial role in the problem. Inspired by stress testing, we first propose a systematic way to elastically tune the link and server usage of each demand based on the network status and properties of demands. In particular, we compute a proper routing path length, and decide, for each VNF in the service chain, whether to use additional server resources or to reuse resources provided by existing servers. We then propose a chain deployment algorithm that follows the guidance of this link and server usage. Via simulations, we show that our design effectively adapts resource allocation to network dynamics and, hence, serves more demands than other heuristics.", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771", } @Article{Lago:2018:EAV, author = "Daniel Guimaraes Lago and Edmundo R. M. Madeira and Deep Medhi", title = "Energy-Aware Virtual Machine Scheduling on Data Centers with Heterogeneous Bandwidths", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "29", number = "1", pages = "83--98", month = jan, year = "2018", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2017.2753247", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Thu Dec 14 07:22:41 MST 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.computer.org/csdl/trans/td/2018/01/08039210-abs.html", acknowledgement = ack-nhfb, journal-URL = "http://www.computer.org/tpds/archives.htm", } @Article{Lettieri:2018:SPV, author = "Giuseppe Lettieri and Vincenzo Maffione and Luigi Rizzo", title = "A Study of {I/O} Performance of Virtual Machines", journal = j-COMP-J, volume = "61", number = "6", pages = "808--831", day = "1", month = jun, year = "2018", CODEN = "CMPJA6", DOI = "https://doi.org/10.1093/comjnl/bxx092", ISSN = "0010-4620 (print), 1460-2067 (electronic)", ISSN-L = "0010-4620", bibdate = "Fri Aug 3 11:54:39 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://academic.oup.com/comjnl/article/61/6/808/4259797", acknowledgement = ack-nhfb, fjournal = "The Computer Journal", journal-URL = "http://comjnl.oxfordjournals.org/", } @Article{Li:2018:EAM, author = "Zhihua Li and Chengyu Yan and Lei Yu and Xinrong Yu", title = "Energy-aware and multi-resource overload probability constraint-based virtual machine dynamic consolidation method", journal = j-FUT-GEN-COMP-SYS, volume = "80", number = "??", pages = "139--156", month = mar, year = "2018", CODEN = "FGSEVI", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Sat Dec 2 16:58:42 MST 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X16307476", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Li:2018:HVM, author = "Xiang Li and Peter Garraghan and Xiaohong Jiang and Zhaohui Wu and Jie Xu", title = "Holistic Virtual Machine Scheduling in Cloud Datacenters towards Minimizing Total Energy", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "29", number = "6", pages = "1317--1331", month = jun, year = "2018", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2017.2688445", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Thu May 10 07:22:57 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.computer.org/csdl/trans/td/2018/06/07888576-abs.html", acknowledgement = ack-nhfb, journal-URL = "http://www.computer.org/tpds/archives.htm", } @Article{Li:2018:LCS, author = "Huixi Li and Wenjun Li and Qilong Feng and Shigeng Zhang and Haodong Wang and Jianxin Wang", title = "Leveraging content similarity among {VMI} files to allocate virtual machines in cloud", journal = j-FUT-GEN-COMP-SYS, volume = "79 (part 2)", number = "??", pages = "528--542", year = "2018", CODEN = "FGSEVI", DOI = "https://doi.org/10.1016/j.future.2017.09.058", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Fri Nov 24 15:16:17 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.sciencedirect.com/science/article/pii/S0167739X17300146", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", keywords = "Content sharing; Optimization; Virtual machine images; Virtual machine placement", } @Article{Li:2018:OVM, author = "Huixi Li and Wenjun Li and Haodong Wang and Jianxin Wang", title = "An optimization of virtual machine selection and placement by using memory content similarity for server consolidation in cloud", journal = j-FUT-GEN-COMP-SYS, volume = "84", number = "??", pages = "98--107", month = jul, year = "2018", CODEN = "FGSEVI", DOI = "https://doi.org/10.1016/j.future.2018.02.026", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Mon Apr 16 14:45:08 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.sciencedirect.com/science/article/pii/S0167739X17323063", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Li:2018:TFV, author = "Junfeng Li and Dan Li and Yirong Yu and Yukai Huang and Jing Zhu and Jinkun Geng", title = "Towards full virtualization of {SDN} infrastructure", journal = j-COMP-NET-AMSTERDAM, volume = "143", number = "??", pages = "ii--ii", day = "9", month = oct, year = "2018", CODEN = "????", DOI = "https://doi.org/10.1016/j.comnet.2018.06.014", ISSN = "1389-1286 (print), 1872-7069 (electronic)", ISSN-L = "1389-1286", bibdate = "Thu Sep 13 14:39:28 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1389128618303852", acknowledgement = ack-nhfb, fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)", journal-URL = "http://www.sciencedirect.com/science/journal/13891286/", } @Article{Liu:2018:CAL, author = "Jiayi Liu and Qinghai Yang and Gwendal Simon and Jiayi Liu and Gwendal Simon and Qinghai Yang", title = "Congestion Avoidance and Load Balancing in Content Placement and Request Redirection for Mobile {CDN}", journal = j-IEEE-TRANS-NETWORKING, volume = "26", number = "2", pages = "851--863", month = apr, year = "2018", CODEN = "IEANEP", DOI = "https://doi.org/10.1109/TNET.2018.2804979", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Fri Apr 20 17:34:21 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "With the development of network function virtualization and software-defined network standards, the mobile network operators are interested in integrating content delivery network CDN functionalities into the mobile network to enhance their capability for supporting content oriented services. We consider a mobile CDN system, where Base Stations BSs are equipped with storage for replicating content. In such a system, BSs cooperation in replying user requests through backhaul links is a widely adopted mechanism. Blindly redirect user requests upon content placement can cause traffic congestion. As a result, congestion avoidance and load balancing is an important issue to be tackled in this scenario. We investigated the joint optimization problem of content placement and request redirection for the BS-based mobile CDN. Specifically, each BS maintains a transmission queue for replying requests issued from other BSs. Network congestion and BSs load balancing can be jointly considered through guaranteeing network stability. We employ the stochastic optimization model to minimize the long-term time-average transmission cost under network stability constraints. By using the Lyapunov optimization technique, we transform the long-term problem into a set of linear programs solved in each short time duration, and we develop an on-line algorithm to efficiently decide content placement and request redirection without requiring a priori knowledge on the random network state information. Through our theoretical analysis, the performance of the algorithm on optimality and network stability is given. The evaluation confirms that our solution can achieve low transmission cost, whilst avoiding congestion and balancing traffic loads.", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771", } @Article{Liu:2018:SPM, author = "Xi Liu and Weidong Li and Xuejie Zhang", title = "Strategy-Proof Mechanism for Provisioning and Allocation Virtual Machines in Heterogeneous Clouds", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "29", number = "7", pages = "1650--1663", month = jul, year = "2018", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2017.2785815", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Thu Jun 14 08:35:31 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.computer.org/csdl/trans/td/2018/07/08241849-abs.html", acknowledgement = ack-nhfb, journal-URL = "http://www.computer.org/tpds/archives.htm", } @Article{Liu:2018:TBG, author = "Jialei Liu and Shangguang Wang and Ao Zhou and Xiang Xu and Sathish A. P. Kumar and Fangchun Yang", title = "Towards Bandwidth Guaranteed Virtual Cluster Reallocation in the Cloud", journal = j-COMP-J, volume = "61", number = "9", pages = "1284--1295", day = "1", month = sep, year = "2018", CODEN = "CMPJA6", DOI = "https://doi.org/10.1093/comjnl/bxx113", ISSN = "0010-4620 (print), 1460-2067 (electronic)", ISSN-L = "0010-4620", bibdate = "Thu Aug 30 15:17:48 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://academic.oup.com/comjnl/article/61/9/1284/4779880", acknowledgement = ack-nhfb, fjournal = "Computer Journal", journal-URL = "http://comjnl.oxfordjournals.org/", } @Article{Lopez-Pires:2018:VMP, author = "Fabio L{\'o}pez-Pires and Benjam{\'\i}n Bar{\'a}n and Leonardo Ben{\'\i}tez and Sa{\'u}l Zalimben and Augusto Amarilla", title = "Virtual machine placement for elastic infrastructures in overbooked cloud computing datacenters under uncertainty", journal = j-FUT-GEN-COMP-SYS, volume = "79 (part 3)", number = "??", pages = "830--848", month = feb, year = "2018", CODEN = "FGSEVI", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Wed Nov 15 14:36:32 MST 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X17303126", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Ludwig:2018:TPC, author = "Arne Ludwig and Szymon Dudycz and Matthias Rost and Stefan Schmid", title = "Transiently Policy-Compliant Network Updates", journal = j-IEEE-TRANS-NETWORKING, volume = "26", number = "6", pages = "2569--2582", month = dec, year = "2018", CODEN = "IEANEP", DOI = "https://doi.org/10.1109/TNET.2018.2871023", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Mon Feb 4 19:39:59 MST 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Computer networks have become a critical infrastructure. It is hence increasingly important to guarantee a correct, consistent, and secure network operation at any time, even during route updates. However, most existing works on consistent network update protocols focus on connectivity properties only e.g., loop-freedom while ignoring basic security policies. This paper studies how to update routes in a software-defined network in a transiently policy-compliant manner. In particular, our goal is to enforce waypoints: at no point in time should it be possible for packets to bypass security critical network functions such as a firewall. This problem is timely, given the advent of network function virtualization which envisions more flexible middlebox deployments, not limited to the network edge. This paper shows that enforcing waypoint traversal in transient states can be challenging: waypoint enforcement can conflict with loop-freedom. Even worse, we rigorously prove that deciding whether a waypoint enforcing, loop-free network update schedule exists is NP-hard. These results hold for both kinds of loop-freedom used in the literature: strong and relaxed loop-freedom. This paper also presents optimized, exact mixed integer programs to decide feasibility quickly and to compute optimal update schedules. We report on extensive simulation results, and also study scenarios where entire ``service chains,'' connecting multiple waypoints, need to be updated consistently.", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771", } @Article{Luo:2018:IPN, author = "Gangyi Luo and Zhuzhong Qian and Mianxiong Dong and Kaoru Ota and Sanglu Lu", title = "Improving performance by network-aware virtual machine clustering and consolidation", journal = j-J-SUPERCOMPUTING, volume = "74", number = "11", pages = "5846--5864", month = nov, year = "2018", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-017-2104-9", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Thu Oct 10 15:31:09 MDT 2019", bibsource = "http://link.springer.com/journal/11227/74/11; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Ma:2018:GEG, author = "Jiacheng Ma and Xiao Zheng and Yaozu Dong and Wentai Li and Zhengwei Qi and Bingsheng He and Haibing Guan", title = "{gMig}: Efficient {GPU} Live Migration Optimized by Software Dirty Page for Full Virtualization", journal = j-SIGPLAN, volume = "53", number = "3", pages = "31--44", month = mar, year = "2018", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/3296975.3186414", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Oct 16 14:12:57 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "This paper introduces gMig, an open-source and practical GPU live migration solution for full virtualization. By taking advantage of the dirty pattern of GPU workloads, gMig presents the One-Shot Pre-Copy combined with the hashing based Software Dirty Page technique to achieve efficient GPU live migration. Particularly, we propose three approaches for gMig: (1) Dynamic Graphics Address Remapping, which parses and manipulates GPU commands to adjust the address mapping to adapt to a different environment after migration, (2) Software Dirty Page, which utilizes a hashing based approach to detect page modification, overcomes the commodity GPU's hardware limitation, and speeds up the migration by only sending the dirtied pages, (3) One-Shot Pre-Copy, which greatly reduces the rounds of pre-copy of graphics memory. Our evaluation shows that gMig achieves GPU live migration with an average downtime of 302 ms on Windows and 119 ms on Linux. With the help of Software Dirty Page, the number of GPU pages transferred during the downtime is effectively reduced by 80.0\%.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "VEE '18 proceedings.", } @Article{Malandrino:2018:VBE, author = "Francesco Malandrino and Carla-Fabiana Chiasserini and Claudio Casetti", title = "Virtualization-based evaluation of backhaul performance in vehicular applications", journal = j-COMP-NET-AMSTERDAM, volume = "134", number = "??", pages = "93--104", day = "7", month = apr, year = "2018", CODEN = "????", DOI = "https://doi.org/10.1016/j.comnet.2018.01.018", ISSN = "1389-1286 (print), 1872-7069 (electronic)", ISSN-L = "1389-1286", bibdate = "Sat Mar 17 13:11:52 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib; https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1389128618300276", acknowledgement = ack-nhfb, fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)", journal-URL = "http://www.sciencedirect.com/science/journal/13891286/", } @Article{Mann:2018:CSI, author = "Zolt{\'a}n {\'A}d{\'a}m Mann", title = "Cloud simulators in the implementation and evaluation of virtual machine placement algorithms", journal = j-SPE, volume = "48", number = "7", pages = "1368--1389", month = jul, year = "2018", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/spe.2579", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Sat Aug 4 10:20:33 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://onlinelibrary.wiley.com/doi/abs/10.1002/spe.2579", acknowledgement = ack-nhfb, fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", onlinedate = "17 April 2018", } @Article{Marotta:2018:JPE, author = "Antonio Marotta and Stefano Avallone and Andreas Kassler", title = "A Joint Power Efficient Server and Network Consolidation approach for virtualized data centers", journal = j-COMP-NET-AMSTERDAM, volume = "130", number = "??", pages = "65--80", day = "15", month = jan, year = "2018", CODEN = "????", ISSN = "1389-1286 (print), 1872-7069 (electronic)", ISSN-L = "1389-1286", bibdate = "Fri Jan 5 05:57:59 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1389128617304012", acknowledgement = ack-nhfb, fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)", journal-URL = "http://www.sciencedirect.com/science/journal/13891286/", } @Article{Mashimo:2018:VMS, author = "Susumu Mashimo and Ryota Shioya and Koji Inoue", title = "{VMOR}: Microarchitectural Support for Operand Access in an Interpreter", journal = j-IEEE-COMPUT-ARCHIT-LETT, volume = "17", number = "2", pages = "217--220", month = jul # "\slash " # dec, year = "2018", CODEN = "????", DOI = "https://doi.org/10.1109/LCA.2018.2866243", ISSN = "1556-6056 (print), 1556-6064 (electronic)", ISSN-L = "1556-6056", bibdate = "Tue Jun 25 07:41:05 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib; https://www.math.utah.edu/pub/tex/bib/ieeecomputarchitlett.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Dynamic scripting languages become very popular for high productivity. However, many of these languages have significant runtime overheads because they employ interpreter-based virtual machines. One of the major overheads for the interpreter is derived from operand accesses, which significantly increase memory accesses. We propose VMOR, microarchitectural support for the operand accesses in the interpreter. VMOR remaps operand values into floating-point physical registers, which are rarely used in the interpreter, and thus. VMOR effectively reduces the memory accesses.", acknowledgement = ack-nhfb, affiliation = "Mashimo, S (Reprint Author), Kyushu Univ, Fukuoka, Fukuoka 8190395, Japan. Mashimo, Susumu; Inoue, Koji, Kyushu Univ, Fukuoka, Fukuoka 8190395, Japan. Shioya, Ryota, Nagoya Univ, Nagoya, Aichi 4648601, Japan.", author-email = "susumu.mashimo@cpc.ait.kyushu-u.ac.jp shioya@nuee.nagoya-u.ac.jp inoue@ait.kyushu-u.ac.jp", da = "2019-06-20", doc-delivery-number = "HA2CO", eissn = "1556-6064", fjournal = "IEEE Computer Architecture Letters", funding-acknowledgement = "JSPS KAKENHI [JP17J10388]", funding-text = "This work was supported by JSPS KAKENHI Grant Number JP17J10388.", journal-iso = "IEEE Comput. Archit. Lett.", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=10208", keywords = "authoring languages; Cryptography; Dynamic scripting language; dynamic scripting languages; floating-point physical registers; Hardware; high productivity; interpreter; interpreter-based virtual machines; memory accesses; microarchitectural support; Microarchitecture; operand access; operand values; Pipelines; Productivity; program interpreters; Proposals; Registers; virtual machines; VMOR", number-of-cited-references = "10", research-areas = "Computer Science", times-cited = "0", unique-id = "Mashimo:2018:VMS", web-of-science-categories = "Computer Science, Hardware \& Architecture", } @Article{Meier:2018:VMD, author = "Remigius Meier and Armin Rigo and Thomas R. Gross", title = "Virtual machine design for parallel dynamic programming languages", journal = j-PACMPL, volume = "2", number = "OOPSLA", pages = "109:1--109:25", month = oct, year = "2018", DOI = "https://doi.org/10.1145/3276479", bibdate = "Sat Aug 8 07:56:30 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/pacmpl.bib; https://www.math.utah.edu/pub/tex/bib/python.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/abs/10.1145/3276479", abstract = "To leverage the benefits of modern hardware, dynamic languages must support parallelism, and parallelism requires a virtual machine (VM) capable of parallel execution --- a parallel VM. However, unrestricted concurrency and the dynamism of dynamic languages pose great challenges to the implementation of parallel VMs. In a dynamic language, a program changing itself is part of the language model. To help the VM, languages often choose memory models (MM) that weaken consistency guarantees. With lesser guarantees, local program state cannot be affected by every concurrent state change. And less interference allows a VM to make local assumptions about the program state which are not immediately violated. These local assumptions are essential for a VM's just-in-time compiler for delivering state-of-the-art VM performance.\par Unfortunately, some dynamic languages employ MMs that give exceedingly strong consistency guarantees and thereby hinder the development of parallel VMs. Such is the case in particular for languages that depend on a global interpreter lock, which mandates a MM with sequential consistency and instruction atomicity.\par In this paper, we reflect on a first implementation of the Parallel RPython execution model, which facilitates the development of parallel VMs by decoupling language semantics from the synchronization mechanism used within the VM. The implementation addresses the challenges imposed by strong MMs through strict isolation of concurrent computations. This isolation builds on transactional parallel worlds, which are implemented with a novel combination of software techniques and the capabilities of modern hardware.\par We evaluate a set of parallel Python programs on a parallel VM that relies on Parallel RPython's implementation. Compared with a serial baseline VM that relies on a global interpreter lock, the parallel VM achieves speedups of up to $ 7.5 \times $ on 8 CPU cores. The evaluation shows that our realization of Parallel RPython meets the challenges of dynamic languages, and that it can serve as a solid foundation for the construction of parallel dynamic language VMs.", acknowledgement = ack-nhfb, articleno = "109", fjournal = "Proceedings of the ACM on Programming Languages", journal-URL = "https://pacmpl.acm.org/", } @Article{Meloni:2018:CBI, author = "A. Meloni and P. A. Pegoraro and L. Atzori and A. Benigni and S. Sulis", title = "Cloud-based {IoT} solution for state estimation in smart grids: Exploiting virtualization and edge-intelligence technologies", journal = j-COMP-NET-AMSTERDAM, volume = "130", number = "??", pages = "156--165", day = "15", month = jan, year = "2018", CODEN = "????", ISSN = "1389-1286 (print), 1872-7069 (electronic)", ISSN-L = "1389-1286", bibdate = "Fri Jan 5 05:57:59 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1389128617303912", acknowledgement = ack-nhfb, fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)", journal-URL = "http://www.sciencedirect.com/science/journal/13891286/", } @Article{Miao:2018:VMA, author = "Xuna Miao and Xiaobo Wu", title = "Virtual machine anomaly detection strategy based on cloud platform operating environment perception", journal = j-CCPE, volume = "30", number = "22", pages = "e4656:1--e4656:??", day = "25", month = nov, year = "2018", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.4656", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Thu Mar 28 08:07:52 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", onlinedate = "27 August 2018", } @Article{Montella:2018:MBP, author = "Raffaele Montella and Livia Marcellino and Ardelio Galletti and Diana {Di Luccio} and Sokol Kosta and Giuliano Laccetti and Giulio Giunta", title = "Marine bathymetry processing through {GPGPU} virtualization in high performance cloud computing", journal = j-CCPE, volume = "30", number = "24", pages = "e4895:1--e4895:??", day = "25", month = dec, year = "2018", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.4895", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Thu Mar 28 08:07:53 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", onlinedate = "12 September 2018", } @Article{Nagy:2018:NVI, author = "Mate Nagy and Janos Tapolcai and Gabor Retvari", title = "Node Virtualization for {IP} Level Resilience", journal = j-IEEE-TRANS-NETWORKING, volume = "26", number = "3", pages = "1250--1263", month = jun, year = "2018", CODEN = "IEANEP", DOI = "https://doi.org/10.1109/TNET.2018.2829399", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Thu Oct 18 05:31:01 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "For Internet protocol IP to evolve into a true carrier-grade transport facility, it needs to support fast resilience out-of-the-box. IP-level failure protection based on the IP fast reroute/loop-free alternates LFA specification has become industrial requirement recently. The success of LFA lies in its inherent simplicity, but this comes at the expense of letting certain failure scenarios go unprotected. Realizing full failure coverage with LFA so far has only been possible through completely re-engineering the network around LFA-compliant design patterns. In this paper, we show that attaining high LFA coverage is possible without any alteration to the installed IP infrastructure, by introducing a carefully designed virtual overlay on top of the physical network that provides LFAs to otherwise unprotected routers. Our main contribution is formulating the corresponding resilient IP overlay design problem and providing constructions that can achieve full failure coverage against single link failures by adding at most four virtual nodes to each physical one. We also show that the problem of finding the minimal number of virtual nodes achieving full failure coverage is NP-hard, and thus propose heuristic algorithms that are guaranteed to terminate with a fully protected topology in polynomial time. According to the numerical evaluations the performance of our algorithm is on par with, or even better than, that of previous ones, lending itself as the first practically viable option to build highly resilient IP networks.", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771", } @Article{Naranjo:2018:DEE, author = "Paola G. Vinueza Naranjo and Enzo Baccarelli and Michele Scarpiniti", title = "Design and energy-efficient resource management of virtualized networked Fog architectures for the real-time support of {IoT} applications", journal = j-J-SUPERCOMPUTING, volume = "74", number = "6", pages = "2470--2507", month = jun, year = "2018", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-018-2274-0", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Thu Oct 10 15:31:12 MDT 2019", bibsource = "http://link.springer.com/journal/11227/74/6; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Nguyen:2018:CCE, author = "Tuan Anh Nguyen and Dugki Min and Eunmi Choi", title = "Correction to: {A comprehensive evaluation of availability and operational cost for a virtualized server system using stochastic reward nets}", journal = j-J-SUPERCOMPUTING, volume = "74", number = "6", pages = "2903--2903", month = jun, year = "2018", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-018-2428-0", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Thu Oct 10 15:31:12 MDT 2019", bibsource = "http://link.springer.com/journal/11227/74/6; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "See \cite{Nguyen:2018:CEA}.", URL = "http://link.springer.com/content/pdf/10.1007/s11227-018-2428-0.pdf", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Nguyen:2018:CEA, author = "Tuan Anh Nguyen and Dugki Min and Eunmi Choi", title = "A comprehensive evaluation of availability and operational cost for a virtualized server system using stochastic reward nets", journal = j-J-SUPERCOMPUTING, volume = "74", number = "1", pages = "222--276", month = jan, year = "2018", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-017-2127-2", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Sat Jan 6 08:59:19 MST 2018", bibsource = "http://link.springer.com/journal/11227/74/1; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "See correction \cite{Nguyen:2018:CCE}.", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Nitu:2018:WSS, author = "Vlad Nitu and Aram Kocharyan and Hannas Yaya and Alain Tchana and Daniel Hagimont and Hrachya Astsatryan", title = "Working Set Size Estimation Techniques in Virtualized Environments: One Size Does not Fit All", journal = j-SIGMETRICS, volume = "46", number = "1", pages = "62--63", month = jun, year = "2018", CODEN = "????", DOI = "https://doi.org/10.1145/3292040.3219642", ISSN = "0163-5999 (print), 1557-9484 (electronic)", ISSN-L = "0163-5999", bibdate = "Fri Jan 18 06:03:57 MST 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigmetrics.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Energy consumption is a primary concern for datacenters' management. Numerous datacenters are relying on virtualization, as it provides flexible resource management means such as virtual machine (VM) checkpoint/restart, migration and consolidation. However, one of the main hindrances to server consolidation is physical memory. In nowadays cloud, memory is generally statically allocated to VMs and wasted if not used. Techniques (such as ballooning) were introduced for dynamically reclaiming memory from VMs, such that only the needed memory is provisioned to each VM. However, the challenge is to precisely monitor the needed memory, i.e., the working set of each VM. In this paper, we thoroughly review the main techniques that were proposed for monitoring the working set of VMs. Additionally, we have implemented the main techniques in the Xen hypervisor and we have defined different metrics in order to evaluate their efficiency. Based on the evaluation results, we propose Badis, a system which combines several of the existing solutions, using the right solution at the right time. We also propose a consolidation extension which leverages Badis in order to pack the VMs based on the working set size and not the booked memory.", acknowledgement = ack-nhfb, fjournal = "ACM SIGMETRICS Performance Evaluation Review", journal-URL = "http://portal.acm.org/toc.cfm?id=J618", } @Article{Noshy:2018:OLV, author = "Mostafa Noshy and Abdelhameed Ibrahim and Hesham Arafat Ali", title = "Optimization of live virtual machine migration in cloud computing: A survey and future directions", journal = j-J-NETW-COMPUT-APPL, volume = "110", number = "??", pages = "1--10", day = "15", month = may, year = "2018", CODEN = "JNCAF3", DOI = "https://doi.org/10.1016/j.jnca.2018.03.002", ISSN = "1084-8045 (print), 1095-8592 (electronic)", ISSN-L = "1084-8045", bibdate = "Sun May 27 08:10:15 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1084804518300833", acknowledgement = ack-nhfb, fjournal = "Journal of Network and Computer Applications", journal-URL = "http://www.sciencedirect.com/science/journal/10848045", } @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{Pahl:2018:APC, author = "Claus Pahl and Pooyan Jamshidi and Olaf Zimmermann", title = "Architectural Principles for Cloud Software", journal = j-TOIT, volume = "18", number = "2", pages = "17:1--17:??", month = mar, year = "2018", CODEN = "????", DOI = "https://doi.org/10.1145/3104028", ISSN = "1533-5399 (print), 1557-6051 (electronic)", ISSN-L = "1533-5399", bibdate = "Sat Sep 21 07:34:08 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/toit.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "A cloud is a distributed Internet-based software system providing resources as tiered services. Through service-orientation and virtualization for resource provisioning, cloud applications can be deployed and managed dynamically. We discuss the building blocks of an architectural style for cloud-based software systems. We capture style-defining architectural principles and patterns for control-theoretic, model-based architectures for cloud software. While service orientation is agreed on in the form of service-oriented architecture and microservices, challenges resulting from multi-tiered, distributed and heterogeneous cloud architectures cause uncertainty that has not been sufficiently addressed. We define principles and patterns needed for effective development and operation of adaptive cloud-native systems.", acknowledgement = ack-nhfb, articleno = "17", fjournal = "ACM Transactions on Internet Technology (TOIT)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780", } @Article{Pascual:2018:ERV, author = "Jose A. Pascual and Jose A. Lozano and Jose Miguel-Alonso", title = "Effects of Reducing {VMs} Management Times on Elastic Applications", journal = j-J-GRID-COMP, volume = "16", number = "3", pages = "513--530", month = sep, year = "2018", CODEN = "????", DOI = "https://doi.org/10.1007/s10723-018-9441-7", ISSN = "1570-7873 (print), 1572-9184 (electronic)", ISSN-L = "1570-7873", bibdate = "Wed Sep 26 10:02:59 MDT 2018", bibsource = "http://link.springer.com/journal/10723/16/3; https://www.math.utah.edu/pub/tex/bib/jgridcomp.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://link.springer.com/article/10.1007/s10723-018-9441-7", acknowledgement = ack-nhfb, fjournal = "Journal of Grid Computing", journal-URL = "http://link.springer.com/journal/10723", } @Article{Paulraj:2018:RAV, author = "Getzi Jeba Leelipushpam Paulraj and Sharmila Anand John Francis and J. Dinesh Peter and Immanuel Johnraja Jebadurai", title = "Resource-aware virtual machine migration in {IoT} cloud", journal = j-FUT-GEN-COMP-SYS, volume = "85", number = "??", pages = "173--183", month = aug, year = "2018", CODEN = "FGSEVI", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Thu Apr 19 14:05:57 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.sciencedirect.com/science/article/pii/S0167739X17322471", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Pease:2018:IRT, author = "Sarogini Grace Pease and Russell Trueman and Callum Davies and Jude Grosberg and Kai Hin Yau and Navjot Kaur and Paul Conway and Andrew West", title = "An intelligent real-time cyber-physical toolset for energy and process prediction and optimisation in the future industrial {Internet of Things}", journal = j-FUT-GEN-COMP-SYS, volume = "79 (part 3)", number = "??", pages = "815--829", month = feb, year = "2018", CODEN = "FGSEVI", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Wed Nov 15 14:36:32 MST 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X1630382X", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @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{Pickartz:2018:PCV, author = "Simon Pickartz and Carsten Clauss and Jens Breitbart and Stefan Lankes and Antonello Monti", title = "Prospects and challenges of virtual machine migration in {HPC}", journal = j-CCPE, volume = "30", number = "9", pages = "", day = "10", month = may, year = "2018", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.4412", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Sat Aug 4 10:03:13 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://onlinelibrary.wiley.com/doi/abs/10.1002/cpe.4412", acknowledgement = ack-nhfb, fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", } @Article{Psychas:2018:NPV, author = "Konstantinos Psychas and Javad Ghaderi", title = "On Non-Preemptive {VM} Scheduling in the Cloud", journal = j-SIGMETRICS, volume = "46", number = "1", pages = "67--69", month = jun, year = "2018", CODEN = "????", DOI = "https://doi.org/10.1145/3292040.3219644", ISSN = "0163-5999 (print), 1557-9484 (electronic)", ISSN-L = "0163-5999", bibdate = "Fri Jan 18 06:03:57 MST 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigmetrics.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "We study the problem of scheduling VMs (Virtual Machines) in a distributed server platform, motivated by cloud computing applications. The VMs arrive dynamically over time to the system, and require a certain amount of resources (e.g. memory, CPU, etc) for the duration of their service. To avoid costly preemptions, we consider non-preemptive scheduling: Each VM has to be assigned to a server which has enough residual capacity to accommodate it, and once a VM is assigned to a server, its service cannot be disrupted (preempted). Prior approaches to this problem either have high complexity, require synchronization among the servers, or yield queue sizes/delays which are excessively large. We propose a non-preemptive scheduling algorithm that resolves these issues. In general, given an approximation algorithm to Knapsack with approximation ratio r, our scheduling algorithm can provide $ r \beta $ fraction of the throughput region for $ \beta < r $. In the special case of a greedy approximation algorithm to Knapsack, we further show that this condition can be relaxed to $ \beta < 1 $. The parameters $ \beta $ and $r$ can be tuned to provide a tradeoff between achievable throughput, delay, and computational complexity of the scheduling algorithm. Finally extensive simulation results using both synthetic and real traffic traces are presented to verify the performance of our algorithm.", acknowledgement = ack-nhfb, fjournal = "ACM SIGMETRICS Performance Evaluation Review", journal-URL = "http://portal.acm.org/toc.cfm?id=J618", } @Article{Qu:2018:IEE, author = "Xilong Qu and Peng Xiao and Lirong Huang", title = "Improving the energy efficiency and performance of data-intensive workflows in virtualized clouds", journal = j-J-SUPERCOMPUTING, volume = "74", number = "7", pages = "2935--2955", month = jul, year = "2018", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-018-2344-3", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Thu Oct 10 15:31:13 MDT 2019", bibsource = "http://link.springer.com/journal/11227/74/7; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{R:2018:SDM, author = "Jithin R and Priya Chandran", title = "Secure and Dynamic Memory Management Architecture for Virtualization Technologies in {IoT} Devices", journal = j-FUTURE-INTERNET, volume = "10", number = "12", pages = "119", day = "30", month = nov, year = "2018", CODEN = "????", DOI = "https://doi.org/10.3390/fi10120119", ISSN = "1999-5903", ISSN-L = "1999-5903", bibdate = "Thu Nov 21 16:51:03 MST 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib; https://www.math.utah.edu/pub/tex/bib/future-internet.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.mdpi.com/1999-5903/10/12/119", abstract = "The introduction of the internet in embedded devices led to a new era of technology --- the Internet of Things (IoT) era. The IoT technology-enabled device market is growing faster by the day, due to its complete acceptance in diverse areas such as domicile systems, the automobile industry, and beyond. The introduction of internet connectivity in objects that are frequently used in daily life raises the question of security --- how secure is the information and the infrastructure handled by these devices when they are connected to the internet? Security enhancements through standard cryptographic techniques are not suitable due to the power and performance constraints of IoT devices. The introduction of virtualization technology into IoT devices is a recent development, meant for fulfilling security and performance needs. However, virtualization augments the vulnerability present in IoT devices, due to the addition of one more software layer --- namely, the hypervisor, which enables the sharing of resources among different users. This article proposes the adaptation of ASMI (Architectural Support for Memory Isolation --- a general architecture available in the literature for the improvement of the performance and security of virtualization technology) on the popular MIPS (Microprocessor without Interlocked Pipeline Stages) embedded virtualization platform, which could be adopted in embedded virtualization architectures for IoT devices. The article illustrates the performance enhancement achieved by the proposed architecture with the existing architectures.", acknowledgement = ack-nhfb, journal-URL = "https://www.mdpi.com/journal/futureinternet", remark = "Special Issue IoT Security and Privacy.", } @Article{Rahmanian:2018:LAB, author = "Ali Asghar Rahmanian and Mostafa Ghobaei-Arani and Sajjad Tofighy", title = "A learning automata-based ensemble resource usage prediction algorithm for cloud computing environment", journal = j-FUT-GEN-COMP-SYS, volume = "79 (part 1)", number = "??", pages = "54--71", year = "2018", CODEN = "FGSEVI", DOI = "https://doi.org/10.1016/j.future.2017.09.049", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Fri Nov 24 15:16:17 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.sciencedirect.com/science/article/pii/S0167739X17309378", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", keywords = "Cloud computing environment; Ensemble algorithm; Learning automata; Prediction; Virtual machine", } @Article{Ranjbari:2018:LAB, author = "Milad Ranjbari and Javad Akbari Torkestani", title = "A learning automata-based algorithm for energy and {SLA} efficient consolidation of virtual machines in cloud data centers", journal = j-J-PAR-DIST-COMP, volume = "113", number = "??", pages = "55--62", month = mar, year = "2018", CODEN = "JPDCER", ISSN = "0743-7315 (print), 1096-0848 (electronic)", ISSN-L = "0743-7315", bibdate = "Sat Jan 13 12:26:41 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S074373151730285X", acknowledgement = ack-nhfb, fjournal = "Journal of Parallel and Distributed Computing", journal-URL = "http://www.sciencedirect.com/science/journal/07437315", } @Article{Ren:2018:LHA, author = "Shiru Ren and Le Tan and Chunqi Li and Zhen Xiao and Weijia Song", title = "Leveraging Hardware-Assisted Virtualization for Deterministic Replay on Commodity Multi-Core Processors", journal = j-IEEE-TRANS-COMPUT, volume = "67", number = "1", pages = "45--58", month = jan, year = "2018", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.2017.2727492", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Thu Dec 14 07:11:27 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://ieeexplore.ieee.org/document/7982675/", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Computers", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", keywords = "Computer architecture; Deterministic replay; Hardware; multi-core; Program processors; Protocols; Virtual machine monitors; Virtualization; virtualization", } @Article{Riahi:2018:MOD, author = "Montassar Riahi and Saoussen Krichen", title = "A multi-objective decision support framework for virtual machine placement in cloud data centers: a real case study", journal = j-J-SUPERCOMPUTING, volume = "74", number = "7", pages = "2984--3015", month = jul, year = "2018", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-018-2348-z", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Thu Oct 10 15:31:13 MDT 2019", bibsource = "http://link.springer.com/journal/11227/74/7; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Ricci:2018:LSC, author = "Laura Ricci and Alexandru Iosup and Radu Prodan", title = "Large Scale Cooperative Virtual Environments", journal = j-CCPE, volume = "30", number = "20", pages = "e4878:1--e4878:??", day = "25", month = oct, year = "2018", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.4878", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Thu Mar 28 08:07:52 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", onlinedate = "27 July 2018", } @Article{Rodrigues:2018:CAS, author = "Tiago Gama Rodrigues and Katsuya Suto and Hiroki Nishiyama and Nei Kato and Katsuhiro Temma", title = "Cloudlets Activation Scheme for Scalable Mobile Edge Computing with Transmission Power Control and Virtual Machine Migration", journal = j-IEEE-TRANS-COMPUT, volume = "67", number = "9", pages = "1287--1300", month = "????", year = "2018", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.2018.2818144", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Thu Aug 9 10:45:38 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://ieeexplore.ieee.org/document/8322166/", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Computers", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", } @Article{Ruprecht:2018:VLM, author = "Adam Ruprecht and Danny Jones and Dmitry Shiraev and Greg Harmon and Maya Spivak and Michael Krebs and Miche Baker-Harvey and Tyler Sanderson", title = "{VM} Live Migration At Scale", journal = j-SIGPLAN, volume = "53", number = "3", pages = "45--56", month = mar, year = "2018", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/3296975.3186415", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Oct 16 14:12:57 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Uninterrupted uptime is a critical aspect of Virtual Machines (VMs) offered by cloud hosting providers. Google's VMs run on top of rapidly changing infrastructure: we regularly update hardware and host software, and we must quickly respond to failing hardware. Frequent change is critical to both development velocity---deploying new versions of services and infrastructure---and the ability to respond rapidly to defects, including critical security fixes. Typically these updates would be disruptive, resulting in VM termination or restart. In this paper we present how we use VM live migration at scale to eliminate this disruption with minimal impact to the guest, performing over 1,000,0001migrations monthly in our production fleet, with 50ms median blackout, 300ms 99th percentile blackout.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "VEE '18 proceedings.", } @Article{Saber:2018:VRH, author = "Takfarinas Saber and James Thorburn and Liam Murphy and Anthony Ventresque", title = "{VM} reassignment in hybrid clouds for large decentralised companies: A multi-objective challenge", journal = j-FUT-GEN-COMP-SYS, volume = "79 (part 2)", number = "??", pages = "751--764", year = "2018", CODEN = "FGSEVI", DOI = "https://doi.org/10.1016/j.future.2017.06.015", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Fri Nov 24 15:16:17 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.sciencedirect.com/science/article/pii/S0167739X17301164", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", keywords = "Hybrid algorithms; Hybrid clouds; Interval objective; Large decentralised data centres; Multi-objective optimisation; VM reassignment", } @Article{Santos:2018:HDD, author = "Eddie Antonio Santos and Carson McLean and Christopher Solinas and Abram Hindle", title = "How does {Docker} affect energy consumption? {Evaluating} workloads in and out of {Docker} containers", journal = j-J-SYST-SOFTW, volume = "146", number = "??", pages = "14--25", month = dec, year = "2018", CODEN = "JSSODM", DOI = "https://doi.org/10.1016/j.jss.2018.07.077", ISSN = "0164-1212 (print), 1873-1228 (electronic)", ISSN-L = "0164-1212", bibdate = "Fri Sep 21 11:49:12 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0164121218301456", acknowledgement = ack-nhfb, fjournal = "Journal of Systems and Software", journal-URL = "http://www.sciencedirect.com/science/journal/01641212", } @Article{Scarpiniti:2018:EPH, author = "Michele Scarpiniti and Enzo Baccarelli and Paola G. Vinueza Naranjo and Aurelio Uncini", title = "Energy performance of heuristics and meta-heuristics for real-time joint resource scaling and consolidation in virtualized networked data centers", journal = j-J-SUPERCOMPUTING, volume = "74", number = "5", pages = "2161--2198", month = may, year = "2018", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-018-2244-6", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Thu Oct 10 15:31:12 MDT 2019", bibsource = "http://link.springer.com/journal/11227/74/5; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Shen:2018:RDM, author = "Haiying Shen and Liuhua Chen", title = "Resource Demand Misalignment: an Important Factor to Consider for Reducing Resource Over-Provisioning in Cloud Datacenters", journal = j-IEEE-TRANS-NETWORKING, volume = "26", number = "3", pages = "1207--1221", month = jun, year = "2018", CODEN = "IEANEP", DOI = "https://doi.org/10.1109/TNET.2018.2823642", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Thu Oct 18 05:31:01 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Previous resource provisioning strategies in cloud datacenters allocate physical resources to virtual machines VMs based on the predicted resource utilization pattern of VMs. The pattern for VMs of a job is usually derived from historical utilizations of multiple VMs of the job. We observed that these utilization curves are usually misaligned in time, which would lead to resource over-prediction and hence over-provisioning. Since this resource utilization misalignment problem has not been revealed and studied before, in this paper, we study the VM resource utilization from public datacenter traces and Hadoop benchmark jobs to verify the commonness of the utilization misalignments. Then, to reduce resource over-provisioning, we propose three VM resource utilization pattern refinement algorithms to improve the original generated pattern by lowering the cap of the pattern, reducing cap provision duration and varying the minimum value of the pattern. We then extend these algorithms to further improve the resource efficiency by considering periodical resource demand patterns that have multiple pulses in a pattern. These algorithms can be used in any resource provisioning strategy that considers predicted resource utilizations of VMs of a job. We then adopt these refinement algorithms in an initial VM allocation mechanism and test them in trace-driven experiments and real-world testbed experiments. The experimental results show that each improved mechanism can increase resource utilization, and reduce the number of PMs needed to satisfy tenant requests. Also, our extended refinement algorithms are effective in improving resource efficiency of the refinement algorithms.", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771", } @Article{Shi:2018:HAV, author = "Hao Shi and Jelena Mirkovic and Abdulla Alwabel", title = "Handling Anti-Virtual Machine Techniques in Malicious Software", journal = j-TOPS, volume = "21", number = "1", pages = "2:1--2:??", month = jan, year = "2018", DOI = "https://doi.org/10.1145/3139292", ISSN = "2471-2566 (print), 2471-2574 (electronic)", bibdate = "Sat Sep 21 08:26:23 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tops.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/citation.cfm?id=3139292", abstract = "Malware analysis relies heavily on the use of virtual machines (VMs) for functionality and safety. There are subtle differences in operation between virtual and physical machines. Contemporary malware checks for these differences and changes its behavior when it detects a VM presence. These anti-VM techniques hinder malware analysis. Existing research approaches to uncover differences between VMs and physical machines use randomized testing, and thus cannot guarantee completeness. In this article, we propose a detect-and-hide approach, which systematically addresses anti-VM techniques in malware. First, we propose cardinal pill testing -a modification of red pill testing that aims to enumerate the differences between a given VM and a physical machine through carefully designed tests. Cardinal pill testing finds five times more pills by running 15 times fewer tests than red pill testing. We examine the causes of pills and find that, while the majority of them stem from the failure of VMs to follow CPU specifications, a small number stem from under-specification of certain instructions by the Intel manual. This leads to divergent implementations in different CPU and VM architectures. Cardinal pill testing successfully enumerates the differences that stem from the first cause. Finally, we propose VM Cloak -a WinDbg plug-in which hides the presence of VMs from malware. VM Cloak monitors each execute malware command, detects potential pills, and at runtime modifies the command's outcomes to match those that a physical machine would generate. We implemented VM Cloak and verified that it successfully hides VM presence from malware.", acknowledgement = ack-nhfb, articleno = "2", fjournal = "ACM Transactions on Privacy and Security (TOPS)", journal-URL = "http://dl.acm.org/citation.cfm?id=J1547", } @Article{Shojaei:2018:VVM, author = "Kiamars Shojaei and Faramarz Safi-Esfahani and Saeed Ayat", title = "{VMDFS}: virtual machine dynamic frequency scaling framework in cloud computing", journal = j-J-SUPERCOMPUTING, volume = "74", number = "11", pages = "5944--5979", month = nov, year = "2018", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-018-2508-1", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Thu Oct 10 15:31:09 MDT 2019", bibsource = "http://link.springer.com/journal/11227/74/11; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Silva:2018:FPD, author = "Nuno Silva and Eduardo R. B. Marques and Lu{\'\i}s M. B. Lopes", title = "{Flux}: a Platform for Dynamically Reconfigurable Mobile Crowd-Sensing", journal = j-TOSN, volume = "14", number = "3--4", pages = "20:1--20:??", month = dec, year = "2018", CODEN = "????", DOI = "https://doi.org/10.1145/3200202", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Oct 2 09:20:25 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Flux is a platform for dynamically reconfigurable crowd-sensing using mobile devices like smartphones and tablets, programmed under a notion of region-based sensing. Each region is defined by a set of physical constraints that determine the sensing scope, e.g., based on device position or other environmental variables, plus a set of periodic tasks that perform the actual sensing. The resulting behavior is inherently dynamic: as a device's state changes, e.g., moves in space, it enters and/or leaves different regions, thereby changing the set of active tasks; moreover, regions can be added, deleted, and reprogrammed on-the-fly. Flux makes use of a domain-specific language for sensing tasks that is compiled into abstract bytecode, later executed by a low-footprint virtual machine within a device, guaranteeing runtime safety by construction. For region/task dissemination, Flux employs a broker that holds a changeable region configuration plus gateways that mirror the configuration throughout different network access points to which devices connect. Sensing data is streamed by devices to gateways and then back to the broker. Live or archived data streams are in turn fed by the broker to data-processing clients, which interface with the broker using a publish/subscribe API. We conducted two case-study experiments illustrating Flux: a single-region deployment to monitor WiFi signal quality, and a multi-region deployment to monitor noise, temperature, and places-of-interest based on device movement.", acknowledgement = ack-nhfb, articleno = "20", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J981", } @Article{Son:2018:TSD, author = "Jungmin Son and Rajkumar Buyya", title = "A Taxonomy of Software-Defined Networking ({SDN})-Enabled Cloud Computing", journal = j-COMP-SURV, volume = "51", number = "3", pages = "59:1--59:??", month = jul, year = "2018", CODEN = "CMSVAN", DOI = "https://doi.org/10.1145/3190617", ISSN = "0360-0300 (print), 1557-7341 (electronic)", ISSN-L = "0360-0300", bibdate = "Sat Aug 31 09:04:35 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/compsurv.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Software-Defined Networking (SDN) opened up new opportunities in networking with its concept of the segregated control plane from the data-forwarding hardware, which enables the network to be programmable, adjustable, and reconfigurable dynamically. These characteristics can bring numerous benefits to cloud computing, where dynamic changes and reconfiguration are necessary with its on-demand usage pattern. Although researchers have studied utilizing SDN in cloud computing, gaps still exist and need to be explored further. In this article, we propose a taxonomy to depict different aspects of SDN-enabled cloud computing and explain each element in details. The detailed survey of studies utilizing SDN for cloud computing is presented with focus on data center power optimization, traffic engineering, network virtualization, and security. We also present various simulation and empirical evaluation methods that have been developed for SDN-enabled clouds. Finally, we analyze the gap in current research and propose future directions.", acknowledgement = ack-nhfb, articleno = "59", fjournal = "ACM Computing Surveys", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204", } @Article{Song:2018:FRD, author = "Tao Song and Jiajun Wang and Jiewei Wu and Ruhui Ma and Alei Liang and Tao Gu and Zhengwei Qi", title = "{FastDesk}: a remote desktop virtualization system for multi-tenant", journal = j-FUT-GEN-COMP-SYS, volume = "81", number = "??", pages = "478--491", month = apr, year = "2018", CODEN = "FGSEVI", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Tue Dec 26 08:55:44 MST 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X17304776", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Song:2018:GAH, author = "Tae-Geon Song and Mehdi Pirahandeh and Cheong-Jin Ahn and Deok-Hwan Kim", title = "{GPU}-accelerated high-performance encoding and decoding of hierarchical {RAID} in virtual machines", journal = j-J-SUPERCOMPUTING, volume = "74", number = "11", pages = "5865--5888", month = nov, year = "2018", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-017-1969-y", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Thu Oct 10 15:31:09 MDT 2019", bibsource = "http://link.springer.com/journal/11227/74/11; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Sotiriou-Xanthopoulos:2018:OBV, author = "Efstathios Sotiriou-Xanthopoulos and Leonard Masing and Sotirios Xydis and Kostas Siozios and J{\"u}rgen Becker and Dimitrios Soudris", title = "{OpenCL}-based Virtual Prototyping and Simulation of Many-Accelerator Architectures", journal = j-TECS, volume = "17", number = "5", pages = "86:1--86:??", month = nov, year = "2018", CODEN = "????", DOI = "https://doi.org/10.1145/3242179", ISSN = "1539-9087 (print), 1558-3465 (electronic)", ISSN-L = "1539-9087", bibdate = "Thu Oct 17 18:16:41 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/pvm.bib; https://www.math.utah.edu/pub/tex/bib/tecs.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3242179", abstract = "Heterogeneous architectures featuring multiple hardware accelerators have been proposed as a promising solution for meeting the ever-increasing performance and power requirements of embedded systems. However, the existence of numerous design parameters may result in different architectural schemes and thus in extra design effort. To address this issue, OpenCL-based frameworks have been recently utilized for FPGA programming, to enable the portability of a source code to multiple architectures. However, such OpenCL frameworks focus on RTL design, thus not enabling rapid prototyping and abstracted modeling of complex systems. Virtual Prototyping aims to overcome this problem by enabling the system modeling in higher abstraction levels. This article combines the benefits of OpenCL and Virtual Prototyping, by proposing an OpenCL-based prototyping framework for data-parallel many-accelerator systems, which (a) creates a SystemC Virtual Platform from OpenCL, (b) provides a co-simulation environment for the host and the Virtual Platform, (c) offers memory and interconnection models for parallel data processing, and (d) enables the system evaluation with alternative real number representations (e.g., fixed-point or 16-bit floating-point).", acknowledgement = ack-nhfb, articleno = "86", fjournal = "ACM Transactions on Embedded Computing Systems", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J840", } @Article{Tan:2018:UVQ, author = "Li Tan and Nathan DeBardeleben and Qiang Guan and Sean Blanchard and Michael Lang", title = "Using virtualization to quantify power conservation via near-threshold voltage reduction for inherently resilient applications", journal = j-PARALLEL-COMPUTING, volume = "74", number = "??", pages = "3--15", month = "????", year = "2018", CODEN = "PACOEJ", DOI = "https://doi.org/10.1016/j.parco.2017.07.009", ISSN = "0167-8191 (print), 1872-7336 (electronic)", ISSN-L = "0167-8191", bibdate = "Tue Apr 3 13:59:21 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/parallelcomputing.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167819117300996", acknowledgement = ack-nhfb, fjournal = "Parallel Computing", journal-URL = "http://www.sciencedirect.com/science/journal/01678191", } @Article{Tian:2018:MTE, author = "Wenhong Tian and Majun He and Wenxia Guo and Wenqiang Huang and Xiaoyu Shi and Mingsheng Shang and Adel Nadjaran Toosi and Rajkumar Buyya", title = "On minimizing total energy consumption in the scheduling of virtual machine reservations", journal = j-J-NETW-COMPUT-APPL, volume = "113", number = "??", pages = "64--74", day = "1", month = jul, year = "2018", CODEN = "JNCAF3", DOI = "https://doi.org/10.1016/j.jnca.2018.03.033", ISSN = "1084-8045 (print), 1095-8592 (electronic)", ISSN-L = "1084-8045", bibdate = "Sun May 27 08:10:16 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1084804518301267", acknowledgement = ack-nhfb, fjournal = "Journal of Network and Computer Applications", journal-URL = "http://www.sciencedirect.com/science/journal/10848045", } @Article{Torquato:2018:MAP, author = "Matheus Torquato and I M Umesh and Paulo Maciel", title = "Models for availability and power consumption evaluation of a private cloud with {VMM} rejuvenation enabled by {VM Live Migration}", journal = j-J-SUPERCOMPUTING, volume = "74", number = "9", pages = "4817--4841", month = sep, year = "2018", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-018-2485-4", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Thu Oct 10 15:31:14 MDT 2019", bibsource = "http://link.springer.com/journal/11227/74/9; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Tsiftes:2018:VVS, author = "Nicolas Tsiftes and Thiemo Voigt", title = "{Velox VM}: a safe execution environment for resource-constrained {IoT} applications", journal = j-J-NETW-COMPUT-APPL, volume = "118", number = "??", pages = "61--73", day = "15", month = sep, year = "2018", CODEN = "JNCAF3", ISSN = "1084-8045 (print), 1095-8592 (electronic)", ISSN-L = "1084-8045", bibdate = "Mon Oct 14 14:16:26 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1084804518302017", acknowledgement = ack-nhfb, fjournal = "Journal of Network and Computer Applications", journal-URL = "http://www.sciencedirect.com/science/journal/10848045", } @Article{Ugawa:2018:TSL, author = "Tomoharu Ugawa and Carl G. Ritson and Richard E. Jones", title = "Transactional {Sapphire}: Lessons in High-Performance, On-the-fly Garbage Collection", journal = j-TOPLAS, volume = "40", number = "4", pages = "15:1--15:??", month = dec, year = "2018", CODEN = "ATPSDT", DOI = "https://doi.org/10.1145/3226225", ISSN = "0164-0925 (print), 1558-4593 (electronic)", ISSN-L = "0164-0925", bibdate = "Mon Mar 4 08:35:09 MST 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2010.bib; https://www.math.utah.edu/pub/tex/bib/toplas.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Constructing a high-performance garbage collector is hard. Constructing a fully concurrent `on-the-fly' compacting collector is much more so. We describe our experience of implementing the Sapphire algorithm as the first on-the-fly, parallel, replication copying, garbage collector for the Jikes RVM Java virtual machine (JVM). In part, we explain our innovations such as copying with hardware and software transactions, on-the-fly management of Java's reference types, and simple, yet correct, lock-free management of volatile fields in a replicating collector. We fully evaluate, for the first time, and using realistic benchmarks, Sapphire's performance and suitability as a low latency collector. An important contribution of this work is a detailed description of our experience of building an on-the-fly copying collector for a complete JVM with some assurance that it is correct. A key aspect of this is model checking of critical components of this complicated and highly concurrent system.", acknowledgement = ack-nhfb, articleno = "15", fjournal = "ACM Transactions on Programming Languages and Systems", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J783", } @Article{VanDijkhuizen:2018:SNT, author = "Niels {Van Dijkhuizen} and Jeroen {Van Der Ham}", title = "A Survey of Network Traffic Anonymisation Techniques and Implementations", journal = j-COMP-SURV, volume = "51", number = "3", pages = "52:1--52:??", month = jul, year = "2018", CODEN = "CMSVAN", DOI = "https://doi.org/10.1145/3182660", ISSN = "0360-0300 (print), 1557-7341 (electronic)", ISSN-L = "0360-0300", bibdate = "Sat Aug 31 09:04:35 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/compsurv.bib; https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Many networking research activities are dependent on the availability of network captures. Even outside academic research, there is a need for sharing network captures to cooperate on threat assessments or for debugging. However, most network captures cannot be shared due to privacy concerns. Anonymisation of network captures has been a subject of research for quite some time, and many different techniques exist. In this article, we present an overview of the currently available techniques and implementations for network capture anonymisation. There have been many advances in the understanding of anonymisation and cryptographic methods, which have changed the perspective on the effectiveness of many anonymisation techniques. However, these advances, combined with the increase of computational abilities, may have also made it feasible to perform anonymisation in real time. This may make it easier to collect and distribute network captures both for research and for other applications. This article surveys the literature over the period of 1998-2017 on network traffic anonymisation techniques and implementations. The aim is to provide an overview of the current state of the art and to highlight how advances in related fields have shed new light on anonymisation and pseudonimisation methodologies. The few currently maintained implementations are also reviewed. Last, we identify future research directions to enable easier sharing of network traffic, which in turn can enable new insights in network traffic analysis.", acknowledgement = ack-nhfb, articleno = "52", fjournal = "ACM Computing Surveys", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204", } @Article{Wan:2018:ADU, author = "Xili Wan and Xinjie Guan and Tianjing Wang and Guangwei Bai and Baek-Yong Choi", title = "Application deployment using {Microservice} and {Docker} containers: Framework and optimization", journal = j-J-NETW-COMPUT-APPL, volume = "119", number = "??", pages = "97--109", day = "1", month = oct, year = "2018", CODEN = "JNCAF3", ISSN = "1084-8045 (print), 1095-8592 (electronic)", ISSN-L = "1084-8045", bibdate = "Mon Oct 14 14:16:26 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1084804518302273", acknowledgement = ack-nhfb, fjournal = "Journal of Network and Computer Applications", journal-URL = "http://www.sciencedirect.com/science/journal/10848045", } @Article{Wang:2018:ECM, author = "Cheng Wang and Bhuvan Urgaonkar and George Kesidis and Aayush Gupta and Lydia Y. Chen and Robert Birke", title = "Effective Capacity Modulation as an Explicit Control Knob for Public Cloud Profitability", journal = j-TAAS, volume = "13", number = "1", pages = "2:1--2:??", month = may, year = "2018", CODEN = "????", DOI = "https://doi.org/10.1145/3139291", ISSN = "1556-4665 (print), 1556-4703 (electronic)", ISSN-L = "1556-4665", bibdate = "Wed May 23 05:40:59 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/taas.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "In this article, we explore the efficacy of dynamic effective capacity modulation (i.e., using virtualization techniques to offer lower resource capacity than that advertised by the cloud provider) as a control knob for a cloud provider's profit maximization complementing the more well-studied approach of dynamic pricing. In particular, our focus is on emerging cloud ecosystems wherein we expect tenants to modify their demands strategically in response to such modulation in effective capacity and prices. Toward this, we consider a simple model of a cloud provider that offers a single type of virtual machine to its tenants and devise a leader/follower game-based cloud control framework to capture the interactions between the provider and its tenants. We assume both parties employ myopic control and short-term predictions to reflect their operation under the high dynamism and poor predictability in such environments. Our evaluation using a combination of real data center traces and real-world benchmarks hosted on a prototype OpenStack-based cloud shows 10\% to 30\% profit improvement for a cloud provider compared with baselines that use static pricing and/or static effective capacity.", acknowledgement = ack-nhfb, articleno = "2", fjournal = "ACM Transactions on Autonomous and Adaptive Systems (TAAS)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1010", } @Article{Wang:2018:HSA, author = "Kunshan Wang and Stephen M. Blackburn and Antony L. Hosking and Michael Norrish", title = "Hop, Skip, \& Jump: Practical On-Stack Replacement for a Cross-Platform Language-Neutral {VM}", journal = j-SIGPLAN, volume = "53", number = "3", pages = "1--16", month = mar, year = "2018", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/3296975.3186412", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Oct 16 14:12:57 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "On-stack replacement (OSR) is a performance-critical technology for many languages, especially dynamic languages. Conventional wisdom, apparent in JavaScript engines such as V8 and SpiderMonkey, is that OSR must be implemented in a low-level (i.e., in assembly) and language-specific way. This paper presents an OSR abstraction based on Swapstack, materialized as the API for a low-level virtual machine, and shows how the abstraction of resumption protocols facilitates an elegant implementation of this API on real hardware. Using an experimental JavaScript implementation, we demonstrate that this API enables the language implementation to perform OSR without the need to deal with machine-level details. We also show that the API itself is implementable on concrete hardware. This work helps crystallize OSR abstractions and, by providing a reusable implementation, brings OSR within reach for more language implementers.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "VEE '18 proceedings.", } @Article{Wang:2018:TCB, author = "Haiyang Wang and Tong Li and Ryan Shea and Xiaoqiang Ma and Feng Wang and Jiangchuan Liu and Ke Xu", title = "Toward Cloud-Based Distributed Interactive Applications: Measurement, Modeling, and Analysis", journal = j-IEEE-TRANS-NETWORKING, volume = "26", number = "1", pages = "3--16", month = feb, year = "2018", CODEN = "IEANEP", DOI = "https://doi.org/10.1109/TNET.2017.2765246", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Thu Apr 19 11:27:04 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "With the prevalence of broadband network and wireless mobile network accesses, distributed interactive applications DIAs such as online gaming have attracted a vast number of users over the Internet. The deployment of these systems, however, comes with peculiar hardware/software requirements on the user consoles. Recently, such industrial pioneers as Gaikai, Onlive, and Ciinow have offered a new generation of cloud-based DIAs CDIAs, which shifts the necessary computing loads to cloud platforms and largely relieves the pressure on individual user's consoles. In this paper, we aim to understand the existing CDIA framework and highlight its design challenges. Our measurement reveals the inside structures as well as the operations of real CDIA systems and identifies the critical role of cloud proxies. While its design makes effective use of cloud resources to mitigate client's workloads, it may also significantly increase the interaction latency among clients if not carefully handled. Besides the extra network latency caused by the cloud proxy involvement, we find that computation-intensive tasks e.g., game video encoding and bandwidth-intensive tasks e.g., streaming the game screens to clients together create a severe bottleneck in CDIA. Our experiment indicates that when the cloud proxies are virtual machines VMs in the cloud, the computation-intensive and bandwidth-intensive tasks may seriously interfere with each other. We accordingly capture this feature in our model and present an interference-aware solution. This solution not only smartly allocates workloads but also dynamically assigns capacities across VMs based on their arrival/departure patterns.", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771", } @Article{Watanabe:2018:SEE, author = "Ryo Watanabe and Dilawaer Duolikun and Makoto Takizawa", title = "Simple estimation and energy-aware migration models of virtual machines in a server cluster", journal = j-CCPE, volume = "30", number = "21", pages = "e4771:1--e4771:??", day = "10", month = nov, year = "2018", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.4771", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Thu Mar 28 08:07:52 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", onlinedate = "06 September 2018", } @Article{Win:2018:BDB, author = "T. Y. Win and H. Tianfield and Q. Mair", title = "Big Data Based Security Analytics for Protecting Virtualized Infrastructures in Cloud Computing", journal = j-IEEE-TRANS-BIG-DATA, volume = "4", number = "1", pages = "11--25", month = mar, year = "2018", DOI = "https://doi.org/10.1109/TBDATA.2017.2715335", ISSN = "2332-7790", bibdate = "Fri Aug 2 11:24:47 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransbigdata.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Big Data", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6687317", keywords = "advanced attacks; attack features extraction; belief propagation; Big Data; big data based security analytics; cloud computing; Cloud computing; cloud computing; cloud security; Correlation; Databases; event correlation; Feature extraction; feature extraction; graph theory; graph-based event correlation; guest virtual machines; Hadoop Distributed File System; HDFS; invasive software; learning (artificial intelligence); logistic regression; Malware; malware detection; MapReduce parser based identification; network logs; parallel processing; potential attack paths; random functions; rootkit detection; Security; security analytics; security analytics approach; two-step machine learning; user application logs; virtual machines; virtualisation; virtualization security; Virtualized infrastructure; virtualized infrastructures", } @Article{Wu:2018:EBJ, author = "Mingyu Wu and Ziming Zhao and Haoyu Li and Heting Li and Haibo Chen and Binyu Zang and Haibing Guan", title = "{Espresso}: Brewing {Java} For More Non-Volatility with Non-volatile Memory", journal = j-SIGPLAN, volume = "53", number = "2", pages = "70--83", month = feb, year = "2018", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/3296957.3173201", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Oct 16 14:12:56 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2010.bib; https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Fast, byte-addressable non-volatile memory (NVM) embraces both near-DRAM latency and disk-like persistence, which has generated considerable interests to revolutionize system software stack and programming models. However, it is less understood how NVM can be combined with managed runtime like Java virtual machine (JVM) to ease persistence management. This paper proposes Espresso, a holistic extension to Java and its runtime, to enable Java programmers to exploit NVM for persistence management with high performance. Espresso first provides a general persistent heap design called Persistent Java Heap (PJH) to manage persistent data as normal Java objects. The heap is then strengthened with a recoverable mechanism to provide crash consistency for heap metadata. Espresso further provides a new abstraction called Persistent Java Object (PJO) to provide an easy-to-use but safe persistence programming model for programmers to persist application data. Evaluation confirms that Espresso significantly outperforms state-of-art NVM support for Java (i.e., JPA and PCJ) while being compatible to data structures in existing Java programs.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "ASPLOS '18 proceedings.", } @Article{Xie:2018:NSA, author = "Lei Xie and Shengbo Chen and Wenfeng Shen and Huaikou Miao", title = "A Novel Self-Adaptive {VM} Consolidation Strategy Using Dynamic Multi-Thresholds in {IaaS} Clouds", journal = j-FUTURE-INTERNET, volume = "10", number = "6", pages = "52", day = "13", month = jun, year = "2018", CODEN = "????", DOI = "https://doi.org/10.3390/fi10060052", ISSN = "1999-5903", ISSN-L = "1999-5903", bibdate = "Thu Nov 21 16:51:00 MST 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/future-internet.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.mdpi.com/1999-5903/10/6/52", abstract = "With the rapid development of cloud computing, the demand for infrastructure resources in cloud data centers has further increased, which has already led to enormous amounts of energy costs. Virtual machine (VM) consolidation as one of the important techniques in Infrastructure as a Service clouds (IaaS) can help resolve energy consumption by reducing the number of active physical machines (PMs). However, the necessity of considering energy-efficiency and the obligation of providing high quality of service (QoS) to customers is a trade-off, as aggressive consolidation may lead to performance degradation. Moreover, most of the existing works of threshold-based VM consolidation strategy are mainly focused on single CPU utilization, although the resource request on different VMs are very diverse. This paper proposes a novel self-adaptive VM consolidation strategy based on dynamic multi-thresholds (DMT) for PM selection, which can be dynamically adjusted by considering future utilization on multi-dimensional resources of CPU, RAM and Bandwidth. Besides, the VM selection and placement algorithm of VM consolidation are also improved by utilizing each multi-dimensional parameter in DMT. The experiments show that our proposed strategy has a better performance than other strategies, not only in high QoS but also in less energy consumption. In addition, the advantage of its reduction on the number of active hosts is much more obvious, especially when it is under extreme workloads.", acknowledgement = ack-nhfb, journal-URL = "https://www.mdpi.com/journal/futureinternet", } @Article{Xu:2018:DES, author = "Yu Xu and Jianguo Yao and Yaozu Dong and Kun Tian and Xiao Zheng and Haibing Guan", title = "{Demon}: an Efficient Solution for on-Device {MMU} Virtualization in Mediated Pass-Through", journal = j-SIGPLAN, volume = "53", number = "3", pages = "57--70", month = mar, year = "2018", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/3296975.3186416", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Oct 16 14:12:57 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Memory Management Units (MMUs) for on-device address translation are widely used in modern devices. However, conventional solutions for on-device MMU virtualization, such as shadow page table implemented in mediated pass-through, still suffer from high complexity and low performance. We present Demon, an efficient solution for on-DEvice MMU virtualizatiON in mediated pass-through. The key insight is that Demon takes advantage of IOMMU to construct a two-dimensional address translation and dynamically switches the 2nd-dimensional page table to a proper candidate when the device owner switches. In order to support fine-grained parallelism for the device with multiple engines, we put forward a hardware proposal that separates the address space of each engine and enables simultaneous device address remapping for multiple virtual machines (VMs). We implement Demon with a prototype named gDemon which virtualizes Intel GPU MMU. Nonetheless, Demon is not limited to this particular case. Evaluations show that gDemon provides up to 19.73x better performance in the media transcoding workloads and achieves performance improvement of up to 17.09\% and 13.73\% in the 2D benchmarks and 3D benchmarks, respectively, compared with gVirt. The current release of gDemon scales up to 6 VMs with moderate performance in our experiments. In addition, gDemon simplifies the implementation of GPU MMU virtualization with 37\% code reduction.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "VEE '18 proceedings.", } @Article{Xu:2018:EVC, author = "Xinping Xu and Wenxin Li and Heng Qi and Keqiu Li", title = "On efficient virtual cluster scaling across geo-distributed data centers", journal = j-CCPE, volume = "30", number = "10", pages = "??--??", day = "25", month = may, year = "2018", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.4383", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Sat Aug 4 10:03:14 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://onlinelibrary.wiley.com/doi/abs/10.1002/cpe.4383", acknowledgement = ack-nhfb, fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", } @Article{Xu:2018:IAV, author = "Heyang Xu and Yang Liu and Wei Wei and Wenqiang Zhang", title = "Incentive-aware virtual machine scheduling in cloud computing", journal = j-J-SUPERCOMPUTING, volume = "74", number = "7", pages = "3016--3038", month = jul, year = "2018", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-018-2349-y", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Thu Oct 10 15:31:13 MDT 2019", bibsource = "http://link.springer.com/journal/11227/74/7; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer.com/content/pdf/10.1007/s11227-018-2349-y.pdf", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Xu:2018:MVM, author = "Chuan Xu and Wenqiang Jin and Xinheng Wang and Guofeng Zhao and Shui Yu", title = "{MC-VAP}: a multi-connection virtual access point for high performance software-defined wireless networks", journal = j-J-NETW-COMPUT-APPL, volume = "122", number = "??", pages = "88--98", day = "15", month = nov, year = "2018", CODEN = "JNCAF3", ISSN = "1084-8045 (print), 1095-8592 (electronic)", ISSN-L = "1084-8045", bibdate = "Mon Oct 14 14:16:27 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1084804518302662", acknowledgement = ack-nhfb, fjournal = "Journal of Network and Computer Applications", journal-URL = "http://www.sciencedirect.com/science/journal/10848045", } @Article{Xue:2018:SGV, author = "Mochi Xue and Jiacheng Ma and Wentai Li and Kun Tian and Yaozu Dong and Jinyu Wu and Zhengwei Qi and Bingsheng He and Haibing Guan", title = "Scalable {GPU} Virtualization with Dynamic Sharing of Graphics Memory Space", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "29", number = "8", pages = "1823--1836", month = aug, year = "2018", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2018.2789883", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Wed Jul 25 09:07:14 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.computer.org/csdl/trans/td/2018/08/08247267-abs.html", acknowledgement = ack-nhfb, journal-URL = "http://www.computer.org/tpds/archives.htm", } @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{Yang:2018:CVG, author = "Chao-Tung Yang and Shuo-Tsung Chen and Yu-Sheng Lo and Endah Kristiani and Yu-Wei Chan", title = "On construction of a virtual {GPU} cluster with {InfiniBand} and {10 Gb Ethernet} virtualization", journal = j-J-SUPERCOMPUTING, volume = "74", number = "12", pages = "6876--6897", month = dec, year = "2018", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-018-2484-5", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Thu Oct 10 15:31:10 MDT 2019", bibsource = "http://link.springer.com/journal/11227/74/12; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Yao:2018:SSG, author = "Zhihao Yao and Zongheng Ma and Yingtong Liu and Ardalan Amiri Sani and Aparna Chandramowlishwaran", title = "{Sugar}: Secure {GPU} Acceleration in {Web} Browsers", journal = j-SIGPLAN, volume = "53", number = "2", pages = "519--534", month = feb, year = "2018", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/3296957.3173186", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Oct 16 14:12:56 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Modern personal computers have embraced increasingly powerful Graphics Processing Units (GPUs). Recently, GPU-based graphics acceleration in web apps (i.e., applications running inside a web browser) has become popular. WebGL is the main effort to provide OpenGL-like graphics for web apps and it is currently used in 53\% of the top-100 websites. Unfortunately, WebGL has posed serious security concerns as several attack vectors have been demonstrated through WebGL. Web browsers' solutions to these attacks have been reactive: discovered vulnerabilities have been patched and new runtime security checks have been added. Unfortunately, this approach leaves the system vulnerable to zero-day vulnerability exploits, especially given the large size of the Trusted Computing Base of the graphics plane. We present Sugar, a novel operating system solution that enhances the security of GPU acceleration for web apps by design. The key idea behind Sugar is using a dedicated virtual graphics plane for a web app by leveraging modern GPU virtualization solutions. A virtual graphics plane consists of a dedicated virtual GPU (or vGPU) as well as all the software graphics stack (including the device driver). Sugar enhances the system security since a virtual graphics plane is fully isolated from the rest of the system. Despite GPU virtualization overhead, we show that Sugar achieves high performance. Moreover, unlike current systems, Sugar is able to use two underlying physical GPUs, when available, to co-render the User Interface (UI): one GPU is used to provide virtual graphics planes for web apps and the other to provide the primary graphics plane for the rest of the system. Such a design not only provides strong security guarantees, it also provides enhanced performance isolation.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "ASPLOS '18 proceedings.", } @Article{Yi:2018:CSN, author = "Bo Yi and Xingwei Wang and Keqin Li and Sajal K. Das and Min Huang", title = "A comprehensive survey of {Network Function Virtualization}", journal = j-COMP-NET-AMSTERDAM, volume = "133", number = "??", pages = "212--262", day = "14", month = mar, year = "2018", CODEN = "????", DOI = "https://doi.org/10.1016/j.comnet.2018.01.021", ISSN = "1389-1286 (print), 1872-7069 (electronic)", ISSN-L = "1389-1286", bibdate = "Wed Feb 21 15:18:20 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1389128618300306", acknowledgement = ack-nhfb, fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)", journal-URL = "http://www.sciencedirect.com/science/journal/13891286/", } @Article{Yousefipour:2018:ECA, author = "Amin Yousefipour and Amir Masoud Rahmani and Mohsen Jahanshahi", title = "Energy and cost-aware virtual machine consolidation in cloud computing", journal = j-SPE, volume = "48", number = "10", pages = "1758--1774", month = oct, year = "2018", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/spe.2585", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Thu Dec 6 16:49:42 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", onlinedate = "26 April 2018", remark = "Special issue on metaheuristics in cloud computing.", } @Article{Yuan:2018:ASP, author = "Xingliang Yuan and Huayi Duan and Cong Wang", title = "Assuring String Pattern Matching in Outsourced Middleboxes", journal = j-IEEE-TRANS-NETWORKING, volume = "26", number = "3", pages = "1362--1375", month = jun, year = "2018", CODEN = "IEANEP", DOI = "https://doi.org/10.1109/TNET.2018.2822837", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Thu Oct 18 05:31:01 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Modern enterprise networks heavily rely on the ubiquitous network middleboxes for advanced traffic processing functions. Recent advances in software packet processing and virtualization technologies are further pushing forward the paradigm of migrating middleboxes to third-party providers, e.g., clouds and ISPs, as virtualized services, with well-understood benefits on reduced maintenance cost and increased service scalability. Despite promising, outsourcing middleboxes raises new security challenges. Among others, this new service eliminates the enterprise's direct control on outsourced network functions. Mechanisms assuring that those middleboxes consistently perform network functions as intended currently do not exist. In this paper, we propose the first practical system that enables runtime execution assurances of outsourced middleboxes with high confidence, helping enterprises to extend their visibility into untrusted service providers. As an initial effort, we target on pattern matching-based network functions, which cover a broad class of middlebox applications, such as instruction detection, Web firewall, and traffic classification. Our design follows the roadmap of probabilistic checking mechanisms that provide a tunable level of assurance, as in cloud and distributed computing literature. We show how to synthesize this design intuition in the context of outsourced middleboxes and the dynamic network effect. Specifically, we present diligent technical instantiations in the cases of the single middlebox and the composition i.e., service chaining. We deploy our designs into off-the-shelf middlebox outsourcing architectures with full-fledged implementation on the click modular router. Evaluations demonstrate that high assurance levels are achieved by pre-processing only a few packets with marginal overhead.", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771", } @Article{Zha:2018:LSM, author = "Yue Zha and Jing Li", title = "{Liquid Silicon-Monona}: a Reconfigurable Memory-Oriented Computing Fabric with Scalable Multi-Context Support", journal = j-SIGPLAN, volume = "53", number = "2", pages = "214--228", month = feb, year = "2018", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/3296957.3173167", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Oct 16 14:12:56 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "With the recent trend of promoting Field-Programmable Gate Arrays (FPGAs) to first-class citizens in accelerating compute-intensive applications in networking, cloud services and artificial intelligence, FPGAs face two major challenges in sustaining competitive advantages in performance and energy efficiency for diverse cloud workloads: (1) limited configuration capability for supporting light-weight computations/on-chip data storage to accelerate emerging search-/data-intensive applications. (2) lack of architectural support to hide reconfiguration overhead for assisting virtualization in a cloud computing environment. In this paper, we propose a reconfigurable memory-oriented computing fabric, namely Liquid Silicon-Monona (L-Si), enabled by emerging nonvolatile memory technology i.e. RRAM, to address these two challenges. Specifically, L-Si addresses the first challenge by virtue of a new architecture comprising a 2D array of physically identical but functionally-configurable building blocks. It, for the first time, extends the configuration capabilities of existing FPGAs from computation to the whole spectrum ranging from computation to data storage. It allows users to better customize hardware by flexibly partitioning hardware resources between computation and memory, greatly benefiting emerging search- and data-intensive applications. To address the second challenge, L-Si provides scalable multi-context architectural support to minimize reconfiguration overhead for assisting virtualization. In addition, we provide compiler support to facilitate the programming of applications written in high-level programming languages (e.g. OpenCL) and frameworks (e.g. TensorFlow, MapReduce) while fully exploiting the unique architectural capability of L-Si. Our evaluation results show L-Si achieves 99.6\% area reduction, 1.43$ \times $ throughput improvement and 94.0\% power reduction on search-intensive benchmarks, as compared with the FPGA baseline. For neural network benchmarks, on average, L-Si achieves 52.3$ \times $ speedup, 113.9$ \times $ energy reduction and 81\% area reduction over the FPGA baseline. In addition, the multi-context architecture of L-Si reduces the context switching time to --- 10ns, compared with an off-the-shelf FPGA (~100ms), greatly facilitating virtualization.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", remark = "ASPLOS '18 proceedings.", } @Article{Zhan:2018:HPV, author = "Dongyang Zhan and Lin Ye and Hongli Zhang and Binxing Fang and Huhua Li and Yang Liu and Xiaojiang Du and Mohsen Guizani", title = "A high-performance virtual machine filesystem monitor in cloud-assisted cognitive {IoT}", journal = j-FUT-GEN-COMP-SYS, volume = "88", number = "??", pages = "209--219", month = nov, year = "2018", CODEN = "FGSEVI", DOI = "https://doi.org/10.1016/j.future.2018.05.055", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Tue Sep 18 14:07:58 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X18304394", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Zhang:2018:DIV, author = "Tianwei Zhang and Ruby B. Lee", title = "Design, Implementation and Verification of Cloud Architecture for Monitoring a Virtual Machine's Security Health", journal = j-IEEE-TRANS-COMPUT, volume = "67", number = "6", pages = "799--815", month = jun, year = "2018", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.2017.2780823", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Thu May 10 07:36:40 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://ieeexplore.ieee.org/document/8169039/", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Computers", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", } @Article{Zhang:2018:LFV, author = "Fei Zhang and Xiaoming Fu and Ramin Yahyapour", title = "{LayerMover}: Fast virtual machine migration over {WAN} with three-layer image structure", journal = j-FUT-GEN-COMP-SYS, volume = "83", number = "??", pages = "37--49", month = jun, year = "2018", CODEN = "FGSEVI", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Thu Mar 15 17:42:39 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.sciencedirect.com/science/article/pii/S0167739X1630797X", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Zhao:2018:FFI, author = "Siqi Zhao and Xuhua Ding", title = "{FIMCE}: A Fully Isolated Micro-Computing Environment for Multicore Systems", journal = j-TOPS, volume = "21", number = "3", pages = "15:1--15:??", month = jun, year = "2018", DOI = "https://doi.org/10.1145/3195181", ISSN = "2471-2566 (print), 2471-2574 (electronic)", bibdate = "Sat Sep 21 08:26:24 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tops.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/citation.cfm?id=3195181", abstract = "Virtualization-based memory isolation has been widely used as a security primitive in various security systems to counter kernel-level attacks. In this article, our in-depth analysis on this primitive shows that its security is significantly undermined in the multicore setting when other hardware resources for computing are not enclosed within the isolation boundary. We thus propose to construct a fully isolated micro-computing environment (FIMCE) as a new primitive. By virtue of its architectural niche, FIMCE not only offers stronger security assurance than its predecessor, but also features a flexible and composable environment with support for peripheral device isolation, thus greatly expanding the scope of applications. In addition, FIMCE can be integrated with recent technologies such as Intel Software Guard Extensions (SGX) to attain even stronger security guarantees. We have built a prototype of FIMCE with a bare-metal hypervisor. To show the benefits of using FIMCE as a building block, we have also implemented four applications which are difficult to construct using the existing memory isolation method. Experiments with these applications demonstrate that FIMCE imposes less than 1\% overhead on single-threaded applications, while the maximum performance loss on multithreaded applications is bounded by the degree of parallelism at the processor level.", acknowledgement = ack-nhfb, articleno = "15", fjournal = "ACM Transactions on Privacy and Security (TOPS)", journal-URL = "http://dl.acm.org/citation.cfm?id=J1547", } @Article{Zhao:2018:PAP, author = "Hui Zhao and Jing Wang and Feng Liu and Quan Wang and Weizhan Zhang and Qinghua Zheng", title = "Power-Aware and Performance-Guaranteed Virtual Machine Placement in the Cloud", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "29", number = "6", pages = "1385--1400", month = jun, year = "2018", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2018.2794369", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Thu May 10 07:22:57 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.computer.org/csdl/trans/td/2018/06/08259446-abs.html", acknowledgement = ack-nhfb, journal-URL = "http://www.computer.org/tpds/archives.htm", } @Article{Zhou:2018:DNA, author = "Hang Zhou and Qing Li and Kim-Kwang Raymond Choo and Hai Zhu", title = "{DADTA}: a novel adaptive strategy for energy and performance efficient virtual machine consolidation", journal = j-J-PAR-DIST-COMP, volume = "121", number = "??", pages = "53--70", month = nov, year = "2018", CODEN = "JPDCER", DOI = "https://doi.org/10.1016/j.jpdc.2018.06.011", ISSN = "0743-7315 (print), 1096-0848 (electronic)", ISSN-L = "0743-7315", bibdate = "Thu Sep 13 14:34:44 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0743731518304520", acknowledgement = ack-nhfb, fjournal = "Journal of Parallel and Distributed Computing", journal-URL = "http://www.sciencedirect.com/science/journal/07437315", } @Article{Zhou:2018:SFC, author = "Ruiting Zhou and Zongpeng Li and Chuan Wu", title = "Scheduling Frameworks for Cloud Container Services", journal = j-IEEE-TRANS-NETWORKING, volume = "26", number = "1", pages = "436--450", month = feb, year = "2018", CODEN = "IEANEP", DOI = "https://doi.org/10.1109/TNET.2017.2781200", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Thu Apr 19 11:27:04 MDT 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Compared with traditional virtual machines, cloud containers are more flexible and lightweight, emerging as the new norm of cloud resource provisioning. We exploit this new algorithm design space, and propose scheduling frameworks for cloud container services. Our offline and online schedulers permit partial execution, and allow a job to specify its job deadline, desired cloud containers, and inter-container dependence relations. We leverage the following classic and new techniques in our scheduling algorithm design. First, we apply the compact-exponential technique to express and handle nonconventional scheduling constraints. Second, we adopt the primal-dual framework that determines the primal solution based on its dual constraints in both the offline and online algorithms. The offline scheduling algorithm includes a new separation oracle to separate violated dual constraints, and works in concert with the randomized rounding technique to provide a near-optimal solution. The online scheduling algorithm leverages the online primal-dual framework with a learning-based scheme for obtaining dual solutions. Both theoretical analysis and trace-driven simulations validate that our scheduling frameworks are computationally efficient and achieve close-to-optimal aggregate job valuation.", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771", } @Article{Zhou:2018:VMM, author = "Zhou Zhou and Junyang Yu and Fangmin Li and Fei Yang", title = "Virtual machine migration algorithm for energy efficiency optimization in cloud computing", journal = j-CCPE, volume = "31", number = "7", pages = "e4942:1--e4942:??", day = "25", month = dec, year = "2018", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.4942", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Thu Mar 28 08:07:53 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", onlinedate = "30 August 2018", } @Article{Ziafat:2018:OSV, author = "Hassan Ziafat and Seyed Morteza Babamir", title = "Optimal selection of {VMs} for resource task scheduling in geographically distributed clouds using fuzzy c-mean and {MOLP}", journal = j-SPE, volume = "48", number = "10", pages = "1820--1846", month = oct, year = "2018", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/spe.2601", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Thu Dec 6 16:49:42 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", onlinedate = "04 July 2018", remark = "Special issue on metaheuristics in cloud computing.", } @Article{Abeni:2019:HSR, author = "Luca Abeni and Alessandro Biondi and Enrico Bini", title = "Hierarchical scheduling of real-time tasks over {Linux}-based virtual machines", journal = j-J-SYST-SOFTW, volume = "149", number = "??", pages = "234--249", month = mar, year = "2019", CODEN = "JSSODM", DOI = "https://doi.org/10.1016/j.jss.2018.12.008", ISSN = "0164-1212 (print), 1873-1228 (electronic)", ISSN-L = "0164-1212", bibdate = "Wed Jan 23 16:35:05 MST 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib; https://www.math.utah.edu/pub/tex/bib/linux.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S016412121830270X", acknowledgement = ack-nhfb, fjournal = "Journal of Systems and Software", journal-URL = "http://www.sciencedirect.com/science/journal/01641212", } @Article{Agarwal:2019:SVM, author = "Amit Agarwal and Ta Nguyen Binh Duong", title = "Secure virtual machine placement in cloud data centers", journal = j-FUT-GEN-COMP-SYS, volume = "100", number = "??", pages = "210--222", month = nov, year = "2019", CODEN = "FGSEVI", DOI = "https://doi.org/10.1016/j.future.2019.05.005", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Mon Feb 10 12:55:01 MST 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X18326116", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Ahmed:2019:ILT, author = "Jawad Ahmed and Aqsa Malik and Muhammad U. Ilyas and Jalal S. Alowibdi", title = "Instance launch-time analysis of {OpenStack} virtualization technologies with control plane network errors", journal = j-COMPUTING, volume = "101", number = "8", pages = "989--1014", month = aug, year = "2019", CODEN = "CMPTA2", DOI = "https://doi.org/10.1007/s00607-018-0626-5", ISSN = "0010-485X (print), 1436-5057 (electronic)", ISSN-L = "0010-485X", bibdate = "Fri Sep 6 09:05:35 MDT 2019", bibsource = "http://link.springer.com/journal/607/101/8; https://www.math.utah.edu/pub/tex/bib/computing.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Computing", journal-URL = "http://link.springer.com/journal/607", } @Article{Al-Rahayfeh:2019:NAT, author = "Amer Al-Rahayfeh and Saleh Atiewi and Abdullah Abuhussein and Muder Almiani", title = "Novel Approach to Task Scheduling and Load Balancing Using the Dominant Sequence Clustering and Mean Shift Clustering Algorithms", journal = j-FUTURE-INTERNET, volume = "11", number = "5", pages = "109", day = "08", month = may, year = "2019", CODEN = "????", DOI = "https://doi.org/10.3390/fi11050109", ISSN = "1999-5903", ISSN-L = "1999-5903", bibdate = "Thu Nov 21 16:51:06 MST 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/future-internet.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.mdpi.com/1999-5903/11/5/109", abstract = "Cloud computing (CC) is fast-growing and frequently adopted in information technology (IT) environments due to the benefits it offers. Task scheduling and load balancing are amongst the hot topics in the realm of CC. To overcome the shortcomings of the existing task scheduling and load balancing approaches, we propose a novel approach that uses dominant sequence clustering (DSC) for task scheduling and a weighted least connection (WLC) algorithm for load balancing. First, users' tasks are clustered using the DSC algorithm, which represents user tasks as graph of one or more clusters. After task clustering, each task is ranked using Modified Heterogeneous Earliest Finish Time (MHEFT) algorithm. where the highest priority task is scheduled first. Afterwards, virtual machines (VM) are clustered using a mean shift clustering (MSC) algorithm using kernel functions. Load balancing is subsequently performed using a WLC algorithm, which distributes the load based on server weight and capacity as well as client connectivity to server. A highly weighted or least connected server is selected for task allocation, which in turn increases the response time. Finally, we evaluate the proposed architecture using metrics such as response time, makespan, resource utilization, and service reliability.", acknowledgement = ack-nhfb, journal-URL = "https://www.mdpi.com/journal/futureinternet", remark = "Special Issue Cloud Computing and Internet of Things.", } @Article{Alaluna:2019:SMC, author = "Max Alaluna and Eric Vial and Nuno Neves and Fernando M. V. Ramos", title = "Secure Multi-Cloud Network Virtualization", journal = j-COMP-NET-AMSTERDAM, volume = "161", number = "??", pages = "45--60", day = "9", month = oct, year = "2019", CODEN = "????", ISSN = "1389-1286 (print), 1872-7069 (electronic)", ISSN-L = "1389-1286", bibdate = "Mon Oct 14 17:19:57 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1389128618312155", acknowledgement = ack-nhfb, fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)", journal-URL = "http://www.sciencedirect.com/science/journal/13891286/", } @Article{Aldossary:2019:EAC, author = "Mohammad Aldossary and Karim Djemame and Ibrahim Alzamil and Alexandros Kostopoulos and Antonis Dimakis and Eleni Agiatzidou", title = "Energy-aware cost prediction and pricing of virtual machines in cloud computing environments", journal = j-FUT-GEN-COMP-SYS, volume = "93", number = "??", pages = "442--459", month = apr, year = "2019", CODEN = "FGSEVI", DOI = "https://doi.org/10.1016/j.future.2018.10.027", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Tue Feb 5 08:15:52 MST 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.sciencedirect.com/science/article/pii/S0167739X18310288", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Asvija:2019:SHA, author = "B. Asvija and R. Eswari and M. B. Bijoy", title = "Security in hardware assisted virtualization for cloud computing --- state of the art issues and challenges", journal = j-COMP-NET-AMSTERDAM, volume = "151", number = "??", pages = "68--92", day = "14", month = mar, year = "2019", CODEN = "????", DOI = "https://doi.org/10.1016/j.comnet.2019.01.013", ISSN = "1389-1286 (print), 1872-7069 (electronic)", ISSN-L = "1389-1286", bibdate = "Tue Mar 12 06:31:10 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1389128618302998", acknowledgement = ack-nhfb, fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)", journal-URL = "http://www.sciencedirect.com/science/journal/13891286/", } @Article{Atzori:2019:SCI, author = "L. Atzori and J. L. Bellido and R. Bolla and G. Genovese and A. Iera and A. Jara and C. Lombardo and G. Morabito", title = "{SDN\&NFV} contribution to {IoT} objects virtualization", journal = j-COMP-NET-AMSTERDAM, volume = "149", number = "??", pages = "200--212", day = "11", month = feb, year = "2019", CODEN = "????", DOI = "https://doi.org/10.1016/j.comnet.2018.11.030", ISSN = "1389-1286 (print), 1872-7069 (electronic)", ISSN-L = "1389-1286", bibdate = "Tue Jan 22 16:29:25 MST 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1389128618312933", acknowledgement = ack-nhfb, fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)", journal-URL = "http://www.sciencedirect.com/science/journal/13891286/", } @Article{Basu:2019:LYG, author = "D. Basu and X. Wang and Y. Hong and H. Chen and S. Bressan", title = "Learn-as-you-go with {Megh}: Efficient Live Migration of Virtual Machines", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "30", number = "8", pages = "1786--1801", month = aug, year = "2019", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2019.2893648", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Fri Aug 30 06:09:58 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Parallel and Distributed Systems", journal-URL = "http://www.computer.org/portal/web/csdl/transactions/tpds", keywords = "cloud computing; Cloud computing; cloud providers; Clustering algorithms; computer centres; data centers; Data centers; energy efficiency; function approximation; functional approximation scheme; heterogeneous workloads; Heuristic algorithms; heuristics-based algorithms; Knowledge based systems; knowledge-based algorithms; learning (artificial intelligence); live migration; Markov decision process; Markov processes; Megh models; migration decision; online reinforcement learning algorithm; performance efficiency; reinforcement learning; resource allocation; Resource management; resource management; resources allocation; virtual machine; virtual machines; Virtual machining", } @Article{Baumann:2019:VSL, author = "Christoph Baumann and Oliver Schwarz and Mads Dam", title = "On the verification of system-level information flow properties for virtualized execution platforms", journal = j-J-CRYPTO-ENG, volume = "9", number = "3", pages = "243--261", month = sep, year = "2019", CODEN = "????", DOI = "https://doi.org/10.1007/s13389-019-00216-4", ISSN = "2190-8508 (print), 2190-8516 (electronic)", ISSN-L = "2190-8508", bibdate = "Wed Oct 2 11:24:52 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jcryptoeng.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer.com/article/10.1007/s13389-019-00216-4; https://link.springer.com/content/pdf/10.1007/s13389-019-00216-4.pdf", acknowledgement = ack-nhfb, fjournal = "Journal of Cryptographic Engineering", journal-URL = "http://link.springer.com/journal/13389", } @Article{Benmakrelouf:2019:RNP, author = "Souhila Benmakrelouf and Nadjia Kara and Hanine Tout and Rafi Rabipour and Claes Edstrom", title = "Resource needs prediction in virtualized systems: {Generic} proactive and self-adaptive solution", journal = j-J-NETW-COMPUT-APPL, volume = "148", number = "??", pages = "??--??", day = "15", month = dec, year = "2019", CODEN = "JNCAF3", DOI = "https://doi.org/10.1016/j.jnca.2019.102443", ISSN = "1084-8045 (print), 1095-8592 (electronic)", ISSN-L = "1084-8045", bibdate = "Mon May 24 15:12:31 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1084804519303030", acknowledgement = ack-nhfb, articleno = "102443", fjournal = "Journal of Network and Computer Applications", journal-URL = "http://www.sciencedirect.com/science/journal/10848045", } @Article{Berglund:2019:MSJ, author = "Lasse Berglund and Cyrille Artho", title = "Method summaries for {JPF}", journal = j-SIGSOFT, volume = "44", number = "4", pages = "16--16", month = dec, year = "2019", CODEN = "SFENDP", DOI = "https://doi.org/10.1145/3364452.33644560", ISSN = "0163-5948 (print), 1943-5843 (electronic)", ISSN-L = "0163-5948", bibdate = "Wed Mar 24 14:07:40 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2010.bib; https://www.math.utah.edu/pub/tex/bib/sigsoft2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1145/3364452.33644560", abstract = "Java Pathfinder (JPF) is a virtual machine executing Java byte-code that is able to perform model checking using backtracking execution. Due to backtracking, parts of a program may be executed multiple times during model checking. Hence, we explore \ldots{}", acknowledgement = ack-nhfb, fjournal = "ACM SIGSOFT Software Engineering Notes", journal-URL = "https://dl.acm.org/loi/sigsoft", } @Article{Bermejo:2019:VCS, author = "Belen Bermejo and Carlos Juiz and Carlos Guerrero", title = "Virtualization and consolidation: a systematic review of the past 10 years of research on energy and performance", journal = j-J-SUPERCOMPUTING, volume = "75", number = "2", pages = "808--836", month = feb, year = "2019", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-018-2613-1", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Thu Oct 10 15:31:16 MDT 2019", bibsource = "http://link.springer.com/journal/11227/75/2; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Bertolazzi:2019:MED, author = "Marco Bertolazzi and Carlo Caini", title = "{Mars} to {Earth} Data Downloading: a Directory Synchronization Approach", journal = j-FUTURE-INTERNET, volume = "11", number = "8", pages = "173", day = "08", month = aug, year = "2019", CODEN = "????", DOI = "https://doi.org/10.3390/fi11080173", ISSN = "1999-5903", ISSN-L = "1999-5903", bibdate = "Thu Nov 21 16:51:07 MST 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/future-internet.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.mdpi.com/1999-5903/11/8/173", abstract = "This paper aims to present a possible alternative to direct file transfer in ``challenged networks'', by using DTNbox, a recent application for peer-to-peer directory synchronization between DTN nodes. This application uses the Bundle Protocol (BP) to tackle long delays and link intermittency typical of challenged networks. The directory synchronization approach proposed in the paper consists of delegating the transmission of bulk data files to DTNbox, instead of modifying source applications to interface with the API of a specific BP implementation, or making use of custom scripts for file transfers. The validity of the proposed approach is investigated in the paper by considering a Mars to Earth interplanetary environment. Experiments are carried out by means of Virtual Machines running ION, the NASA-JPL implementation of DTN protocols. The results show that the directory synchronization approach is a valid alternative to direct transfer in interplanetary scenarios such as that considered in the paper.", acknowledgement = ack-nhfb, journal-URL = "https://www.mdpi.com/journal/futureinternet", remark = "Special Issue Delay-Tolerant Networking.", } @Article{Bonfim:2019:INS, author = "Michel S. Bonfim and Kelvin L. Dias and Stenio F. L. Fernandes", title = "Integrated {NFV\slash SDN} Architectures: a Systematic Literature Review", journal = j-COMP-SURV, volume = "51", number = "6", pages = "114:1--114:??", month = feb, year = "2019", CODEN = "CMSVAN", DOI = "https://doi.org/10.1145/3172866", ISSN = "0360-0300 (print), 1557-7341 (electronic)", ISSN-L = "0360-0300", bibdate = "Sat Aug 31 09:04:36 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/compsurv.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3172866", abstract = "Network Functions Virtualization (NFV) and Software-Defined Networking (SDN) are new paradigms in the move towards open software and network hardware. While NFV aims to virtualize network functions and deploy them into general purpose hardware, SDN makes networks programmable by separating the control and data planes. NFV and SDN are complementary technologies capable of providing one network solution. SDN can provide connectivity between Virtual Network Functions (VNFs) in a flexible and automated way, whereas NFV can use SDN as part of a service function chain. There are many studies designing NFV/SDN architectures in different environments. Researchers have been trying to address reliability, performance, and scalability problems using different architectural designs. This Systematic Literature Review (SLR) focuses on integrated NFV/SDN architectures, with the following goals: (i) to investigate and provide an in-depth review of the state of the art of NFV/SDN architectures, (ii) to synthesize their architectural designs, and (iii) to identify areas for further improvements. Broadly, this SLR will encourage researchers to advance the current stage of development (i.e., the state of the practice) of integrated NFV/SDN architectures and shed some light on future research efforts and the challenges faced.", acknowledgement = ack-nhfb, articleno = "114", fjournal = "ACM Computing Surveys", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204", } @Article{Bruschi:2019:AAF, author = "Roberto Bruschi and Florin Ciucu and Thomas Zinner", title = "Application areas and fundamental challenges in {Network Functions Virtualization}", journal = j-COMP-NET-AMSTERDAM, volume = "154", number = "??", pages = "26--27", day = "8", month = may, year = "2019", CODEN = "????", DOI = "https://doi.org/10.1016/j.comnet.2019.02.016", ISSN = "1389-1286 (print), 1872-7069 (electronic)", ISSN-L = "1389-1286", bibdate = "Mon Apr 29 17:23:55 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1389128619302348", acknowledgement = ack-nhfb, fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)", journal-URL = "http://www.sciencedirect.com/science/journal/13891286/", } @Article{Bulck:2019:BVM, author = "J. {Van Bulck} and M. Minkin and O. Weisse and D. Genkin and B. Kasikci and F. Piessens and M. Silberstein and T. F. Wenisch and Y. Yarom and R. Strackx", title = "Breaking Virtual Memory Protection and the {SGX} Ecosystem with Foreshadow", journal = j-IEEE-MICRO, volume = "39", number = "3", pages = "66--74", month = may # "\slash " # jun, year = "2019", CODEN = "IEMIDZ", DOI = "https://doi.org/10.1109/MM.2019.2910104", ISSN = "0272-1732 (print), 1937-4143 (electronic)", ISSN-L = "0272-1732", bibdate = "Thu Jul 25 15:33:44 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeemicro.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Micro", journal-URL = "http://www.computer.org/csdl/mags/mi/index.html", keywords = "Ecosystems; foreshadow; Intel Software Guard eXtensions; Kernel; Microarchitecture; physical memory; Program processors; security guarantees; security of data; SGX ecosystem; Side-channel attacks; software architecture; speculative execution attack; trusted computing; virtual machines; virtual memory protection; virtualisation", } @Article{Celesti:2019:SCV, author = "Antonio Celesti and Davide Mulfari and Antonino Galletta and Maria Fazio and Lorenzo Carnevale and Massimo Villari", title = "A study on container virtualization for guarantee quality of service in {Cloud-of-Things}", journal = j-FUT-GEN-COMP-SYS, volume = "99", number = "??", pages = "356--364", month = oct, year = "2019", CODEN = "FGSEVI", DOI = "https://doi.org/10.1016/j.future.2019.03.055", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Mon Oct 14 16:09:56 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X18325615", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Chari:2019:FRE, author = "G. Chari and D. Garbervetsky and S. Marr and S. Ducasse", title = "Fully Reflective Execution Environments: Virtual Machines for More Flexible Software", journal = j-IEEE-TRANS-SOFTW-ENG, volume = "45", number = "9", pages = "858--876", month = sep, year = "2019", CODEN = "IESEDJ", DOI = "https://doi.org/10.1109/TSE.2018.2812715", ISSN = "0098-5589 (print), 1939-3520 (electronic)", ISSN-L = "0098-5589", bibdate = "Thu Sep 19 10:48:08 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranssoftweng2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Software Engineering", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=32", keywords = "dynamic adaptation; Memory management; metaobject protocols; Reflection; Semantics; Shape; Software; Task analysis; virtual machines; Virtual machining", } @Article{Chen:2019:GCE, author = "H. Chen and X. Zhang and Y. Xu and J. Ren and J. Fan and Z. Ma and W. Zhang", title = "{T-Gaming}: A Cost-Efficient Cloud Gaming System at Scale", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "30", number = "12", pages = "2849--2865", month = dec, year = "2019", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2019.2922205", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Thu Dec 19 09:20:35 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Parallel and Distributed Systems", journal-URL = "http://www.computer.org/portal/web/csdl/transactions/tpds", keywords = "adaptive real-time streaming; Cloud gaming; cost-efficient; Encoding; Graphics processing units; HVS-based compression; Quality of experience; Streaming media; Virtualization", } @Article{Chen:2019:PPF, author = "L. Chen and Y. Feng and B. Li and B. Li", title = "{Promenade}: Proportionally Fair Multipath Rate Control in Datacenter Networks with Random Network Coding", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "30", number = "11", pages = "2536--2546", month = nov, year = "2019", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2019.2915638", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Thu Dec 19 09:20:35 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Parallel and Distributed Systems", journal-URL = "http://www.computer.org/portal/web/csdl/transactions/tpds", keywords = "Bandwidth; bandwidth allocation; bandwidth allocation protocol; communicating virtual machines; computer centres; computer networks; convex optimization problem; convex programming; datacenter networks; Datacenter networks; datacenter topologies; equal-cost paths; fairness; Load management; Mininet testbed; multipath rate control; Network coding; network coding; Network topology; packet reordering; Promenade; proportionally fair multipath rate control; Protocols; random codes; random network coding; Receivers; resource allocation; routing protocols; splitting flows; TCP; telecommunication control; telecommunication network topology; Topology; transport protocols; virtual machines; weighted proportional fairness", } @Article{Cocana-Fernandez:2019:IEE, author = "Alberto Coca{\~n}a-Fern{\'a}ndez and Julio Rodr{\'{\i}}guez-Soares and Luciano S{\'a}nchez and Jos{\'e} Ranilla", title = "Improving the energy efficiency of virtual data centers in an {IT} service provider through proactive fuzzy rules-based multicriteria decision making", journal = j-J-SUPERCOMPUTING, volume = "75", number = "3", pages = "1078--1093", month = mar, year = "2019", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-018-2301-1", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Thu Oct 10 15:31:18 MDT 2019", bibsource = "http://link.springer.com/journal/11227/75/3; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{DeBenedictis:2019:IVD, author = "Marco {De Benedictis} and Antonio Lioy", title = "Integrity verification of {Docker} containers for a lightweight cloud environment", journal = j-FUT-GEN-COMP-SYS, volume = "97", number = "??", pages = "236--246", month = aug, year = "2019", CODEN = "FGSEVI", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Mon Oct 14 16:09:57 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X18327201", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Demirci:2019:OPV, author = "Sedef Demirci and Seref Sagiroglu", title = "Optimal placement of virtual network functions in software defined networks: a survey", journal = j-J-NETW-COMPUT-APPL, volume = "147", number = "??", pages = "??--??", day = "1", month = dec, year = "2019", CODEN = "JNCAF3", DOI = "https://doi.org/10.1016/j.jnca.2019.102424", ISSN = "1084-8045 (print), 1095-8592 (electronic)", ISSN-L = "1084-8045", bibdate = "Mon May 24 15:12:30 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1084804519302760", acknowledgement = ack-nhfb, articleno = "102424", fjournal = "Journal of Network and Computer Applications", journal-URL = "http://www.sciencedirect.com/science/journal/10848045", } @Article{Dong:2019:ACM, author = "Ying Dong and Zhou Lei", title = "An Access Control Model for Preventing Virtual Machine Hopping Attack", journal = j-FUTURE-INTERNET, volume = "11", number = "3", pages = "82", day = "26", month = mar, year = "2019", CODEN = "????", DOI = "https://doi.org/10.3390/fi11030082", ISSN = "1999-5903", ISSN-L = "1999-5903", bibdate = "Thu Nov 21 16:51:05 MST 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/future-internet.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.mdpi.com/1999-5903/11/3/82", abstract = "As a new type of service computing model, cloud computing provides various services through the Internet. Virtual machine (VM) hopping is a security issue often encountered in the virtualization layer. Once it occurs, it directly affects the reliability of the entire computing platform. Therefore, we have thoroughly studied the virtual machine hopping attack. In addition, we designed the access control model PVMH (Prevent VM hopping) to prevent VM hopping attacks based on the BLP model and the Biba model. Finally, we implemented the model on the Xen platform. The experiments demonstrate that our PVMH module succeeds in preventing VM hopping attack with acceptable loss to virtual machine performance.", acknowledgement = ack-nhfb, journal-URL = "https://www.mdpi.com/journal/futureinternet", } @Article{DUrso:2019:WSS, author = "Fabio D'Urso and Corrado Santoro and Federico Fausto Santoro", title = "{Wale}: a solution to share libraries in {Docker} containers", journal = j-FUT-GEN-COMP-SYS, volume = "100", number = "??", pages = "513--522", month = nov, year = "2019", CODEN = "FGSEVI", DOI = "https://doi.org/10.1016/j.future.2019.03.049", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Mon Feb 10 12:55:01 MST 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X18327511", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Eramo:2019:ESR, author = "Vincenzo Eramo and Francesco G. Lavacca and Tiziana Catena and Marco Polverini and Antonio Cianfrani", title = "Effectiveness of Segment Routing Technology in Reducing the Bandwidth and Cloud Resources Provisioning Times in Network Function Virtualization Architectures", journal = j-FUTURE-INTERNET, volume = "11", number = "3", pages = "71", day = "12", month = mar, year = "2019", CODEN = "????", DOI = "https://doi.org/10.3390/fi11030071", ISSN = "1999-5903", ISSN-L = "1999-5903", bibdate = "Thu Nov 21 16:51:05 MST 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/future-internet.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.mdpi.com/1999-5903/11/3/71", abstract = "Network Function Virtualization is a new technology allowing for a elastic cloud and bandwidth resource allocation. The technology requires an orchestrator whose role is the service and resource orchestration. It receives service requests, each one characterized by a Service Function Chain, which is a set of service functions to be executed according to a given order. It implements an algorithm for deciding where both to allocate the cloud and bandwidth resources and to route the SFCs. In a traditional orchestration algorithm, the orchestrator has a detailed knowledge of the cloud and network infrastructures and that can lead to high computational complexity of the SFC Routing and Cloud and Bandwidth resource Allocation (SRCBA) algorithm. In this paper, we propose and evaluate the effectiveness of a scalable orchestration architecture inherited by the one proposed within the European Telecommunications Standards Institute (ETSI) and based on the functional separation of an NFV orchestrator in Resource Orchestrator (RO) and Network Service Orchestrator (NSO). Each cloud domain is equipped with an RO whose task is to provide a simple and abstract representation of the cloud infrastructure. These representations are notified of the NSO that can apply a simplified and less complex SRCBA algorithm. In addition, we show how the segment routing technology can help to simplify the SFC routing by means of an effective addressing of the service functions. The scalable orchestration solution has been investigated and compared to the one of a traditional orchestrator in some network scenarios and varying the number of cloud domains. We have verified that the execution time of the SRCBA algorithm can be drastically reduced without degrading the performance in terms of cloud and bandwidth resource costs.", acknowledgement = ack-nhfb, journal-URL = "https://www.mdpi.com/journal/futureinternet", remark = "Special Issue Software Defined Networking (SDN) and Network Function Virtualization (NFV).", } @Article{Farshin:2019:MKB, author = "Alireza Farshin and Saeed Sharifian", title = "A modified knowledge-based ant colony algorithm for virtual machine placement and simultaneous routing of {NFV} in distributed cloud architecture", journal = j-J-SUPERCOMPUTING, volume = "75", number = "8", pages = "5520--5550", month = aug, year = "2019", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-019-02804-x", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Thu Oct 10 15:31:21 MDT 2019", bibsource = "http://link.springer.com/journal/11227/75/8; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Ferreira:2019:DEV, author = "Bruno Morais Ferreira and Britaldo Silveira Soares-Filho and Fernando Magno Quint{\~a}o Pereira", title = "The {Dinamica EGO} virtual machine", journal = j-SCI-COMPUT-PROGRAM, volume = "173", number = "??", pages = "3--20", day = "15", month = mar, year = "2019", CODEN = "SCPGD4", DOI = "https://doi.org/10.1016/j.scico.2018.02.002", ISSN = "0167-6423 (print), 1872-7964 (electronic)", ISSN-L = "0167-6423", bibdate = "Fri Feb 15 10:57:37 MST 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/scicomputprogram.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167642318300455", acknowledgement = ack-nhfb, fjournal = "Science of Computer Programming", journal-URL = "http://www.sciencedirect.com/science/journal/01676423", } @Article{Flatt:2019:RRC, author = "Matthew Flatt and Caner Derici and R. Kent Dybvig and Andrew W. Keep and Gustavo E. Massaccesi and Sarah Spall and Sam Tobin-Hochstadt and Jon Zeppieri", title = "Rebuilding {Racket} on {Chez Scheme} (experience report)", journal = j-PACMPL, volume = "3", number = "ICFP", pages = "78:1--78:15", month = jul, year = "2019", DOI = "https://doi.org/10.1145/3341642", bibdate = "Fri Aug 7 19:22:28 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/pacmpl.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/abs/10.1145/3341642", abstract = "We rebuilt Racket on Chez Scheme, and it works well --- as long as we're allowed a few patches to Chez Scheme. DrRacket runs, the Racket distribution can build itself, and nearly all of the core Racket test suite passes. Maintainability and performance of the resulting implementation are good, although some work remains to improve end-to-end performance. The least predictable part of our effort was how big the differences between Racket and Chez Scheme would turn out to be and how we would manage those differences. We expect Racket on Chez Scheme to become the main Racket implementation, and we encourage other language implementers to consider Chez Scheme as a target virtual machine.", acknowledgement = ack-nhfb, articleno = "78", fjournal = "Proceedings of the ACM on Programming Languages", journal-URL = "https://pacmpl.acm.org/", } @Article{Gec:2019:SAM, author = "Sandi Gec and Dragi Kimovski and Uros Pascinski and Radu Prodan and Vlado Stankovski", title = "Semantic approach for multi-objective optimisation of the {ENTICE} distributed {Virtual Machine} and container images repository", journal = j-CCPE, volume = "31", number = "3", pages = "e4264:1--e4264:??", day = "10", month = feb, year = "2019", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.4264", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Thu Mar 28 08:07:55 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", onlinedate = "30 August 2017", } @Article{Gerangelos:2019:EAS, author = "Stefanos Gerangelos and Georgios Goumas and Nectarios Koziris", title = "Efficient accelerator sharing in virtualized environments: a {Xeon Phi} use-case", journal = j-J-SYST-SOFTW, volume = "150", number = "??", pages = "37--50", month = apr, year = "2019", CODEN = "JSSODM", DOI = "https://doi.org/10.1016/j.jss.2018.12.029", ISSN = "0164-1212 (print), 1873-1228 (electronic)", ISSN-L = "0164-1212", bibdate = "Tue Feb 5 15:44:55 MST 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0164121218302863", acknowledgement = ack-nhfb, fjournal = "Journal of Systems and Software", journal-URL = "http://www.sciencedirect.com/science/journal/01641212", } @Article{Gill:2019:TFD, author = "Sukhpal Singh Gill and Rajkumar Buyya", title = "A Taxonomy and Future Directions for Sustainable Cloud Computing: 360 Degree View", journal = j-COMP-SURV, volume = "51", number = "5", pages = "104:1--104:??", month = jan, year = "2019", CODEN = "CMSVAN", DOI = "https://doi.org/10.1145/3241038", ISSN = "0360-0300 (print), 1557-7341 (electronic)", ISSN-L = "0360-0300", bibdate = "Sat Aug 31 09:04:36 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/compsurv.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3241038", abstract = "The cloud-computing paradigm offers on-demand services over the Internet and supports a wide variety of applications. With the recent growth of Internet of Things (IoT)--based applications, the use of cloud services is increasing exponentially. The next generation of cloud computing must be energy efficient and sustainable to fulfill end-user requirements, which are changing dynamically. Presently, cloud providers are facing challenges to ensure the energy efficiency and sustainability of their services. The use of a large number of cloud datacenters increases cost as well as carbon footprints, which further affects the sustainability of cloud services. In this article, we propose a comprehensive taxonomy of sustainable cloud computing. The taxonomy is used to investigate the existing techniques for sustainability that need careful attention and investigation as proposed by several academic and industry groups. The current research on sustainable cloud computing is organized into several categories: application design, sustainability metrics, capacity planning, energy management, virtualization, thermal-aware scheduling, cooling management, renewable energy, and waste heat utilization. The existing techniques have been compared and categorized based on common characteristics and properties. A conceptual model for sustainable cloud computing has been presented along with a discussion on future research directions.", acknowledgement = ack-nhfb, articleno = "104", fjournal = "ACM Computing Surveys", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204", } @Article{Guo:2019:SSA, author = "Wenxia Guo and Ping Kuang and Yaqiu Jiang and Xiang Xu and Wenhong Tian", title = "{SAVE}: self-adaptive consolidation of virtual machines for energy efficiency of {CPU}-intensive applications in the cloud", journal = j-J-SUPERCOMPUTING, volume = "75", number = "11", pages = "7076--7100", month = nov, year = "2019", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-019-02927-1", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Sat Jul 25 07:17:52 MDT 2020", bibsource = "http://link.springer.com/journal/11227/75/11; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Haidri:2019:CED, author = "R. A. Haidri and C. P. Katti and P. C. Saxena", title = "Cost-effective deadline-aware stochastic scheduling strategy for workflow applications on virtual machines in cloud computing", journal = j-CCPE, volume = "31", number = "7", pages = "e5006:1--e5006:??", day = "10", month = apr, year = "2019", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.5006", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Thu Mar 28 08:07:56 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", onlinedate = "04 October 2018", } @Article{Han:2019:EED, author = "Zhenhua Han and Haisheng Tan and Rui Wang and Guihai Chen and Yupeng Li and Francis Chi Moon Lau", title = "Energy-Efficient Dynamic Virtual Machine Management in Data Centers", journal = j-IEEE-TRANS-NETWORKING, volume = "27", number = "1", pages = "344--360", month = feb, year = "2019", CODEN = "IEANEP", DOI = "https://doi.org/10.1109/TNET.2019.2891787", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Mon May 20 18:15:50 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Efficient virtual machine VM management can dramatically reduce energy consumption in data centers. Existing VM management algorithms fall into two categories based on whether the VMs' resource demands are assumed to be static or dynamic. The former category fails to maximize the resource utilization as they cannot adapt to the dynamic nature of VMs' resource demands. Most approaches in the latter category are heuristic and lack theoretical performance guarantees. In this paper, we formulate the dynamic VM management as a large-scale Markov decision process MDP problem and derive an optimal solution. Our analysis of real-world data traces supports our choice of the modeling approach. However, solving the large-scale MDP problem suffers from the curse of dimensionality. Therefore, we further exploit the special structure of the problem and propose an approximate MDP-based dynamic VM management method, called MadVM. We prove the convergence of MadVM and analyze the bound of its approximation error. Moreover, we show that MadVM can be implemented in a distributed system with at most two times of the optimal migration cost. Extensive simulations based on two real-world workload traces show that MadVM achieves significant performance gains over two existing baseline approaches in power consumption, resource shortage, and the number of VM migrations. Specifically, the more intensely the resource demands fluctuate, the more MadVM outperforms.", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771", } @Article{Han:2019:EJM, author = "Seok-Hyeon Han and Hyun-Woo Kim and Young-Sik Jeong", title = "An efficient job management of computing service using integrated idle {VM} resources for high-performance computing based on {OpenStack}", journal = j-J-SUPERCOMPUTING, volume = "75", number = "8", pages = "4388--4407", month = aug, year = "2019", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-019-02769-x", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Thu Oct 10 15:31:21 MDT 2019", bibsource = "http://link.springer.com/journal/11227/75/8; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Hbaieb:2019:STV, author = "Ameni Hbaieb and Mahdi Khemakhem and Maher {Ben Jemaa}", title = "A survey and taxonomy on virtual data center embedding", journal = j-J-SUPERCOMPUTING, volume = "75", number = "10", pages = "6324--6360", month = oct, year = "2019", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-019-02854-1", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Thu Oct 10 15:31:16 MDT 2019", bibsource = "http://link.springer.com/journal/11227/75/10; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{He:2019:PEL, author = "TianZhang He and Adel N. Toosi and Rajkumar Buyya", title = "Performance evaluation of live virtual machine migration in {SDN}-enabled cloud data centers", journal = j-J-PAR-DIST-COMP, volume = "131", number = "??", pages = "55--68", month = sep, year = "2019", CODEN = "JPDCER", DOI = "https://doi.org/10.1016/j.jpdc.2019.04.014", ISSN = "0743-7315 (print), 1096-0848 (electronic)", ISSN-L = "0743-7315", bibdate = "Mon Jun 10 07:36:16 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S074373151830474X", acknowledgement = ack-nhfb, fjournal = "Journal of Parallel and Distributed Computing", journal-URL = "http://www.sciencedirect.com/science/journal/07437315", } @Article{Hejja:2019:EIT, author = "Khaled Hejja and Xavier Hesselbach", title = "Evaluating impacts of traffic migration and virtual network functions consolidation on power aware resource allocation algorithms", journal = j-FUT-GEN-COMP-SYS, volume = "101", number = "??", pages = "83--98", month = dec, year = "2019", CODEN = "FGSEVI", DOI = "https://doi.org/10.1016/j.future.2019.06.015", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Mon Feb 10 12:55:02 MST 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X19304108", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Honda:2019:NWD, author = "Hirotada Honda and Hiroshi Saito", title = "Nation-Wide Disaster Avoidance Control Against Heavy Rain", journal = j-IEEE-TRANS-NETWORKING, volume = "27", number = "3", pages = "1084--1097", month = jun, year = "2019", CODEN = "IEANEP", DOI = "https://doi.org/10.1109/TNET.2019.2911234", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Wed Oct 2 08:29:26 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "This paper proposes an algorithm for disaster avoidance control against heavy rainfall. According to weather information, the algorithm reconfigures a logical network slice, including the migration of virtual machines VMs, to avoid disasters. It was applied to a nationwide network of 105 nodes and 140 edges, including cases with more than 10 000 slices. Through numerical simulations using actual data of rainfall that caused significant damage in Japan, we found that the probability of service disruption under the proposed control with suitable parameter settings is 10\%--30\% of that without control, on average. Our proposed control experimental system is implemented by using the software-defined network technology. It can migrate VMs and estimates VM migration time to determine how many VMs should be migrated. By using the experimental system, we found that the control interval has an optimal value, which depends on the management system processing capacity.", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771", } @Article{Ilager:2019:EET, author = "Shashikant Ilager and Kotagiri Ramamohanarao and Rajkumar Buyya", title = "{ETAS}: Energy and thermal-aware dynamic virtual machine consolidation in cloud data center with proactive hotspot mitigation", journal = j-CCPE, volume = "31", number = "17", pages = "e5221:1--e5221:??", day = "10", month = sep, year = "2019", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.5221", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Sat Oct 12 11:00:05 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", onlinedate = "03 April 2019", } @Article{IT:2019:PDI, author = "{Island of \TeX}", title = "Providing {Docker} images for {{\TeX{} Live}} and {\ConTeXt}", journal = j-TUGboat, volume = "40", number = "3", pages = "231--231", year = "2019", CODEN = "????", ISSN = "0896-3207", ISSN-L = "0896-3207", bibdate = "Mon Nov 11 11:15:21 MST 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tugboat.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://tug.org/TUGboat/tb40-3/tb126island-docker.pdf", acknowledgement = ack-nhfb, fjournal = "TUGboat", issue = "126", journal-URL = "https://tug.org/TUGboat/", remark = "Advanced{\Dash}supporting continuous integration with a variety of Docker images.", } @Article{Izquierdo:2019:SDA, author = "D. Izquierdo and J. M. Gonzalez-Barahona and L. Kurth and G. Robles", title = "Software Development Analytics for {Xen}: Why and How", journal = j-IEEE-SOFTWARE, volume = "36", number = "3", pages = "28--32", month = may # "\slash " # jun, year = "2019", CODEN = "IESOEG", DOI = "https://doi.org/10.1109/MS.2018.290101357", ISSN = "0740-7459 (print), 1937-4194 (electronic)", ISSN-L = "0740-7459", bibdate = "Fri Aug 2 09:25:48 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeesoft.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Software", journal-URL = "http://www.computer.org/portal/web/csdl/magazines/software", keywords = "computing Mil; Ecosystems; IT companies; Management of Computing and Information Systems; measurement; metrics; Object recognition; process metrics; Software; software development analytics; Software development management; software engineering; Software Engineering; Software maintenance; Software management; Software measurement; virtual machines; virtualisation; Virtualization; virtualization technologies; xen", } @Article{Jain:2019:NNA, author = "S. Jain and A. Ankit and I. Chakraborty and T. Gokmen and M. Rasch and W. Haensch and K. Roy and A. Raghunathan", title = "Neural network accelerator design with resistive crossbars: Opportunities and challenges", journal = j-IBM-JRD, volume = "63", number = "6", pages = "10:1--10:13", month = nov, year = "2019", CODEN = "IBMJAE", DOI = "https://doi.org/10.1147/JRD.2019.2947011", ISSN = "0018-8646 (print), 2151-8556 (electronic)", ISSN-L = "0018-8646", bibdate = "Mon Jan 20 18:12:12 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/ibmjrd.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IBM Journal of Research and Development", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520", keywords = "Encoding; Hardware; Performance evaluation; Programming; Task analysis; Training; Virtual machine monitors", } @Article{Jiang:2019:BSR, author = "Zhe Jiang and Neil Audsley and Pan Dong", title = "{BlueIO}: a Scalable Real-Time Hardware {I/O} Virtualization System for Many-core Embedded Systems", journal = j-TECS, volume = "18", number = "3", pages = "19:1--19:??", month = jun, year = "2019", CODEN = "????", DOI = "https://doi.org/10.1145/3309765", ISSN = "1539-9087 (print), 1558-3465 (electronic)", ISSN-L = "1539-9087", bibdate = "Thu Oct 17 18:16:43 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/tecs.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3309765", abstract = "In safety-critical systems, time predictability is vital. This extends to I/O operations that require predictability, timing-accuracy, parallel access, scalability, and isolation. Currently, existing approaches cannot achieve all these requirements at the same time. In this article, we propose a framework of hardware framework for real-time I/O virtualization-termed BlueIO -to meet all these requirements simultaneously. BlueIO integrates the functionalities of I/O virtualization, low-layer I/O drivers, and a clock cycle level timing-accurate I/O controller (using the GPIOCP [36]). BlueIO provides this functionality in the hardware layer, supporting abstract virtualized access to I/O from the software domain. The hardware implementation includes I/O virtualization and I/O drivers, provides isolation and parallel (concurrent) access to I/O operations, and improves I/O performance. Furthermore, the approach includes the previously proposed GPIOCP to guarantee that I/O operations will occur at a specific clock cycle (i.e., be timing-accurate and predictable). In this article, we present a hardware consumption analysis of BlueIO to show that it linearly scales with the number of CPUs and I/O devices, which is evidenced by our implementation in VLSI and FPGA. We also describe the design and implementation of BlueIO and demonstrate how a BlueIO-based system can be exploited to meet real-time requirements with significant improvements in I/O performance and a low running cost on different OSs.", acknowledgement = ack-nhfb, articleno = "19", fjournal = "ACM Transactions on Embedded Computing Systems", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J840", } @Article{Karn:2019:DAA, author = "R. R. Karn and P. Kudva and I. A. M. Elfadel", title = "Dynamic Autoselection and Autotuning of Machine Learning Models for Cloud Network Analytics", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "30", number = "5", pages = "1052--1064", month = may, year = "2019", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2018.2876844", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Fri Aug 30 06:09:58 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Parallel and Distributed Systems", journal-URL = "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=71", keywords = "automatic ML model selection; autoscaling method; autoselection; autotuning; classification; Cloud analytics; cloud computing; Cloud computing; cloud DevOps; Cloud DevOps architecture; Cloud network analytics; Cloud network monitoring data; cloud network security datasets; clustering; Computational modeling; container orchestration; Containers; containers; data analysis; Data models; data space; decision feedback; distributed learning; docker; dynamic autoselection; dynamic model selection; EML method; ensemble learning; Ensemble ML method; excessive computational resources; Kafka; machine learning; Machine learning; Machine learning algorithms; machine learning models; ML algorithms; ML models; novel cloud methodology; software architecture; targeted supervised learning models; time-consuming model-building process; Tuning; unsupervised learning", } @Article{Khan:2019:TEX, author = "Minhaj Ahmad Khan", title = "Towards efficient {XML} parsing through minimization of {JVM} parameter space", journal = j-J-SUPERCOMPUTING, volume = "75", number = "7", pages = "3693--3711", month = jul, year = "2019", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-018-2721-y", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Thu Oct 10 15:31:20 MDT 2019", bibsource = "http://link.springer.com/journal/11227/75/7; https://www.math.utah.edu/pub/tex/bib/java2010.bib; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Kirova:2019:IMV, author = "Veronika Kirova and Kirill Karpov and Eduard Siemens and Irina Zander and Oksana Vasylenko and Dmitry Kachan and Sergii Maksymov", title = "Impact of Modern Virtualization Methods on Timing Precision and Performance of High-Speed Applications", journal = j-FUTURE-INTERNET, volume = "11", number = "8", pages = "179", day = "16", month = aug, year = "2019", CODEN = "????", DOI = "https://doi.org/10.3390/fi11080179", ISSN = "1999-5903", ISSN-L = "1999-5903", bibdate = "Thu Nov 21 16:51:07 MST 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/future-internet.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.mdpi.com/1999-5903/11/8/179", abstract = "The presented work is a result of extended research and analysis on timing methods precision, their efficiency in different virtual environments and the impact of timing precision on the performance of high-speed networks applications. We investigated how timer hardware is shared among heavily CPU- and I/O-bound tasks on a virtualized OS as well as on bare OS. By replacing the invoked timing methods within a well-known application for estimation of available path bandwidth, we provide the analysis of their impact on estimation accuracy. We show that timer overhead and precision are crucial for high-performance network applications, and low-precision timing methods usage, e.g., the delays and overheads issued by virtualization result in the degradation of the virtual environment. Furthermore, in this paper, we provide confirmation that, by using the methods we intentionally developed for both precise timing operations and AvB estimation, it is possible to overcome the inefficiency of standard time-related operations and overhead that comes with the virtualization. The impacts of negative virtualization factors were investigated in five different environments to define the most optimal virtual environment for high-speed network applications.", acknowledgement = ack-nhfb, journal-URL = "https://www.mdpi.com/journal/futureinternet", remark = "Section Network Virtualization and Edge/Fog Computing.", } @Article{Kist:2019:FFG, author = "Maicon Kist and Juliano Ara{\'u}jo Wickboldt and Lisandro {Zambenedetti Granville} and Juergen Rochol and Luiz A. DaSilva and Cristiano {Bonato Both}", title = "Flexible fine-grained baseband processing with network functions virtualization: Benefits and impacts", journal = j-COMP-NET-AMSTERDAM, volume = "151", number = "??", pages = "158--165", day = "14", month = mar, year = "2019", CODEN = "????", DOI = "https://doi.org/10.1016/j.comnet.2019.01.021", ISSN = "1389-1286 (print), 1872-7069 (electronic)", ISSN-L = "1389-1286", bibdate = "Tue Mar 12 06:31:10 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1389128619301033", acknowledgement = ack-nhfb, fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)", journal-URL = "http://www.sciencedirect.com/science/journal/13891286/", } @Book{Kolodin:2019:HMR, author = "Denis Kolodin", title = "Hands-on Microservices with {Rust}: Build, Test, and Deploy Scalable and Reactive Microservices with {Rust 2018}", publisher = pub-PACKT, address = pub-PACKT:adr, pages = "511 (est.)", year = "2019", ISBN = "1-78934-198-1, 1-78934-275-9", ISBN-13 = "978-1-78934-198-0, 978-1-78934-275-8", LCCN = "QA76.73.R87", bibdate = "Tue Dec 10 06:02:23 MST 2019", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/rust.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://proquest.safaribooksonline.com/?fpi=9781789342758", abstract = "A comprehensive guide in developing and deploying high performance microservices with Rust Key Features Start your microservices journey and get a broader perspective on microservices development using RUST 2018, Build, deploy, and test microservices using AWS Explore advanced techniques for developing microservices such as actor model, Requests Routing, and threads Book Description Microservice architecture is sweeping the world as the de facto pattern for building web-based applications. Rust is a language particularly well-suited for building microservices. It is a new system programming language that offers a practical and safe alternative to C. This book describes web development using the Rust programming language and will get you up and running with modern web frameworks and crates with examples of RESTful microservices creation. You will deep dive into Reactive programming, and asynchronous programming, and split your web application into a set of concurrent actors. The book provides several HTTP-handling examples with manageable memory allocations. You will walk through stateless high-performance microservices, which are ideally suitable for computation or caching tasks, and look at stateful microservices, which are filled with persistent data and database interactions. As we move along, you will learn how to use Rust macros to describe business or protocol entities of our application and compile them into native structs, which will be performed at full speed with the help of the server's CPU. Finally, you will be taken through examples of how to test and debug microservices and pack them into a tiny monolithic binary or put them into a container and deploy them to modern cloud platforms such as AWS. What you will learn Get acquainted with leveraging Rust web programming Get to grips with various Rust crates, such as hyper, Tokio, and Actix Explore RESTful microservices with Rust Understand how to pack Rust code to a container using Docker Familiarize yourself with Reactive microservices Deploy your microservices to modern cloud platforms such as AWS Who this book is for This book is for developers who have basic knowledge of RUST, and want to learn how to build, test, scale, and manage RUST microservices. No prior experience of writing microservices in RUST is assumed. Downloading the example code for this book You can download the example code files for all Packt books you have purchased from your account at http://www.PacktPub.com.", acknowledgement = ack-nhfb, libnote = "Not in my library.", subject = "Rust (Computer program language); Application software; Development; Web applications; Development.; Rust (Computer program language); Web applications.", } @Article{Kovacs:2019:SPA, author = "J{\'o}zsef Kov{\'a}cs", title = "Supporting Programmable Autoscaling Rules for Containers and Virtual Machines on Clouds", journal = j-J-GRID-COMP, volume = "17", number = "4", pages = "813--829", month = dec, year = "2019", CODEN = "????", DOI = "https://doi.org/10.1007/s10723-019-09488-w", ISSN = "1570-7873 (print), 1572-9184 (electronic)", ISSN-L = "1570-7873", bibdate = "Sat Jul 25 07:09:20 MDT 2020", bibsource = "http://link.springer.com/journal/10723/17/4; https://www.math.utah.edu/pub/tex/bib/jgridcomp.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://link.springer.com/article/10.1007/s10723-019-09488-w; https://link.springer.com/content/pdf/10.1007/s10723-019-09488-w.pdf", acknowledgement = ack-nhfb, fjournal = "Journal of Grid Computing", journal-URL = "http://link.springer.com/journal/10723", } @Article{Kumar:2019:ICL, author = "Pawan Kumar and Rakesh Kumar", title = "Issues and Challenges of Load Balancing Techniques in Cloud Computing: a Survey", journal = j-COMP-SURV, volume = "51", number = "6", pages = "120:1--120:??", month = feb, year = "2019", CODEN = "CMSVAN", DOI = "https://doi.org/10.1145/3281010", ISSN = "0360-0300 (print), 1557-7341 (electronic)", ISSN-L = "0360-0300", bibdate = "Sat Aug 31 09:04:36 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/compsurv.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3281010", abstract = "With the growth in computing technologies, cloud computing has added a new paradigm to user services that allows accessing Information Technology services on the basis of pay-per-use at any time and any location. Owing to flexibility in cloud services, numerous organizations are shifting their business to the cloud and service providers are establishing more data centers to provide services to users. However, it is essential to provide cost-effective execution of tasks and proper utilization of resources. Several techniques have been reported in the literature to improve performance and resource use based on load balancing, task scheduling, resource management, quality of service, and workload management. Load balancing in the cloud allows data centers to avoid overloading/underloading in virtual machines, which itself is a challenge in the field of cloud computing. Therefore, it becomes a necessity for developers and researchers to design and implement a suitable load balancer for parallel and distributed cloud environments. This survey presents a state-of-the-art review of issues and challenges associated with existing load-balancing techniques for researchers to develop more effective algorithms.", acknowledgement = ack-nhfb, articleno = "120", fjournal = "ACM Computing Surveys", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204", } @Article{Laaziz:2019:FFS, author = "Lahlou Laaziz and Nadjia Kara and Rafi Rabipour and Claes Edstrom and Yves Lemieux", title = "{FASTSCALE}: a fast and scalable evolutionary algorithm for the joint placement and chaining of virtualized services", journal = j-J-NETW-COMPUT-APPL, volume = "148", number = "??", pages = "??--??", day = "15", month = dec, year = "2019", CODEN = "JNCAF3", DOI = "https://doi.org/10.1016/j.jnca.2019.102429", ISSN = "1084-8045 (print), 1095-8592 (electronic)", ISSN-L = "1084-8045", bibdate = "Mon May 24 15:12:31 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1084804519302875", acknowledgement = ack-nhfb, articleno = "102429", fjournal = "Journal of Network and Computer Applications", journal-URL = "http://www.sciencedirect.com/science/journal/10848045", } @Article{Lebre:2019:PNV, author = "Adrien Lebre and Jonathan Pastor and Anthony Simonet and Mario Sudholt", title = "Putting the Next 500 {VM} Placement Algorithms to the Acid Test: The Infrastructure Provider Viewpoint", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "30", number = "1", pages = "204--217", month = jan, year = "2019", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2018.2855158", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Thu Feb 14 06:19:13 MST 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.computer.org/csdl/trans/td/2019/01/08409978-abs.html", acknowledgement = ack-nhfb, journal-URL = "http://www.computer.org/tpds/archives.htm", } @Article{Leivadeas:2019:VPO, author = "Aris Leivadeas and George Kesidis and Mohamed Ibnkahla and Ioannis Lambadaris", title = "{VNF} Placement Optimization at the Edge and Cloud", journal = j-FUTURE-INTERNET, volume = "11", number = "3", pages = "69", day = "09", month = mar, year = "2019", CODEN = "????", DOI = "https://doi.org/10.3390/fi11030069", ISSN = "1999-5903", ISSN-L = "1999-5903", bibdate = "Thu Nov 21 16:51:05 MST 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/future-internet.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.mdpi.com/1999-5903/11/3/69", abstract = "Network Function Virtualization (NFV) has revolutionized the way network services are offered to end users. Individual network functions are decoupled from expensive and dedicated middleboxes and are now provided as software-based virtualized entities called Virtualized Network Functions (VNFs). NFV is often complemented with the Cloud Computing paradigm to provide networking functions to enterprise customers and end-users remote from their premises. NFV along with Cloud Computing has also started to be seen in Internet of Things (IoT) platforms as a means to provide networking functions to the IoT traffic. The intermix of IoT, NFV, and Cloud technologies, however, is still in its infancy creating a rich and open future research area. To this end, in this paper, we propose a novel approach to facilitate the placement and deployment of service chained VNFs in a network cloud infrastructure that can be extended using the Mobile Edge Computing (MEC) infrastructure for accommodating mission critical and delay sensitive traffic. Our aim is to minimize the end-to-end communication delay while keeping the overall deployment cost to minimum. Results reveal that the proposed approach can significantly reduce the delay experienced, while satisfying the Service Providers' goal of low deployment costs.", acknowledgement = ack-nhfb, journal-URL = "https://www.mdpi.com/journal/futureinternet", remark = "Special Issue Software Defined Networking (SDN) and Network Function Virtualization (NFV).", } @Article{Leon:2019:HBW, author = "R. S. Leon and M. Kiperberg and A. A. {Leon Zabag} and A. Resh and A. Algawi and N. J. Zaidenberg", title = "Hypervisor-Based White Listing of Executables", journal = j-IEEE-SEC-PRIV, volume = "17", number = "5", pages = "58--67", month = sep # "\slash " # oct, year = "2019", DOI = "https://doi.org/10.1109/MSEC.2019.2910218", ISSN = "1540-7993 (print), 1558-4046 (electronic)", ISSN-L = "1540-7993", bibdate = "Tue Sep 17 17:34:33 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Security \& Privacy", journal-URL = "https://publications.computer.org/security-and-privacy/", keywords = "Databases; Image segmentation; Linux; Microprogramming; Monitoring; Operating systems; Virtual machine monitors", } @Article{Li:2019:ELV, author = "Chunguang Li and Dan Feng and Yu Hua and Leihua Qin", title = "Efficient live virtual machine migration for memory write-intensive workloads", journal = j-FUT-GEN-COMP-SYS, volume = "95", number = "??", pages = "126--139", month = jun, year = "2019", CODEN = "FGSEVI", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Mon Oct 14 16:09:56 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X18320491", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Li:2019:NIM, author = "Shupan Li and Limin Xiao and Li Ruan and Shubin Su", title = "A novel integrity measurement method based on copy-on-write for region in virtual machine", journal = j-FUT-GEN-COMP-SYS, volume = "97", number = "??", pages = "714--726", month = aug, year = "2019", CODEN = "FGSEVI", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Mon Oct 14 16:09:57 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X18317618", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Li:2019:PSB, author = "Huixi Li and Wenjun Li and Shigeng Zhang and Haodong Wang and Yi Pan and Jianxin Wang", title = "Page-sharing-based virtual machine packing with multi-resource constraints to reduce network traffic in migration for clouds", journal = j-FUT-GEN-COMP-SYS, volume = "96", number = "??", pages = "462--471", month = jul, year = "2019", CODEN = "FGSEVI", DOI = "https://doi.org/10.1016/j.future.2019.02.043", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Mon Oct 14 16:09:56 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X18302619", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Liang:2019:UBO, author = "Y. Liang and J. Ge and S. Zhang and J. Wu and Z. Tang and B. Luo", title = "A Utility-Based Optimization Framework for Edge Service Entity Caching", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "30", number = "11", pages = "2384--2395", month = nov, year = "2019", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2019.2915218", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Thu Dec 19 09:20:35 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Parallel and Distributed Systems", journal-URL = "http://www.computer.org/portal/web/csdl/transactions/tpds", keywords = "approximation algorithm; Approximation algorithms; approximation theory; Bandwidth; cache cost minimization; cache service entities; cache storage; computational complexity; edge computing; Edge computing; edge infrastructure providers; edge server; edge service entity; edge service providers; edge virtualization; EIP; ESP; Internet; Internet of Things; network edge; NP-complete problem; optimisation; physical edge infrastructure; physical resources; Probabilistic logic; Servers; service entity caching; set cover; traditional edge providers; utility; Utility-based optimization framework; utility-based service entity caching problem; UtilitySEC problem; value-added services; virtualisation; Virtualization", } @Article{Lindemann:2019:DAC, author = "Jens Lindemann and Mathias Fischer", title = "On the detection of applications in co-resident virtual machines via a memory deduplication side-channel", journal = j-SIGAPP, volume = "18", number = "4", pages = "31--46", month = jan, year = "2019", CODEN = "????", DOI = "https://doi.org/10.1145/3307624.3307628", ISSN = "1559-6915 (print), 1931-0161 (electronic)", ISSN-L = "1559-6915", bibdate = "Thu Jan 23 10:25:05 MST 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigapp.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/abs/10.1145/3307624.3307628", abstract = "Nowadays, hosting services of multiple customers on the same hardware via virtualization techniques is very common. Memory deduplication allows to save physical memory by merging identical memory pages of multiple Virtual Machines (VMs) running on the \ldots{}", acknowledgement = ack-nhfb, fjournal = "ACM SIGAPP Applied Computing Review", journal-URL = "https://dl.acm.org/loi/sigapp", } @Article{Linguaglossa:2019:HSD, author = "Leonardo Linguaglossa and Dario Rossi and Salvatore Pontarelli and Dave Barach and Damjan Marjon and Pierre Pfister", title = "High-speed data plane and network functions virtualization by vectorizing packet processing", journal = j-COMP-NET-AMSTERDAM, volume = "149", number = "??", pages = "187--199", day = "11", month = feb, year = "2019", CODEN = "????", DOI = "https://doi.org/10.1016/j.comnet.2018.11.033", ISSN = "1389-1286 (print), 1872-7069 (electronic)", ISSN-L = "1389-1286", bibdate = "Tue Jan 22 16:29:25 MST 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1389128618312957", acknowledgement = ack-nhfb, fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)", journal-URL = "http://www.sciencedirect.com/science/journal/13891286/", } @Article{Liu:2019:MRV, author = "Z. Liu and Y. Cao and X. Zhang and C. Zhu and F. Zhang", title = "Managing Recurrent Virtual Network Updates in Multi-Tenant Datacenters: {A} System Perspective", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "30", number = "8", pages = "1816--1825", month = aug, year = "2019", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2019.2893239", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Fri Aug 30 06:09:58 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Parallel and Distributed Systems", journal-URL = "http://www.computer.org/portal/web/csdl/transactions/tpds", keywords = "Cloud computing; computer centres; greedy routing search algorithms; Linear programming; multi-tenant datacenters; multitenant datacenters; network configuration; network routing update; Network topology; on-demand opportunities; OpReduce; optimisation; Optimization; programmable interfaces; Recurrent virtual network; recurrent virtual network updates; Routing; routing management; search problems; Search problems; software defined networking; software-defined networking; telecommunication network management; telecommunication network routing; telecommunication network topology; Topology; topology search costs; virtualisation", } @Article{Lopez:2019:TMT, author = "Martin Andreoni Lopez and Diogo M. F. Mattos and Otto Carlos M. B. Duarte and Guy Pujolle", title = "Toward a monitoring and threat detection system based on stream processing as a virtual network function for big data", journal = j-CCPE, volume = "31", number = "20", pages = "e5344:1--e5344:??", day = "25", month = oct, year = "2019", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.5344", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Sat Oct 12 11:00:06 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", onlinedate = "21 May 2019", } @Article{Ma:2019:ASF, author = "Yi-Wei Ma and Jiann-Liang Chen and Jia-Yi Jhou", title = "Adaptive service function selection for {Network Function Virtualization} networking", journal = j-FUT-GEN-COMP-SYS, volume = "91", number = "??", pages = "108--123", month = feb, year = "2019", CODEN = "FGSEVI", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Tue Feb 5 08:15:51 MST 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.sciencedirect.com/science/article/pii/S0167739X17328406", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Ma:2019:PMA, author = "Y. Ma and W. Liang and Z. Xu and S. Guo", title = "Profit Maximization for Admitting Requests with Network Function Services in Distributed Clouds", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "30", number = "5", pages = "1143--1157", month = may, year = "2019", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2018.2874257", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Fri Aug 30 06:09:58 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Parallel and Distributed Systems", journal-URL = "http://www.computer.org/portal/web/csdl/transactions/tpds", keywords = "cloud computing; computational complexity; data centers; Data centers; data traffic; delay-aware requests; Delays; distributed clouds; distributed data centers; dynamic profit maximization problem; end-to-end delay requirement; hardware devices; Heuristic algorithms; integer linear programming solution; integer programming; linear programming; middleboxes; network function services; Network function virtualization; network function virtualization; NFV; novel optimization problem; NP-hard problem; online algorithm; online algorithms; profit maximization; request admission; request admission scheduling; Routing; Servers; service function chain consolidation; service function chain provisioning; service function chain requirements; service provider; Software; software defined networking; telecommunication traffic; traditional networks; user requests; virtualisation; Virtualization; virtualization technique", } @Article{Makowski:2019:EVT, author = "Lukasz Makowski and Paola Grosso", title = "Evaluation of virtualization and traffic filtering methods for container networks", journal = j-FUT-GEN-COMP-SYS, volume = "93", number = "??", pages = "345--357", month = apr, year = "2019", CODEN = "FGSEVI", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Tue Feb 5 08:15:52 MST 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.sciencedirect.com/science/article/pii/S0167739X18302371", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Mao:2019:AMC, author = "B. Mao and F. Tang and Z. M. Fadlullah and N. Kato", title = "An Absorbing {Markov} Chain Based Model to Solve Computation and Communication Tradeoff in {GPU}-Accelerated {MDRUs} for Safety Confirmation in Disaster Scenarios", journal = j-IEEE-TRANS-COMPUT, volume = "68", number = "9", pages = "1256--1268", month = sep, year = "2019", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.2019.2906881", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Fri Aug 30 05:58:40 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Computers", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", keywords = "absorbing Markov chain; absorbing Markov chain based model; buffer consumption; Central Processing Unit; chip processing capacities; Communication networks; communication tradeoff; computation overhead; computation tradeoff; Computer architecture; computer networks; Databases; disaster recovery networks; disaster scenarios; disasters; emergency services; general computation platforms; general hardware architectures; GPU-accelerated MDRU; GPU-accelerated MDRUs; Graphics processing units; graphics processing units; Hardware; Markov processes; mobile radio; Moore's Law; movable and deployable resource units; network function virtualization; NFV; optimisation; photo database; photo sharing; photo size; resource allocation; resource-limited disaster recovery networks; Safety; Safety confirmation; safety confirmation method; SDN; software defined networking; telecommunication traffic; traffic overhead optimization; transition matrix; virtualisation; visual communication", } @Article{Marangozova-Martin:2019:MLE, author = "V. Marangozova-Martin and N. {de Palma} and A. {El Rheddane}", title = "Multi-Level Elasticity for Data Stream Processing", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "30", number = "10", pages = "2326--2337", month = oct, year = "2019", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2019.2907950", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Thu Dec 19 09:20:35 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Parallel and Distributed Systems", journal-URL = "http://www.computer.org/portal/web/csdl/transactions/tpds", keywords = "Apache Storm; apache storm; cloud computing; Computational modeling; Containers; Data models; data stream processing; elastic management strategy; Elasticity; execution containers; Measurement; multi-level elasticity; multilevel elasticity; parallel processing; parallelism degree; Proposals; resource allocation; Storms; Stream processing; stream processing environments; virtual machines", } @Article{Mavridis:2019:CCV, author = "Ilias Mavridis and Helen Karatza", title = "Combining containers and virtual machines to enhance isolation and extend functionality on cloud computing", journal = j-FUT-GEN-COMP-SYS, volume = "94", number = "??", pages = "674--696", month = may, year = "2019", CODEN = "FGSEVI", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Mon Oct 14 16:09:56 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X18305764", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Merelli:2019:EDC, author = "Ivan Merelli and Federico Fornari and Fabio Tordini and Daniele D'Agostino and Marco Aldinucci and Daniele Cesini", title = "Exploiting {Docker} containers over Grid computing for a comprehensive study of chromatin conformation in different cell types", journal = j-J-PAR-DIST-COMP, volume = "134", number = "??", pages = "116--127", month = dec, year = "2019", CODEN = "JPDCER", DOI = "https://doi.org/10.1016/j.jpdc.2019.08.002", ISSN = "0743-7315 (print), 1096-0848 (electronic)", ISSN-L = "0743-7315", bibdate = "Wed Mar 18 09:26:10 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0743731519305593", acknowledgement = ack-nhfb, fjournal = "Journal of Parallel and Distributed Computing", journal-URL = "http://www.sciencedirect.com/science/journal/07437315", } @Article{Mohammadhosseini:2019:EEA, author = "Mahdieh Mohammadhosseini and Abolfazl Toroghi Haghighat and Ebrahim Mahdipour", title = "An efficient energy-aware method for virtual machine placement in cloud data centers using the cultural algorithm", journal = j-J-SUPERCOMPUTING, volume = "75", number = "10", pages = "6904--6933", month = oct, year = "2019", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-019-02909-3", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Thu Oct 10 15:31:15 MDT 2019", bibsource = "http://link.springer.com/journal/11227/75/10; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Mohiuddin:2019:WAV, author = "Irfan Mohiuddin and Ahmad Almogren", title = "Workload aware {VM} consolidation method in edge\slash cloud computing for {IoT} applications", journal = j-J-PAR-DIST-COMP, volume = "123", number = "??", pages = "204--214", month = jan, year = "2019", CODEN = "JPDCER", DOI = "https://doi.org/10.1016/j.jpdc.2018.09.011", ISSN = "0743-7315 (print), 1096-0848 (electronic)", ISSN-L = "0743-7315", bibdate = "Mon Jan 7 07:58:39 MST 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0743731518306762", acknowledgement = ack-nhfb, fjournal = "Journal of Parallel and Distributed Computing", journal-URL = "http://www.sciencedirect.com/science/journal/07437315", } @Article{Motaki:2019:CSB, author = "Saloua {El Motaki} and Ali Yahyaouy and Hamid Gualous and Jalal Sabor", title = "Comparative study between exact and metaheuristic approaches for virtual machine placement process as knapsack problem", journal = j-J-SUPERCOMPUTING, volume = "75", number = "10", pages = "6239--6259", month = oct, year = "2019", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-019-02847-0", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Thu Oct 10 15:31:16 MDT 2019", bibsource = "http://link.springer.com/journal/11227/75/10; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Nashaat:2019:SES, author = "Heba Nashaat and Nesma Ashry and Rawya Rizk", title = "Smart elastic scheduling algorithm for virtual machine migration in cloud computing", journal = j-J-SUPERCOMPUTING, volume = "75", number = "7", pages = "3842--3865", month = jul, year = "2019", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-019-02748-2", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Thu Oct 10 15:31:20 MDT 2019", bibsource = "http://link.springer.com/journal/11227/75/7; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Ngoc:2019:EYS, author = "Tu Dinh Ngoc and Bao Bui and Stella Bitchebe and Alain Tchana and Valerio Schiavoni and Pascal Felber and Daniel Hagimont", title = "Everything You Should Know About {Intel SGX} Performance on Virtualized Systems", journal = j-SIGMETRICS, volume = "47", number = "1", pages = "77--78", month = dec, year = "2019", CODEN = "????", DOI = "https://doi.org/10.1145/3376930.3376979", ISSN = "0163-5999 (print), 1557-9484 (electronic)", ISSN-L = "0163-5999", bibdate = "Mon Jan 27 06:15:26 MST 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigmetrics.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/abs/10.1145/3376930.3376979", abstract = "Intel SGX has attracted much attention from academia and is already powering commercial applications. Cloud providers have also started implementing SGX in their cloud offerings. Research efforts on Intel SGX so far have mainly focused on its security \ldots{}", acknowledgement = ack-nhfb, fjournal = "ACM SIGMETRICS Performance Evaluation Review", journal-URL = "https://dl.acm.org/loi/sigmetrics", } @Article{Nguyen:2019:RFV, author = "Thi-Minh Nguyen and Andre Girard and Catherine Rosenberg and Serge Fdida", title = "Routing via Functions in Virtual Networks: The Curse of Choices", journal = j-IEEE-TRANS-NETWORKING, volume = "27", number = "3", pages = "1192--1205", month = jun, year = "2019", CODEN = "IEANEP", DOI = "https://doi.org/10.1109/TNET.2019.2912717", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Wed Oct 2 08:29:26 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "An important evolution of the users' needs is represented by the on-demand access to the network, storage, and compute resources in order to dynamically match the level of resource consumption with their service requirements. The response of the network providers is to transition to an architecture based on softwarization and cloudification of the network functions. This is the rationale for the deployment of network functions virtualization NFV where virtual network functions VNFs may be chained together to create network services. Efficient online routing of demand across nodes handling the functions involved in a given service chain is the novel problem that we address in this paper. We provide an original formulation of this problem that includes link and CPU capacity constraints and is based on the construction of an expanded network. We derive the exact mathematical formulation and propose several heuristic algorithms taking into account the main system's parameters. We conclude by deriving some interesting insights both about the algorithms and the network performance by comparing the heuristics with the exact solutions.", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J771", } @Article{Niyizamwiyitira:2019:UBS, author = "Christine Niyizamwiyitira and Lars Lundberg", title = "A Utilization-Based Schedulability Test of Real-Time Systems Running on a Multiprocessor Virtual Machine", journal = j-COMP-J, volume = "62", number = "6", pages = "884--904", month = jun, year = "2019", CODEN = "CMPJA6", DOI = "https://doi.org/10.1093/comjnl/bxz005", ISSN = "0010-4620 (print), 1460-2067 (electronic)", ISSN-L = "0010-4620", bibdate = "Fri May 24 14:43:23 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://academic.oup.com/comjnl/article/62/6/884/5319152", acknowledgement = ack-nhfb, fjournal = "Computer Journal", journal-URL = "http://comjnl.oxfordjournals.org/", } @Article{Pal:2019:NPR, author = "Souvik Pal and Raghvendra Kumar and Le Hoang Son and Krishnan Saravanan and Mohamed Abdel-Basset and Gunasekaran Manogaran and Pham Huy Thong", title = "Novel probabilistic resource migration algorithm for cross-cloud live migration of virtual machines in public cloud", journal = j-J-SUPERCOMPUTING, volume = "75", number = "9", pages = "5848--5865", month = sep, year = "2019", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-019-02874-x", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Thu Oct 10 15:31:23 MDT 2019", bibsource = "http://link.springer.com/journal/11227/75/9; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Park:2019:BGM, author = "Younghun Park and Minwoo Gu and Sungyong Park", title = "Ballooning Graphics Memory Space in Full {GPU} Virtualization Environments", journal = j-SCI-PROG, volume = "2019", number = "1", pages = "5240956:1--5240956:??", year = "2019", CODEN = "SCIPEV", DOI = "https://doi.org/10.1155/2019/5240956", ISSN = "1058-9244 (print), 1875-919X (electronic)", ISSN-L = "1058-9244", bibdate = "Mon Sep 2 14:36:20 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/sciprogram.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://onlinelibrary.wiley.com/doi/epdf/10.1155/2019/5240956", acknowledgement = ack-nhfb, ajournal = "Sci. Program.", fjournal = "Scientific Programming", journal-URL = "http://iospress.metapress.com/content/1058-9244", } @Article{Patil:2019:DEF, author = "Rajendra Patil and Chirag Modi", title = "Designing an efficient framework for vulnerability assessment and patching {(VAP)} in virtual environment of cloud computing", journal = j-J-SUPERCOMPUTING, volume = "75", number = "5", pages = "2862--2889", month = may, year = "2019", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-018-2698-6", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Thu Oct 10 15:31:19 MDT 2019", bibsource = "http://link.springer.com/journal/11227/75/5; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Patil:2019:ESS, author = "Rajendra Patil and Chirag Modi", title = "An Exhaustive Survey on Security Concerns and Solutions at Different Components of Virtualization", journal = j-COMP-SURV, volume = "52", number = "1", pages = "12:1--12:??", month = feb, year = "2019", CODEN = "CMSVAN", DOI = "https://doi.org/10.1145/3287306", ISSN = "0360-0300 (print), 1557-7341 (electronic)", ISSN-L = "0360-0300", bibdate = "Sat Aug 31 09:04:37 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/compsurv.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3287306", abstract = "Virtualization is a key enabler of various modern computing technologies. However, it brings additional vulnerabilities that can be exploited to affect the availability, integrity, and confidentiality of the underlying resources and services. The dynamic and shared nature of the virtualization poses additional challenges to the traditional security solutions. This article explores the vulnerabilities, threats, and attacks relevant to virtualization. We analyze the existing security solutions and identify the research gaps that can help the research community to develop a secured virtualization platform for current and future computing technologies.", acknowledgement = ack-nhfb, articleno = "12", fjournal = "ACM Computing Surveys", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204", } @Article{Pei:2019:EES, author = "J. Pei and P. Hong and K. Xue and D. Li", title = "Efficiently Embedding Service Function Chains with Dynamic Virtual Network Function Placement in Geo-Distributed Cloud System", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "30", number = "10", pages = "2179--2192", month = oct, year = "2019", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2018.2880992", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Thu Dec 19 09:20:35 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Parallel and Distributed Systems", journal-URL = "http://www.computer.org/portal/web/csdl/transactions/tpds", keywords = "Bandwidth; Binary Integer Programming model; cloud computing; Cloud computing; computer centres; computer network security; dynamic network load; Dynamic Virtual Network Function placement; dynamic VNF placement; efficiently embed SFC requests; Embedding Service Function Chains; geo-distributed cloud system; Heuristic algorithms; integer programming; Internet Service Providers; ISPs; Linear programming; Load modeling; Middleboxes; minimum embedding cost; Network Function Virtualization; network performance; network throughput; NFV environment; novel SFC eMbedding APproach; optimal SFC embedding strategy; performance evaluation results; placed VNF instances; security benefit; Service function chain; SFC Embedding Problem; SFC request acceptance rate; SFC-EP; SFC-MAP; software defined networking; Software-Defined Networks; Switches; total VNF running time; virtual network function; Virtual Network Functions; virtualisation; VNF Dynamic Release Algorithm; VNF utilization rate; VNF-DRA", } @Article{Pfitscher:2019:GPA, author = "Ricardo Jos{\'e} Pfitscher and Arthur Selle Jacobs and Luciano Zembruzki and Ricardo Luis dos Santos and Eder John Scheid and Muriel Figueredo Franco and Alberto Schaeffer-Filho and Lisandro Zambenedetti Granville", title = "Guiltiness: a practical approach for quantifying virtual network functions performance", journal = j-COMP-NET-AMSTERDAM, volume = "161", number = "??", pages = "14--31", day = "9", month = oct, year = "2019", CODEN = "????", DOI = "https://doi.org/10.1016/j.comnet.2019.06.001", ISSN = "1389-1286 (print), 1872-7069 (electronic)", ISSN-L = "1389-1286", bibdate = "Mon Oct 14 17:19:57 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1389128618310508", acknowledgement = ack-nhfb, fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)", journal-URL = "http://www.sciencedirect.com/science/journal/13891286/", } @Article{Pinto:2019:DAT, author = "Sandro Pinto and Nuno Santos", title = "Demystifying {Arm TrustZone}: a Comprehensive Survey", journal = j-COMP-SURV, volume = "51", number = "6", pages = "130:1--130:??", month = feb, year = "2019", CODEN = "CMSVAN", DOI = "https://doi.org/10.1145/3291047", ISSN = "0360-0300 (print), 1557-7341 (electronic)", ISSN-L = "0360-0300", bibdate = "Sat Aug 31 09:04:36 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/compsurv.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3291047", abstract = "The world is undergoing an unprecedented technological transformation, evolving into a state where ubiquitous Internet-enabled ``things'' will be able to generate and share large amounts of security- and privacy-sensitive data. To cope with the security threats that are thus foreseeable, system designers can find in Arm TrustZone hardware technology a most valuable resource. TrustZone is a System-on-Chip and CPU system-wide security solution, available on today's Arm application processors and present in the new generation Arm microcontrollers, which are expected to dominate the market of smart ``things.'' Although this technology has remained relatively underground since its inception in 2004, over the past years, numerous initiatives have significantly advanced the state of the art involving Arm TrustZone. Motivated by this revival of interest, this paper presents an in-depth study of TrustZone technology. We provide a comprehensive survey of relevant work from academia and industry, presenting existing systems into two main areas, namely, Trusted Execution Environments and hardware-assisted virtualization. Furthermore, we analyze the most relevant weaknesses of existing systems and propose new research directions within the realm of tiniest devices and the Internet of Things, which we believe to have potential to yield high-impact contributions in the future.", acknowledgement = ack-nhfb, articleno = "130", fjournal = "ACM Computing Surveys", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204", } @Article{Ponraj:2019:OVM, author = "Anitha Ponraj", title = "Optimistic virtual machine placement in cloud data centers using queuing approach", journal = j-FUT-GEN-COMP-SYS, volume = "93", number = "??", pages = "338--344", month = apr, year = "2019", CODEN = "FGSEVI", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Tue Feb 5 08:15:52 MST 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.sciencedirect.com/science/article/pii/S0167739X18304692", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Prades:2019:GJM, author = "J. Prades and F. Silla", title = "{GPU}-Job Migration: The {rCUDA} Case", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "30", number = "12", pages = "2718--2729", month = dec, year = "2019", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2019.2924433", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Thu Dec 19 09:20:35 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/pvm.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Parallel and Distributed Systems", journal-URL = "http://www.computer.org/portal/web/csdl/transactions/tpds", keywords = "CUDA; GPU; Graphics processing units; Middleware; migration; Proposals; rCUDA; Resource management; Virtual machining; virtualization; Virtualization", } @Article{Raju:2019:STB, author = "BKSP Kumar Raju and G. Geethakumari", title = "{SNAPS}: Towards building snapshot based provenance system for virtual machines in the cloud environment", journal = j-COMPUT-SECUR, volume = "86", number = "??", pages = "92--111", month = sep, year = "2019", CODEN = "CPSEDU", ISSN = "0167-4048 (print), 1872-6208 (electronic)", ISSN-L = "0167-4048", bibdate = "Mon Sep 23 09:47:02 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.sciencedirect.com/science/article/pii/S0167404818301895", acknowledgement = ack-nhfb, fjournal = "Computers \& Security", journal-URL = "https://www.sciencedirect.com/science/journal/01674048", } @Article{Rathinaraja:2019:DRB, author = "J. Rathinaraja and V. S. Ananthanarayana and Anand Paul", title = "Dynamic ranking-based {MapReduce} job scheduler to exploit heterogeneous performance in a virtualized environment", journal = j-J-SUPERCOMPUTING, volume = "75", number = "11", pages = "7520--7549", month = nov, year = "2019", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-019-02960-0", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Sat Jul 25 07:17:52 MDT 2020", bibsource = "http://link.springer.com/journal/11227/75/11; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Ren:2019:PLL, author = "Shiru Ren and Yunqi Zhang and Lichen Pan and Zhen Xiao", title = "Phantasy: Low-Latency Virtualization-Based Fault Tolerance via Asynchronous Prefetching", journal = j-IEEE-TRANS-COMPUT, volume = "68", number = "2", pages = "225--238", month = "????", year = "2019", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.2018.2865943", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Mon Feb 4 19:28:55 MST 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://ieeexplore.ieee.org/document/8438984/", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Computers", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", } @Article{Rosa:2019:AOT, author = "Andrea Ros{\`a} and Eduardo Rosales and Walter Binder", title = "Analysis and Optimization of Task Granularity on the {Java Virtual Machine}", journal = j-TOPLAS, volume = "41", number = "3", pages = "19:1--19:??", month = jul, year = "2019", CODEN = "ATPSDT", DOI = "https://doi.org/10.1145/3338497", ISSN = "0164-0925 (print), 1558-4593 (electronic)", ISSN-L = "0164-0925", bibdate = "Sat Nov 23 07:18:02 MST 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2010.bib; https://www.math.utah.edu/pub/tex/bib/toplas.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3338497", abstract = "Task granularity, i.e., the amount of work performed by parallel tasks, is a key performance attribute of parallel applications. On the one hand, fine-grained tasks (i.e., small tasks carrying out few computations) may introduce considerable parallelization overheads. On the other hand, coarse-grained tasks (i.e., large tasks performing substantial computations) may not fully utilize the available CPU cores, leading to missed parallelization opportunities. In this article, we provide a better understanding of task granularity for task-parallel applications running on a single Java Virtual Machine in a shared-memory multicore. We present a new methodology to accurately and efficiently collect the granularity of each executed task, implemented in a novel profiler (available open-source) that collects carefully selected metrics from the whole system stack with low overhead, and helps developers locate performance and scalability problems. We analyze task granularity in the DaCapo, ScalaBench, and Spark Perf benchmark suites, revealing inefficiencies related to fine-grained and coarse-grained tasks in several applications. We demonstrate that the collected task-granularity profiles are actionable by optimizing task granularity in several applications, achieving speedups up to a factor of $ 5.90 \times $. Our results highlight the importance of analyzing and optimizing task granularity on the Java Virtual Machine.", acknowledgement = ack-nhfb, articleno = "19", fjournal = "ACM Transactions on Programming Languages and Systems", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J783", } @Article{Ruan:2019:VMA, author = "Xiaojun Ruan and Haiquan Chen and Yun Tian and Shu Yin", title = "Virtual machine allocation and migration based on performance-to-power ratio in energy-efficient clouds", journal = j-FUT-GEN-COMP-SYS, volume = "100", number = "??", pages = "380--394", month = nov, year = "2019", CODEN = "FGSEVI", DOI = "https://doi.org/10.1016/j.future.2019.05.036", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Mon Feb 10 12:55:01 MST 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X18321629", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Sayadnavard:2019:CRE, author = "Monireh H. Sayadnavard and Abolfazl Toroghi Haghighat and Amir Masoud Rahmani", title = "Correction to: {A reliable energy-aware approach for dynamic virtual machine consolidation in cloud data centers}", journal = j-J-SUPERCOMPUTING, volume = "75", number = "4", pages = "2148--2148", month = apr, year = "2019", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-018-02733-1", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Thu Oct 10 15:31:18 MDT 2019", bibsource = "http://link.springer.com/journal/11227/75/4; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "See \cite{Sayadnavard:2019:REA}.", URL = "http://link.springer.com/content/pdf/10.1007/s11227-018-02733-1.pdf", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Sayadnavard:2019:REA, author = "Monireh H. Sayadnavard and Abolfazl Toroghi Haghighat and Amir Masoud Rahmani", title = "A reliable energy-aware approach for dynamic virtual machine consolidation in cloud data centers", journal = j-J-SUPERCOMPUTING, volume = "75", number = "4", pages = "2126--2147", month = apr, year = "2019", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-018-2709-7", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Thu Oct 10 15:31:18 MDT 2019", bibsource = "http://link.springer.com/journal/11227/75/4; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "See \cite{Sayadnavard:2019:CRE}.", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Sha:2019:CED, author = "Le-Tian Sha and Fu Xiao and Hai-Ping Huang and Yu Chen and Ru-Chuan Wang", title = "Catching Escapers: a Detection Method for Advanced Persistent Escapers in Industry {Internet of Things} Based on Identity-based Broadcast Encryption {(IBBE)}", journal = j-TECS, volume = "18", number = "3", pages = "29:1--29:??", month = jun, year = "2019", CODEN = "????", DOI = "https://doi.org/10.1145/3319615", ISSN = "1539-9087 (print), 1558-3465 (electronic)", ISSN-L = "1539-9087", bibdate = "Thu Oct 17 18:16:43 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib; https://www.math.utah.edu/pub/tex/bib/tecs.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3319615", abstract = "As the Industry 4.0 or Internet of Things (IoT) era begins, security plays a key role in the Industry Internet of Things (IIoT) due to various threats, which include escape or Distributed Denial of Service (DDoS) attackers in the virtualization layer and vulnerability exploiters in the device layer. A successful cross-VM escape attack in the virtualization layer combined with cross-layer penetration in the device layer, which we define as an Advanced Persistent Escaper (APE), poses a great threat. Therefore, the development of detection and rejection methods for APEs across multiple layers in IIoT is an open issue. To the best of our knowledge, less effective methods are established, especially for vulnerability exploitation in the virtualization layer and backdoor leverage in the device layer. On the basis of this, we propose Escaper Cops (EscaperCOP), a detection method for cross-VM escapers in the virtualization layer and cross-layer penetrators in the device layer. In particular, a new detection method for guest-to-host escapers is proposed for the virtualization layer. Finally, a novel encryption method based on Identity-based Broadcast Encryption (IBBE) is proposed to protect the critical components in EscaperCOP, detection library, and control command library. To verify our method, experimental tests are performed for a large number of APEs in an IIoT framework. The test results have demonstrated the proposed method is effective with an acceptable level of detection ratio.", acknowledgement = ack-nhfb, articleno = "29", fjournal = "ACM Transactions on Embedded Computing Systems", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J840", } @Article{Shooshtarian:2019:MRE, author = "L. Shooshtarian and F. Safaei", title = "A maximally robustness embedding algorithm in virtual data centers with multi-attribute node ranking based on {TOPSIS}", journal = j-J-SUPERCOMPUTING, volume = "75", number = "12", pages = "8059--8093", month = dec, year = "2019", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-019-02981-9", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Sat Jul 25 07:17:52 MDT 2020", bibsource = "http://link.springer.com/journal/11227/75/12; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Simao:2019:GWS, author = "J. Sim{\~a}o and S. Esteves and Andr{\'e} Pires and L. Veiga", title = "{{\em GC-Wise}}: a Self-adaptive approach for memory-performance efficiency in {Java VMs}", journal = j-FUT-GEN-COMP-SYS, volume = "100", number = "??", pages = "674--688", month = nov, year = "2019", CODEN = "FGSEVI", DOI = "https://doi.org/10.1016/j.future.2019.05.027", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Mon Feb 10 12:55:01 MST 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/java2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X18304898", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Son:2019:CNM, author = "Jungmin Son and TianZhang He and Rajkumar Buyya", title = "{CloudSimSDN-NFV}: Modeling and simulation of network function virtualization and service function chaining in edge computing environments", journal = j-SPE, volume = "49", number = "12", pages = "1748--1764", month = dec, year = "2019", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/spe.2755", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Fri Dec 13 10:58:35 MST 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", onlinedate = "22 October 2019", } @Article{Sparks:2019:EDH, author = "Jonathan Sparks", title = "Enabling {Docker} for {HPC}", journal = j-CCPE, volume = "31", number = "16", pages = "e5018:1--e5018:??", day = "25", month = aug, year = "2019", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.5018", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Sat Oct 12 11:00:04 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "Concurr. Comput.", fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", onlinedate = "03 December 2018", } @Article{Stamou:2019:ANM, author = "Adamantia Stamou and Grigorios Kakkavas and Konstantinos Tsitseklis and Vasileios Karyotis and Symeon Papavassiliou", title = "Autonomic Network Management and Cross-Layer Optimization in Software Defined Radio Environments", journal = j-FUTURE-INTERNET, volume = "11", number = "2", pages = "37", day = "03", month = feb, year = "2019", CODEN = "????", DOI = "https://doi.org/10.3390/fi11020037", ISSN = "1999-5903", ISSN-L = "1999-5903", bibdate = "Thu Nov 21 16:51:04 MST 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/future-internet.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.mdpi.com/1999-5903/11/2/37", abstract = "The demand for Autonomic Network Management (ANM) and optimization is as intense as ever, even though significant research has been devoted towards this direction. This paper addresses such need in Software Defined (SDR) based Cognitive Radio Networks (CRNs). We propose a new framework for ANM and network reconfiguration combining Software Defined Networks (SDN) with SDR via Network Function Virtualization (NFV) enabled Virtual Utility Functions (VUFs). This is the first approach combining ANM with SDR and SDN via NFV, demonstrating how these state-of-the-art technologies can be effectively combined to achieve reconfiguration flexibility, improved performance and efficient use of available resources. In order to show the feasibility of the proposed framework, we implemented its main functionalities in a cross-layer resource allocation mechanism for CRNs over real SDR testbeds provided by the Orchestration and Reconfiguration Control Architecture (ORCA) EU project. We demonstrate the efficacy of our framework, and based on the obtained results, we identify aspects that can be further investigated for improving the applicability and increasing performance of our broader framework.", acknowledgement = ack-nhfb, journal-URL = "https://www.mdpi.com/journal/futureinternet", remark = "Special Issue Software Defined Networking (SDN) and Network Function Virtualization (NFV).", } @Article{Staples:2019:SAB, author = "J. Staples and C. Endicott and L. Krause and P. Pal and P. Samouelian and R. Schantz and A. Wellman", title = "A Semi-Autonomic Bytecode Repair Framework", journal = j-IEEE-SOFTWARE, volume = "36", number = "2", pages = "97--102", month = mar # "\slash " # apr, year = "2019", CODEN = "IESOEG", DOI = "https://doi.org/10.1109/MS.2018.2886829", ISSN = "0740-7459 (print), 1937-4194 (electronic)", ISSN-L = "0740-7459", bibdate = "Fri Aug 2 09:25:48 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeesoft.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Software", journal-URL = "http://www.computer.org/portal/web/csdl/magazines/software", keywords = "Cryptography; Ecosystems; Java; Java virtual machine languages; Maintenance engineering; SABRE; semiautonomic bytecode repair engine framework; Servers; Software development; Software maintenance", } @Article{Sun:2019:MOO, author = "Daniel Sun and Shiping Chen and Guoqiang Li and Yuanyuan Zhang and Muhammad Atif", title = "Multi-objective Optimisation of Online Distributed Software Update for {DevOps} in Clouds", journal = j-TOIT, volume = "19", number = "3", pages = "43:1--43:??", month = nov, year = "2019", CODEN = "????", DOI = "https://doi.org/10.1145/3338851", ISSN = "1533-5399 (print), 1557-6051 (electronic)", ISSN-L = "1533-5399", bibdate = "Sat Nov 23 11:09:41 MST 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/toit.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "This article studies synchronous online distributed software update, also known as rolling upgrade in DevOps, which in clouds upgrades software versions in virtual machine instances even when various failures may occur. The goal is to minimise completion time, availability degradation, and monetary cost for entire rolling upgrade by selecting proper parameters. For this goal, we propose a stochastic model and a novel optimisation method. We validate our approach to minimise the objectives through both experiments in Amazon Web Service (AWS) and simulations.", acknowledgement = ack-nhfb, articleno = "43", fjournal = "ACM Transactions on Internet Technology (TOIT)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780", } @Article{Tan:2019:VMC, author = "Huailiang Tan and Yanjie Tan and Xiaofei He and Kenli Li and Keqin Li", title = "A Virtual Multi-Channel {GPU} Fair Scheduling Method for Virtual Machines", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "30", number = "2", pages = "257--270", month = feb, year = "2019", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2018.2865341", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Thu Feb 14 06:19:13 MST 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.computer.org/csdl/trans/td/2019/02/08434359-abs.html", acknowledgement = ack-nhfb, journal-URL = "http://www.computer.org/tpds/archives.htm", } @Article{Tavakoli-Someh:2019:MOV, author = "Sanaz Tavakoli-Someh and Mohammad Hossein Rezvani", title = "Multi-objective virtual network function placement using {NSGA--II} meta-heuristic approach", journal = j-J-SUPERCOMPUTING, volume = "75", number = "10", pages = "6451--6487", month = oct, year = "2019", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-019-02849-y", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Thu Oct 10 15:31:16 MDT 2019", bibsource = "http://link.springer.com/journal/11227/75/10; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Tekinerdogan:2019:SIA, author = "Bedir Tekinerdogan and Uwe Zdun and M. Ali Babar", title = "Special issue on architecting for hyper connectivity and hyper virtualization", journal = j-J-SYST-SOFTW, volume = "149", number = "??", pages = "531--532", month = mar, year = "2019", CODEN = "JSSODM", DOI = "https://doi.org/10.1016/j.jss.2018.12.020", ISSN = "0164-1212 (print), 1873-1228 (electronic)", ISSN-L = "0164-1212", bibdate = "Wed Jan 23 16:35:05 MST 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0164121218302802", acknowledgement = ack-nhfb, fjournal = "Journal of Systems and Software", journal-URL = "http://www.sciencedirect.com/science/journal/01641212", } @Article{Toosi:2019:EAS, author = "Adel Nadjaran Toosi and Jungmin Son and Qinghua Chi and Rajkumar Buyya", title = "{ElasticSFC}: Auto-scaling techniques for elastic service function chaining in network functions virtualization-based clouds", journal = j-J-SYST-SOFTW, volume = "152", number = "??", pages = "108--119", month = jun, year = "2019", CODEN = "JSSODM", DOI = "https://doi.org/10.1016/j.jss.2019.02.052", ISSN = "0164-1212 (print), 1873-1228 (electronic)", ISSN-L = "0164-1212", bibdate = "Mon May 27 07:11:51 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0164121219300421", acknowledgement = ack-nhfb, fjournal = "Journal of Systems and Software", journal-URL = "http://www.sciencedirect.com/science/journal/01641212", } @Article{Ugawa:2019:EBJ, author = "Tomoharu Ugawa and Hideya Iwasaki and Takafumi Kataoka", title = "{eJSTK}: Building {JavaScript} virtual machines with customized datatypes for embedded systems", journal = j-J-COMPUT-LANG, volume = "51", number = "??", pages = "261--279", month = apr, year = "2019", CODEN = "????", DOI = "https://doi.org/10.1016/j.cola.2019.01.003", ISSN = "2665-9182 (print), 2590-1184 (electronic)", ISSN-L = "2590-1184", bibdate = "Mon Sep 29 08:54:27 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2010.bib; https://www.math.utah.edu/pub/tex/bib/jcomputlang.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1045926X18302416", acknowledgement = ack-nhfb, ajournal = "J. Comput. Lang.", fjournal = "Journal of Computer Languages", journal-URL = "https://www.sciencedirect.com/journal/journal-of-computer-languages", } @Article{Varshney:2019:ARC, author = "P. Varshney and Y. Simmhan", title = "{AutoBoT}: Resilient and Cost-Effective Scheduling of a Bag of Tasks on Spot {VMs}", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "30", number = "7", pages = "1512--1527", month = jul, year = "2019", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2018.2889851", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Fri Aug 30 06:09:58 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Parallel and Distributed Systems", journal-URL = "http://www.computer.org/portal/web/csdl/transactions/tpds", keywords = "active runtime decisions; Amazon EC2 pricing data; AutoBoT; bag of tasks; bag-of-tasks; Bot (Internet); BoT size; Checkpointing; checkpointing; checkpointing strategies; cloud computing; Cloud computing; cloud computing; cloud model; cloud virtual machines; computer centres; cost reduction; cost-effective scheduling; data centers; distributed systems; fixed-price VMs; Google; Google cluster workload; heuristics; loss budget; monetary cost; Pricing; pricing; Reliability; reliability; Scheduling; scheduling; spot pricing; Task analysis; task parallel applications; time periods; time-variant pricing; virtual machines", } @Article{Wang:2019:ATA, author = "Zhong Wang and Daniel Sun and Guangtao Xue and Shiyou Qian and Guoqiang Li and Minglu Li", title = "{Ada-Things}: an adaptive virtual machine monitoring and migration strategy for {Internet of Things} applications", journal = j-J-PAR-DIST-COMP, volume = "132", number = "??", pages = "164--176", month = oct, year = "2019", CODEN = "JPDCER", DOI = "https://doi.org/10.1016/j.jpdc.2018.06.009", ISSN = "0743-7315 (print), 1096-0848 (electronic)", ISSN-L = "0743-7315", bibdate = "Fri Sep 13 10:25:20 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0743731518304404", acknowledgement = ack-nhfb, fjournal = "Journal of Parallel and Distributed Computing", journal-URL = "http://www.sciencedirect.com/science/journal/07437315", } @Article{Wang:2019:MTR, author = "Qingyang Wang and Shungeng Zhang and Yasuhiko Kanemasa and Calton Pu", title = "Mitigating Tail Response Time of $n$-Tier Applications: The Impact of Asynchronous Invocations", journal = j-TOIT, volume = "19", number = "3", pages = "36:1--36:??", month = nov, year = "2019", CODEN = "????", DOI = "https://doi.org/10.1145/3340462", ISSN = "1533-5399 (print), 1557-6051 (electronic)", ISSN-L = "1533-5399", bibdate = "Sat Nov 23 11:09:41 MST 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/toit.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3340462", abstract = "Consistent low response time is essential for e-commerce due to intense competitive pressure. However, practitioners of web applications have often encountered the long-tail response time problem in cloud data centers as the system utilization reaches moderate levels (e.g., 50\%). Our fine-grained measurements of an open source n-tier benchmark application (RUBBoS) show such long response times are often caused by Cross-tier Queue Overflow (CTQO). Our experiments reveal the CTQO is primarily created by the synchronous nature of RPC-style call/response inter-tier communications, which create strong inter-tier dependencies due to the request processing chain of classic n-tier applications composed of synchronous RPC/thread-based servers. We remove gradually the dependencies in n-tier applications by replacing the classic synchronous servers (e.g., Apache, Tomcat, and MySQL) with their corresponding event-driven asynchronous version (e.g., Nginx, XTomcat, and XMySQL) one-by-one. Our measurements with two application scenarios (virtual machine co-location and background monitoring interference) show that replacing a subset of asynchronous servers will shift the CTQO, without significant improvements in long-tail response time. Only when all the servers become asynchronous the CTQO is resolved. In synchronous n-tier applications, long-tail response times resulting from CTQO arise at utilization as low as 43\%. On the other hand, the completely asynchronous n-tier system can disrupt CTQO and remove the long tail latency at utilization as high as 83\%.", acknowledgement = ack-nhfb, articleno = "36", fjournal = "ACM Transactions on Internet Technology (TOIT)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J780", } @Article{Wang:2019:VTV, author = "Sen Wang and Jun Bi and Jianping Wu and Athanasios V. Vasilakos and Qilin Fan", title = "{VNE-TD}: a virtual network embedding algorithm based on temporal-difference learning", journal = j-COMP-NET-AMSTERDAM, volume = "161", number = "??", pages = "251--263", day = "9", month = oct, year = "2019", CODEN = "????", ISSN = "1389-1286 (print), 1872-7069 (electronic)", ISSN-L = "1389-1286", bibdate = "Mon Oct 14 17:19:57 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S138912861830584X", acknowledgement = ack-nhfb, fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)", journal-URL = "http://www.sciencedirect.com/science/journal/13891286/", } @Article{Wei:2019:HBS, author = "Song Wei and Kun Zhang and Bibo Tu", title = "{HyperBench}: a Benchmark Suite for Virtualization Capabilities", journal = j-SIGMETRICS, volume = "47", number = "1", pages = "73--74", month = dec, year = "2019", CODEN = "????", DOI = "https://doi.org/10.1145/3376930.3376977", ISSN = "0163-5999 (print), 1557-9484 (electronic)", ISSN-L = "0163-5999", bibdate = "Mon Jan 27 06:15:26 MST 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigmetrics.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/abs/10.1145/3376930.3376977", abstract = "Virtualization is ubiquitous in modern data centers. By deploying applications on separate virtual machines hosted in a shared physical machine, it brings benefits over traditional systems in resources utilization[5, 10], system security[2, 3], and \ldots{}", acknowledgement = ack-nhfb, fjournal = "ACM SIGMETRICS Performance Evaluation Review", journal-URL = "https://dl.acm.org/loi/sigmetrics", } @Article{Wenzl:2019:HET, author = "Matthias Wenzl and Georg Merzdovnik and Johanna Ullrich and Edgar Weippl", title = "From Hack to Elaborate Technique --- a Survey on Binary Rewriting", journal = j-COMP-SURV, volume = "52", number = "3", pages = "49:1--49:37", month = jul, year = "2019", CODEN = "CMSVAN", DOI = "https://doi.org/10.1145/3316415", ISSN = "0360-0300 (print), 1557-7341 (electronic)", ISSN-L = "0360-0300", bibdate = "Sat Aug 31 09:04:37 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/compsurv.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/ft_gateway.cfm?id=3316415", abstract = "Binary rewriting is changing the semantics of a program without having the source code at hand. It is used for diverse purposes, such as emulation (e.g., QEMU), optimization (e.g., DynInst), observation (e.g., Valgrind), and hardening (e.g., Control flow integrity enforcement). This survey gives detailed insight into the development and state-of-the-art in binary rewriting by reviewing 67 publications from 1966 to 2018. Starting from these publications, we provide an in-depth investigation of the challenges and respective solutions to accomplish binary rewriting. Based on our findings, we establish a thorough categorization of binary rewriting approaches with respect to their use-case, applied analysis technique, code-transformation method, and code generation techniques. We contribute a comprehensive mapping between binary rewriting tools, applied techniques, and their domain of application. Our findings emphasize that although much work has been done over the past decades, most of the effort was put into improvements aiming at rewriting general purpose applications but ignoring other challenges like altering throughput-oriented programs or software with real-time requirements, which are often used in the emerging field of the Internet of Things. To the best of our knowledge, our survey is the first comprehensive overview on the complete binary rewriting process.", acknowledgement = ack-nhfb, articleno = "49", fjournal = "ACM Computing Surveys", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204", } @Article{Xie:2019:DDS, author = "An Xie and Huawei Huang and Xiaoliang Wang and Song Guo and Zhuzhong Qian and Sanglu Lu", title = "{Dual}: Deploy stateful virtual network function chains by jointly allocating data-control traffic", journal = j-COMP-NET-AMSTERDAM, volume = "162", number = "??", pages = "Article 106868", month = "????", year = "2019", CODEN = "????", DOI = "https://doi.org/10.1016/j.comnet.2019.106868", ISSN = "1389-1286 (print), 1872-7069 (electronic)", ISSN-L = "1389-1286", bibdate = "Mon Oct 14 17:21:59 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1389128619303962", acknowledgement = ack-nhfb, fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)", journal-URL = "http://www.sciencedirect.com/science/journal/13891286/", } @Article{Xu:2019:MCE, author = "Heyang Xu and Yang Liu and Wei Wei and Ying Xue", title = "Migration Cost and Energy-Aware Virtual Machine Consolidation Under Cloud Environments Considering Remaining Runtime", journal = j-INT-J-PARALLEL-PROG, volume = "47", number = "3", pages = "481--501", month = jun, year = "2019", CODEN = "IJPPE5", DOI = "https://doi.org/10.1007/s10766-018-00622-x", ISSN = "0885-7458 (print), 1573-7640 (electronic)", ISSN-L = "0885-7458", bibdate = "Fri Oct 11 08:37:52 MDT 2019", bibsource = "http://link.springer.com/journal/10766/47/3; https://www.math.utah.edu/pub/tex/bib/intjparallelprogram.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "International Journal of Parallel Programming", journal-URL = "http://link.springer.com/journal/10766", } @Article{Yang:2019:IRT, author = "Chao-Tung Yang and Shuo-Tsung Chen and Jung-Chun Liu and Yao-Yu Yang and Karan Mitra and Rajiv Ranjan", title = "Implementation of a real-time network traffic monitoring service with network functions virtualization", journal = j-FUT-GEN-COMP-SYS, volume = "93", number = "??", pages = "687--701", month = apr, year = "2019", CODEN = "FGSEVI", DOI = "https://doi.org/10.1016/j.future.2018.08.050", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Tue Feb 5 08:15:52 MST 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.sciencedirect.com/science/article/pii/S0167739X1830311X", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Yao:2019:EVM, author = "Feng Yao and Yiping Yao and Huangke Chen and Tianlin Li and Menglong Lin and Xiaoxiong Zhang", title = "An efficient virtual machine allocation algorithm for parallel and distributed simulation applications", journal = j-CCPE, volume = "31", number = "17", pages = "e5237:1--e5237:??", day = "10", month = sep, year = "2019", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.5237", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Sat Oct 12 11:00:05 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", onlinedate = "13 March 2019", } @Article{Yu:2019:LAV, author = "Chao Yu and Leihua Qin and Jingli Zhou", title = "A lock-aware virtual machine scheduling scheme for synchronization performance", journal = j-J-SUPERCOMPUTING, volume = "75", number = "1", pages = "20--32", month = jan, year = "2019", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-015-1557-y", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Thu Oct 10 15:31:15 MDT 2019", bibsource = "http://link.springer.com/journal/11227/75/1; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Zeuch:2019:AES, author = "Steffen Zeuch and Bonaventura {Del Monte} and Jeyhun Karimov and Clemens Lutz and Manuel Renz and Jonas Traub and Sebastian Bre{\ss} and Tilmann Rabl and Volker Markl", title = "Analyzing efficient stream processing on modern hardware", journal = j-PROC-VLDB-ENDOWMENT, volume = "12", number = "5", pages = "516--530", month = jan, year = "2019", CODEN = "????", DOI = "https://doi.org/10.14778/3303753.3303758", ISSN = "2150-8097", bibdate = "Wed Feb 27 14:03:31 MST 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2010.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; https://www.math.utah.edu/pub/tex/bib/vldbe.bib", abstract = "Modern Stream Processing Engines (SPEs) process large data volumes under tight latency constraints. Many SPEs execute processing pipelines using message passing on shared-nothing architectures and apply a partition-based scale-out strategy to handle high-velocity input streams. Furthermore, many state-of-the-art SPEs rely on a Java Virtual Machine to achieve platform independence and speed up system development by abstracting from the underlying hardware. In this paper, we show that taking the underlying hardware into account is essential to exploit modern hardware efficiently. To this end, we conduct an extensive experimental analysis of current SPEs and SPE design alternatives optimized for modern hardware. Our analysis highlights potential bottlenecks and reveals that state-of-the-art SPEs are not capable of fully exploiting current and emerging hardware trends, such as multi-core processors and high-speed networks. Based on our analysis, we describe a set of design changes to the common architecture of SPEs to scale-up on modern hardware. We show that the single-node throughput can be increased by up to two orders of magnitude compared to state-of-the-art SPEs by applying specialized code generation, fusing operators, batch-style parallelization strategies, and optimized windowing. This speedup allows for deploying typical streaming applications on a single or a few nodes instead of large clusters.", acknowledgement = ack-nhfb, fjournal = "Proceedings of the VLDB Endowment", journal-URL = "http://portal.acm.org/citation.cfm?id=J1174", } @Article{Zhang:2019:AMD, author = "Lei Zhang and Zhemin Yang and Yuyu He and Mingqi Li and Sen Yang and Min Yang and Yuan Zhang and Zhiyun Qian", title = "App in the Middle: Demystify Application Virtualization in {Android} and its Security Threats", journal = j-SIGMETRICS, volume = "47", number = "1", pages = "75--76", month = dec, year = "2019", CODEN = "????", DOI = "https://doi.org/10.1145/3376930.3376978", ISSN = "0163-5999 (print), 1557-9484 (electronic)", ISSN-L = "0163-5999", bibdate = "Mon Jan 27 06:15:26 MST 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigmetrics.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/abs/10.1145/3376930.3376978", abstract = "Customizability is a key feature of the Android operating system that differentiates it from Apple's iOS. One concrete feature that gaining popularity is called ``app virtualization''. This feature allows multiple copies of the same app to be installed \ldots{}", acknowledgement = ack-nhfb, fjournal = "ACM SIGMETRICS Performance Evaluation Review", journal-URL = "https://dl.acm.org/loi/sigmetrics", } @Article{Zhang:2019:CFV, author = "Fei Zhang and Guangming Liu and Bo Zhao and Piotr Kasprzak and Xiaoming Fu and Ramin Yahyapour", title = "{CBase}: Fast Virtual Machine storage data migration with a new data center structure", journal = j-J-PAR-DIST-COMP, volume = "124", number = "??", pages = "14--26", month = feb, year = "2019", CODEN = "JPDCER", DOI = "https://doi.org/10.1016/j.jpdc.2018.10.001", ISSN = "0743-7315 (print), 1096-0848 (electronic)", ISSN-L = "0743-7315", bibdate = "Mon Jan 7 07:58:40 MST 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0743731518307342", acknowledgement = ack-nhfb, fjournal = "Journal of Parallel and Distributed Computing", journal-URL = "http://www.sciencedirect.com/science/journal/07437315", } @Article{Zhang:2019:EAV, author = "Xinqian Zhang and Tingming Wu and Mingsong Chen and Tongquan Wei and Junlong Zhou and Shiyan Hu and Rajkumar Buyya", title = "Energy-aware virtual machine allocation for cloud with resource reservation", journal = j-J-SYST-SOFTW, volume = "147", number = "??", pages = "147--161", month = jan, year = "2019", CODEN = "JSSODM", DOI = "https://doi.org/10.1016/j.jss.2018.09.084", ISSN = "0164-1212 (print), 1873-1228 (electronic)", ISSN-L = "0164-1212", bibdate = "Wed Dec 5 10:20:00 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0164121218302152", acknowledgement = ack-nhfb, fjournal = "Journal of Systems and Software", journal-URL = "http://www.sciencedirect.com/science/journal/01641212", } @Article{Zhang:2019:RNO, author = "Fei Zhang and Guangming Liu and Bo Zhao and Xiaoming Fu and Ramin Yahyapour", title = "Reducing the network overhead of user mobility-induced virtual machine migration in mobile edge computing", journal = j-SPE, volume = "49", number = "4", pages = "673--693", month = apr, year = "2019", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/spe.2642", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Mon Mar 25 14:15:53 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", onlinedate = "28 September 2018", } @Article{Zhang:2019:TVN, author = "Chuanji Zhang and Harshvardhan P. Joshi and George F. Riley and Steven A. Wright", title = "Towards a virtual network function research agenda: a systematic literature review of {VNF} design considerations", journal = j-J-NETW-COMPUT-APPL, volume = "146", number = "??", pages = "Article 102417", month = "????", year = "2019", CODEN = "JNCAF3", ISSN = "1084-8045 (print), 1095-8592 (electronic)", ISSN-L = "1084-8045", bibdate = "Mon Oct 14 14:16:36 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1084804519302516", acknowledgement = ack-nhfb, fjournal = "Journal of Network and Computer Applications", journal-URL = "http://www.sciencedirect.com/science/journal/10848045", } @Article{Zhao:2019:RUC, author = "Yan Zhao and Hongwei Liu and Yan Wang and Zhan Zhang and Decheng Zuo", title = "Reducing the upfront cost of private clouds with clairvoyant virtual machine placement", journal = j-J-SUPERCOMPUTING, volume = "75", number = "1", pages = "340--369", month = jan, year = "2019", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-018-02730-4", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Thu Oct 10 15:31:15 MDT 2019", bibsource = "http://link.springer.com/journal/11227/75/1; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Zhong:2019:TFL, author = "K. Zhong and D. Liu and Y. Wu and L. Long and W. Liu and J. Ren and R. Liu and L. Liang and Z. Shao and T. Li", title = "Towards Fast and Lightweight Checkpointing for Mobile Virtualization Using {NVRAM}", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "30", number = "6", pages = "1421--1433", month = jun, year = "2019", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2018.2886906", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Fri Aug 30 06:09:58 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Parallel and Distributed Systems", journal-URL = "http://www.computer.org/portal/web/csdl/transactions/tpds", keywords = "byte-addressable; checkpointing; Checkpointing; checkpointing; energy-efficient data deduplication; Exynos 5250 SoC; fault-tolerance; flash memories; lightweight checkpointing machinery; mobile computing; Mobile handsets; Mobile virtualization; mobile virtualization; non-volatile memory; Nonvolatile memory; nonvolatile memory; NVRAM; Performance evaluation; Phase change materials; power aware computing; Random access memory; random-access storage; slow flash memory; storage management; storage space; system-on-chip; user experience; virtual machines; virtualisation; Virtualization; virtualized mobile devices; VM snapshot; VM's entire memory", } @Article{Abadi:2020:CCS, author = "Reza Mohamadi Bahram Abadi and Amir Masoud Rahmani and Sasan Hossein Alizadeh", title = "Correction to: {Challenges of server consolidation in virtualized data centers and open research issues: a systematic literature review}", journal = j-J-SUPERCOMPUTING, volume = "76", number = "4", pages = "2928--2928", month = apr, year = "2020", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-019-03105-z", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Sat Jul 25 07:17:55 MDT 2020", bibsource = "http://link.springer.com/journal/11227/76/4; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "See \cite{Abadi:2020:CSC}.", URL = "http://link.springer.com/content/pdf/10.1007/s11227-019-03105-z.pdf", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Abadi:2020:CSC, author = "Reza Mohamadi Bahram Abadi and Amir Masoud Rahmani and Sasan Hossein Alizadeh", title = "Challenges of server consolidation in virtualized data centers and open research issues: a systematic literature review", journal = j-J-SUPERCOMPUTING, volume = "76", number = "4", pages = "2876--2927", month = apr, year = "2020", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-019-03068-1", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Sat Jul 25 07:17:55 MDT 2020", bibsource = "http://link.springer.com/journal/11227/76/4; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "See correction \cite{Abadi:2020:CCS}.", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Alam:2020:SNV, author = "Iqbal Alam and Kashif Sharif and Fan Li and Zohaib Latif and M. M. Karim and Sujit Biswas and Boubakr Nour and Yu Wang", title = "A Survey of Network Virtualization Techniques for {Internet of Things} Using {SDN} and {NFV}", journal = j-COMP-SURV, volume = "53", number = "2", pages = "35:1--35:40", month = jul, year = "2020", CODEN = "CMSVAN", DOI = "https://doi.org/10.1145/3379444", ISSN = "0360-0300 (print), 1557-7341 (electronic)", ISSN-L = "0360-0300", bibdate = "Wed Jul 8 17:24:43 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/compsurv.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/abs/10.1145/3379444", abstract = "Internet of Things (IoT) and Network Softwarization are fast becoming core technologies of information systems and network management for the next-generation Internet. The deployment and applications of IoT range from smart cities to urban computing and \ldots{}", acknowledgement = ack-nhfb, articleno = "35", fjournal = "ACM Computing Surveys", journal-URL = "https://dl.acm.org/loi/csur", } @Article{Baalamurugan:2020:MOK, author = "K. M. Baalamurugan and S. Vijay Bhanu", title = "A multi-objective krill herd algorithm for virtual machine placement in cloud computing", journal = j-J-SUPERCOMPUTING, volume = "76", number = "6", pages = "4525--4542", month = jun, year = "2020", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-018-2516-1", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Sat Jul 25 07:17:57 MDT 2020", bibsource = "http://link.springer.com/journal/11227/76/6; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Bao:2020:PPE, author = "W. Bao and D. Yuan and B. B. Zhou and A. Y. Zomaya", title = "Prune and Plant: Efficient Placement and Parallelism of Virtual Network Functions", journal = j-IEEE-TRANS-COMPUT, volume = "69", number = "6", pages = "800--811", year = "2020", CODEN = "ITCOB4", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Thu Jul 23 16:03:24 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Computers", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", } @Article{Bays:2020:RSV, author = "Leonardo Richter Bays and Luciano Paschoal Gaspary", title = "Reality shock in virtual network embedding: {Flexibilizing} demands for dealing with multiple operational requirements in {SDNs}", journal = j-J-NETW-COMPUT-APPL, volume = "153", number = "??", pages = "??--??", day = "1", month = mar, year = "2020", CODEN = "JNCAF3", DOI = "https://doi.org/10.1016/j.jnca.2019.102508", ISSN = "1084-8045 (print), 1095-8592 (electronic)", ISSN-L = "1084-8045", bibdate = "Mon May 24 15:12:33 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1084804519303686", acknowledgement = ack-nhfb, articleno = "102508", fjournal = "Journal of Network and Computer Applications", journal-URL = "http://www.sciencedirect.com/science/journal/10848045", } @Article{Benmakrelouf:2020:ABD, author = "Souhila Benmakrelouf and C{\'e}dric St-Onge and Nadjia Kara and Hanine Tout and Claes Edstrom and Yves Lemieux", title = "Abnormal behavior detection using resource level to service level metrics mapping in virtualized systems", journal = j-FUT-GEN-COMP-SYS, volume = "102", number = "??", pages = "680--700", month = jan, year = "2020", CODEN = "FGSEVI", DOI = "https://doi.org/10.1016/j.future.2019.07.051", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Mon Feb 10 12:55:04 MST 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X19306600", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Berghaus:2020:HTC, author = "F. Berghaus and K. Casteels and J. Weldon", title = "High-Throughput Cloud Computing with the Cloudscheduler {VM} Provisioning Service", journal = j-COMPUT-SOFTW-BIG-SCI, volume = "4", number = "1", pages = "??--??", month = dec, year = "2020", CODEN = "????", DOI = "https://doi.org/10.1007/s41781-020-0036-1", ISSN = "2510-2036 (print), 2510-2044 (electronic)", ISSN-L = "2510-2036", bibdate = "Fri Apr 9 06:38:19 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/computsoftwbigsci.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://link.springer.com/article/10.1007/s41781-020-0036-1", acknowledgement = ack-nhfb, articleno = "4", fjournal = "Computing and Software for Big Science", journal-URL = "https://www.springer.com/journal/41781", online-date = "Published: 13 February 2020 Article: 4", } @Article{Bermejo:2020:VMC, author = "Belen Bermejo and Carlos Juiz", title = "Virtual machine consolidation: a systematic review of its overhead influencing factors", journal = j-J-SUPERCOMPUTING, volume = "76", number = "1", pages = "324--361", month = jan, year = "2020", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-019-03025-y", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Sat Jul 25 07:17:53 MDT 2020", bibsource = "http://link.springer.com/journal/11227/76/1; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Bir:2020:DIE, author = "Parth Bir and Shylaja Vinaykumar Karatangi and Amrita Rai", title = "Design and implementation of an elastic processor with hyperthreading technology and virtualization for elastic server models", journal = j-J-SUPERCOMPUTING, volume = "76", number = "9", pages = "7394--7415", month = sep, year = "2020", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-020-03174-5", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Fri May 14 09:19:58 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://link.springer.com/article/10.1007/s11227-020-03174-5", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", online-date = "Published: 24 January 2020 Pages: 7394 - 7415", } @Article{Bogo:2020:CAO, author = "Matteo Bogo and Jacopo Soldani and Davide Neri and Antonio Brogi", title = "Component-aware orchestration of cloud-based enterprise applications, from {TOSCA} to {Docker} and {Kubernetes}", journal = j-SPE, volume = "50", number = "9", pages = "1793--1821", month = sep, year = "2020", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/spe.2848", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Fri Aug 14 11:05:24 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "Softw. Pract. Exp.", fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", onlinedate = "28 May 2020", } @Article{Braiki:2020:FLB, author = "Khaoula Braiki and Habib Youssef", title = "Fuzzy-logic-based multi-objective best-fit-decreasing virtual machine reallocation", journal = j-J-SUPERCOMPUTING, volume = "76", number = "1", pages = "427--454", month = jan, year = "2020", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-019-03029-8", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Sat Jul 25 07:17:53 MDT 2020", bibsource = "http://link.springer.com/journal/11227/76/1; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Chen:2020:SSV, author = "Yunliang Chen and Xiaodao Chen and Wangyang Liu and Yuchen Zhou and Albert Y. Zomaya and Rajiv Ranjan and Shiyan Hu", title = "Stochastic scheduling for variation-aware virtual machine placement in a cloud computing {CPS}", journal = j-FUT-GEN-COMP-SYS, volume = "105", number = "??", pages = "779--788", month = apr, year = "2020", CODEN = "FGSEVI", DOI = "https://doi.org/10.1016/j.future.2017.09.024", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Mon Feb 10 12:55:07 MST 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X17320101", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Cheng:2020:SVC, author = "Yuxia Cheng and Wenzhi Chen and Zonghui Wang and Zhongxian Tang and Yang Xiang", title = "Smart {VM} co-scheduling with the precise prediction of performance characteristics", journal = j-FUT-GEN-COMP-SYS, volume = "105", number = "??", pages = "1016--1027", month = apr, year = "2020", CODEN = "FGSEVI", DOI = "https://doi.org/10.1016/j.future.2016.11.022", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Mon Feb 10 12:55:07 MST 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X16306616", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Compastie:2020:VSI, author = "Maxime Compasti{\'e} and R{\'e}mi Badonnel and Olivier Festor and Ruan He", title = "From virtualization security issues to cloud protection opportunities: an in-depth analysis of system virtualization models", journal = j-COMPUT-SECUR, volume = "97", number = "??", pages = "Article 101905", month = oct, year = "2020", CODEN = "CPSEDU", DOI = "https://doi.org/10.1016/j.cose.2020.101905", ISSN = "0167-4048 (print), 1872-6208 (electronic)", ISSN-L = "0167-4048", bibdate = "Wed Mar 10 08:25:06 MST 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167404820301814", acknowledgement = ack-nhfb, fjournal = "Computers \& Security", journal-URL = "http://www.sciencedirect.com/science/journal/01674048", } @Article{Daoud:2020:MAJ, author = "Houssem Daoud and Michel Dagenais", title = "Multilevel analysis of the {Java Virtual Machine} based on kernel and userspace traces", journal = j-J-SYST-SOFTW, volume = "167", number = "??", pages = "??--??", month = sep, year = "2020", CODEN = "JSSODM", DOI = "https://doi.org/10.1016/j.jss.2020.110589", ISSN = "0164-1212 (print), 1873-1228 (electronic)", ISSN-L = "0164-1212", bibdate = "Mon May 24 20:13:53 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2020.bib; https://www.math.utah.edu/pub/tex/bib/jsystsoftw2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0164121220300698", acknowledgement = ack-nhfb, articleno = "110589", fjournal = "Journal of Systems and Software", journal-URL = "http://www.sciencedirect.com/science/journal/01641212", } @Article{Dhule:2020:PSP, author = "Chetan Dhule and Urmila Shrawankar", title = "{POF-SVLM}: {Pareto} optimized framework for seamless {VM} live migration", journal = j-COMPUTING, volume = "102", number = "10", pages = "2159--2183", month = oct, year = "2020", CODEN = "CMPTA2", DOI = "https://doi.org/10.1007/s00607-020-00815-8", ISSN = "0010-485X (print), 1436-5057 (electronic)", ISSN-L = "0010-485X", bibdate = "Wed Mar 31 15:46:36 MDT 2021", bibsource = "http://link.springer.com/journal/607/102/10; https://www.math.utah.edu/pub/tex/bib/computing.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Computing", journal-URL = "http://link.springer.com/journal/607", } @Article{Ding:2020:AVM, author = "Weichao Ding and Fei Luo and Liangxiu Han and Chunhua Gu and Haifeng Lu and Joel Fuentes", title = "Adaptive virtual machine consolidation framework based on performance-to-power ratio in cloud data centers", journal = j-FUT-GEN-COMP-SYS, volume = "111", number = "??", pages = "254--270", month = oct, year = "2020", CODEN = "FGSEVI", DOI = "https://doi.org/10.1016/j.future.2020.05.004", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Fri Jun 19 07:44:21 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X19307769", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Donnell:2020:DVM, author = "Nicola Mc Donnell and Enda Howley and Jim Duggan", title = "Dynamic virtual machine consolidation using a multi-agent system to optimise energy efficiency in cloud computing", journal = j-FUT-GEN-COMP-SYS, volume = "108", number = "??", pages = "288--301", month = jul, year = "2020", CODEN = "FGSEVI", DOI = "https://doi.org/10.1016/j.future.2020.02.036", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Fri Jun 19 07:44:16 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X19314591", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Ebadifard:2020:SSW, author = "Fatemeh Ebadifard and Seyed Morteza Babamir", title = "Scheduling scientific workflows on virtual machines using a {Pareto} and hypervolume based black hole optimization algorithm", journal = j-J-SUPERCOMPUTING, volume = "76", number = "10", pages = "7635--7688", month = oct, year = "2020", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-020-03183-4", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Fri May 14 09:19:56 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://link.springer.com/article/10.1007/s11227-020-03183-4", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", online-date = "Published: 06 February 2020 Pages: 7635 - 7688", } @Article{Fang:2020:RAV, author = "Lang Fang and Xiaoning Zhang and Keshav Sood and Yunqing Wang and Shui Yu", title = "Reliability-aware virtual network function placement in carrier networks", journal = j-J-NETW-COMPUT-APPL, volume = "154", number = "??", pages = "??--??", day = "15", month = mar, year = "2020", CODEN = "JNCAF3", DOI = "https://doi.org/10.1016/j.jnca.2020.102536", ISSN = "1084-8045 (print), 1095-8592 (electronic)", ISSN-L = "1084-8045", bibdate = "Mon May 24 15:12:33 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1084804520300102", acknowledgement = ack-nhfb, articleno = "102536", fjournal = "Journal of Network and Computer Applications", journal-URL = "http://www.sciencedirect.com/science/journal/10848045", } @Article{Fei:2020:PWN, author = "Xincai Fei and Fangming Liu and Qixia Zhang and Hai Jin and Hongxin Hu", title = "Paving the Way for {NFV} Acceleration: a Taxonomy, Survey and Future Directions", journal = j-COMP-SURV, volume = "53", number = "4", pages = "73:1--73:42", month = sep, year = "2020", CODEN = "CMSVAN", DOI = "https://doi.org/10.1145/3397022", ISSN = "0360-0300 (print), 1557-7341 (electronic)", ISSN-L = "0360-0300", bibdate = "Sun Sep 27 07:06:06 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/compsurv.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1145/3397022", abstract = "As a recent innovation, network functions virtualization (NFV) --- with its core concept of replacing hardware middleboxes with software network functions (NFs) implemented in commodity servers --- promises cost savings and flexibility benefits. However, transitioning NFs from special-purpose hardware to commodity servers has turned out to be more challenging than expected, as it inevitably incurs performance penalties due to bottlenecks in both software and hardware. To achieve performance comparable to hardware middleboxes, there is a strong demand for a speedup in NF processing, which plays a crucial role in the success of NFV. In this article, we study the performance challenges that exist in general-purpose servers and simultaneously summarize the typical performance bottlenecks in NFV. Through reviewing the progress in the field of NFV acceleration, we present a new taxonomy of the state-of-the-art efforts according to various acceleration approaches. We discuss the surveyed works and identify the respective advantages and disadvantages in each category. We then discuss the products, solutions, and projects emerged in industry. We also present a gap analysis to improve current solutions and highlight promising research trends that can be explored in the future.", acknowledgement = ack-nhfb, articleno = "73", fjournal = "ACM Computing Surveys", journal-URL = "https://dl.acm.org/loi/csur", } @Article{Gao:2020:CMS, author = "Lingnan Gao and George N. Rouskas", title = "Congestion Minimization for Service Chain Routing Problems With Path Length Considerations", journal = j-IEEE-TRANS-NETWORKING, volume = "28", number = "6", pages = "2643--2656", month = dec, year = "2020", CODEN = "IEANEP", DOI = "https://doi.org/10.1109/TNET.2020.3017792", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Tue Feb 23 08:45:31 MST 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3017792", abstract = "Network function virtualization (NFV), with its perceived potential to accelerate service deployment and to introduce flexibility in service provisioning, has drawn a growing interest from industry and academia alike over the past few years. One of the \ldots{}", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "https://dl.acm.org/loi/ton", } @Article{Ghasemi:2020:MOL, author = "Arezoo Ghasemi and Abolfazl Toroghi Haghighat", title = "A multi-objective load balancing algorithm for virtual machine placement in cloud data centers based on machine learning", journal = j-COMPUTING, volume = "102", number = "9", pages = "2049--2072", month = sep, year = "2020", CODEN = "CMPTA2", DOI = "https://doi.org/10.1007/s00607-020-00813-w", ISSN = "0010-485X (print), 1436-5057 (electronic)", ISSN-L = "0010-485X", bibdate = "Wed Mar 31 15:46:36 MDT 2021", bibsource = "http://link.springer.com/journal/607/102/9; https://www.math.utah.edu/pub/tex/bib/computing.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Computing", journal-URL = "http://link.springer.com/journal/607", } @Article{Gilesh:2020:OLM, author = "Malayam Parambath Gilesh and Subham Jain and S. D. Madhu Kumar and Lillykutty Jacob and Umesh Bellur", title = "Opportunistic live migration of virtual machines", journal = j-CCPE, volume = "32", number = "5", pages = "e5477:1--e5477:??", day = "10", month = mar, year = "2020", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.5477", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Wed Mar 31 07:52:13 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "Concurr. Comput.", fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", onlinedate = "14 August 2019", } @Article{Haghshenas:2020:PBU, author = "Kawsar Haghshenas and Siamak Mohammadi", title = "Prediction-based underutilized and destination host selection approaches for energy-efficient dynamic {VM} consolidation in data centers", journal = j-J-SUPERCOMPUTING, volume = "76", number = "12", pages = "10240--10257", month = dec, year = "2020", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-020-03248-4", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Fri May 14 09:19:57 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://link.springer.com/article/10.1007/s11227-020-03248-4", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", online-date = "Published: 16 March 2020 Pages: 10240 - 10257", } @Article{Hoffmann:2020:RVM, author = "Leah Hoffmann", title = "Reinventing Virtual Machines", journal = j-CACM, volume = "63", number = "4", pages = "128ff", month = apr, year = "2020", CODEN = "CACMA2", DOI = "https://doi.org/10.1145/3381947", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Tue Apr 21 15:35:34 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "http://dl.acm.org/pub.cfm?id=J782", numpages = "2", } @Article{Hsieh:2020:UPA, author = "Sun-Yuan Hsieh and Cheng-Sheng Liu and Rajkumar Buyya and Albert Y. Zomaya", title = "Utilization-prediction-aware virtual machine consolidation approach for energy-efficient cloud data centers", journal = j-J-PAR-DIST-COMP, volume = "139", number = "??", pages = "99--109", month = may, year = "2020", CODEN = "JPDCER", ISSN = "0743-7315 (print), 1096-0848 (electronic)", ISSN-L = "0743-7315", bibdate = "Wed Mar 18 09:26:12 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S074373151930190X", acknowledgement = ack-nhfb, fjournal = "Journal of Parallel and Distributed Computing", journal-URL = "http://www.sciencedirect.com/science/journal/07437315", } @Article{Ijaz:2020:RHP, author = "Qaiser Ijaz and El-Bay Bourennane and Ali Kashif Bashir and Hira Asghar", title = "Revisiting the High-Performance Reconfigurable Computing for Future Datacenters", journal = j-FUTURE-INTERNET, volume = "12", number = "4", pages = "64", day = "06", month = apr, year = "2020", CODEN = "????", DOI = "https://doi.org/10.3390/fi12040064", ISSN = "1999-5903", bibdate = "Thu May 28 15:16:57 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/future-internet.bib; https://www.math.utah.edu/pub/tex/bib/super.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.mdpi.com/1999-5903/12/4/64", abstract = "Modern datacenters are reinforcing the computational power and energy efficiency by assimilating field programmable gate arrays (FPGAs). The sustainability of this large-scale integration depends on enabling multi-tenant FPGAs. This requisite amplifies the importance of communication architecture and virtualization method with the required features in order to meet the high-end objective. Consequently, in the last decade, academia and industry proposed several virtualization techniques and hardware architectures for addressing resource management, scheduling, adoptability, segregation, scalability, performance-overhead, availability, programmability, time-to-market, security, and mainly, multitenancy. This paper provides an extensive survey covering three important aspects --- discussion on non-standard terms used in existing literature, network-on-chip evaluation choices as a mean to explore the communication architecture, and virtualization methods under latest classification. The purpose is to emphasize the importance of choosing appropriate communication architecture, virtualization technique and standard language to evolve the multi-tenant FPGAs in datacenters. None of the previous surveys encapsulated these aspects in one writing. Open problems are indicated for scientific community as well.", acknowledgement = ack-nhfb, journal-URL = "https://www.mdpi.com/1999-5903/", remark = "Collection Featured Reviews of Future Internet Research.", } @Article{Ingalls:2020:TDL, author = "Daniel Ingalls and Eliot Miranda and Cl{\'e}ment B{\'e}ra and Elisa Gonzalez Boix", title = "Two decades of live coding and debugging of virtual machines through simulation", journal = j-SPE, volume = "50", number = "9", pages = "1629--1650", month = sep, year = "2020", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/spe.2841", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Fri Aug 14 11:05:24 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "Softw. Pract. Exp.", fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", onlinedate = "08 May 2020", } @Article{Kang:2020:PMT, author = "JiHun Kang and JongBeom Lim and HeonChang Yu", title = "Partial migration technique for {GPGPU} tasks to Prevent {GPU} Memory Starvation in {RPC}-based {GPU} Virtualization", journal = j-SPE, volume = "50", number = "6", pages = "948--972", month = jun, year = "2020", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/spe.2801", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Fri Aug 14 11:05:23 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "Softw. Pract. Exp.", fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", onlinedate = "11 February 2020", } @Article{Karmakar:2020:BAC, author = "Kamalesh Karmakar and Rajib K. Das and Sunirmal Khatua", title = "Bandwidth allocation for communicating virtual machines in cloud data centers", journal = j-J-SUPERCOMPUTING, volume = "76", number = "9", pages = "7268--7289", month = sep, year = "2020", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-019-03128-6", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Fri May 14 09:19:58 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://link.springer.com/article/10.1007/s11227-019-03128-6", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", online-date = "Published: 18 January 2020 Pages: 7268 - 7289", } @Article{Karthikeyan:2020:ECA, author = "K. Karthikeyan and R. Sunder and K. Shankar and S. K. Lakshmanaprabu and V. Vijayakumar and Mohamed Elhoseny and Gunasekaran Manogaran", title = "Energy consumption analysis of Virtual Machine migration in cloud using hybrid swarm optimization {(ABC-BA)}", journal = j-J-SUPERCOMPUTING, volume = "76", number = "5", pages = "3374--3390", month = may, year = "2020", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-018-2583-3", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Sat Jul 25 07:17:57 MDT 2020", bibsource = "http://link.springer.com/journal/11227/76/5; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Kavitha:2020:PAA, author = "Kadarla Kavitha and S. C. Sharma", title = "Performance analysis of {ACO}-based improved virtual machine allocation in cloud for {IoT}-enabled healthcare", journal = j-CCPE, volume = "32", number = "21", pages = "e5613:1--e5613:??", day = "10", month = nov, year = "2020", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.5613", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Wed Mar 31 07:52:21 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "Concurr. Comput.", fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", onlinedate = "19 December 2019", } @Article{Kim:2020:RTS, author = "T. Kim and C. H. Park and J. Huh and J. Ahn", title = "Reconciling Time Slice Conflicts of Virtual Machines With Dual Time Slice for Clouds", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "31", number = "10", pages = "2453--2465", year = "2020", CODEN = "ITDSEO", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Sat Aug 15 14:52:38 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Parallel and Distributed Systems", journal-URL = "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=71", } @Article{Kourai:2020:FSC, author = "Kenichi Kourai and Kouta Sannomiya", title = "Flexible service consolidation with nested virtualization and library operating systems", journal = j-SPE, volume = "50", number = "1", pages = "3--21", month = jan, year = "2020", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/spe.2752", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Fri Dec 13 10:58:35 MST 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", onlinedate = "24 October 2019", } @Article{Kulkarni:2020:RAE, author = "Sameer G. Kulkarni and Guyue Liu and K. K. Ramakrishnan and Mayutan Arumaithurai and Timothy Wood and Xiaoming Fu", title = "{REINFORCE}: Achieving Efficient Failure Resiliency for Network Function Virtualization-Based Services", journal = j-IEEE-TRANS-NETWORKING, volume = "28", number = "2", pages = "695--708", month = apr, year = "2020", CODEN = "IEANEP", DOI = "https://doi.org/10.1109/TNET.2020.2969961", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Sat Aug 15 14:18:14 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2020.2969961", abstract = "Ensuring high availability (HA) for software-based networks is a critical design feature that will help the adoption of software-based network functions (NFs) in production networks. It is important for NFs to avoid outages and maintain mission-critical \ldots{}", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "https://dl.acm.org/loi/ton", } @Article{Li:2020:EEQ, author = "Zhihua Li and Xinrong Yu and Lei Yu and Shujie Guo and Victor Chang", title = "Energy-efficient and quality-aware {VM} consolidation method", journal = j-FUT-GEN-COMP-SYS, volume = "102", number = "??", pages = "789--809", month = jan, year = "2020", CODEN = "FGSEVI", DOI = "https://doi.org/10.1016/j.future.2019.08.004", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Mon Feb 10 12:55:04 MST 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X18324713", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Li:2020:MOO, author = "Rui Li and Qinghua Zheng and Xiuqi Li and Zheng Yan", title = "Multi-objective optimization for rebalancing virtual machine placement", journal = j-FUT-GEN-COMP-SYS, volume = "105", number = "??", pages = "824--842", month = apr, year = "2020", CODEN = "FGSEVI", DOI = "https://doi.org/10.1016/j.future.2017.08.027", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Mon Feb 10 12:55:07 MST 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X1731840X", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Lin:2020:LGN, author = "Yilei Lin and Ting He and Shiqiang Wang and Kevin Chan and Stephen Pasteris", title = "Looking Glass of {NFV}: Inferring the Structure and State of {NFV} Network From External Observations", journal = j-IEEE-TRANS-NETWORKING, volume = "28", number = "4", pages = "1477--1490", month = aug, year = "2020", CODEN = "IEANEP", DOI = "https://doi.org/10.1109/TNET.2020.2985908", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Tue Feb 23 08:45:28 MST 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1109/TNET.2020.2985908", abstract = "The rapid development of network function virtualization (NFV) enables a communication network to provide in-network services using virtual network functions (VNFs) deployed on general IT hardware. While existing studies on NFV focused on how to provision \ldots{}", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "https://dl.acm.org/loi/ton", } @Article{Liu:2020:LCV, author = "Zhenpeng Liu and Jiahuan Lu and Nan Su and Bin Zhang and Xiaofei Li", title = "Location-Constrained Virtual Machine Placement {(LCVP)} Algorithm", journal = j-SCI-PROG, volume = "2020", number = "1", pages = "8846087:1--8846087:??", year = "2020", CODEN = "SCIPEV", DOI = "https://doi.org/10.1155/2020/8846087", ISSN = "1058-9244 (print), 1875-919X (electronic)", ISSN-L = "1058-9244", bibdate = "Mon Sep 2 14:36:22 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/sciprogram.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://onlinelibrary.wiley.com/doi/epdf/10.1155/2020/8846087", acknowledgement = ack-nhfb, ajournal = "Sci. Program.", fjournal = "Scientific Programming", journal-URL = "http://iospress.metapress.com/content/1058-9244", } @Article{Lu:2020:GEV, author = "Q. Lu and X. Zheng and J. Ma and Y. Dong and Z. Qi and J. Yao and B. He and H. Guan", title = "{gMig}: Efficient {vGPU} Live Migration with Overlapped Software-Based Dirty Page Verification", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "31", number = "5", pages = "1209--1222", month = may, year = "2020", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2019.2947521", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Thu Feb 20 10:08:58 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Parallel and Distributed Systems", journal-URL = "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=71", keywords = "Cloud computing; Computer architecture; GPU; Graphics processing units; Hardware; migration; Performance evaluation; virtualization; Virtualization", } @Article{Lu:2020:GQO, author = "Q. Lu and J. Yao and H. Guan and P. Gao", title = "{gQoS}: a {QoS}-Oriented {GPU} Virtualization with Adaptive Capacity Sharing", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "31", number = "4", pages = "843--855", month = apr, year = "2020", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2019.2948753", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Wed Jan 22 06:09:50 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/pvm.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Parallel and Distributed Systems", journal-URL = "http://www.computer.org/portal/web/csdl/transactions/tpds", keywords = "Cloud computing; cloud computing; GPU virtualization; Graphics processing units; Hardware; QoS control; Quality of service; Resource management; resource scheduling; Virtual machining; Virtualization", } @Article{Luo:2020:OAV, author = "Ziyue Luo and Chuan Wu", title = "An Online Algorithm for {VNF} Service Chain Scaling in Datacenters", journal = j-IEEE-TRANS-NETWORKING, volume = "28", number = "3", pages = "1061--1073", month = jun, year = "2020", CODEN = "IEANEP", DOI = "https://doi.org/10.1109/TNET.2020.2979263", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Tue Feb 23 08:45:26 MST 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1109/TNET.2020.2979263", abstract = "Built on top of virtualization technologies, network function virtualization (NFV) provides flexible and scalable software implementation of various network functions. Virtual network functions (VNFs), which are network functions implemented as virtual \ldots{}", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "https://dl.acm.org/loi/ton", } @Article{Masdari:2020:GCC, author = "Mohammad Masdari and Mehran Zangakani", title = "Green Cloud Computing Using Proactive Virtual Machine Placement: Challenges and Issues", journal = j-J-GRID-COMP, volume = "18", number = "4", pages = "727--759", month = dec, year = "2020", CODEN = "????", DOI = "https://doi.org/10.1007/s10723-019-09489-9", ISSN = "1570-7873 (print), 1572-9184 (electronic)", ISSN-L = "1570-7873", bibdate = "Fri May 14 09:08:25 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/jgridcomp.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://link.springer.com/article/10.1007/s10723-019-09489-9", acknowledgement = ack-nhfb, fjournal = "Journal of Grid Computing", journal-URL = "http://link.springer.com/journal/10723", online-date = "Published: 27 August 2019 Pages: 727 - 759", } @Article{Mesnard:2020:RWP, author = "O. Mesnard and L. A. Barba", title = "Reproducible Workflow on a Public Cloud for Computational Fluid Dynamics", journal = j-COMPUT-SCI-ENG, volume = "22", number = "1", pages = "102--116", month = jan # "\slash " # feb, year = "2020", CODEN = "CSENFA", DOI = "https://doi.org/10.1109/MCSE.2019.2941702", ISSN = "1521-9615 (print), 1558-366X (electronic)", ISSN-L = "1521-9615", bibdate = "Thu Mar 05 14:46:04 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/computscieng.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Computing in Science and Engineering", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5992", keywords = "Application software; application software stack; Azure cloud; Benchmark testing; Cloud computing; cloud computing; cloud environment; cloud offerings; computational fluid dynamics; computational fluid dynamics studies; Computational modeling; Docker containers; expanded reproducibility package; high-performance computing; HPC nodes; in-house research software; parallel computing; parallel processing; public cloud Microsoft Azure; reproducible workflow; Research and development; Runtime environment; Software packages; virtual machines; Virtual machining", } @Article{Monge:2020:COM, author = "David A. Monge and Elina Pacini and Cristian Mateos and Enrique Alba and Carlos Garc{\'\i}a Garino", title = "{CMI}: an online multi-objective genetic autoscaler for scientific and engineering workflows in cloud infrastructures with unreliable virtual machines", journal = j-J-NETW-COMPUT-APPL, volume = "149", number = "??", pages = "??--??", day = "1", month = jan, year = "2020", CODEN = "JNCAF3", DOI = "https://doi.org/10.1016/j.jnca.2019.102464", ISSN = "1084-8045 (print), 1095-8592 (electronic)", ISSN-L = "1084-8045", bibdate = "Mon May 24 15:12:31 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1084804519303248", acknowledgement = ack-nhfb, articleno = "102464", fjournal = "Journal of Network and Computer Applications", journal-URL = "http://www.sciencedirect.com/science/journal/10848045", } @Article{Naeen:2020:AMB, author = "Hossein Monshizadeh Naeen and Esmaeil Zeinali and Abolfazl Toroghi Haghighat", title = "Adaptive {Markov}-based approach for dynamic virtual machine consolidation in cloud data centers with quality-of-service constraints", journal = j-SPE, volume = "50", number = "2", pages = "161--183", month = feb, year = "2020", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/spe.2764", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Fri Aug 14 11:05:21 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "Softw. Pract. Exp.", fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", onlinedate = "12 December 2019", } @Article{Naranjo:2020:ASC, author = "Diana M. Naranjo and Sebasti{\'a}n Risco and Carlos de Alfonso and Alfonso P{\'e}rez and Ignacio Blanquer and Germ{\'a}n Molt{\'o}", title = "Accelerated serverless computing based on {GPU} virtualization", journal = j-J-PAR-DIST-COMP, volume = "139", number = "??", pages = "32--42", month = may, year = "2020", CODEN = "JPDCER", DOI = "https://doi.org/10.1016/j.jpdc.2020.01.004", ISSN = "0743-7315 (print), 1096-0848 (electronic)", ISSN-L = "0743-7315", bibdate = "Wed Mar 18 09:26:12 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib; https://www.math.utah.edu/pub/tex/bib/pvm.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0743731519303533", acknowledgement = ack-nhfb, fjournal = "Journal of Parallel and Distributed Computing", journal-URL = "http://www.sciencedirect.com/science/journal/07437315", } @Article{Papavassiliou:2020:SDN, author = "Symeon Papavassiliou", title = "Software Defined Networking {(SDN)} and Network Function Virtualization {(NFV)}", journal = j-FUTURE-INTERNET, volume = "12", number = "1", pages = "7", day = "02", month = jan, year = "2020", CODEN = "????", DOI = "https://doi.org/10.3390/fi12010007", ISSN = "1999-5903", bibdate = "Mon Mar 2 12:22:41 MST 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/future-internet.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.mdpi.com/1999-5903/12/1/7", abstract = "The role of Software Defined Networking (SDN) and Network Function Virtualization (NFV) have been instrumental in realizing the transition and vision ``from black boxes to a white box towards facilitating 5G network architectures''. Though significant research results and several deployments have occurred and realized over the last few years focusing on the NFV and SDN technologies, several issues --- both of theoretical and practical importance --- remain still open. Accordingly, the papers of this special issue are significant contributions samples within the general ecosystem highlighted above, ranging from SDN and NFV architectures and implementations, to SDN-NFV integration and orchestration approaches, while considering issues associated with optimization, network management and security aspects. In particular, a total of nine excellent articles (one review and eight original research articles) have been accepted, following a rigorous review process, and addressing many of the aforementioned challenges and beyond.", acknowledgement = ack-nhfb, journal-URL = "https://www.mdpi.com/journal/futureinternet", remark = "Special Issue Software Defined Networking (SDN) and Network Function Virtualization (NFV).", } @Article{Patil:2020:DVA, author = "Rajendra Patil and Harsha Dudeja and Chirag Modi", title = "Designing in-{VM}-assisted lightweight agent-based malware detection framework for securing virtual machines in cloud computing", journal = j-INT-J-INFO-SEC, volume = "19", number = "2", pages = "147--162", month = apr, year = "2020", CODEN = "????", DOI = "https://doi.org/10.1007/s10207-019-00447-w", ISSN = "1615-5262 (print), 1615-5270 (electronic)", ISSN-L = "1615-5262", bibdate = "Wed Mar 18 12:04:16 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjinfosec.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer.com/article/10.1007/s10207-019-00447-w", acknowledgement = ack-nhfb, fjournal = "International Journal of Information Security", journal-URL = "https://link.springer.com/journal/10207", } @Article{Perez:2020:OPN, author = "Taciano D. Perez and Marcelo V. Neves and Diego Medaglia and Pedro H. G. Monteiro and C{\'e}sar A. F. {De Rose}", title = "Orthogonal persistence in nonvolatile memory architectures: a persistent heap design and its implementation for a {Java Virtual Machine}", journal = j-SPE, volume = "50", number = "4", pages = "368--387", month = apr, year = "2020", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/spe.2781", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Fri Aug 14 11:05:22 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2020.bib; https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "Softw. Pract. Exp.", fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", onlinedate = "17 December 2019", } @Article{Pham:2020:CAE, author = "Minh Pham and Doan B. Hoang and Zenon Chaczko", title = "Congestion-Aware and Energy-Aware Virtual Network Embedding", journal = j-IEEE-TRANS-NETWORKING, volume = "28", number = "1", pages = "210--223", month = feb, year = "2020", CODEN = "IEANEP", DOI = "https://doi.org/10.1109/TNET.2019.2958367", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Sat Aug 15 14:18:12 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2019.2958367", abstract = "Network virtualization is an inherent component of future internet architectures. Network resources are virtualized from the underlying substrate and elastically provisioned and offered to customers on-demand. Optimal allocation of network resources in \ldots{}", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "https://dl.acm.org/loi/ton", } @Article{Pham:2020:MAR, author = "Tuan-Minh Pham and Serge Fdida and Thi-Thuy-Lien Nguyen and Hoai-Nam Chu", title = "Modeling and analysis of robust service composition for network functions virtualization", journal = j-COMP-NET-AMSTERDAM, volume = "166", number = "??", pages = "Article 106989", day = "15", month = jan, year = "2020", CODEN = "????", DOI = "https://doi.org/10.1016/j.comnet.2019.106989", ISSN = "1389-1286 (print), 1872-7069 (electronic)", ISSN-L = "1389-1286", bibdate = "Fri Aug 14 10:03:45 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1389128619305080", acknowledgement = ack-nhfb, fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)", journal-URL = "http://www.sciencedirect.com/science/journal/13891286/", } @Article{Phung:2020:LPM, author = "J. Phung and Y. C. Lee and A. Y. Zomaya", title = "Lightweight Power Monitoring Framework for Virtualized Computing Environments", journal = j-IEEE-TRANS-COMPUT, volume = "69", number = "1", pages = "14--25", month = jan, year = "2020", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.2019.2936018", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Thu Jan 9 07:48:57 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Computers", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", keywords = "Benchmark testing; Central Processing Unit; containers; Energy efficiency; Estimation; Monitoring; Power demand; Power measurement; power model; power monitoring; running average power limit; Servers; virtualization", } @Article{Qaiser:2020:NEB, author = "Hammad ur Rehman Qaiser and Gao Shu", title = "{Nash} equilibrium based replacement of virtual machines for efficient utilization of cloud data centers", journal = j-COMPUTING, volume = "102", number = "12", pages = "2521--2540", month = dec, year = "2020", CODEN = "CMPTA2", DOI = "https://doi.org/10.1007/s00607-020-00789-7", ISSN = "0010-485X (print), 1436-5057 (electronic)", ISSN-L = "0010-485X", bibdate = "Wed Mar 31 15:46:37 MDT 2021", bibsource = "http://link.springer.com/journal/607/102/12; https://www.math.utah.edu/pub/tex/bib/computing.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Computing", journal-URL = "http://link.springer.com/journal/607", } @Article{Rahmani:2020:BAV, author = "Somayeh Rahmani and Vahid Khajehvand and Mohsen Torabian", title = "Burstiness-aware virtual machine placement in cloud computing systems", journal = j-J-SUPERCOMPUTING, volume = "76", number = "1", pages = "362--387", month = jan, year = "2020", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-019-03037-8", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Sat Jul 25 07:17:53 MDT 2020", bibsource = "http://link.springer.com/journal/11227/76/1; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Rajabzadeh:2020:NCM, author = "Mehdi Rajabzadeh and Abolfazl Toroghi Haghighat and Amir Masoud Rahmani", title = "New comprehensive model based on virtual clusters and absorbing {Markov} chains for energy-efficient virtual machine management in cloud computing", journal = j-J-SUPERCOMPUTING, volume = "76", number = "9", pages = "7438--7457", month = sep, year = "2020", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-020-03169-2", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Fri May 14 09:19:58 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://link.springer.com/article/10.1007/s11227-020-03169-2", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", online-date = "Published: 29 January 2020 Pages: 7438 - 7457", } @Article{Randal:2020:IVR, author = "Allison Randal", title = "The Ideal Versus the Real: Revisiting the History of Virtual Machines and Containers", journal = j-COMP-SURV, volume = "53", number = "1", pages = "5:1--5:31", month = may, year = "2020", CODEN = "CMSVAN", DOI = "https://doi.org/10.1145/3365199", ISSN = "0360-0300 (print), 1557-7341 (electronic)", ISSN-L = "0360-0300", bibdate = "Sat May 30 20:55:29 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/compsurv.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/abs/10.1145/3365199", abstract = "The common perception in both academic literature and industry today is that virtual machines offer better security, whereas containers offer better performance. However, a detailed review of the history of these technologies and the current threats they face reveals a different story. This survey covers key developments in the evolution of virtual machines and containers from the 1950s to today, with an emphasis on countering modern misperceptions with accurate historical details and providing a solid foundation for ongoing research into the future of secure isolation for multitenant infrastructures, such as cloud and container deployments.", acknowledgement = ack-nhfb, articleno = "5", fjournal = "ACM Computing Surveys", journal-URL = "https://dl.acm.org/loi/csur", } @Article{Rosendo:2020:AAD, author = "Daniel Rosendo and Demis Gomes and Guto Leoni Santos and Leylane Silva and Andre Moreira and Judith Kelner and Djamel Sadok and Glauco Gon{\c{c}}alves and Amardeep Mehta and Mattias Wildeman and Patricia Takako Endo", title = "Availability analysis of design configurations to compose virtual performance-optimized data center systems in next-generation cloud data centers", journal = j-SPE, volume = "50", number = "6", pages = "805--826", month = jun, year = "2020", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/spe.2833", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Fri Aug 14 11:05:23 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "Softw. Pract. Exp.", fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", onlinedate = "21 April 2020", } @Article{Rost:2020:HIV, author = "Matthias Rost and Stefan Schmid", title = "On the Hardness and Inapproximability of Virtual Network Embeddings", journal = j-IEEE-TRANS-NETWORKING, volume = "28", number = "2", pages = "791--803", month = apr, year = "2020", CODEN = "IEANEP", DOI = "https://doi.org/10.1109/TNET.2020.2975646", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Sat Aug 15 14:18:14 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/abs/10.1109/TNET.2020.2975646", abstract = "Many resource allocation problems in the cloud can be described as a basic Virtual Network Embedding Problem (VNEP): the problem of finding a mapping of a {\em request graph\/} (describing a workload) onto a {\em substrate graph\/} \ldots{}.", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "https://dl.acm.org/loi/ton", } @Article{Saharan:2020:QEV, author = "Shweta Saharan and Gaurav Somani and Gaurav Gupta and Robin Verma and Manoj Singh Gaur and Rajkumar Buyya", title = "{QuickDedup}: Efficient {VM} deduplication in cloud computing environments", journal = j-J-PAR-DIST-COMP, volume = "139", number = "??", pages = "18--31", month = may, year = "2020", CODEN = "JPDCER", DOI = "https://doi.org/10.1016/j.jpdc.2020.01.002", ISSN = "0743-7315 (print), 1096-0848 (electronic)", ISSN-L = "0743-7315", bibdate = "Wed Mar 18 09:26:12 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0743731519303442", acknowledgement = ack-nhfb, fjournal = "Journal of Parallel and Distributed Computing", journal-URL = "http://www.sciencedirect.com/science/journal/07437315", } @Article{Saurabh:2020:ESC, author = "Nishant Saurabh and Shajulin Benedict and Jorge G. Barbosa and Radu Prodan", title = "{Expelliarmus}: Semantic-centric virtual machine image management in {IaaS} Clouds", journal = j-J-PAR-DIST-COMP, volume = "146", number = "??", pages = "107--121", month = dec, year = "2020", CODEN = "JPDCER", DOI = "https://doi.org/10.1016/j.jpdc.2020.08.001", ISSN = "0743-7315 (print), 1096-0848 (electronic)", ISSN-L = "0743-7315", bibdate = "Wed May 26 16:11:03 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0743731520303415", acknowledgement = ack-nhfb, fjournal = "Journal of Parallel and Distributed Computing", journal-URL = "http://www.sciencedirect.com/science/journal/07437315", } @Article{Sha:2020:MVM, author = "Jing Sha and Abdol Ghaffar Ebadi and Dinesh Mavaluru and Mohmmed Alshehri and Osama Alfarraj and Lila Rajabion", title = "A method for virtual machine migration in cloud computing using a collective behavior-based metaheuristics algorithm", journal = j-CCPE, volume = "32", number = "2", pages = "e5441:1--e5441:??", day = "25", month = jan, year = "2020", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.5441", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Wed Mar 31 07:52:12 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "Concurr. Comput.", fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", onlinedate = "25 July 2019", } @Article{Shirinbab:2020:PEC, author = "Sogand Shirinbab and Lars Lundberg and Emiliano Casalicchio", title = "Performance evaluation of containers and virtual machines when running {Cassandra} workload concurrently", journal = j-CCPE, volume = "32", number = "17", pages = "e5693:1--e5693:??", day = "10", month = sep, year = "2020", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.5693", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Wed Mar 31 07:52:19 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "Concurr. Comput.", fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", onlinedate = "13 February 2020", } @Article{Sierra-Arriaga:2020:SIC, author = "Federico Sierra-Arriaga and Rodrigo Branco and Ben Lee", title = "Security Issues and Challenges for Virtualization Technologies", journal = j-COMP-SURV, volume = "53", number = "2", pages = "45:1--45:37", month = jul, year = "2020", CODEN = "CMSVAN", DOI = "https://doi.org/10.1145/3382190", ISSN = "0360-0300 (print), 1557-7341 (electronic)", ISSN-L = "0360-0300", bibdate = "Wed Jul 8 17:24:43 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/compsurv.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/abs/10.1145/3382190", abstract = "Virtualization-based technologies have become ubiquitous in computing. While they provide an easy-to-implement platform for scalable, high-availability services, they also introduce new security issues. Traditionally, discussions on security \ldots{}", acknowledgement = ack-nhfb, articleno = "45", fjournal = "ACM Computing Surveys", journal-URL = "https://dl.acm.org/loi/csur", } @Article{Son:2020:DII, author = "Yunsik Son and Junho Jeong and YangSun Lee", title = "Design and implementation of an {IoT--cloud} converged virtual machine system", journal = j-J-SUPERCOMPUTING, volume = "76", number = "7", pages = "5259--5275", month = jul, year = "2020", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-019-02866-x", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Sat Jul 25 07:17:58 MDT 2020", bibsource = "http://link.springer.com/journal/11227/76/7; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Tarafdar:2020:EQS, author = "Anurina Tarafdar and Mukta Debnath and Rajib K. Das", title = "Energy and quality of service-aware virtual machine consolidation in a cloud data center", journal = j-J-SUPERCOMPUTING, volume = "76", number = "11", pages = "9095--9126", month = nov, year = "2020", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-020-03203-3", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Fri May 14 09:19:57 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://link.springer.com/article/10.1007/s11227-020-03203-3", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", online-date = "Published: 18 February 2020 Pages: 9095 - 9126", } @Article{Thakur:2020:MDV, author = "Dipanwita Thakur and Manas Khatua", title = "Multi-domain virtual network embedding with dynamic flow migration in software-defined networks", journal = j-J-NETW-COMPUT-APPL, volume = "162", number = "??", pages = "??--??", day = "15", month = jul, year = "2020", CODEN = "JNCAF3", DOI = "https://doi.org/10.1016/j.jnca.2020.102639", ISSN = "1084-8045 (print), 1095-8592 (electronic)", ISSN-L = "1084-8045", bibdate = "Mon May 24 15:12:36 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1084804520301132", acknowledgement = ack-nhfb, articleno = "102639", fjournal = "Journal of Network and Computer Applications", journal-URL = "http://www.sciencedirect.com/science/journal/10848045", } @TechReport{vanSchaik:2020:CLD, author = "Stephan van Schaik and Marina Minkin and Andrew Kwong and Daniel Genkin and Yuval Yarom", title = "{CacheOut}: Leaking Data on {Intel CPUs} via Cache Evictions", type = "Report", institution = "University of Michigan and University of Adelaide and Data61", address = "Ann Arbor, MI, USA and Adelaide, Australia", pages = "16", day = "27", month = jan, year = "2020", bibdate = "Tue Jan 28 08:58:45 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://cacheoutattack.com/CacheOut.pdf", abstract = "Recent speculative execution attacks, such as RIDL, Fallout, and ZombieLoad, demonstrated that attackers can leak information while it transits through various microarchitectural buffers. Named Microarchitectural Data Sampling (MDS) by Intel, these attacks are likened to ``drinking from the firehose'', as the attacker has little control over what data is observed and from what origin. Unable to prevent these buffers from leaking, Intel issued countermeasures via microcode updates that overwrite the buffers when the CPU changes security domains. In this work we present CacheOut, a new microarchitectural attack that is capable of bypassing Intel's buffer overwrite counter measures. We observe that as data is being evicted from the CPU L1 cache, it is often transferred back to the leaky CPU buffers where it can be recovered by the attacker. CacheOut improves over previous MDS attacks by allowing the attacker to choose which data to leak from the CPU's L1 cache, as well as which part of a cache line to leak. We demonstrate that CacheOut can leak information across multiple security boundaries, including those between hyperthreads, processes, and virtual machines, and between user space and the operating system kernel, and from SGX enclaves.", acknowledgement = ack-nhfb, } @Article{Veglis:2020:SEO, author = "Andreas Veglis and Dimitrios Giomelakis", title = "Search Engine Optimization", journal = j-FUTURE-INTERNET, volume = "12", number = "1", pages = "6", day = "31", month = dec, year = "2020", CODEN = "????", DOI = "https://doi.org/10.3390/fi12010006", ISSN = "1999-5903", bibdate = "Mon Mar 2 12:22:41 MST 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/future-internet.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.mdpi.com/1999-5903/12/1/6", abstract = "The role of Software Defined Networking (SDN) and Network Function Virtualization (NFV) have been instrumental in realizing the transition and vision ``from black boxes to a white box towards facilitating 5G network architectures''. Though significant research results and several deployments have occurred and realized over the last few years focusing on the NFV and SDN technologies, several issues --- both of theoretical and practical importance --- remain still open. Accordingly, the papers of this special issue are significant contributions samples within the general ecosystem highlighted above, ranging from SDN and NFV architectures and implementations, to SDN-NFV integration and orchestration approaches, while considering issues associated with optimization, network management and security aspects. In particular, a total of nine excellent articles (one review and eight original research articles) have been accepted, following a rigorous review process, and addressing many of the aforementioned challenges and beyond.", acknowledgement = ack-nhfb, journal-URL = "https://www.mdpi.com/journal/futureinternet", remark = "Special Issue Search Engine Optimization.", } @Article{Wade:2020:EIP, author = "April W. Wade and Prasad A. Kulkarni and Michael R. Jantz", title = "Exploring Impact of Profile Data on Code Quality in the {HotSpot JVM}", journal = j-TECS, volume = "19", number = "6", pages = "48:1--48:26", month = nov, year = "2020", CODEN = "????", DOI = "https://doi.org/10.1145/3391894", ISSN = "1539-9087 (print), 1558-3465 (electronic)", ISSN-L = "1539-9087", bibdate = "Fri Dec 10 11:17:18 MST 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2020.bib; https://www.math.utah.edu/pub/tex/bib/tecs.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1145/3391894", abstract = "Managed language virtual machines (VM) rely on dynamic or just-in-time (JIT) compilation to generate optimized native code at run-time to deliver high execution performance. Many VMs and JIT compilers collect profile data at run-time to enable profile-. \ldots{}", acknowledgement = ack-nhfb, articleno = "48", fjournal = "ACM Transactions on Embedded Computing Systems", journal-URL = "https://dl.acm.org/loi/tecs", } @Article{Wan:2020:MAC, author = "B. Wan and J. Dang and Z. Li and H. Gong and F. Zhang and S. Oh", title = "Modeling Analysis and Cost-Performance Ratio Optimization of Virtual Machine Scheduling in Cloud Computing", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "31", number = "7", pages = "1518--1532", month = jul, year = "2020", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2020.2968913", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Thu Mar 19 11:19:41 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, keywords = "Analytical models; Cloud computing; Computational modeling; cost-performance ratio optimization; Elasticity; Optimization; Queueing analysis; queuing system; Task analysis", } @Article{Wang:2020:ESF, author = "Meng Wang and Bo Cheng and Junliang Chen", title = "An Efficient Service Function Chaining Placement Algorithm in Mobile Edge Computing", journal = j-TOIT, volume = "20", number = "4", pages = "32:1--32:21", month = nov, year = "2020", CODEN = "????", DOI = "https://doi.org/10.1145/3388241", ISSN = "1533-5399 (print), 1557-6051 (electronic)", ISSN-L = "1533-5399", bibdate = "Fri Feb 5 18:12:52 MST 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/toit.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1145/3388241", abstract = "Mobile Edge Computing (MEC) is a promising network architecture that pushes network control and mobile computing to the network edge. Recent studies propose to deploy MEC applications in the Network Function Virtualization (NFV) environment. The mobile \ldots{}", acknowledgement = ack-nhfb, articleno = "32", fjournal = "ACM Transactions on Internet Technology (TOIT)", journal-URL = "https://dl.acm.org/loi/toit", } @Article{Wang:2020:MVN, author = "Cong Wang and Fanghui Zheng and Guangcong Zheng and Sancheng Peng and Zejie Tian and Yujia Guo and Guorui Li and Ying Yuan", title = "Modeling on virtual network embedding using reinforcement learning", journal = j-CCPE, volume = "32", number = "23", pages = "e6020:1--e6020:??", day = "10", month = dec, year = "2020", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.6020", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Wed Mar 31 07:52:22 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "Concurr. Comput.", fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", onlinedate = "22 September 2020", } @Article{Wang:2020:OVR, author = "Xiaohui Wang and Haoran Gu and YuXian Yue", title = "The optimization of virtual resource allocation in cloud computing based on {RBPSO}", journal = j-CCPE, volume = "32", number = "16", pages = "e5113:1--e5113:??", day = "25", month = aug, year = "2020", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.5113", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Wed Mar 31 07:52:18 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "Concurr. Comput.", fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", onlinedate = "27 December 2018", } @Article{Wei:2020:EAE, author = "Chen Wei and Zhi-Hua Hu and You-Gan Wang", title = "Exact algorithms for energy-efficient virtual machine placement in data centers", journal = j-FUT-GEN-COMP-SYS, volume = "106", number = "??", pages = "77--91", month = may, year = "2020", CODEN = "FGSEVI", DOI = "https://doi.org/10.1016/j.future.2019.12.043", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Fri Jun 19 07:44:13 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X19319594", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Wu:2020:ESI, author = "Yulei Wu and Zheng Yan and Zhiwei Zhao and Ahmed Al-Dubai", title = "Editorial: Special issue on {SDN}-based wireless network virtualization", journal = j-CCPE, volume = "32", number = "16", pages = "e5444:1--e5444:??", day = "25", month = aug, year = "2020", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.5444", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Wed Mar 31 07:52:18 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "Concurr. Comput.", fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", onlinedate = "25 July 2019", } @Article{Xu:2020:AAR, author = "Yajing Xu and Junnan Li and Zhihui Lu and Jie Wu and Patrick C. K. Hung and Abdulhameed Alelaiwi", title = "{ARVMEC}: Adaptive Recommendation of Virtual Machines for {IoT} in Edge-Cloud Environment", journal = j-J-PAR-DIST-COMP, volume = "141", number = "??", pages = "23--34", month = jul, year = "2020", CODEN = "JPDCER", DOI = "https://doi.org/10.1016/j.jpdc.2020.03.006", ISSN = "0743-7315 (print), 1096-0848 (electronic)", ISSN-L = "0743-7315", bibdate = "Wed May 26 16:11:01 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0743731520302045", acknowledgement = ack-nhfb, fjournal = "Journal of Parallel and Distributed Computing", journal-URL = "http://www.sciencedirect.com/science/journal/07437315", } @Article{Xu:2020:BVM, author = "Xiaolong Xu and Xuyun Zhang and Maqbool Khan and Wanchun Dou and Shengjun Xue and Shui Yu", title = "A balanced virtual machine scheduling method for energy-performance trade-offs in cyber-physical cloud systems", journal = j-FUT-GEN-COMP-SYS, volume = "105", number = "??", pages = "789--799", month = apr, year = "2020", CODEN = "FGSEVI", DOI = "https://doi.org/10.1016/j.future.2017.08.057", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Mon Feb 10 12:55:07 MST 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X17318927", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Xu:2020:QAV, author = "Zichuan Xu and Zhiheng Zhang and Weifa Liang and Qiufen Xia and Omer Rana and Guowei Wu", title = "{QoS}-Aware {VNF} Placement and Service Chaining for {IoT} Applications in Multi-Tier Mobile Edge Networks", journal = j-TOSN, volume = "16", number = "3", pages = "23:1--23:27", month = aug, year = "2020", CODEN = "????", DOI = "https://doi.org/10.1145/3387705", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Sat Aug 15 07:04:17 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/abs/10.1145/3387705", abstract = "Mobile edge computing and network function virtualization (NFV) paradigms enable new flexibility and possibilities of the deployment of extreme low-latency services for Internet-of-Things (IoT) applications within the proximity of their users. However, \ldots{}", acknowledgement = ack-nhfb, articleno = "23", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Yang:2020:IES, author = "Chao-Tung Yang and Tsung-Yueh Wan", title = "Implementation of an energy saving cloud infrastructure with virtual machine power usage monitoring and live migration on {OpenStack}", journal = j-COMPUTING, volume = "102", number = "6", pages = "1547--1566", month = jun, year = "2020", CODEN = "CMPTA2", DOI = "https://doi.org/10.1007/s00607-020-00808-7", ISSN = "0010-485X (print), 1436-5057 (electronic)", ISSN-L = "0010-485X", bibdate = "Wed Mar 31 15:46:35 MDT 2021", bibsource = "http://link.springer.com/journal/607/102/6; https://www.math.utah.edu/pub/tex/bib/computing.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Computing", journal-URL = "http://link.springer.com/journal/607", } @Article{Yang:2020:TRS, author = "Song Yang and Fan Li and Stojan Trajanovski and Xiaoming Fu", title = "Traffic routing in stochastic network function virtualization networks", journal = j-J-NETW-COMPUT-APPL, volume = "169", number = "??", pages = "??--??", day = "1", month = nov, year = "2020", CODEN = "JNCAF3", DOI = "https://doi.org/10.1016/j.jnca.2020.102765", ISSN = "1084-8045 (print), 1095-8592 (electronic)", ISSN-L = "1084-8045", bibdate = "Mon May 24 15:12:39 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1084804520302393", acknowledgement = ack-nhfb, articleno = "102765", fjournal = "Journal of Network and Computer Applications", journal-URL = "http://www.sciencedirect.com/science/journal/10848045", } @Article{Yao:2020:JOF, author = "Hong Yao and Muzhou Xiong and Hui Li and Lin Gu and Deze Zeng", title = "Joint optimization of function mapping and preemptive scheduling for service chains in network function virtualization", journal = j-FUT-GEN-COMP-SYS, volume = "108", number = "??", pages = "1112--1118", month = jul, year = "2020", CODEN = "FGSEVI", DOI = "https://doi.org/10.1016/j.future.2017.12.021", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Fri Jun 19 07:44:16 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X17324305", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Yu:2020:CCC, author = "Linchen Yu", title = "{CCHybrid}: {CPU} co-scheduling in virtualization environment", journal = j-CCPE, volume = "32", number = "3", pages = "e4213:1--e4213:??", day = "10", month = feb, year = "2020", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.4213", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Wed Mar 31 07:52:13 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "Concurr. Comput.", fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", onlinedate = "20 June 2017", } @Article{Zhang:2020:PEE, author = "Yiming Zhang and Huiba Li and Shengyun Liu and Jiawei Xu and Guangtao Xue", title = "{PBS}: an Efficient Erasure-Coded Block Storage System Based on Speculative Partial Writes", journal = j-TOS, volume = "16", number = "1", pages = "6:1--6:25", month = apr, year = "2020", CODEN = "????", DOI = "https://doi.org/10.1145/3365839", ISSN = "1553-3077 (print), 1553-3093 (electronic)", ISSN-L = "1553-3077", bibdate = "Wed Apr 8 11:43:49 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/tos.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/abs/10.1145/3365839", abstract = "Block storage provides virtual disks that can be mounted by virtual machines (VMs). Although erasure coding (EC) has been widely used in many cloud storage systems for its high efficiency and durability, current EC schemes cannot provide high-performance block storage for the cloud. This is because they introduce significant overhead to small write operations (which perform partial write to an entire EC group), whereas cloud-oblivious applications running on VMs are often small-write-intensive. We identify the root cause for the poor performance of partial writes in state-of-the-art EC schemes: for each partial write, they have to perform a time-consuming write-after-read operation that reads the current value of the data and then computes and writes the parity delta, which will be used to patch the parity in journal replay. In this article, we present a speculative partial write scheme (called PARIX) that supports fast small writes in erasure-coded storage systems. We transform the original formula of parity calculation to use the data deltas (between the current/original data values), instead of the parity deltas, to calculate the parities in journal replay. For each partial write, this allows PARIX to speculatively log only the new value of the data without reading its original value. For a series of $n$ partial writes to the same data, PARIX performs pure write (instead of write-after-read) for the last $ n - 1$ ones while only introducing a small penalty of an extra network round-trip time to the first one. Based on PARIX, we design and implement PARIX Block Storage (PBS), an efficient block storage system that provides high-performance virtual disk service for VMs running cloud-oblivious applications. PBS not only supports fast partial writes but also realizes efficient full writes, background journal replay, and fast failure recovery with strong consistency guarantees. Both microbenchmarks and trace-driven evaluation show that PBS provides efficient block storage and outperforms state-of-the-art EC-based systems by orders of magnitude.", acknowledgement = ack-nhfb, articleno = "6", fjournal = "ACM Transactions on Storage", journal-URL = "https://dl.acm.org/loi/tos", } @Article{Zhang:2020:PER, author = "Sheng Zhang and Yu Liang and Jidong Ge and Mingjun Xiao and Jie Wu", title = "Provably Efficient Resource Allocation for Edge Service Entities Using {Hermes}", journal = j-IEEE-TRANS-NETWORKING, volume = "28", number = "4", pages = "1684--1697", month = aug, year = "2020", CODEN = "IEANEP", DOI = "https://doi.org/10.1109/TNET.2020.2989307", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Tue Feb 23 08:45:28 MST 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1109/TNET.2020.2989307", abstract = "Virtualization techniques help edge environments separate the role of the traditional edge providers into two: edge infrastructure providers (EIPs), who manage the physical edge infrastructure, and edge service providers (ESPs), who aggregate resources \ldots{}", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "https://dl.acm.org/loi/ton", } @Article{Zhao:2020:PHV, author = "Sicheng Zhao and Xing Wu and Zuqing Zhu", title = "On Parallel and Hitless {vSDN} Reconfiguration", journal = j-IEEE-TRANS-NETWORKING, volume = "28", number = "6", pages = "2657--2670", month = dec, year = "2020", CODEN = "IEANEP", DOI = "https://doi.org/10.1109/TNET.2020.3014655", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Tue Feb 23 08:45:31 MST 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3014655", abstract = "The symbiosis of network virtualization and software-defined networking (SDN) enables an infrastructure provider (InP) to build various virtual software defined networks (vSDNs) over a shared substrate network (SNT). To handle a dynamic network \ldots{}", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "https://dl.acm.org/loi/ton", } @Article{Zhong:2020:CEC, author = "Zhiheng Zhong and Rajkumar Buyya", title = "A Cost-Efficient Container Orchestration Strategy in {Kubernetes}-Based Cloud Computing Infrastructures with Heterogeneous Resources", journal = j-TOIT, volume = "20", number = "2", pages = "15:1--15:24", month = may, year = "2020", CODEN = "????", DOI = "https://doi.org/10.1145/3378447", ISSN = "1533-5399 (print), 1557-6051 (electronic)", ISSN-L = "1533-5399", bibdate = "Wed May 27 07:53:04 MDT 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/toit.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/abs/10.1145/3378447", abstract = "Containers, as a lightweight application virtualization technology, have recently gained immense popularity in mainstream cluster management systems like Google Borg and Kubernetes. Prevalently adopted by these systems for task deployments of diverse \ldots{}", acknowledgement = ack-nhfb, articleno = "15", fjournal = "ACM Transactions on Internet Technology (TOIT)", journal-URL = "https://dl.acm.org/loi/toit", } @Article{Ahmadian:2021:EET, author = "S. Ahmadian and R. Salkhordeh and O. Mutlu and H. Asadi", title = "{ETICA}: Efficient Two-Level {I/O} Caching Architecture for Virtualized Platforms", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "32", number = "10", pages = "2415--2433", month = oct, year = "2021", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2021.3066308", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Thu Apr 15 13:49:27 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Parallel and Distributed Systems", journal-URL = "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=71", } @Article{Alashaikh:2021:SUP, author = "Abdulaziz Alashaikh and Eisa Alanazi and Ala Al-Fuqaha", title = "A Survey on the Use of Preferences for Virtual Machine Placement in Cloud Data Centers", journal = j-COMP-SURV, volume = "54", number = "5", pages = "96:1--96:39", month = jun, year = "2021", CODEN = "CMSVAN", DOI = "https://doi.org/10.1145/3450517", ISSN = "0360-0300 (print), 1557-7341 (electronic)", ISSN-L = "0360-0300", bibdate = "Sat Jul 10 07:58:00 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/compsurv.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1145/3450517", abstract = "With the rapid development of virtualization techniques, cloud data centers allow for cost-effective, flexible, and customizable deployments of applications on virtualized infrastructure. Virtual machine (VM) placement aims to assign each virtual machine to a server in the cloud environment. VM Placement is of paramount importance to the design of cloud data centers. Typically, VM placement involves complex relations and multiple design factors as well as local policies that govern the assignment decisions. It also involves different constituents including cloud administrators and customers that might have disparate preferences while opting for a placement solution. Thus, it is often valuable to return not only an optimized solution to the VM placement problem but also a solution that reflects the given preferences of the constituents. In this article, we provide a detailed review on the role of preferences in the recent literature on VM placement. We examine different preference representations found in the literature, explain their existing usage, and explain the adopted solving approaches. We further discuss key challenges and identify possible research opportunities to better incorporate preferences within the context of VM placement.", acknowledgement = ack-nhfb, articleno = "96", fjournal = "ACM Computing Surveys", journal-URL = "https://dl.acm.org/loi/csur", } @Article{Alboaneen:2021:MMJ, author = "Dabiah Alboaneen and Hugo Tianfield and Yan Zhang and Bernardi Pranggono", title = "A metaheuristic method for joint task scheduling and virtual machine placement in cloud data centers", journal = j-FUT-GEN-COMP-SYS, volume = "115", number = "??", pages = "201--212", month = feb, year = "2021", CODEN = "FGSEVI", DOI = "https://doi.org/10.1016/j.future.2020.08.036", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Tue Mar 30 13:50:11 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X20310967", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Alqahtani:2021:ECR, author = "Fayez Alqahtani and Mohammed Al-Maitah and Khaldoun Besoul and S. K. Elagan", title = "Elastic Computing Resource Virtualization Method for a Service-centric {Industrial Internet of Things}", journal = j-COMP-NET-AMSTERDAM, volume = "190", number = "??", pages = "??--??", day = "8", month = may, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1016/j.comnet.2021.107955", ISSN = "1389-1286 (print), 1872-7069 (electronic)", ISSN-L = "1389-1286", bibdate = "Tue Feb 1 09:19:00 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1389128621000918", acknowledgement = ack-nhfb, articleno = "107955", fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)", journal-URL = "http://www.sciencedirect.com/science/journal/13891286/", } @Article{Apostolopoulos:2021:RAV, author = "Theodoros Apostolopoulos and Vasilios Katos and Kim-Kwang Raymond Choo and Constantinos Patsakis", title = "Resurrecting anti-virtualization and anti-debugging: Unhooking your hooks", journal = j-FUT-GEN-COMP-SYS, volume = "116", number = "??", pages = "393--405", month = mar, year = "2021", CODEN = "FGSEVI", DOI = "https://doi.org/10.1016/j.future.2020.11.004", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Tue Mar 30 13:50:13 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X20330284", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Bendechache:2021:SER, author = "Malika Bendechache", title = "Simulating and Evaluating a Real-World {ElasticSearch} System Using the {RECAP DES} Simulator", journal = j-FUTURE-INTERNET, volume = "13", number = "4", pages = "83", day = "24", month = mar, year = "2021", CODEN = "????", DOI = "https://doi.org/10.3390/fi13040083", ISSN = "1999-5903", bibdate = "Fri Apr 23 17:52:28 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/future-internet.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.mdpi.com/1999-5903/13/4/83", abstract = "Simulation has become an indispensable technique for modelling and evaluating the performance of large-scale systems efficiently and at a relatively low cost. ElasticSearch (ES) is one of the most popular open source large-scale distributed data indexing systems worldwide. In this paper, we use the RECAP Discrete Event Simulator (DES) simulator, an extension of CloudSimPlus, to model and evaluate the performance of a real-world cloud-based ES deployment by an Irish small and medium-sized enterprise (SME), Opening.io. Following simulation experiments that explored how much query traffic the existing Opening.io architecture could cater for before performance degradation, a revised architecture was proposed, adding a new virtual machine in order to dissolve the bottleneck. The simulation results suggest that the proposed improved architecture can handle significantly larger query traffic (about 71\% more) than the current architecture used by Opening.io. The results also suggest that the RECAP DES simulator is suitable for simulating ES systems and can help companies to understand their infrastructure bottlenecks under various traffic scenarios and inform optimisation and scalability decisions.", acknowledgement = ack-nhfb, journal-URL = "https://www.mdpi.com/1999-5903/", } @Article{Buchbinder:2021:OVM, author = "Niv Buchbinder and Yaron Fairstein and Konstantina Mellou and Ishai Menache and Joseph (Seffi) Naor", title = "Online Virtual Machine Allocation with Lifetime and Load Predictions", journal = j-SIGMETRICS, volume = "49", number = "1", pages = "9--10", month = jun, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3543516.3456278", ISSN = "0163-5999 (print), 1557-9484 (electronic)", ISSN-L = "0163-5999", bibdate = "Wed Jun 8 06:42:40 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigmetrics.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1145/3543516.3456278", abstract = "The cloud computing industry has grown rapidly over the last decade, and with this growth there is a significant increase in demand for compute resources. Demand is manifested in the form of Virtual Machine (VM) \ldots{}", acknowledgement = ack-nhfb, fjournal = "ACM SIGMETRICS Performance Evaluation Review", journal-URL = "https://dl.acm.org/loi/sigmetrics", } @Article{Cappellari:2021:CBD, author = "Max Cappellari", title = "A Cloud-Based Data Collaborative to Combat the {COVID-19} Pandemic and to Solve Major Technology Challenges", journal = j-FUTURE-INTERNET, volume = "13", number = "3", pages = "61", day = "27", month = feb, year = "2021", CODEN = "????", DOI = "https://doi.org/10.3390/fi13030061", ISSN = "1999-5903", bibdate = "Fri Mar 26 12:47:18 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/future-internet.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.mdpi.com/1999-5903/13/3/61", abstract = "The XPRIZE Foundation designs and operates multi-million-dollar, global competitions to incentivize the development of technological breakthroughs that accelerate humanity toward a better future. To combat the COVID-19 pandemic, the foundation coordinated with several organizations to make datasets about different facets of the disease available and to provide the computational resources needed to analyze those datasets. This paper is a case study of the requirements, design, and implementation of the XPRIZE Data Collaborative, which is a Cloud-based infrastructure that enables the XPRIZE to meet its COVID-19 mission and host future data-centric competitions. We examine how a Cloud Native Application can use an unexpected variety of Cloud technologies, ranging from containers, serverless computing, to even older ones such as Virtual Machines. We also search and document the effects that the pandemic had on application development in the Cloud. We include our experiences of having users successfully exercise the Data Collaborative, detailing the challenges encountered and areas for improvement and future work.", acknowledgement = ack-nhfb, journal-URL = "https://www.mdpi.com/1999-5903/", } @Article{Cardoso-Llach:2021:AIE, author = "Daniel Cardoso-Llach and Eric Kaltman and Emek Erdolu and Zachary Furste", title = "An Archive of Interfaces: Exploring the Potential of Emulation for Software Research, Pedagogy, and Design", journal = j-PACMHCI, volume = "5", number = "CSCW2", pages = "294:1--294:22", month = oct, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3476035", ISSN = "2573-0142 (electronic)", ISSN-L = "2573-0142", bibdate = "Wed Mar 2 07:56:45 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/pacmhci.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1145/3476035", abstract = "This paper explores the potential of distributed emulation networks to support research and pedagogy into historical and sociotechnical aspects of software. Emulation is a type of virtualization that re-creates the conditions for a piece of legacy \ldots{}", acknowledgement = ack-nhfb, articleno = "294", fjournal = "Proceedings of the ACM on Human-Computer Interaction (PACMHCI)", journal-URL = "https://dl.acm.org/loi/pacmhci", } @Article{Chehelgerdi-Samani:2021:PAP, author = "Maryam Chehelgerdi-Samani and Faramarz Safi-Esfahani", title = "{PCVM.ARIMA}: predictive consolidation of virtual machines applying {ARIMA} method", journal = j-J-SUPERCOMPUTING, volume = "77", number = "3", pages = "2172--2206", month = mar, year = "2021", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-020-03354-3", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Fri May 14 09:19:59 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://link.springer.com/article/10.1007/s11227-020-03354-3", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", online-date = "Published: 06 June 2020 Pages: 2172 - 2206", } @Article{Chetty:2021:VNF, author = "Swarna Bindu Chetty", title = "Virtual Network Function Embedding under Nodal Outage Using Deep {Q}-Learning", journal = j-FUTURE-INTERNET, volume = "13", number = "3", pages = "82", day = "23", month = mar, year = "2021", CODEN = "????", DOI = "https://doi.org/10.3390/fi13030082", ISSN = "1999-5903", bibdate = "Fri Mar 26 12:47:18 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/future-internet.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.mdpi.com/1999-5903/13/3/82", abstract = "With the emergence of various types of applications such as delay-sensitive applications, future communication networks are expected to be increasingly complex and dynamic. Network Function Virtualization (NFV) provides the necessary support towards efficient management of such complex networks, by virtualizing network functions and placing them on shared commodity servers. However, one of the critical issues in NFV is the resource allocation for the highly complex services; moreover, this problem is classified as an NP-Hard problem. To solve this problem, our work investigates the potential of Deep Reinforcement Learning (DRL) as a swift yet accurate approach (as compared to integer linear programming) for deploying Virtualized Network Functions (VNFs) under several Quality-of-Service (QoS) constraints such as latency, memory, CPU, and failure recovery requirements. More importantly, the failure recovery requirements are focused on the node-outage problem where outage can be either due to a disaster or unavailability of network topology information (e.g., due to proprietary and ownership issues). In DRL, we adopt a Deep Q-Learning (DQL) based algorithm where the primary network estimates the action-value function Q, as well as the predicted Q, highly causing divergence in Q-value's updates. This divergence increases for the larger-scale action and state-space causing inconsistency in learning, resulting in an inaccurate output. Thus, to overcome this divergence, our work has adopted a well-known approach, i.e., introducing Target Neural Networks and Experience Replay algorithms in DQL. The constructed model is simulated for two real network topologies-Netrail Topology and BtEurope Topology-with various capacities of the nodes (e.g., CPU core, VNFs per Core), links (e.g., bandwidth and latency), several VNF Forwarding Graph (VNF-FG) complexities, and different degrees of the nodal outage from 0\% to 50\%. We can conclude from our work that, with the increase in network density or nodal capacity or VNF-FG's complexity, the model took extremely high computation time to execute the desirable results. Moreover, with the rise in complexity of the VNF-FG, the resources decline much faster. In terms of the nodal outage, our model provided almost 70-90\% Service Acceptance Rate (SAR) even with a 50\% nodal outage for certain combinations of scenarios.", acknowledgement = ack-nhfb, journal-URL = "https://www.mdpi.com/1999-5903/", } @Article{ElMotaki:2021:PBM, author = "Saloua {El Motaki} and Ali Yahyaouy and Hamid Gualous", title = "A prediction-based model for virtual machine live migration monitoring in a cloud datacenter", journal = j-COMPUTING, volume = "103", number = "11", pages = "2711--2735", month = nov, year = "2021", CODEN = "CMPTA2", DOI = "https://doi.org/10.1007/s00607-021-00981-3", ISSN = "0010-485X (print), 1436-5057 (electronic)", ISSN-L = "0010-485X", bibdate = "Mon May 9 09:55:42 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/computing.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://link.springer.com/article/10.1007/s00607-021-00981-3", acknowledgement = ack-nhfb, ajournal = "Computing", fjournal = "Computing", journal-URL = "http://link.springer.com/journal/607", } @Article{Eramo:2021:PIC, author = "Vincenzo Eramo and Francesco Valente and Tiziana Catena and Francesco Giacinto Lavacca", title = "Proposal and Investigation of a Convolutional and {LSTM} Neural Network for the Cost-Aware Resource Prediction in Softwarized Networks", journal = j-FUTURE-INTERNET, volume = "13", number = "12", pages = "316", day = "16", month = dec, year = "2021", CODEN = "????", DOI = "https://doi.org/10.3390/fi13120316", ISSN = "1999-5903", bibdate = "Wed Jan 19 05:45:14 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/future-internet.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.mdpi.com/1999-5903/13/12/316", abstract = "Resource prediction algorithms have been recently proposed in Network Function Virtualization architectures. A prediction-based resource allocation is characterized by higher operation costs due to: (i) Resource underestimate that leads to quality of service degradation; (ii) used cloud resource over allocation when a resource overestimate occurs. To reduce such a cost, we propose a cost-aware prediction algorithm able to minimize the sum of the two cost components. The proposed prediction solution is based on a convolutional and Long Short Term Memory neural network to handle the spatial and temporal correlations of the need processing capacities. We compare in a real network and traffic scenario the proposed technique to a traditional one in which the aim is to exactly predict the needed processing capacity. We show how the proposed solution allows for cost advantages in the order of 20\%.", acknowledgement = ack-nhfb, journal-URL = "https://www.mdpi.com/journal/futureinternet", } @Article{Fan:2021:RTU, author = "Xingpeng Fan and Hongli Xu and He Huang and Xuwei Yang", title = "Real-Time Update of Joint {SFC} and Routing in Software Defined Networks", journal = j-IEEE-TRANS-NETWORKING, volume = "29", number = "6", pages = "2664--2677", month = dec, year = "2021", CODEN = "IEANEP", DOI = "https://doi.org/10.1109/TNET.2021.3095935", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Fri Apr 15 05:49:27 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3095935", abstract = "To meet the ever-increasing demands for high-quality network services, a software defined network (SDN) can support various virtual network functions (VNFs) using virtualization technology. Due to network dynamics, an SDN needs to be updated frequently to \ldots{}", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "https://dl.acm.org/loi/ton", } @Article{Farkiani:2021:PDD, author = "Behrooz Farkiani and Bahador Bakhshi and S. Ali MirHassani and Tim Wauters and Bruno Volckaert and Filip {De Turck}", title = "Prioritized Deployment of Dynamic Service Function Chains", journal = j-IEEE-TRANS-NETWORKING, volume = "29", number = "3", pages = "979--993", month = jun, year = "2021", CODEN = "IEANEP", DOI = "https://doi.org/10.1109/TNET.2021.3055074", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Wed Apr 20 07:36:12 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3055074", abstract = "Service Function Chaining and Network Function Virtualization are enabling technologies that provide dynamic network services with diverse QoS requirements. Regarding the limited infrastructure resources, service providers need to prioritize service \ldots{}", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "https://dl.acm.org/loi/ton", } @Article{Feizollahibarough:2021:SAV, author = "Sattar Feizollahibarough and Mehrdad Ashtiani", title = "A security-aware virtual machine placement in the cloud using hesitant fuzzy decision-making processes", journal = j-J-SUPERCOMPUTING, volume = "77", number = "6", pages = "5606--5636", month = jun, year = "2021", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-020-03496-4", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Fri May 14 09:20:01 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://link.springer.com/article/10.1007/s11227-020-03496-4", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", online-date = "Published: 09 November 2020 Pages: 5606 - 5636", } @Article{Geissler:2021:DTM, author = "Stefan Geissler and Stanislav Lange and Leonardo Linguaglossa and Dario Rossi and Thomas Zinner and Tobias Hossfeld", title = "Discrete-Time Modeling of {NFV} Accelerators that Exploit Batched Processing", journal = j-TOMPECS, volume = "6", number = "3", pages = "11:1--11:27", month = sep, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3488243", ISSN = "2376-3639 (print), 2376-3647 (electronic)", ISSN-L = "2376-3639", bibdate = "Wed Mar 2 06:32:09 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tompecs.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1145/3488243", abstract = "Network Functions Virtualization (NFV) is among the latest network revolutions, promising increased flexibility and avoiding network ossification. At the same time, all-software NFV implementations on commodity hardware raise performance issues when \ldots{}", acknowledgement = ack-nhfb, articleno = "11", fjournal = "ACM Transactions on Modeling and Performance Evaluation of Computing Systems (TOMPECS)", journal-URL = "https://dl.acm.org/loi/tompecs", } @Article{Gong:2021:TLS, author = "X. Gong and D. Cao and Y. Li and X. Liu and Y. Li and J. Zhang and T. Li", title = "A Thread Level {SLO}-Aware {I/O} Framework for Embedded Virtualization", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "32", number = "3", pages = "500--513", month = mar, year = "2021", CODEN = "ITDSEO", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Thu Oct 15 12:52:54 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Parallel and Distributed Systems", journal-URL = "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=71", } @Article{Gutierrez:2021:RTP, author = "Juan Roberto L{\'o}pez Guti{\'e}rrez and Pedro Ponce and Arturo Molina", title = "Real-Time Power Electronics Laboratory to Strengthen Distance Learning Engineering Education on Smart Grids and Microgrids", journal = j-FUTURE-INTERNET, volume = "13", number = "9", pages = "237", day = "17", month = sep, year = "2021", CODEN = "????", DOI = "https://doi.org/10.3390/fi13090237", ISSN = "1999-5903", bibdate = "Tue Sep 28 10:43:54 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/future-internet.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.mdpi.com/1999-5903/13/9/237", abstract = "In the science and engineering fields of study, a hands-on learning experience is as crucial a part of the learning process for the student as the theoretical aspect of a given subject. With the COVID-19 pandemic in 2020, educational institutions were forced to migrate to digital platforms to ensure the continuity of the imparted lectures. The online approach can be challenging for engineering programs, especially in courses that employ practical laboratory methods as the primary teaching strategies. Laboratory courses that include specialized hardware and software cannot migrate to a virtual environment without compromising the advantages that a hands-on method provides to the engineering student. This work assesses different approaches in the virtualization process of a laboratory facility, diving these into key factors such as required communication infrastructure and available technologies; it opens a discussion on the trends and possible obstacles in the virtualization of a Real-Time (RT) laboratory intended for Microgrid education in a power electronics laboratory course, exposing the main simulation strategies that can be used in an RT environment and how these have different effects on the learning process of student, as well as addressing the main competencies an engineering student can strengthen through interaction with RT simulation technologies.", acknowledgement = ack-nhfb, journal-URL = "https://www.mdpi.com/1999-5903/", } @Article{Haugerud:2021:DSP, author = "H{\aa}rek Haugerud and Huy Nhut Tran and Nadjib Aitsaadi and Anis Yazidi", title = "A dynamic and scalable parallel {Network Intrusion Detection System} using intelligent rule ordering and Network Function Virtualization", journal = j-FUT-GEN-COMP-SYS, volume = "124", number = "??", pages = "254--267", month = nov, year = "2021", CODEN = "FGSEVI", DOI = "https://doi.org/10.1016/j.future.2021.05.037", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Wed Feb 9 09:07:20 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X21001874", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Huang:2021:ESC, author = "Chih-Kai Huang and Shan-Hsiang Shen", title = "Enabling Service Cache in Edge Clouds", journal = j-TIOT, volume = "2", number = "3", pages = "18:1--18:24", month = jul, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3456564", ISSN = "2691-1914 (print), 2577-6207 (electronic)", ISSN-L = "2691-1914", bibdate = "Wed Aug 11 10:46:28 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tiot.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1145/3456564", abstract = "The next-generation 5G cellular networks are designed to support the internet of things (IoT) networks; network components and services are virtualized and run either in virtual machines (VMs) or containers. Moreover, edge clouds (which are closer to \ldots{}).", acknowledgement = ack-nhfb, articleno = "18", fjournal = "ACM Transactions on Internet of Things (TIOT)", journal-URL = "https://dl.acm.org/loi/tiot", } @Article{Iserte:2021:IME, author = "Sergio Iserte and Javier Prades and Carlos Rea{\~n}o and Federico Silla", title = "Improving the management efficiency of {GPU} workloads in data centers through {GPU} virtualization", journal = j-CCPE, volume = "33", number = "2", pages = "e5275:1--e5275:??", day = "25", month = jan, year = "2021", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.5275", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Tue May 18 08:31:19 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "", fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", onlinedate = "10 April 2019", } @Article{Karthikeyan:2021:EAS, author = "Ramamoorthy Karthikeyan and Venkatachalam Balamurugan", title = "Energy-aware and {SLA}-guaranteed optimal virtual machine swap and migrate system in cloud-{Internet of Things}", journal = j-CCPE, volume = "33", number = "10", pages = "e6171:1--e6171:??", day = "25", month = may, year = "2021", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.6171", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Tue May 18 08:31:25 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "", fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", onlinedate = "10 January 2021", } @Article{Katsikas:2021:MHP, author = "Georgios P. Katsikas and Tom Barbette and Dejan Kosti{\'c} and Gerald Q. {Maguire, Jr.} and Rebecca Steinert", title = "{Metron}: High-performance {NFV} Service Chaining Even in the Presence of Blackboxes", journal = j-TOCS, volume = "38", number = "1--2", pages = "3:1--3:45", month = jul, year = "2021", CODEN = "ACSYEC", DOI = "https://doi.org/10.1145/3465628", ISSN = "0734-2071 (print), 1557-7333 (electronic)", ISSN-L = "0734-2071", bibdate = "Tue Aug 10 13:25:43 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tocs.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1145/3465628", abstract = "Deployment of 100Gigabit Ethernet (GbE) links challenges the packet processing limits of commodity hardware used for Network Functions Virtualization (NFV). Moreover, realizing chained network functions (i.e., service chains) necessitates the use of \ldots{}", acknowledgement = ack-nhfb, articleno = "3", fjournal = "ACM Transactions on Computer Systems", journal-URL = "https://dl.acm.org/loi/tocs", } @Article{Khaleel:2021:AVM, author = "Mustafa I. Khaleel and Michelle M. Zhu", title = "Adaptive virtual machine migration based on performance-to-power ratio in fog-enabled cloud data centers", journal = j-J-SUPERCOMPUTING, volume = "77", number = "10", pages = "11986--12025", month = oct, year = "2021", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-021-03753-0", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Fri Feb 21 16:23:00 MST 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/jsuper2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://link.springer.com/article/10.1007/s11227-021-03753-0", acknowledgement = ack-nhfb, ajournal = "J. Supercomputing", fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Kiani:2021:NAP, author = "Mohsen Kiani and Mohammad Reza Khayyambashi", title = "A network-aware and power-efficient virtual machine placement scheme in cloud datacenters based on chemical reaction optimization", journal = j-COMP-NET-AMSTERDAM, volume = "196", number = "??", pages = "??--??", day = "4", month = sep, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1016/j.comnet.2021.108270", ISSN = "1389-1286 (print), 1872-7069 (electronic)", ISSN-L = "1389-1286", bibdate = "Tue Feb 1 09:19:03 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1389128621002954", acknowledgement = ack-nhfb, articleno = "108270", fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)", journal-URL = "http://www.sciencedirect.com/science/journal/13891286/", } @Article{Kiperberg:2021:PMC, author = "Michael Kiperberg", title = "Preventing malicious communication using virtualization", journal = j-J-INFO-SEC-APPL, volume = "61", number = "??", pages = "??--??", month = sep, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1016/j.jisa.2021.102871", ISSN = "2214-2126", ISSN-L = "2214-2126", bibdate = "Sun May 8 11:59:38 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jinfosecappl.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S2214212621001009", acknowledgement = ack-nhfb, ajournal = "J. Info. Sec. Appl.", articleno = "102871", fjournal = "Journal of Information Security and Applications (JISA)", journal-URL = "http://www.sciencedirect.com/science/journal/22142126", } @Article{Kucab:2021:RAI, author = "Micha{\l} Kucab and Piotr Bory{\l}o and Piotr Cho{\l}da", title = "Remote attestation and integrity measurements with {Intel SGX} for virtual machines", journal = j-COMPUT-SECUR, volume = "106", number = "??", pages = "Article 102300", month = jul, year = "2021", CODEN = "CPSEDU", DOI = "https://doi.org/10.1016/j.cose.2021.102300", ISSN = "0167-4048 (print), 1872-6208 (electronic)", ISSN-L = "0167-4048", bibdate = "Sat Jan 22 14:55:05 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167404821001243", acknowledgement = ack-nhfb, fjournal = "Computers \& Security", journal-URL = "http://www.sciencedirect.com/science/journal/01674048", } @Article{Lin:2021:TOP, author = "I-Chieh Lin and Yu-Hsuan Yeh and Kate Ching-Ju Lin", title = "Toward Optimal Partial Parallelization for Service Function Chaining", journal = j-IEEE-TRANS-NETWORKING, volume = "29", number = "5", pages = "2033--2044", month = oct, year = "2021", CODEN = "IEANEP", DOI = "https://doi.org/10.1109/TNET.2021.3075709", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Wed Apr 20 07:36:15 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3075709", abstract = "The emergence of Network Function Virtualization (NFV) and Service Function Chaining (SFC) together enable flexible and agile network management and traffic engineering. Due to the sequential execution nature of SFC, the latency would grow linearly with \ldots{}", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "https://dl.acm.org/loi/ton", } @Article{Liu:2021:ISD, author = "Jianchun Liu and Hongli Xu and Gongming Zhao and Chen Qian and Xingpeng Fan and Xuwei Yang and He Huang", title = "Incremental Server Deployment for Software-Defined {NFV}-Enabled Networks", journal = j-IEEE-TRANS-NETWORKING, volume = "29", number = "1", pages = "248--261", month = feb, year = "2021", CODEN = "IEANEP", DOI = "https://doi.org/10.1109/TNET.2020.3030298", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Tue Jun 15 09:48:15 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3030298", abstract = "Network Function Virtualization (NFV) is a new paradigm to enable service innovation through virtualizing traditional network functions. To construct a new NFV-enabled network, there are two critical requirements: minimizing server deployment cost and \ldots{}", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "https://dl.acm.org/loi/ton", } @Article{Mai:2021:EES, author = "Liuyang Mai and Yi Ding and Xiaoning Zhang and Lang Fan and Shui Yu and Zhichao Xu", title = "Energy efficiency with service availability guarantee for Network Function Virtualization", journal = j-FUT-GEN-COMP-SYS, volume = "119", number = "??", pages = "140--153", month = jun, year = "2021", CODEN = "FGSEVI", DOI = "https://doi.org/10.1016/j.future.2021.02.002", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Tue Mar 30 13:50:17 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X21000479", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Mansouri:2021:REC, author = "Yaser Mansouri and M. Ali Babar", title = "A review of edge computing: Features and resource virtualization", journal = j-J-PAR-DIST-COMP, volume = "150", number = "??", pages = "155--183", month = apr, year = "2021", CODEN = "JPDCER", DOI = "https://doi.org/10.1016/j.jpdc.2020.12.015", ISSN = "0743-7315 (print), 1096-0848 (electronic)", ISSN-L = "0743-7315", bibdate = "Wed May 26 16:11:05 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0743731520304317", acknowledgement = ack-nhfb, fjournal = "Journal of Parallel and Distributed Computing", journal-URL = "http://www.sciencedirect.com/science/journal/07437315", } @Article{Mirobi:2021:DDA, author = "G. Justy Mirobi and L. Arockiam", title = "{DAVmS}: {Distance Aware Virtual Machine Scheduling} approach for reducing the response time in cloud computing", journal = j-J-SUPERCOMPUTING, volume = "77", number = "7", pages = "6664--6675", month = jul, year = "2021", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-020-03563-w", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Mon Feb 28 16:44:32 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://link.springer.com/article/10.1007/s11227-020-03563-w", acknowledgement = ack-nhfb, ajournal = "J. Supercomputing", fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Moreno:2021:OSF, author = "Jes{\'u}s Fernando Cevallos Moreno and Rebecca Sattler and Ra{\'u}l P. Caulier Cisterna and Lorenzo Ricciardi Celsi and Aminael S{\'a}nchez Rodr{\'\i}guez and Massimo Mecella", title = "Online Service Function Chain Deployment for Live-Streaming in Virtualized Content Delivery Networks: a Deep Reinforcement Learning Approach", journal = j-FUTURE-INTERNET, volume = "13", number = "11", pages = "278", day = "29", month = oct, year = "2021", CODEN = "????", DOI = "https://doi.org/10.3390/fi13110278", ISSN = "1999-5903", bibdate = "Wed Jan 19 05:45:13 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/future-internet.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.mdpi.com/1999-5903/13/11/278", abstract = "Video delivery is exploiting 5G networks to enable higher server consolidation and deployment flexibility. Performance optimization is also a key target in such network systems. We present a multi-objective optimization framework for service function chain deployment in the particular context of Live-Streaming in virtualized content delivery networks using deep reinforcement learning. We use an Enhanced Exploration, Dense-reward mechanism over a Dueling Double Deep Q Network (E2-D4QN). Our model assumes to use network function virtualization at the container level. We carefully model processing times as a function of current resource utilization in data ingestion and streaming processes. We assess the performance of our algorithm under bounded network resource conditions to build a safe exploration strategy that enables the market entry of new bounded-budget vCDN players. Trace-driven simulations with real-world data reveal that our approach is the only one to adapt to the complexity of the particular context of Live-Video delivery concerning the state-of-art algorithms designed for general-case service function chain deployment. In particular, our simulation test revealed a substantial QoS/QoE performance improvement in terms of session acceptance ratio against the compared algorithms while keeping operational costs within proper bounds.", acknowledgement = ack-nhfb, journal-URL = "https://www.mdpi.com/journal/futureinternet", } @Article{Mostafavi:2021:QSP, author = "Seyedakbar Mostafavi and Vesal Hakami and Maryam Sanaei", title = "Quality of service provisioning in network function virtualization: a survey", journal = j-COMPUTING, volume = "103", number = "5", pages = "917--991", month = may, year = "2021", CODEN = "CMPTA2", DOI = "https://doi.org/10.1007/s00607-021-00925-x", ISSN = "0010-485X (print), 1436-5057 (electronic)", ISSN-L = "0010-485X", bibdate = "Mon May 9 09:55:39 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/computing.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://link.springer.com/article/10.1007/s00607-021-00925-x", acknowledgement = ack-nhfb, ajournal = "Computing", fjournal = "Computing", journal-URL = "http://link.springer.com/journal/607", } @Article{Najafizadegan:2021:AMS, author = "Negin Najafizadegan and Eslam Nazemi and Vahid Khajehvand", title = "An autonomous model for self-optimizing virtual machine selection by learning automata in cloud environment", journal = j-SPE, volume = "51", number = "6", pages = "1352--1386", month = jun, year = "2021", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/spe.2960", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Mon May 17 14:47:49 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "Softw. Pract. Exp.", fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", onlinedate = "15 March 2021", } @Article{Nemati:2021:HBV, author = "Hani Nemati and Seyed Vahid Azhari and Mahsa Shakeri and Michel Dagenais", title = "Host-Based Virtual Machine Workload Characterization Using Hypervisor Trace Mining", journal = j-TOMPECS, volume = "6", number = "1", pages = "4:1--4:25", month = jun, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3460197", ISSN = "2376-3639 (print), 2376-3647 (electronic)", ISSN-L = "2376-3639", bibdate = "Wed Mar 2 06:32:08 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tompecs.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1145/3460197", abstract = "Cloud computing is a fast-growing technology that provides on-demand access to a pool of shared resources. This type of distributed and complex environment requires advanced resource management solutions that could model virtual machine (VM) behavior. \ldots{}", acknowledgement = ack-nhfb, articleno = "4", fjournal = "ACM Transactions on Modeling and Performance Evaluation of Computing Systems (TOMPECS)", journal-URL = "https://dl.acm.org/loi/tompecs", } @Article{Padhy:2021:MCA, author = "Satyajit Padhy and Jerry Chou", title = "{MIRAGE}: a consolidation aware migration avoidance genetic job scheduling algorithm for virtualized data centers", journal = j-J-PAR-DIST-COMP, volume = "154", number = "??", pages = "106--118", month = aug, year = "2021", CODEN = "JPDCER", DOI = "https://doi.org/10.1016/j.jpdc.2021.03.004", ISSN = "0743-7315 (print), 1096-0848 (electronic)", ISSN-L = "0743-7315", bibdate = "Thu Feb 10 06:39:17 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0743731521000575", acknowledgement = ack-nhfb, fjournal = "Journal of Parallel and Distributed Computing", journal-URL = "http://www.sciencedirect.com/science/journal/07437315", } @Article{Papaevripides:2021:EMB, author = "Michalis Papaevripides and Elias Athanasopoulos", title = "Exploiting Mixed Binaries", journal = j-TOPS, volume = "24", number = "2", pages = "7:1--7:29", month = feb, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3418898", ISSN = "2471-2566 (print), 2471-2574 (electronic)", ISSN-L = "2471-2566", bibdate = "Fri Feb 5 09:05:32 MST 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tops.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1145/3418898", abstract = "Unsafe programming systems are still very popular, despite the shortcomings due to several published memory-corruption vulnerabilities. Toward defending memory corruption, compilers have started to employ advanced software hardening such as Control-flow Integrity (CFI) and SafeStack. However, there is a broad interest for realizing compilers that impose memory safety with no heavy runtime support (e.g., garbage collection). Representative examples of this category are Rust and Go, which enforce memory safety primarily statically at compile time.\par Software hardening and Rust/Go are promising directions for defending memory corruption, albeit combining the two is questionable. In this article, we consider hardened mixed binaries, i.e., machine code that has been produced from different compilers and, in particular, from hardened C/C++ and Rust/Go (e.g., Mozilla Firefox, Dropbox, npm, and Docker). Our analysis is focused on Mozilla Firefox, which outsources significant code to Rust and is open source with known public vulnerabilities (with assigned CVE). Furthermore, we extend our analysis in mixed binaries that leverage Go, and we derive similar results.\par The attacks explored in this article do not exploit Rust or Go binaries that depend on some legacy (vulnerable) C/C++ code. In contrast, we explore how Rust/Go compiled code can stand as a vehicle for bypassing hardening in C/C++ code. In particular, we discuss CFI and SafeStack, which are available in the latest Clang. Our assessment concludes that CFI can be completely nullified through Rust or Go code by constructing much simpler attacks than state-of-the-art CFI bypasses.", acknowledgement = ack-nhfb, articleno = "7", fjournal = "ACM Transactions on Privacy and Security (TOPS)", journal-URL = "https://dl.acm.org/loi/tops", } @Article{Peng:2021:TON, author = "Bo Peng and Ming Yang and Jianguo Yao and Haibing Guan", title = "A Throughput-Oriented {NVMe} Storage Virtualization With Workload-Aware Management", journal = j-IEEE-TRANS-COMPUT, volume = "70", number = "12", pages = "2112--2124", month = dec, year = "2021", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.2020.3037817", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Thu Nov 11 08:55:47 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Computers", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", } @Article{Qiao:2021:DSR, author = "Wenxin Qiao and Hao Lu and Yu Lu and Lijie Meng and Yicen Liu", title = "A Dynamic Service Reconfiguration Method for Satellite-Terrestrial Integrated Networks", journal = j-FUTURE-INTERNET, volume = "13", number = "10", pages = "260", day = "09", month = oct, year = "2021", CODEN = "????", DOI = "https://doi.org/10.3390/fi13100260", ISSN = "1999-5903", bibdate = "Fri Oct 22 11:19:02 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/future-internet.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.mdpi.com/1999-5903/13/10/260", abstract = "Satellite-terrestrial integrated networks (STINs) are regarded as a promising solution to meeting the demands of global high-speed seamless network access in the future. Software-defined networking and network function virtualization (SDN/NFV) are two complementary technologies that can be used to ensure that the heterogeneous resources in STINs can be easily managed and deployed. Considering the dual mobility of satellites and ubiquitous users, along with the dynamic requirements of user requests and network resource states, it is challenging to maintain service continuity and high QoE performance in STINs. Thus, we investigate the service migration and reconfiguration scheme, which are of great significance to the guarantee of continuous service provisioning. Specifically, this paper proposes a dynamic service reconfiguration method that can support flexible service configurations on integrated networks, including LEO satellites and ground nodes. We first model the migration cost as an extra delay incurred by service migration and reconfiguration and then formulate the selection processes of the location and migration paths of virtual network functions (VNFs) as an integer linear programming (ILP) optimization problem. Then, we propose a fuzzy logic and quantum genetic algorithm (FQGA) to obtain an approximate optimal solution that can accelerate the solving process efficiently with the benefits of the high-performance computing capacity of QGA. The simulation results validate the effectiveness and improved performance of the scheme proposed in this paper.", acknowledgement = ack-nhfb, journal-URL = "https://www.mdpi.com/1999-5903/", } @Article{Quraishi:2021:SSA, author = "M. H. Quraishi and E. B. Tavakoli and F. Ren", title = "A Survey of System Architectures and Techniques for {FPGA} Virtualization", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "32", number = "9", pages = "2216--2230", month = sep, year = "2021", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2021.3063670", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Thu Apr 15 13:54:51 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Parallel and Distributed Systems", journal-URL = "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=71", } @Article{Raman:2021:CWS, author = "Narayani Raman and Aisha Banu Wahab and Sutherson Chandrasekaran", title = "Computation of workflow scheduling using backpropagation neural network in cloud computing: a virtual machine placement approach", journal = j-J-SUPERCOMPUTING, volume = "77", number = "9", pages = "9454--9473", month = sep, year = "2021", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-021-03648-0", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Mon Feb 28 16:44:33 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://link.springer.com/article/10.1007/s11227-021-03648-0", acknowledgement = ack-nhfb, ajournal = "J. Supercomputing", fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Sadegh:2021:TPV, author = "Samaneh Sadegh and Kamran Zamanifar and Piotr Kasprzak and Ramin Yahyapour", title = "A two-phase virtual machine placement policy for data-intensive applications in cloud", journal = j-J-NETW-COMPUT-APPL, volume = "180", number = "??", pages = "??--??", day = "15", month = apr, year = "2021", CODEN = "JNCAF3", DOI = "https://doi.org/10.1016/j.jnca.2021.103025", ISSN = "1084-8045 (print), 1095-8592 (electronic)", ISSN-L = "1084-8045", bibdate = "Mon May 24 15:12:43 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1084804521000515", acknowledgement = ack-nhfb, articleno = "103025", fjournal = "Journal of Network and Computer Applications", journal-URL = "http://www.sciencedirect.com/science/journal/10848045", } @Article{Salami:2021:EEC, author = "Hamza Onoruoiza Salami and Abubakar Bala and Idris Ismail", title = "An energy-efficient cuckoo search algorithm for virtual machine placement in cloud computing data centers", journal = j-J-SUPERCOMPUTING, volume = "77", number = "11", pages = "13330--13357", month = nov, year = "2021", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-021-03807-3", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Mon Feb 28 16:44:31 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://link.springer.com/article/10.1007/s11227-021-03807-3", acknowledgement = ack-nhfb, ajournal = "J. Supercomputing", fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Sallam:2021:JPA, author = "Gamal Sallam and Bo Ji", title = "Joint Placement and Allocation of {VNF} Nodes With Budget and Capacity Constraints", journal = j-IEEE-TRANS-NETWORKING, volume = "29", number = "3", pages = "1238--1251", month = jun, year = "2021", CODEN = "IEANEP", DOI = "https://doi.org/10.1109/TNET.2021.3058378", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Wed Apr 20 07:36:12 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3058378", abstract = "With the advent of Network Function Virtualization (NFV), network services that traditionally run on proprietary dedicated hardware can now be realized using Virtual Network Functions (VNFs) that are hosted on general-purpose commodity hardware. This new \ldots{}", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "https://dl.acm.org/loi/ton", } @Article{Scazzariello:2021:MSA, author = "Mariano Scazzariello and Lorenzo Ariemma and Giuseppe {Di Battista} and Maurizio Patrignani", title = "{Megalos}: a Scalable Architecture for the Virtualization of Large Network Scenarios", journal = j-FUTURE-INTERNET, volume = "13", number = "9", pages = "227", day = "30", month = aug, year = "2021", CODEN = "????", DOI = "https://doi.org/10.3390/fi13090227", ISSN = "1999-5903", bibdate = "Tue Sep 28 10:43:54 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/future-internet.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.mdpi.com/1999-5903/13/9/227", abstract = "We introduce an open-source, scalable, and distributed architecture, called Megalos, that supports the implementation of virtual network scenarios consisting of virtual devices (VDs) where each VD may have several Layer 2 interfaces assigned to virtual LANs. We rely on Docker containers to realize vendor-independent VDs and we leverage Kubernetes for the management of the nodes of a distributed cluster. Our architecture does not require platform-specific configurations and supports a seamless interconnection between the virtual environment and the physical one. Also, it guarantees the segregation of each virtual LAN traffic from the traffic of other LANs, from the cluster traffic, and from Internet traffic. Further, a packet is only sent to the cluster node containing the recipient VD. We produce several example applications where we emulate large network scenarios, with thousands of VDs and LANs. Finally, we experimentally show the scalability potential of Megalos by measuring the overhead of the distributed environment and of its signaling protocols.", acknowledgement = ack-nhfb, journal-URL = "https://www.mdpi.com/1999-5903/", } @Article{Simoes:2021:DAS, author = "Rhodney Sim{\~o}es and Kelvin Dias and Ricardo Martins", title = "Dynamic Allocation of {SDN} Controllers in {NFV}-Based {MEC} for the {Internet of Vehicles}", journal = j-FUTURE-INTERNET, volume = "13", number = "11", pages = "270", day = "26", month = oct, year = "2021", CODEN = "????", DOI = "https://doi.org/10.3390/fi13110270", ISSN = "1999-5903", bibdate = "Wed Jan 19 05:45:13 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/future-internet.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.mdpi.com/1999-5903/13/11/270", abstract = "The expected huge amount of connected cars and applications with varying Quality of Service (QoS) demands still depend on agile/flexible networking infrastructure to deal with dynamic service requests to the control plane, which may become a bottleneck for 5G and Beyond Software-Defined Network (SDN) based Internet of Vehicles (IoV). At the heart of this issue is the need for an architecture and optimization mechanisms that benefit from cutting edge technologies while granting latency bounds in order to control and manage the dynamic nature of IoV. To this end, this article proposes an autonomic software-defined vehicular architecture grounded on the synergy of Multi-access Edge Computing (MEC) and Network Functions Virtualization (NFV) along with a heuristic approach and an exact model based on linear programming to efficiently optimize the dynamic resource allocation of SDN controllers, ensuring load balancing between controllers and employing reserve resources for tolerance in case of demand variation. The analyses carried out in this article consider: (a) to avoid waste of limited MEC resources, (b) to devise load balancing among controllers, (c) management complexity, and (d) to support scalability in dense IoV scenarios. The results show that the heuristic efficiently manages the environment even in highly dynamic and dense scenarios.", acknowledgement = ack-nhfb, journal-URL = "https://www.mdpi.com/journal/futureinternet", } @Article{Song:2021:CRE, author = "Weijia Song and Christina Delimitrou and Zhiming Shen and Robbert {Van Renesse} and Hakim Weatherspoon and Lotfi Benmohamed and Frederic {De Vaulx} and Charif Mahmoudi", title = "{CacheInspector}: Reverse Engineering Cache Resources in Public Clouds", journal = j-TACO, volume = "18", number = "3", pages = "35:1--35:25", month = jun, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3457373", ISSN = "1544-3566 (print), 1544-3973 (electronic)", ISSN-L = "1544-3566", bibdate = "Tue Jun 29 08:21:11 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/taco.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1145/3457373", abstract = "Infrastructure-as-a-Service cloud providers sell virtual machines that are only specified in terms of number of CPU cores, amount of memory, and I/O throughput. Performance-critical aspects such as cache sizes and memory latency are missing or reported in ways that make them hard to compare across cloud providers. It is difficult for users to adapt their application's behavior to the available resources. In this work, we aim to increase the visibility that cloud users have into shared resources on public clouds. Specifically, we present CacheInspector, a lightweight runtime that determines the performance and allocated capacity of shared caches on multi-tenant public clouds. We validate CacheInspector's accuracy in a controlled environment, and use it to study the characteristics and variability of cache resources in the cloud, across time, instances, availability regions, and cloud providers. We show that CacheInspector's output allows cloud users to tailor their application's behavior, including their output quality, to avoid suboptimal performance when resources are scarce.", acknowledgement = ack-nhfb, articleno = "35", fjournal = "ACM Transactions on Architecture and Code Optimization (TACO)", journal-URL = "https://dl.acm.org/loi/taco", } @Article{Tiburski:2021:LVM, author = "Ram{\~a}o T. Tiburski and Carlos R. Moratelli and S{\'e}rgio F. Johann and Everton de Matos and Fabiano Hessel", title = "A lightweight virtualization model to enable edge computing in deeply embedded systems", journal = j-SPE, volume = "51", number = "9", pages = "1964--1981", month = sep, year = "2021", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/spe.2968", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Fri Jan 21 10:29:07 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "Softw. Pract. Exp.", fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", onlinedate = "18 March 2021", } @Article{Wu:2021:SLS, author = "Hao Wu and Xin Chen and He Guo", title = "Scheduling large-scale scientific workflow on virtual machines with different numbers of {vCPUs}", journal = j-J-SUPERCOMPUTING, volume = "77", number = "1", pages = "679--710", month = jan, year = "2021", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-020-03273-3", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Fri May 14 09:19:58 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://link.springer.com/article/10.1007/s11227-020-03273-3", acknowledgement = ack-nhfb, fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", online-date = "Published: 23 April 2020 Pages: 679 - 710", } @Article{Xiao:2021:IEE, author = "Peng Xiao and Zhenyu Ni and Zhigang Hu", title = "Improving the energy-efficiency of virtual machines by {I/O} compensation", journal = j-J-SUPERCOMPUTING, volume = "77", number = "10", pages = "11135--11159", month = oct, year = "2021", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-021-03678-8", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Mon Feb 28 16:44:30 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://link.springer.com/article/10.1007/s11227-021-03678-8", acknowledgement = ack-nhfb, ajournal = "J. Supercomputing", fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Xie:2021:OAM, author = "Yanghao Xie and Sheng Wang and Binbin Wang and Shizhong Xu and Xiong Wang and Jing Ren", title = "Online algorithm for migration aware Virtualized Network Function placing and routing in dynamic {5G} networks", journal = j-COMP-NET-AMSTERDAM, volume = "194", number = "??", pages = "??--??", day = "20", month = jul, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1016/j.comnet.2021.108115", ISSN = "1389-1286 (print), 1872-7069 (electronic)", ISSN-L = "1389-1286", bibdate = "Tue Feb 1 09:19:03 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1389128621001924", acknowledgement = ack-nhfb, articleno = "108115", fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)", journal-URL = "http://www.sciencedirect.com/science/journal/13891286/", } @Article{Yang:2021:FGR, author = "Yang Yang and Songtao Guo and Guiyan Liu and Lin Yi", title = "Fine granularity resource allocation of virtual data center with consideration of virtual switches", journal = j-J-NETW-COMPUT-APPL, volume = "175", number = "??", pages = "??--??", day = "1", month = feb, year = "2021", CODEN = "JNCAF3", DOI = "https://doi.org/10.1016/j.jnca.2020.102916", ISSN = "1084-8045 (print), 1095-8592 (electronic)", ISSN-L = "1084-8045", bibdate = "Mon May 24 15:12:41 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1084804520303751", acknowledgement = ack-nhfb, articleno = "102916", fjournal = "Journal of Network and Computer Applications", journal-URL = "http://www.sciencedirect.com/science/journal/10848045", } @Article{Yang:2021:SHS, author = "Ye Yang and Haiyang Jiang and Guangxing Zhang and Xin Wang and Yilong Lv and Xing Li and Serge Fdida and Gaogang Xie", title = "{S2H}: Hypervisor as a setter within {Virtualized Network I/O} for {VM} isolation on cloud platform", journal = j-COMP-NET-AMSTERDAM, volume = "201", number = "??", pages = "??--??", day = "24", month = dec, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1016/j.comnet.2021.108577", ISSN = "1389-1286 (print), 1872-7069 (electronic)", ISSN-L = "1389-1286", bibdate = "Tue Feb 1 09:19:06 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1389128621004862", acknowledgement = ack-nhfb, articleno = "108577", fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)", journal-URL = "http://www.sciencedirect.com/science/journal/13891286/", } @Article{Ye:2021:SSD, author = "Z. Ye and Y. Wang and S. He and C. Xu and X. Sun", title = "{Sova}: a Software-Defined Autonomic Framework for Virtual Network Allocations", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "32", number = "1", pages = "116--130", year = "2021", CODEN = "ITDSEO", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Sat Aug 15 14:52:38 2020", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Parallel and Distributed Systems", journal-URL = "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=71", } @Article{Yilmaz:2021:FGC, author = "Fadi Yilmaz and Meera Sridhar and Abhinav Mohanty and Vasant Tendulkar and Kevin W. Hamlen", title = "A fine-grained classification and security analysis of web-based virtual machine vulnerabilities", journal = j-COMPUT-SECUR, volume = "105", number = "??", pages = "Article 102246", month = jun, year = "2021", CODEN = "CPSEDU", DOI = "https://doi.org/10.1016/j.cose.2021.102246", ISSN = "0167-4048 (print), 1872-6208 (electronic)", ISSN-L = "0167-4048", bibdate = "Tue May 4 07:59:03 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167404821000705", acknowledgement = ack-nhfb, fjournal = "Computers \& Security", journal-URL = "http://www.sciencedirect.com/science/journal/01674048", } @Article{Zerouali:2021:MDA, author = "Ahmed Zerouali and Tom Mens and Alexandre Decan and Jesus Gonzalez-Barahona and Gregorio Robles", title = "A multi-dimensional analysis of technical lag in {Debian}-based {Docker} images", journal = j-EMPIR-SOFTWARE-ENG, volume = "26", number = "2", pages = "??--??", month = mar, year = "2021", CODEN = "ESENFW", DOI = "https://doi.org/10.1007/s10664-020-09908-6", ISSN = "1382-3256 (print), 1573-7616 (electronic)", ISSN-L = "1382-3256", bibdate = "Tue Mar 30 15:09:47 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/empir-software-eng.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer.com/article/10.1007/s10664-020-09908-6; http://link.springer.com/content/pdf/10.1007/s10664-020-09908-6.pdf", acknowledgement = ack-nhfb, articleno = "19", fjournal = "Empirical Software Engineering", journal-URL = "http://link.springer.com/journal/10664", } @Article{Zhan:2021:CAW, author = "Yang Zhan and Alex Conway and Yizheng Jiao and Nirjhar Mukherjee and Ian Groombridge and Michael A. Bender and Martin Farach-Colton and William Jannen and Rob Johnson and Donald E. Porter and Jun Yuan", title = "Copy-on-Abundant-Write for Nimble File System Clones", journal = j-TOS, volume = "17", number = "1", pages = "5:1--5:27", month = feb, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3423495", ISSN = "1553-3077 (print), 1553-3093 (electronic)", ISSN-L = "1553-3077", bibdate = "Fri Feb 5 11:10:27 MST 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tos.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1145/3423495", abstract = "Making logical copies, or clones, of files and directories is critical to many real-world applications and workflows, including backups, virtual machines, and containers. An ideal clone implementation meets the following performance goals: (1) creating \ldots{}", acknowledgement = ack-nhfb, articleno = "5", fjournal = "ACM Transactions on Storage", journal-URL = "https://dl.acm.org/loi/tos", } @Article{Zhang:2021:CHP, author = "Xuzhi Zhang and Xiaozhe Shao and George Provelengios and Naveen Kumar Dumpala and Lixin Gao and Russell Tessier", title = "{CoNFV}: a Heterogeneous Platform for Scalable Network Function Virtualization", journal = j-TRETS, volume = "14", number = "1", pages = "1:1--1:29", month = jan, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3409113", ISSN = "1936-7406 (print), 1936-7414 (electronic)", ISSN-L = "1936-7406", bibdate = "Fri Jul 16 07:17:04 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/trets.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1145/3409113", abstract = "Network function virtualization (NFV) is a powerful networking approach that leverages computing resources to perform a time-varying set of network processing functions. Although microprocessors can be used for this purpose, their performance limitations and lack of specialization present implementation challenges. In this article, we describe a new heterogeneous hardware-software NFV platform called CoNFV that provides scalability and programmability while supporting significant hardware-level parallelism and reconfiguration. Our computing platform takes advantage of both field-programmable gate arrays (FPGAs) and microprocessors to implement numerous virtual network functions (VNF) that can be dynamically customized to specific network flow needs. The most distinctive feature of our system is the use of global network state to coordinate NFV operations. Traffic management and hardware reconfiguration functions are performed by a global coordinator that allows for the rapid sharing of network function states and continuous evaluation of network function needs. With the help of state sharing mechanism offered by the coordinator, customer-defined VNF instances can be easily migrated between heterogeneous middleboxes as the network environment changes. A resource allocation and scheduling algorithm dynamically assesses resource deployments as network flows and conditions are updated. We show that our deployment algorithm can successfully reallocate FPGA and microprocessor resources in a fraction of a second in response to changes in network flow capacity and network security threats including intrusion.", acknowledgement = ack-nhfb, articleno = "1", fjournal = "ACM Transactions on Reconfigurable Technology and Systems (TRETS)", journal-URL = "https://dl.acm.org/loi/trets", } @Article{Zhang:2021:KSV, author = "Yiming Zhang and Chengfei Zhang and Yaozheng Wang and Kai Yu and Guangtao Xue and Jon Crowcroft", title = "{KylinX}: Simplified Virtualization Architecture for Specialized Virtual Appliances with Strong Isolation", journal = j-TOCS, volume = "37", number = "1--4", pages = "2:1--2:27", month = mar, year = "2021", CODEN = "ACSYEC", DOI = "https://doi.org/10.1145/3436512", ISSN = "0734-2071 (print), 1557-7333 (electronic)", ISSN-L = "0734-2071", bibdate = "Tue May 25 09:04:45 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tocs.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1145/3436512", abstract = "Unikernel specializes a minimalistic LibOS and a target application into a standalone single-purpose virtual machine (VM) running on a hypervisor, which is referred to as (virtual) appliance. Compared to traditional VMs, Unikernel appliances have smaller memory footprint and lower overhead while guaranteeing the same level of isolation. On the downside, Unikernel strips off the process abstraction from its monolithic appliance and thus sacrifices flexibility, efficiency, and applicability.\par In this article, we examine whether there is a balance embracing the best of both Unikernel appliances (strong isolation) and processes (high flexibility/efficiency). We present KylinX, a dynamic library operating system for simplified and efficient cloud virtualization by providing the pVM (process-like VM) abstraction. A pVM takes the hypervisor as an OS and the Unikernel appliance as a process allowing both page-level and library-level dynamic mapping. At the page level, KylinX supports pVM fork plus a set of API for inter-pVM communication (IpC, which is compatible with conventional UNIX IPC). At the library level, KylinX supports shared libraries to be linked to a Unikernel appliance at runtime. KylinX enforces mapping restrictions against potential threats. We implement a prototype of KylinX by modifying MiniOS and Xen tools. Extensive experimental results show that KylinX achieves similar performance both in micro benchmarks (fork, IpC, library update, etc.) and in applications (Redis, web server, and DNS server) compared to conventional processes, while retaining the strong isolation benefit of VMs/Unikernels.", acknowledgement = ack-nhfb, articleno = "2", fjournal = "ACM Transactions on Computer Systems", journal-URL = "https://dl.acm.org/loi/tocs", } @Article{Zhang:2021:OAI, author = "Qixia Zhang and Fangming Liu and Chaobing Zeng", title = "Online Adaptive Interference-Aware {VNF} Deployment and Migration for {5G} Network Slice", journal = j-IEEE-TRANS-NETWORKING, volume = "29", number = "5", pages = "2115--2128", month = oct, year = "2021", CODEN = "IEANEP", DOI = "https://doi.org/10.1109/TNET.2021.3080197", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Wed Apr 20 07:36:15 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3080197", abstract = "Based on network function virtualization (NFV) and software defined network (SDN), {$<$ italic$>$ network} {slicing$<$}/{italic$>$} is proposed as a new paradigm for building service-customized 5G network. In each network slice, service-required virtual network functions \ldots{}", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "https://dl.acm.org/loi/ton", } @Article{Zhang:2021:TVM, author = "Jiachen Zhang and Lixiao Cui and Peng Li and Xiaoguang Liu and Gang Wang", title = "Toward Virtual Machine Image Management for Persistent Memory", journal = j-TOS, volume = "17", number = "3", pages = "20:1--20:24", month = aug, year = "2021", CODEN = "????", DOI = "https://doi.org/10.1145/3450976", ISSN = "1553-3077 (print), 1553-3093 (electronic)", ISSN-L = "1553-3077", bibdate = "Wed Sep 15 05:45:21 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/tos.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1145/3450976", abstract = "Persistent memory's (PM) byte-addressability and high capacity will also make it emerging for virtualized environment. Modern virtual machine monitors virtualize PM using either I/O virtualization or memory virtualization. However, I/O virtualization will \ldots{}", acknowledgement = ack-nhfb, articleno = "20", fjournal = "ACM Transactions on Storage", journal-URL = "https://dl.acm.org/loi/tos", } @Article{Zhang:2021:VGA, author = "Xiaoli Zhang and Qi Li and Zeyu Zhang and Jianping Wu and Jiahai Yang", title = "{vSFC}: Generic and Agile Verification of Service Function Chains in the Cloud", journal = j-IEEE-TRANS-NETWORKING, volume = "29", number = "1", pages = "78--91", month = feb, year = "2021", CODEN = "IEANEP", DOI = "https://doi.org/10.1109/TNET.2020.3028846", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Tue Jun 15 09:48:15 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1109/TNET.2020.3028846", abstract = "With the advent of network function virtualization (NFV), outsourcing network functions (NFs) to the cloud is becoming increasingly popular for enterprises since it brings significant benefits for NF deployment and maintenance, such as improved \ldots{}", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "https://dl.acm.org/loi/ton", } @Article{Zhao:2021:LSA, author = "N. Zhao and V. Tarasov and H. Albahar and A. Anwar and L. Rupprecht and D. Skourtis and A. K. Paul and K. Chen and A. R. Butt", title = "Large-Scale Analysis of {Docker} Images and Performance Implications for Container Storage Systems", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "32", number = "4", pages = "918--930", year = "2021", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2020.3034517", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Fri Mar 19 06:51:50 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Parallel and Distributed Systems", journal-URL = "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=71", } @Article{Adoga:2022:NFV, author = "Haruna Umar Adoga and Dimitrios P. Pezaros", title = "Network Function Virtualization and Service Function Chaining Frameworks: a Comprehensive Review of Requirements, Objectives, Implementations, and Open Research Challenges", journal = j-FUTURE-INTERNET, volume = "14", number = "2", pages = "59", day = "15", month = feb, year = "2022", CODEN = "????", DOI = "https://doi.org/10.3390/fi14020059", ISSN = "1999-5903", bibdate = "Fri Feb 25 07:09:39 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/future-internet.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.mdpi.com/1999-5903/14/2/59", abstract = "Network slicing has become a fundamental property for next-generation networks, especially because an inherent part of 5G standardisation is the ability for service providers to migrate some or all of their network services to a virtual network infrastructure, thereby reducing both capital and operational costs. With network function virtualisation (NFV), network functions (NFs) such as firewalls, traffic load balancers, content filters, and intrusion detection systems (IDS) are either instantiated on virtual machines (VMs) or lightweight containers, often chained together to create a service function chain (SFC). In this work, we review the state-of-the-art NFV and SFC implementation frameworks and present a taxonomy of the current proposals. Our taxonomy comprises three major categories based on the primary objectives of each of the surveyed frameworks: (1) resource allocation and service orchestration, (2) performance tuning, and (3) resilience and fault recovery. We also identify some key open research challenges that require further exploration by the research community to achieve scalable, resilient, and high-performance NFV/SFC deployments in next-generation networks.", acknowledgement = ack-nhfb, journal-URL = "https://www.mdpi.com/journal/futureinternet", } @Article{Ahmadi:2022:CIB, author = "Javad Ahmadi and Abolfazl Toroghi Haghighat and Amir Masoud Rahmani and Reza Ravanmehr", title = "Confidence interval-based overload avoidance algorithm for virtual machine placement", journal = j-SPE, volume = "52", number = "10", pages = "2288--2311", month = oct, year = "2022", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/spe.3127", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Tue Feb 28 12:16:34 MST 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "Softw. Pract. Exp.", fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", onlinedate = "29 July 2022", } @Article{Ahmadi:2022:FAV, author = "Javad Ahmadi and Abolfazl Toroghi Haghighat and Amir Masoud Rahmani and Reza Ravanmehr", title = "A flexible approach for virtual machine selection in cloud data centers with {AHP}", journal = j-SPE, volume = "52", number = "5", pages = "1216--1241", month = may, year = "2022", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/spe.3062", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Tue Feb 28 12:16:31 MST 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "Softw. Pract. Exp.", fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", onlinedate = "22 December 2021", } @Article{Alachiotis:2022:SPR, author = "Nikolaos Alachiotis and Panagiotis Skrimponis and Manolis Pissadakis and Dionisios Pnevmatikatos", title = "Scalable Phylogeny Reconstruction with Disaggregated Near-memory Processing", journal = j-TRETS, volume = "15", number = "3", pages = "25:1--25:32", month = sep, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3484983", ISSN = "1936-7406 (print), 1936-7414 (electronic)", ISSN-L = "1936-7406", bibdate = "Tue May 24 07:29:32 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/trets.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1145/3484983", abstract = "Disaggregated computer architectures eliminate resource fragmentation in next-generation datacenters by enabling virtual machines to employ resources such as CPUs, memory, and accelerators that are physically located on different servers. While this paves \ldots{}", acknowledgement = ack-nhfb, articleno = "25", fjournal = "ACM Transactions on Reconfigurable Technology and Systems (TRETS)", journal-URL = "https://dl.acm.org/loi/trets", } @Article{Alharbe:2022:FGG, author = "Nawaf Alharbe and Abeer Aljohani and Mohamed Ali Rakrouki", title = "A Fuzzy Grouping Genetic Algorithm for Solving a Real-World Virtual Machine Placement Problem in a Healthcare-Cloud", journal = j-ALGORITHMS-BASEL, volume = "15", number = "4", month = apr, year = "2022", CODEN = "ALGOCH", DOI = "https://doi.org/10.3390/a15040128", ISSN = "1999-4893 (electronic)", ISSN-L = "1999-4893", bibdate = "Fri Apr 22 10:29:44 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/algorithms.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.mdpi.com/1999-4893/15/4/128", acknowledgement = ack-nhfb, articleno = "128", fjournal = "Algorithms (Basel)", journal-URL = "https://www.mdpi.com/journal/algorithms", pagecount = "??", } @Article{Alharbi:2022:NSA, author = "Abdullah Alharbi and Mohammed Aljebreen and Amr Tolba and Konstantinos A. Lizos and Saied Abd El-Atty and Farid Shawki", title = "A Normalized Slicing-assigned Virtualization Method for 6G-based Wireless Communication Systems", journal = j-TOMM, volume = "18", number = "3s", pages = "134:1--134:??", month = oct, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3546077", ISSN = "1551-6857 (print), 1551-6865 (electronic)", ISSN-L = "1551-6857", bibdate = "Thu Jun 22 10:29:31 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tomccap.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1145/3546077", abstract = "The next generation of wireless communication systems will rely on advantageous sixth-generation wireless network (6G) features and \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Multimed Comput. Commun. Appl.", articleno = "134", fjournal = "ACM Transactions on Multimedia Computing, Communications, and Applications", journal-URL = "https://dl.acm.org/loi/tomm", } @Article{Alnaim:2022:MPT, author = "Abdulrahman K. Alnaim", title = "Misuse Patterns from the Threat of Modification of Non-Control Data in Network Function Virtualization", journal = j-FUTURE-INTERNET, volume = "14", number = "7", pages = "201", day = "30", month = jun, year = "2022", CODEN = "????", DOI = "https://doi.org/10.3390/fi14070201", ISSN = "1999-5903", bibdate = "Tue Jul 26 06:44:01 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/future-internet.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.mdpi.com/1999-5903/14/7/201", abstract = "Network Function Virtualization (NFV) is a virtual network model, the goal of which is a cost-efficient transition of the hardware infrastructure into a flexible and reliable software platform. However, this transition comes at the cost of more security threats. A key part of this virtualization environment is the hypervisor, which emulates the hardware resources to provide a runtime environment for virtual machines (VMs). The hypervisor is considered a major attack vector and must be secured to ensure network service continuity. The virtualization environment contains critical non-control data where compromise could lead to several misuses, including information leakage and privilege and resource modification. In this paper, we present a misuse pattern for an attack that exploits the security vulnerabilities of the hypervisor to compromise the integrity of non-control data in the NFV environment. Misuse patterns are used to describe how attacks are carried out from the attackers' perspective. The threat of modification of non-control data can lead to several misuses, and in this paper, we discuss three of them. The defenses to this attack can be incorporated into the Security Reference Architecture (SRA) of the NFV system to prevent these misuses.", acknowledgement = ack-nhfb, journal-URL = "https://www.mdpi.com/journal/futureinternet", } @Article{Battisti:2022:NSV, author = "Anselmo Luiz {\'E}den Battisti and Evandro Luiz Cardoso Macedo and Marina Ivanov Pereira Josu{\'e} and Hugo Barbalho and Fl{\'a}via C. Delicato and D{\'e}bora Christina Muchaluat-Saade and Paulo F. Pires and Douglas Paulo de Mattos and Ana Cristina Bernardo de Oliveira", title = "A Novel Strategy for {VNF} Placement in Edge Computing Environments", journal = j-FUTURE-INTERNET, volume = "14", number = "12", pages = "361", day = "30", month = nov, year = "2022", CODEN = "????", DOI = "https://doi.org/10.3390/fi14120361", ISSN = "1999-5903", bibdate = "Mon Feb 27 09:26:52 MST 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/future-internet.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.mdpi.com/1999-5903/14/12/361", abstract = "Network function virtualization (NFV) is a novel technology that virtualizes computing, network, and storage resources to decouple the network functions from the underlying hardware, thus allowing the software implementation of such functions to run on commodity hardware. By doing this, NFV provides the necessary flexibility to enable agile, cost-effective, and on-demand service delivery models combined with automated management. Different management and orchestration challenges arise in such virtualized and distributed environments. A major challenge in the selection of the most suitable edge nodes is that of deploying virtual network functions (VNFs) to meet requests from multiple users. This article addresses the VNF placement problem by providing a novel integer linear programming (ILP) optimization model and a novel VNF placement algorithm. In our definition, the multi-objective optimization problem aims to (i) minimize the energy consumption in the edge nodes; (ii) minimize the total latency; and (iii) reducing the total cost of the infrastructure. Our new solution formulates the VNF placement problem by taking these three objectives into account simultaneously. In addition, the novel VNF placement algorithm leverages VNF sharing, which reuses VNF instances already placed to potentially reduce computational resource usage. Such a feature is still little explored in the community. Through simulation, numerical results show that our approach can perform better than other approaches found in the literature regarding resource consumption and the number of SFC requests met.", acknowledgement = ack-nhfb, journal-URL = "https://www.mdpi.com/journal/futureinternet", } @Article{Benomar:2022:CBN, author = "Zakaria Benomar and Francesco Longo and Giovanni Merlino and Antonio Puliafito", title = "Cloud-based Network Virtualization in {IoT} with {OpenStack}", journal = j-TOIT, volume = "22", number = "1", pages = "19:1--19:26", month = feb, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3460818", ISSN = "1533-5399 (print), 1557-6051 (electronic)", ISSN-L = "1533-5399", bibdate = "Wed Nov 10 05:28:20 MST 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/toit.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1145/3460818", abstract = "In Cloud computing deployments, specifically in the Infrastructure-as-a-Service (IaaS) model, networking is one of the core enabling facilities provided for the users. The IaaS approach ensures significant flexibility and manageability, since the \ldots{}", acknowledgement = ack-nhfb, articleno = "19", fjournal = "ACM Transactions on Internet Technology (TOIT)", journal-URL = "https://dl.acm.org/loi/toit", } @Article{Bermejo:2022:GME, author = "Belen Bermejo and Carlos Juiz", title = "A general method for evaluating the overhead when consolidating servers: performance degradation in virtual machines and containers", journal = j-J-SUPERCOMPUTING, volume = "78", number = "9", pages = "11345--11372", month = jun, year = "2022", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-022-04318-5", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Mon Jun 6 08:11:51 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jsuper2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://link.springer.com/article/10.1007/s11227-022-04318-5", acknowledgement = ack-nhfb, ajournal = "J. Supercomputing", fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Bhagavathi:2022:IBS, author = "Hariharan Bhagavathi and Siva Rathinavelayatham and Kaliraj Shanmugaiah and Kamaraj Kanagaraj and Dinesh Elangovan", title = "Improved beetle swarm optimization algorithm for energy efficient virtual machine consolidation on cloud environment", journal = j-CCPE, volume = "34", number = "10", pages = "e6828:1--e6828:??", day = "1", month = may, year = "2022", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.6828", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Wed Apr 13 09:55:03 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "Concurr. Comput.", fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", onlinedate = "13 January 2022", } @Article{Bhattacharya:2022:PMI, author = "Tathagata Bhattacharya and Xiaopu Peng and Jianzhou Mao and Chaowei Zhang and Taha Takreeti and Ye Wang and Ting Cao and Xiao Qin", title = "Performance modeling for {I/O}-intensive applications on virtual machines", journal = j-CCPE, volume = "34", number = "10", pages = "e6823:1--e6823:??", day = "1", month = may, year = "2022", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.6823", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Wed Apr 13 09:55:03 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "Concurr. Comput.", fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", onlinedate = "18 January 2022", } @Article{Carpio:2022:SMR, author = "Francisco Carpio and Wolfgang Bziuk and Admela Jukan", title = "Scaling migrations and replications of {Virtual Network Functions} based on network traffic forecasting", journal = j-COMP-NET-AMSTERDAM, volume = "203", number = "??", pages = "??--??", day = "11", month = feb, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1016/j.comnet.2021.108582", ISSN = "1389-1286 (print), 1872-7069 (electronic)", ISSN-L = "1389-1286", bibdate = "Tue Feb 1 09:19:07 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1389128621004898", acknowledgement = ack-nhfb, articleno = "108582", fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)", journal-URL = "http://www.sciencedirect.com/science/journal/13891286/", } @Article{Catena:2022:DLB, author = "Tiziana Catena and Vincenzo Eramo and Massimo Panella and Antonello Rosato", title = "Distributed {LSTM}-based cloud resource allocation in {Network Function Virtualization Architectures}", journal = j-COMP-NET-AMSTERDAM, volume = "213", number = "??", pages = "??--??", day = "4", month = aug, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1016/j.comnet.2022.109111", ISSN = "1389-1286 (print), 1872-7069 (electronic)", ISSN-L = "1389-1286", bibdate = "Thu Aug 4 05:58:27 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1389128622002390", acknowledgement = ack-nhfb, articleno = "109111", fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)", journal-URL = "http://www.sciencedirect.com/science/journal/13891286/", } @Article{Chen:2022:DUL, author = "Jiahao Chen and Dingji Li and Zeyu Mi and Yuxuan Liu and Binyu Zang and Haibing Guan and Haibo Chen", title = "{DuVisor}: A user-level hypervisor through delegated virtualization,", journal = "arXiv.org", volume = "??", number = "??", pages = "1--17", day = "22", month = jan, year = "2022", DOI = "https://doi.org/10.48550/arXiv.2201.09652", bibdate = "Tue Dec 19 08:16:51 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/risc-v.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://arxiv.org/abs/2201.09652", abstract = "Today's mainstream virtualization systems comprise of two cooperative components: a kernel-resident driver that accesses virtualization hardware and a user-level helper process that provides VM management and I/O virtualization. However, this virtualization architecture has intrinsic issues in both security (a large attack surface) and performance. While there is a long thread of work trying to minimize the kernel-resident driver by offloading functions to user mode, they face a fundamental tradeoff between security and performance: more offloading may reduce the kernel attack surface, yet increase the runtime ring crossings between the helper process and the driver, and thus more performance cost.\par This paper explores a new design called delegated virtualization, which completely separates the control plane (the kernel driver) from the data plane (the helper process) and thus eliminates the kernel driver from runtime intervention. The resulting user-level hypervisor, called DuVisor, can handle all VM operations without trapping into the kernel once the kernel driver has done the initialization. DuVisor retrofits existing hardware virtualization support with a new delegated virtualization extension to directly handle VM exits, configure virtualization registers, manage the stage-2 page table and virtual devices in user mode. We have implemented the hardware extension on an open-source RISC-V CPU and built a Rust-based hypervisor atop the hardware. Evaluation on FireSim shows that DuVisor outperforms KVM by up to 47.96\% in a variety of real-world applications and significantly reduces the attack surface.", acknowledgement = ack-nhfb, } @Article{Choi:2022:EDP, author = "Yeseul Choi and Yunjong Jeong and Daehee Jang and Brent Byunghoon Kang and Hojoon Lee", title = "{EmuID}: Detecting presence of emulation through microarchitectural characteristic on {ARM}", journal = j-COMPUT-SECUR, volume = "113", number = "??", pages = "Article 102569", month = feb, year = "2022", CODEN = "CPSEDU", DOI = "https://doi.org/10.1016/j.cose.2021.102569", ISSN = "0167-4048 (print), 1872-6208 (electronic)", ISSN-L = "0167-4048", bibdate = "Sat Jan 22 14:55:12 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S016740482100393X", acknowledgement = ack-nhfb, fjournal = "Computers \& Security", journal-URL = "http://www.sciencedirect.com/science/journal/01674048", } @Article{Cinque:2022:VMC, author = "Marcello Cinque and Domenico Cotroneo and Luigi {De Simone} and Stefano Rosiello", title = "Virtualizing mixed-criticality systems: a survey on industrial trends and issues", journal = j-FUT-GEN-COMP-SYS, volume = "129", number = "??", pages = "315--330", month = apr, year = "2022", CODEN = "FGSEVI", DOI = "https://doi.org/10.1016/j.future.2021.12.002", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Wed Feb 9 09:07:29 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X21004787", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Dai:2022:RBV, author = "Guangli Dai and Pavan Kumar Paluri and Albert Mo Kim Cheng and Bozheng Liu", title = "Regularity-Based Virtualization Under the {ARINC 653 Standard for Embedded Systems}", journal = j-IEEE-TRANS-COMPUT, volume = "71", number = "10", pages = "2592--2605", month = oct, year = "2022", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.2021.3138019", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Thu Sep 8 07:59:47 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Computers", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", } @Article{Dias:2022:SLR, author = "Alexandre H. T. Dias and Luiz. H. A. Correia and Neumar Malheiros", title = "A Systematic Literature Review on Virtual Machine Consolidation", journal = j-COMP-SURV, volume = "54", number = "8", pages = "176:1--176:38", month = nov, year = "2022", CODEN = "CMSVAN", DOI = "https://doi.org/10.1145/3470972", ISSN = "0360-0300 (print), 1557-7341 (electronic)", ISSN-L = "0360-0300", bibdate = "Tue Oct 5 08:39:24 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/compsurv.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1145/3470972", abstract = "Virtual machine consolidation has been a widely explored topic in recent years due to Cloud Data Centers' effect on global energy consumption. Thus, academia and companies made efforts to achieve green computing, reducing energy consumption to minimize \ldots{}", acknowledgement = ack-nhfb, articleno = "176", fjournal = "ACM Computing Surveys", journal-URL = "https://dl.acm.org/loi/csur", } @Article{Durairaj:2022:TSV, author = "Selvam Durairaj and Rajeswari Sridhar", title = "Task scheduling to a virtual machine using a multi-objective mayfly approach for a cloud environment", journal = j-CCPE, volume = "34", number = "24", pages = "e7236:1--e7236:??", day = "1", month = nov, year = "2022", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.7236", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Wed Mar 15 08:11:25 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "Concurr. Comput.", fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", onlinedate = "28 July 2022", } @Article{Eiling:2022:CVL, author = "Niklas Eiling and Jonas Baude and Stefan Lankes and Antonello Monti", title = "{Cricket}: a virtualization layer for distributed execution of {CUDA} applications with checkpoint\slash restart support", journal = j-CCPE, volume = "34", number = "14", pages = "e6474:1--e6474:??", day = "25", month = jun, year = "2022", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.6474", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Wed Mar 15 08:11:16 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "Concurr. Comput.", fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", onlinedate = "06 July 2021", } @Article{ElBalmany:2022:SVM, author = "Chawki {El Balmany} and Zakariae Tbatou and Ahmed Asimi and Mohamed Bamarouf", title = "Secure Virtual Machine Image Storage Process into a Trusted Zone-based Cloud Storage", journal = j-COMPUT-SECUR, volume = "120", number = "??", pages = "Article 102815", month = sep, year = "2022", CODEN = "CPSEDU", DOI = "https://doi.org/10.1016/j.cose.2022.102815", ISSN = "0167-4048 (print), 1872-6208 (electronic)", ISSN-L = "0167-4048", bibdate = "Wed Jul 27 18:09:30 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167404822002097", acknowledgement = ack-nhfb, fjournal = "Computers \& Security", journal-URL = "http://www.sciencedirect.com/science/journal/01674048", } @Article{Farzaneh:2022:NVM, author = "Seyed Milad Farzaneh and Omid Fatemi", title = "A novel virtual machine placement algorithm using {RF} element in cloud infrastructure", journal = j-J-SUPERCOMPUTING, volume = "78", number = "1", pages = "1288--1329", month = jan, year = "2022", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-021-03863-9", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Fri Feb 21 15:59:34 MST 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/jsuper2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://link.springer.com/article/10.1007/s11227-021-03863-9", acknowledgement = ack-nhfb, ajournal = "J. Supercomputing", fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Fraga:2022:FSD, author = "Martin Fraga and Mat{\'\i}as Micheletto and Andr{\'e}s Llin{\'a}s and Rodrigo Santos and Paula Zabala", title = "Flow Scheduling in Data Center Networks with Time and Energy Constraints: a Software-Defined Network Approach", journal = j-FUTURE-INTERNET, volume = "14", number = "2", pages = "65", day = "21", month = feb, year = "2022", CODEN = "????", DOI = "https://doi.org/10.3390/fi14020065", ISSN = "1999-5903", bibdate = "Fri Feb 25 07:09:39 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/future-internet.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.mdpi.com/1999-5903/14/2/65", abstract = "Flow scheduling in Data Center Networks (DCN) is a hot topic as cloud computing and virtualization are becoming the dominant paradigm in the increasing demand of digital services. Within the cost of the DCN, the energy demands associated with the network infrastructure represent an important portion. When flows have temporal restrictions, the scheduling with path selection to reduce the number of active switching devices is a NP-hard problem as proven in the literature. In this paper, an heuristic approach to schedule real-time flows in data-centers is proposed, optimizing the temporal requirements while reducing the energy consumption in the network infrastructure via a proper selection of the paths. The experiments show good performance of the solutions found in relation to exact solution approximations based on an integer linear programming model. The possibility of programming the network switches allows the dynamic schedule of paths of flows under the software-defined network management.", acknowledgement = ack-nhfb, journal-URL = "https://www.mdpi.com/journal/futureinternet", } @Article{Garg:2022:OVM, author = "Neha Garg and Damanpreet Singh and Major Singh Goraya", title = "Optimal virtual machine scheduling in virtualized cloud environment using {VIKOR} method", journal = j-J-SUPERCOMPUTING, volume = "78", number = "4", pages = "6006--6034", month = mar, year = "2022", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-021-04081-z", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Fri Feb 21 15:59:35 MST 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/jsuper2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://link.springer.com/article/10.1007/s11227-021-04081-z", acknowledgement = ack-nhfb, ajournal = "J. Supercomputing", fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Haris:2022:LMV, author = "Raseena M. Haris and Khaled M. Khan and Armstrong Nhlabatsi", title = "Live migration of virtual machine memory content in networked systems", journal = j-COMP-NET-AMSTERDAM, volume = "209", number = "??", pages = "??--??", day = "22", month = may, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1016/j.comnet.2022.108898", ISSN = "1389-1286 (print), 1872-7069 (electronic)", ISSN-L = "1389-1286", bibdate = "Wed Apr 27 06:10:39 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1389128622000962", acknowledgement = ack-nhfb, articleno = "108898", fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)", journal-URL = "http://www.sciencedirect.com/science/journal/13891286/", } @Article{He:2022:CCA, author = "TianZhang He and Adel N. Toosi and Rajkumar Buyya", title = "\pkg{CAMIG}: Concurrency-Aware Live Migration Management of Multiple Virtual Machines in {SDN}-Enabled Clouds", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "33", number = "10", pages = "2318--2331", month = oct, year = "2022", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2021.3139014", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Fri Jun 10 07:55:27 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Parallel and Distributed Systems", journal-URL = "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=71", } @Article{Helali:2022:SLC, author = "Leila Helali and Mohamed Nazih Omri", title = "Software License Consolidation and Resource Optimization in Container-based Virtualized Data Centers", journal = j-J-GRID-COMP, volume = "20", number = "2", pages = "??--??", month = jun, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1007/s10723-022-09602-5", ISSN = "1570-7873 (print), 1572-9184 (electronic)", ISSN-L = "1570-7873", bibdate = "Tue Jun 7 17:03:22 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jgridcomp.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://link.springer.com/article/10.1007/s10723-022-09602-5", acknowledgement = ack-nhfb, ajournal = "J. Grid Comp.", fjournal = "Journal of Grid Computing", journal-URL = "http://link.springer.com/journal/10723", } @Article{Henry:2022:HMH, author = "Niroshini Infantia Henry and C Anbuananth and S Kalarani", title = "Hybrid meta-heuristic algorithm for optimal virtual machine placement and migration in cloud computing", journal = j-CCPE, volume = "34", number = "28", pages = "e7353:1--e7353:??", day = "25", month = dec, year = "2022", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.7353", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Wed Mar 15 08:11:28 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "Concurr. Comput.", fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", onlinedate = "29 September 2022", } @Article{Hummaida:2022:SVM, author = "Abdul Rahman Hummaida and Norman W. Paton and Rizos Sakellariou", title = "Scalable Virtual Machine Migration using Reinforcement Learning", journal = j-J-GRID-COMP, volume = "20", number = "2", pages = "??--??", month = jun, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1007/s10723-022-09603-4", ISSN = "1570-7873 (print), 1572-9184 (electronic)", ISSN-L = "1570-7873", bibdate = "Tue Jun 7 17:03:22 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jgridcomp.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://link.springer.com/article/10.1007/s10723-022-09603-4", acknowledgement = ack-nhfb, ajournal = "J. Grid Comp.", fjournal = "Journal of Grid Computing", journal-URL = "http://link.springer.com/journal/10723", } @Article{Jia:2022:GND, author = "Xingguo Jia and Jin Zhang and Boshi Yu and Xingyue Qian and Zhengwei Qi and Haibing Guan", title = "{GiantVM}: a Novel Distributed Hypervisor for Resource Aggregation with {DSM-aware} Optimizations", journal = j-TACO, volume = "19", number = "2", pages = "20:1--20:27", month = jun, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3505251", ISSN = "1544-3566 (print), 1544-3973 (electronic)", ISSN-L = "1544-3566", bibdate = "Fri Mar 25 07:03:00 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/taco.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1145/3505251", abstract = "We present GiantVM, an open-source distributed hypervisor that provides the many-to-one virtualization to aggregate resources from multiple physical machines. We propose techniques to enable distributed CPU and I/O virtualization and distributed shared \ldots{}", acknowledgement = ack-nhfb, articleno = "20", fjournal = "ACM Transactions on Architecture and Code Optimization (TACO)", journal-URL = "https://dl.acm.org/loi/taco", } @Article{Karmakar:2022:UAN, author = "Kamalesh Karmakar and Somrita Banerjee and Rajib K. Das and Sunirmal Khatua", title = "Utilization aware and network {I/O} intensive virtual machine placement policies for cloud data center", journal = j-J-NETW-COMPUT-APPL, volume = "205", number = "??", pages = "??--??", month = sep, year = "2022", CODEN = "JNCAF3", DOI = "https://doi.org/10.1016/j.jnca.2022.103442", ISSN = "1084-8045 (print), 1095-8592 (electronic)", ISSN-L = "1084-8045", bibdate = "Wed Jul 20 16:30:20 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1084804522000959", acknowledgement = ack-nhfb, articleno = "103442", fjournal = "Journal of Network and Computer Applications", journal-URL = "http://www.sciencedirect.com/science/journal/10848045", } @Article{Khan:2022:RSR, author = "Hassan Mahmood Khan and Fang-Fang Chua and Timothy Tzen Vun Yap", title = "{ReSQoV}: a Scalable Resource Allocation Model for {QoS}-Satisfied Cloud Services", journal = j-FUTURE-INTERNET, volume = "14", number = "5", pages = "131", day = "26", month = apr, year = "2022", CODEN = "????", DOI = "https://doi.org/10.3390/fi14050131", ISSN = "1999-5903", bibdate = "Fri May 27 12:03:38 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/future-internet.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.mdpi.com/1999-5903/14/5/131", abstract = "Dynamic resource provisioning is made more accessible with cloud computing. Monitoring a running service is critical, and modifications are performed when specific criteria are exceeded. It is a standard practice to add or delete resources in such situations. We investigate the method to ensure the Quality of Service (QoS), estimate the required resources, and modify allotted resources depending on workload, serialization, and parallelism due to resources. This article focuses on cloud QoS violation remediation using resource planning and scaling. A Resource Quantified Scaling for QoS Violation (ReSQoV) model is proposed based on the Universal Scalability Law (USL), which provides cloud service capacity for specific workloads and generates a capacity model. ReSQoV considers the system overheads while allocating resources to maintain the agreed QoS. As the QoS violation detection decision is Probably Violation and Definitely Violation, the remedial action is triggered, and required resources are added to the virtual machine as vertical scaling. The scenarios emulate QoS parameters and their respective resource utilization for ReSQoV compared to policy-based resource allocation. The results show that after USLbased Quantified resource allocation, QoS is regained, and validation of the ReSQoV is performed through the statistical test ANOVA that shows the significant difference before and after implementation.", acknowledgement = ack-nhfb, journal-URL = "https://www.mdpi.com/journal/futureinternet", } @Article{Kong:2022:NIV, author = "Yuqiang Kong and Yaoping He and Karlo Abnoosian", title = "Nature-inspired virtual machine placement mechanisms: a systematic review", journal = j-CCPE, volume = "34", number = "11", pages = "e6900:1--e6900:??", day = "15", month = may, year = "2022", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.6900", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Wed Mar 15 08:11:12 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "Concurr. Comput.", fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", onlinedate = "08 March 2022", } @Article{Kwon:2022:SFF, author = "Dongup Kwon and Wonsik Lee and Dongryeong Kim and Junehyuk Boo and Jangwoo Kim", title = "{SmartFVM}: a Fast, Flexible, and Scalable Hardware-based Virtualization for Commodity Storage Devices", journal = j-TOS, volume = "18", number = "2", pages = "12:1--12:27", month = may, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3511213", ISSN = "1553-3077 (print), 1553-3093 (electronic)", ISSN-L = "1553-3077", bibdate = "Mon May 9 06:54:11 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/tos.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1145/3511213", abstract = "A computational storage device incorporating a computation unit inside or near its storage unit is a highly promising technology to maximize a storage server's performance. However, to apply such computational storage devices and take their full potential in virtualized environments, server architects must resolve a fundamental challenge: cost-effective virtualization. This critical challenge can be directly addressed by the following questions: (1) how to virtualize two different hardware units (i.e., computation and storage), and (2) how to integrate them to construct virtual computational storage devices, and (3) how to provide them to users. However, the existing methods for computational storage virtualization severely suffer from their low performance and high costs due to the lack of hardware-assisted virtualization support.\par In this work, we propose SmartFVM-Engine, an FPGA card designed to maximize the performance and cost-effectiveness of computational storage virtualization. SmartFVM-Engine introduces three key ideas to achieve the design goals. First, it achieves high virtualization performance by applying hardware-assisted virtualization to both computation and storage units. Second, it further improves the performance by applying hardware-assisted resource orchestration for the virtualized units. Third, it achieves high cost-effectiveness by dynamically constructing and scheduling virtual computational storage devices. To the best of our knowledge, this is the first work to implement a hardware-assisted virtualization mechanism for modern computational storage devices.", acknowledgement = ack-nhfb, articleno = "12", fjournal = "ACM Transactions on Storage", journal-URL = "https://dl.acm.org/loi/tos", } @Article{Li:2022:SIM, author = "Zhuozhao Li and Tanmoy Sen and Haiying Shen and Mooi Choo Chuah", title = "A Study on the Impact of Memory {DoS} Attacks on Cloud Applications and Exploring Real-Time Detection Schemes", journal = j-IEEE-TRANS-NETWORKING, volume = "30", number = "4", pages = "1644--1658", year = "2022", CODEN = "IEANEP", DOI = "https://doi.org/10.1109/TNET.2022.3144895", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Wed May 17 13:15:08 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3144895", abstract = "Even though memory denial-of-service attacks can cause severe performance degradations on co-located virtual machines, a previous detection scheme against such attacks cannot accurately detect the attacks and also generates high detection \ldots{}", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "https://dl.acm.org/loi/ton", } @Article{Li:2022:VAT, author = "Chong Li and Sisu Xi and Chenyang Lu and Roch Gu{\'e}rin and Christopher D. Gill", title = "Virtualization-Aware Traffic Control for Soft Real-Time Network Traffic on {Xen}", journal = j-IEEE-TRANS-NETWORKING, volume = "30", number = "1", pages = "257--270", month = feb, year = "2022", CODEN = "IEANEP", DOI = "https://doi.org/10.1109/TNET.2021.3114055", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Fri Apr 15 05:49:29 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3114055", abstract = "As the role of virtualization technology becomes more prevalent, the range of applications deployed in virtualized systems is steadily growing. This increasingly includes applications with soft real-time requirements that benefit from low and predictable \ldots{}", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "https://dl.acm.org/loi/ton", } @Article{Liu:2022:AFB, author = "Danxu Liu and Junjie Peng and Xin Zhang and Yongkang You and Bo Ning", title = "Application features-based virtual machine deployment strategy in cloud environment", journal = j-CCPE, volume = "34", number = "5", pages = "e6691:1--e6691:??", day = "28", month = feb, year = "2022", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.6691", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Tue Feb 22 09:50:08 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "Concurr. Comput.", fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", onlinedate = "02 November 2021", } @Article{Liu:2022:EAV, author = "Xialin Liu and Junsheng Wu and Lijun Chen and Lili Zhang", title = "Energy-aware virtual machine consolidation based on evolutionary game theory", journal = j-CCPE, volume = "34", number = "10", pages = "e6830:1--e6830:??", day = "1", month = may, year = "2022", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.6830", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Wed Apr 13 09:55:03 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "Concurr. Comput.", fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", onlinedate = "19 January 2022", } @Article{Mangalampalli:2022:WDN, author = "Ashish Mangalampalli and Avinash Kumar", title = "\pkg{WBATimeNet}: a deep neural network approach for {VM Live Migration} in the cloud", journal = j-FUT-GEN-COMP-SYS, volume = "135", number = "??", pages = "438--449", month = oct, year = "2022", CODEN = "FGSEVI", DOI = "https://doi.org/10.1016/j.future.2022.05.016", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Fri Jun 10 07:12:09 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X2200187X", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Memari:2022:LAT, author = "Pedram Memari and Seyedeh Samira Mohammadi and Reza Tavakkoli-Moghaddam", title = "A latency-aware task scheduling algorithm for allocating virtual machines in a cost-effective and time-sensitive fog-cloud architecture", journal = j-J-SUPERCOMPUTING, volume = "78", number = "1", pages = "93--122", month = jan, year = "2022", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-021-03868-4", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Mon Feb 28 16:44:33 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://link.springer.com/article/10.1007/s11227-021-03868-4", acknowledgement = ack-nhfb, ajournal = "J. Supercomputing", fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Montazerolghaem:2022:SVV, author = "Ahmadreza Montazerolghaem", title = "Softwarization and virtualization of {VoIP} networks", journal = j-J-SUPERCOMPUTING, volume = "78", number = "12", pages = "14471--14503", month = aug, year = "2022", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-022-04448-w", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Tue Jul 19 08:40:45 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jsuper2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://link.springer.com/article/10.1007/s11227-022-04448-w", acknowledgement = ack-nhfb, ajournal = "J. Supercomputing", fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @InProceedings{Moratelli:2022:MRV, author = "Carlos Moratelli and Ram{\~a}o Tiburski and S{\'e}rgio F. Johann and Emanuel Moura and Everton {De Matos} and Fabiano Hessel", editor = "{IEEE}", booktitle = "{2022 IEEE 8th World Forum on Internet of Things (WF-IoT)}", title = "{MIPS} and {RISC-V}: Evaluating Virtualization Trade-off for Edge Devices", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "1--6", year = "2022", DOI = "https://doi.org/10.1109/WF-IoT54382.2022.10152084", bibdate = "Sat Dec 16 15:51:40 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/risc-v.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, } @Article{Najjari:2022:SOL, author = "Ahmadreza Hassannezhad Najjari and Ali Asghar Pourhaji Kazem", title = "A systematic overview of live virtual machine migration methods", journal = j-CCPE, volume = "34", number = "17", pages = "e6915:1--e6915:??", day = "1", month = aug, year = "2022", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.6915", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Wed Mar 15 08:11:19 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "Concurr. Comput.", fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", onlinedate = "09 May 2022", } @Article{Niu:2022:NMN, author = "Zhixiong Niu and Qiang Su and Peng Cheng and Yongqiang Xiong and Dongsu Han and Keith Winstein and Chun Jason Xue and Hong Xu", title = "{NetKernel}: Making Network Stack Part of the Virtualized Infrastructure", journal = j-IEEE-TRANS-NETWORKING, volume = "30", number = "3", pages = "999--1013", month = jun, year = "2022", CODEN = "IEANEP", DOI = "https://doi.org/10.1109/TNET.2021.3129806", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Wed May 17 13:15:06 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3129806", abstract = "This paper presents a system called NetKernel that decouples the network stack from the guest virtual machine and offers it as an independent module. NetKernel represents a new paradigm where network stack can be managed as part of the virtualized \ldots{}", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "https://dl.acm.org/loi/ton", } @Article{Nong:2022:ARC, author = "Mengxin Nong and Lingfeng Huang and Mingtao Liu", title = "Allocation of Resources for Cloud Survivability in Smart Manufacturing", journal = j-TMIS, volume = "13", number = "4", pages = "45:1--45:??", month = dec, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3533701", ISSN = "2158-656X (print), 2158-6578 (electronic)", ISSN-L = "2158-656X", bibdate = "Thu Mar 9 08:04:44 MST 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tmis.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1145/3533701", abstract = "With the development of virtualization technology, cloud computing has emerged as a powerful and flexible platform for various services such as online trading. However, there are concerns about the survivability of cloud services in smart manufacturing. \ldots{}", acknowledgement = ack-nhfb, articleno = "45", fjournal = "ACM Transactions on Management Information Systems (TMIS)", journal-URL = "https://dl.acm.org/loi/tmis", } @Article{Peake:2022:PVP, author = "Joshua Peake and Martyn Amos and Nicholas Costen and Giovanni Masala and Huw Lloyd", title = "{PACO--VMP}: Parallel Ant Colony Optimization for Virtual Machine Placement", journal = j-FUT-GEN-COMP-SYS, volume = "129", number = "??", pages = "174--186", month = apr, year = "2022", CODEN = "FGSEVI", DOI = "https://doi.org/10.1016/j.future.2021.11.019", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Wed Feb 9 09:07:29 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X21004568", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Peng:2022:MNM, author = "Bo Peng and Jianguo Yao and Yaozu Dong and Haibing Guan", title = "{MDev-NVMe}: Mediated Pass-Through {NVMe} Virtualization Solution With Adaptive Polling", journal = j-IEEE-TRANS-COMPUT, volume = "71", number = "2", pages = "251--265", month = feb, year = "2022", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.2020.3045785", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Thu Jan 20 07:18:16 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Computers", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", } @Article{Rahman:2022:EET, author = "Fatin Hamadah Rahman and S. H. Shah Newaz and Thien-Wan Au and Wida Susanty Suhaili and M. A. Parvez Mahmud and Gyu Myoung Lee", title = "{EnTruVe}: {ENergy} and {TRUst}-aware Virtual Machine allocation in {VEhicle} fog computing for catering applications in {5G}", journal = j-FUT-GEN-COMP-SYS, volume = "126", number = "??", pages = "196--210", month = jan, year = "2022", CODEN = "FGSEVI", DOI = "https://doi.org/10.1016/j.future.2021.07.036", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Wed Feb 9 09:07:24 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X21002983", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Sa:2022:FLR, author = "Bruno S{\'a} and Jos{\'e} Martins and Sandro Pinto", title = "A First Look at {RISC-V} Virtualization From an Embedded Systems Perspective", journal = j-IEEE-TRANS-COMPUT, volume = "71", number = "9", pages = "2177--2190", month = sep, year = "2022", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.2021.3124320", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Thu Aug 11 09:05:14 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Computers", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", } @Article{Samuelson:2022:LSA, author = "Pamela Samuelson", title = "Legally speaking: {Apple}'s challenge to virtualization software", journal = j-CACM, volume = "65", number = "7", pages = "24--26", month = jul, year = "2022", CODEN = "CACMA2", DOI = "https://doi.org/10.1145/3538636", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Fri Jun 24 09:17:58 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1145/3538636", abstract = "Is it okay for security researchers to virtualize software to look for vulnerabilities?", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Singh:2022:OSA, author = "Garima Singh and Anil Kumar Singh", title = "Optimization of {SLA} aware live migration of multiple virtual machines using {Lagrange} multiplier", journal = j-FUT-GEN-COMP-SYS, volume = "130", number = "??", pages = "279--291", month = may, year = "2022", CODEN = "FGSEVI", DOI = "https://doi.org/10.1016/j.future.2022.01.001", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Wed Feb 9 09:07:30 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X22000073", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Surantha:2022:ISN, author = "Nico Surantha and Noffal A. Putra", title = "Integrated {SDN-NFV} {5G} Network Performance and Management-Complexity Evaluation", journal = j-FUTURE-INTERNET, volume = "14", number = "12", pages = "378", day = "14", month = dec, year = "2022", CODEN = "????", DOI = "https://doi.org/10.3390/fi14120378", ISSN = "1999-5903", bibdate = "Mon Feb 27 09:26:52 MST 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/future-internet.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.mdpi.com/1999-5903/14/12/378", abstract = "Digitalization is one of the factors that affects the acceleration of the application of telecommunications technologies such as 5G. The 5G technology that has been developed today does not yet meet different performance and manageability standards, particularly for data center networks as a supportive technology. Software-defined networking (SDN) and network function virtualization (NFV) are two complementary technologies that are currently used by almost all data centers in the telecommunications industry to rectify performance and manageability issues. In this study, we deliver an integrated SDN-NFV architecture to simplify network management activities in telecommunication companies. To improve network performance at the computing level, we performed a modification of a networking system at the computing level, underlying NFV devices by replacing the default virtual switch with a data plane development kit (DPDK) and single root I/O virtualization (SR-IOV). This study evaluated the proposed architecture design in terms of network performance and manageability. Based on 30 days of observation in prime time, the proposed solution increased throughput up to 200 Mbps for the server leaf and 1.6 Gbps for the border leaf compared to the legacy architecture. Meanwhile, the latency decreased to 12 ms for the server leaf and 17 ms for the border leaf. For manageability, we tested three different scenarios and achieved savings of 13 min for Scenario 1, 22 min for Scenario 2 and 9 min for Scenario 3.", acknowledgement = ack-nhfb, journal-URL = "https://www.mdpi.com/journal/futureinternet", } @Article{Thabet:2022:SBO, author = "Marwa Thabet and Brahim Hnich and Mouhebeddine Berrima", title = "A sampling-based online {Co-Location-Resistant Virtual Machine} placement strategy", journal = j-J-SYST-SOFTW, volume = "187", number = "??", pages = "??--??", month = may, year = "2022", CODEN = "JSSODM", DOI = "https://doi.org/10.1016/j.jss.2022.111215", ISSN = "0164-1212 (print), 1873-1228 (electronic)", ISSN-L = "0164-1212", bibdate = "Mon Feb 28 11:01:58 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jsystsoftw2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0164121222000012", acknowledgement = ack-nhfb, articleno = "111215", fjournal = "Journal of Systems and Software", journal-URL = "http://www.sciencedirect.com/science/journal/01641212", } @Article{Woldeyohannes:2022:CEA, author = "Yordanos Tibebu Woldeyohannes and Besmir Tola and Yuming Jiang and K. K. Ramakrishnan", title = "{CoShare}: an Efficient Approach for Redundancy Allocation in {NFV}", journal = j-IEEE-TRANS-NETWORKING, volume = "30", number = "3", pages = "1014--1028", month = jun, year = "2022", CODEN = "IEANEP", DOI = "https://doi.org/10.1109/TNET.2021.3132279", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Wed May 17 13:15:06 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1109/TNET.2021.3132279", abstract = "An appealing feature of Network Function Virtualization (NFV) is that in an NFV-based network, a network function (NF) instance may be placed at any node. On the one hand this offers great flexibility in allocation of redundant instances, but on the other \ldots{}", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "https://dl.acm.org/loi/ton", } @Article{Xu:2022:NMB, author = "Yanfei Xu and Karlo Abnoosian", title = "A new metaheuristic-based method for solving the virtual machines migration problem in the green cloud computing", journal = j-CCPE, volume = "34", number = "3", pages = "e6579:1--e6579:??", day = "1", month = feb, year = "2022", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.6579", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Tue Feb 22 09:50:06 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "Concurr. Comput.", fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", onlinedate = "24 September 2021", } @Article{Xu:2022:NOL, author = "Zichuan Xu and Haozhe Ren and Weifa Liang and Qiufen Xia and Wanlei Zhou and Pan Zhou and Wenzheng Xu and Guowei Wu and Mingchu Li", title = "Near Optimal Learning-Driven Mechanisms for Stable {NFV} Markets in Multitier Cloud Networks", journal = j-IEEE-TRANS-NETWORKING, volume = "30", number = "6", pages = "2601--2615", year = "2022", CODEN = "IEANEP", DOI = "https://doi.org/10.1109/TNET.2022.3179295", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Wed May 17 13:15:13 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3179295", abstract = "More and more 5G and AI applications demand flexible and low-cost processing of their traffic through diverse virtualized network functions (VNFs) to meet their security and privacy requirements. As such, the Network Function Virtualization (NFV) market \ldots{}", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "https://dl.acm.org/loi/ton", } @Article{Yin:2022:VDC, author = "Chunxia Yin and Jian Liu and Shunfu Jin", title = "A virtualized data center energy-saving mechanism based on switching operating mode of physical servers and reserving virtual machines", journal = j-CCPE, volume = "34", number = "9", pages = "e5785:1--e5785:??", day = "25", month = apr, year = "2022", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.5785", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Wed Apr 13 09:55:02 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "Concurr. Comput.", fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", onlinedate = "04 May 2020", } @Article{Zeng:2022:ADB, author = "Jing Zeng and Ding Ding and Kaixuan Kang and HuaMao Xie and Qian Yin", title = "Adaptive {DRL}-Based Virtual Machine Consolidation in Energy-Efficient Cloud Data Center", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "33", number = "11", pages = "2991--3002", month = nov, year = "2022", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2022.3147851", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Fri May 27 06:27:18 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Parallel and Distributed Systems", journal-URL = "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=71", } @Article{Zeng:2022:UFV, author = "Shulin Zeng and Guohao Dai and Hanbo Sun and Jun Liu and Shiyao Li and Guangjun Ge and Kai Zhong and Kaiyuan Guo and Yu Wang and Huazhong Yang", title = "A Unified {FPGA} Virtualization Framework for General-Purpose Deep Neural Networks in the Cloud", journal = j-TRETS, volume = "15", number = "3", pages = "24:1--24:31", month = sep, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3480170", ISSN = "1936-7406 (print), 1936-7414 (electronic)", ISSN-L = "1936-7406", bibdate = "Tue May 24 07:29:32 MDT 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/trets.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1145/3480170", abstract = "INFerence-as-a-Service (INFaaS) has become a primary workload in the cloud. However, existing FPGA-based Deep Neural Network (DNN) accelerators are mainly optimized for the fastest speed of a single task, while the multi-tenancy of INFaaS has not been explored yet. As the demand for INFaaS keeps growing, simply increasing the number of FPGA-based DNN accelerators is not cost-effective, while merely sharing these single-task optimized DNN accelerators in a time-division multiplexing way could lead to poor isolation and high-performance loss for INFaaS. On the other hand, current cloud-based DNN accelerators have excessive compilation overhead, especially when scaling out to multi-FPGA systems for multi-tenant sharing, leading to unacceptable compilation costs for both offline deployment and online reconfiguration. Therefore, it is far from providing efficient and flexible FPGA virtualization for public and private cloud scenarios.\par Aiming to solve these problems, we propose a unified virtualization framework for general-purpose deep neural networks in the cloud, enabling multi-tenant sharing for both the Convolution Neural Network (CNN), and the Recurrent Neural Network (RNN) accelerators on a single FPGA. The isolation is enabled by introducing a two-level instruction dispatch module and a multi-core based hardware resources pool. Such designs provide isolated and runtime-programmable hardware resources, which further leads to performance isolation for multi-tenant sharing. On the other hand, to overcome the heavy re-compilation overheads, a tiling-based instruction frame package design and a two-stage static-dynamic compilation, are proposed. Only the lightweight runtime information is re-compiled with $ \approx $1 ms overhead, thus guaranteeing the private cloud's performance. Finally, the extensive experimental results show that the proposed virtualized solutions achieve up to $ 3.12 \times $ and $ 6.18 \times $ higher throughput in the private cloud compared with the static CNN and RNN baseline designs, respectively.", acknowledgement = ack-nhfb, articleno = "24", fjournal = "ACM Transactions on Reconfigurable Technology and Systems (TRETS)", journal-URL = "https://dl.acm.org/loi/trets", } @Article{Zhang:2022:CST, author = "Yao Zhang and Wenping Fan and Qichen Hao and Xinya Wu and Min-Ling Zhang", title = "{CAFE} and {SOUP}: Toward Adaptive {VDI} Workload Prediction", journal = j-TIST, volume = "13", number = "6", pages = "94:1--94:??", month = dec, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3529536", ISSN = "2157-6904 (print), 2157-6912 (electronic)", ISSN-L = "2157-6904", bibdate = "Sat Mar 11 08:47:22 MST 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tist.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1145/3529536", abstract = "For Virtual Desktop Infrastructure (VDI) system, effective resource management is rather important where turning off spare virtual machines would help save running cost while maintaining sufficient virtual machines is essential to secure satisfactory user \ldots{}", acknowledgement = ack-nhfb, articleno = "94", fjournal = "ACM Transactions on Intelligent Systems and Technology (TIST)", journal-URL = "https://dl.acm.org/loi/tist", } @Article{Zhao:2022:SEE, author = "Zihan Zhao and Sidi Mohamed Beillahi and Ryan Song and Yuxi Cai and Andreas Veneris and Fan Long", title = "{SigVM}: enabling event-driven execution for truly decentralized smart contracts", journal = j-PACMPL, volume = "6", number = "OOPSLA2", pages = "149:1--149:??", month = oct, year = "2022", CODEN = "????", DOI = "https://doi.org/10.1145/3563312", ISSN = "2475-1421 (electronic)", ISSN-L = "2475-1421", bibdate = "Sat Mar 11 09:08:36 MST 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/pacmpl.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1145/3563312", abstract = "This paper presents SigVM, the first blockchain virtual machine that extends EVM to support an event-driven execution model, enabling developers to build truly \ldots{}", acknowledgement = ack-nhfb, articleno = "149", fjournal = "Proceedings of the ACM on Programming Languages (PACMPL)", journal-URL = "https://dl.acm.org/loi/pacmpl", } @Article{Zhong:2022:MLB, author = "Zhiheng Zhong and Minxian Xu and Maria Alejandra Rodriguez and Chengzhong Xu and Rajkumar Buyya", title = "Machine Learning-based Orchestration of Containers: a Taxonomy and Future Directions", journal = j-COMP-SURV, volume = "54", number = "10s", pages = "217:1--217:??", month = jan, year = "2022", DOI = "https://doi.org/10.1145/3510415", bibdate = "Thu Mar 23 11:02:53 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/compsurv.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1145/3510415", abstract = "Containerization is a lightweight application virtualization technology, providing high environmental consistency, operating system distribution portability, and \ldots{}", acknowledgement = ack-nhfb, articleno = "217", fjournal = "ACM Computing Surveys", journal-URL = "https://dl.acm.org/loi/csur", } @Article{Zhou:2022:SRE, author = "Hang Zhou and Xinying Zhu and Jian Wang", title = "A Specific Risk Evaluation System for Live Virtual Machine Migration Based on the Uncertain Theory", journal = j-SCI-PROG, volume = "2022", number = "1", pages = "6784419:1--6784419:??", year = "2022", CODEN = "SCIPEV", DOI = "https://doi.org/10.1155/2021/6784419", ISSN = "1058-9244 (print), 1875-919X (electronic)", ISSN-L = "1058-9244", bibdate = "Mon Sep 2 14:36:34 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/sciprogram.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://onlinelibrary.wiley.com/doi/epdf/10.1155/2021/6784419", acknowledgement = ack-nhfb, ajournal = "Sci. Program.", fjournal = "Scientific Programming", journal-URL = "http://iospress.metapress.com/content/1058-9244", } @Article{Zolfaghari:2022:EAV, author = "Rahmat Zolfaghari and Amir Sahafi and Amir Masoud Rahmani and Reza Rezaei", title = "An energy-aware virtual machines consolidation method for cloud computing: {Simulation} and verification", journal = j-SPE, volume = "52", number = "1", pages = "194--235", month = jan, year = "2022", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/spe.3010", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Fri Jan 21 10:29:09 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "Softw. Pract. Exp.", fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", onlinedate = "28 June 2021", } @Article{Aghasi:2023:DAM, author = "Ali Aghasi and Kamal Jamshidi and Ali Bohlooli and Bahman Javadi", title = "A decentralized adaptation of model-free {Q}-learning for thermal-aware energy-efficient virtual machine placement in cloud data centers", journal = j-COMP-NET-AMSTERDAM, volume = "224", number = "??", pages = "??--??", month = apr, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1016/j.comnet.2023.109624", ISSN = "1389-1286 (print), 1872-7069 (electronic)", ISSN-L = "1389-1286", bibdate = "Tue Mar 7 10:53:03 MST 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1389128623000695", acknowledgement = ack-nhfb, articleno = "109624", fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)", journal-URL = "http://www.sciencedirect.com/science/journal/13891286/", } @Article{Ajmera:2023:SPS, author = "Kashav Ajmera and Tribhuwan Kumar Tewari", title = "{SR-PSO}: server residual efficiency-aware particle swarm optimization for dynamic virtual machine scheduling", journal = j-J-SUPERCOMPUTING, volume = "79", number = "14", pages = "15459--15495", month = sep, year = "2023", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-023-05270-8", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Tue Aug 15 06:21:43 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/jsuper2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://link.springer.com/article/10.1007/s11227-023-05270-8", acknowledgement = ack-nhfb, ajournal = "J. Supercomputing", fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Al-Hamid:2023:NSB, author = "Duaa Zuhair Al-Hamid and Pejman A. Karegar and and Peter Han Joo Chong", title = "A Novel {SDWSN}-Based Testbed for {IoT} Smart Applications", journal = j-FUTURE-INTERNET, volume = "15", number = "9", pages = "291", day = "28", month = aug, year = "2023", CODEN = "????", DOI = "https://doi.org/10.3390/fi15090291", ISSN = "1999-5903", bibdate = "Thu Sep 28 13:55:47 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/future-internet.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.mdpi.com/1999-5903/15/9/291", abstract = "Wireless sensor network (WSN) environment monitoring and smart city applications present challenges for maintaining network connectivity when, for example, dynamic events occur. Such applications can benefit from recent technologies such as software-defined networks (SDNs) and network virtualization to support network flexibility and offer validation for a physical network. This paper aims to present a testbed-based, software-defined wireless sensor network (SDWSN) for IoT applications with a focus on promoting the approach of virtual network testing and analysis prior to physical network implementation to monitor and repair any network failures. Herein, physical network implementation employing hardware boards such as Texas Instruments CC2538 (TI CC2538) and TI CC1352R sensor nodes is presented and designed based on virtual WSN- based clustering for stationary and dynamic networks use cases. The key performance indicators such as evaluating node (such as a gateway node to the Internet) connection capability based on packet drop and energy consumption virtually and physically are discussed. According to the test findings, the proposed software-defined physical network benefited from ``prior-to-implementation'' analysis via virtualization, as the performance of both virtual and physical networks is comparable.", acknowledgement = ack-nhfb, journal-URL = "https://www.mdpi.com/journal/futureinternet", } @Article{Ali:2023:ETN, author = "Shrouk A. Ali and Shaimaa Ahmed Elsaid and Abdelhamied A. Ateya and Mohammed ElAffendi and and Ahmed A. Abd El-Latif", title = "Enabling Technologies for Next-Generation Smart Cities: a Comprehensive Review and Research Directions", journal = j-FUTURE-INTERNET, volume = "15", number = "12", pages = "398", day = "09", month = dec, year = "2023", CODEN = "????", DOI = "https://doi.org/10.3390/fi15120398", ISSN = "1999-5903", bibdate = "Sat Dec 23 05:04:14 MST 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/future-internet.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.mdpi.com/1999-5903/15/12/398", abstract = "The concept of smart cities, which aim to enhance the quality of urban life through innovative technologies and policies, has gained significant momentum in recent years. As we approach the era of next-generation smart cities, it becomes crucial to explore the key enabling technologies that will shape their development. This work reviews the leading technologies driving the future of smart cities. The work begins by introducing the main requirements of different smart city applications; then, the enabling technologies are presented. This work highlights the transformative potential of the Internet of things (IoT) to facilitate data collection and analysis to improve urban infrastructure and services. As a complementary technology, distributed edge computing brings computational power closer to devices, reducing the reliance on centralized data centers. Another key technology is virtualization, which optimizes resource utilization, enabling multiple virtual environments to run efficiently on shared hardware. Software-defined networking (SDN) emerges as a pivotal technology that brings flexibility and scalability to smart city networks, allowing for dynamic network management and resource allocation. Artificial intelligence (AI) is another approach for managing smart cities by enabling predictive analytics, automation, and smart decision making based on vast amounts of data. Lastly, the blockchain is introduced as a promising approach for smart cities to achieve the required security. The review concludes by identifying potential research directions to address the challenges and complexities brought about by integrating these key enabling technologies.", acknowledgement = ack-nhfb, journal-URL = "https://www.mdpi.com/journal/futureinternet", } @Article{Baresi:2023:MFA, author = "Luciano Baresi and Tommaso Dolci and Giovanni Quattrocchi and Nicholas Rasi", title = "A multi-faceted analysis of the performance variability of virtual machines", journal = j-SPE, volume = "53", number = "11", pages = "2067--2091", month = nov, year = "2023", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/spe.3244", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Tue Jan 9 09:41:56 MST 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "Softw. Pract. Exp.", fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", onlinedate = "24 July 2023", } @Article{Belgacem:2023:MLM, author = "Ali Belgacem and Sa{\"\i}d Mahmoudi and Mohamed Amine Ferrag", title = "A machine learning model for improving virtual machine migration in cloud computing", journal = j-J-SUPERCOMPUTING, volume = "79", number = "9", pages = "9486--9508", month = jun, year = "2023", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-022-05031-z", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Tue Apr 25 07:11:47 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/jsuper2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://link.springer.com/article/10.1007/s11227-022-05031-z", acknowledgement = ack-nhfb, ajournal = "J. Supercomputing", fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Besseling:2023:UTT, author = "Johan Besseling and Cyrille Artho", title = "Using {Theia} Trace Viewer to Visualize {JPF} Traces", journal = j-SIGSOFT, volume = "48", number = "1", pages = "22--26", month = jan, year = "2023", CODEN = "SFENDP", DOI = "https://doi.org/10.1145/3573074.3573081", ISSN = "0163-5948 (print), 1943-5843 (electronic)", ISSN-L = "0163-5948", bibdate = "Mon Mar 25 12:02:24 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2020.bib; https://www.math.utah.edu/pub/tex/bib/sigsoft2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1145/3573074.3573081", abstract = "Java Pathfinder (JPF) is currently the most feature-rich platform for an in-depth analysis of programs that run on the Java Virtual Machine (JVM). However, using JPF and interpreting its results is a challenge. Dependencies on specific Java versions \ldots{}", acknowledgement = ack-nhfb, fjournal = "ACM SIGSOFT Software Engineering Notes", journal-URL = "https://dl.acm.org/loi/sigsoft", } @Article{Carrion:2023:KST, author = "Carmen Carri{\'o}n", title = "{Kubernetes} Scheduling: Taxonomy, Ongoing Issues and Challenges", journal = j-COMP-SURV, volume = "55", number = "7", pages = "138:1--138:??", month = jul, year = "2023", CODEN = "CMSVAN", DOI = "https://doi.org/10.1145/3539606", ISSN = "0360-0300 (print), 1557-7341 (electronic)", ISSN-L = "0360-0300", bibdate = "Thu Mar 23 11:17:15 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/compsurv.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1145/3539606", abstract = "Continuous integration enables the development of microservices-based applications using container virtualization technology. Container \ldots{}", acknowledgement = ack-nhfb, articleno = "138", fjournal = "ACM Computing Surveys", journal-URL = "https://dl.acm.org/loi/csur", } @Article{Cecilia:2023:URG, author = "Jos{\'e} M. Cecilia and Juan Morales-Garc{\'{\i}}a and Baldomero Imbern{\'o}n and Javier Prades and Juan-Carlos Cano and Federico Silla", title = "Using remote {GPU} virtualization techniques to enhance edge computing devices", journal = j-FUT-GEN-COMP-SYS, volume = "142", number = "??", pages = "14--24", month = may, year = "2023", CODEN = "FGSEVI", DOI = "https://doi.org/10.1016/j.future.2022.12.038", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Mon Mar 6 07:21:36 MST 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X22004423", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Chen:2023:PTA, author = "Rui Chen and Bo Liu and WeiWei Lin and JianPeng Lin and HuiWen Cheng and KeQin Li", title = "Power and thermal-aware virtual machine scheduling optimization in cloud data center", journal = j-FUT-GEN-COMP-SYS, volume = "145", number = "??", pages = "578--589", month = aug, year = "2023", CODEN = "FGSEVI", DOI = "https://doi.org/10.1016/j.future.2023.03.049", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Fri Apr 28 06:08:26 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X23001346", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Dangl:2023:VEF, author = "Thomas Dangl and Stewart Sentanoe and Hans P. Reiser", title = "{VMIFresh}: Efficient and fresh caches for virtual machine introspection", journal = j-COMPUT-SECUR, volume = "135", number = "??", pages = "??--??", month = dec, year = "2023", CODEN = "CPSEDU", DOI = "https://doi.org/10.1016/j.cose.2023.103527", ISSN = "0167-4048 (print), 1872-6208 (electronic)", ISSN-L = "0167-4048", bibdate = "Fri Nov 10 11:02:45 MST 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167404823004376", acknowledgement = ack-nhfb, articleno = "103527", fjournal = "Computers \& Security", journal-URL = "http://www.sciencedirect.com/science/journal/01674048", } @InProceedings{Doran:2023:EVR, author = "Michael A. Doran and Nabeeh Kandalaft", editor = "{IEEE}", booktitle = "{2023 IEEE 14th Annual Ubiquitous Computing, Electronics \& Mobile Communication Conference (UEMCON)}", title = "Embedded Virtualization on {RISC-V} with {seL4}", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "0736--0740", year = "2023", DOI = "https://doi.org/10.1109/UEMCON59035.2023.10316016", bibdate = "Sat Dec 16 15:51:40 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/risc-v.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, } @Article{Fan:2023:MOO, author = "Tian Fan and Wanwan Guo and Zhixia Zhang and Zhihua Cui", title = "A many-objective optimization based intelligent algorithm for virtual machine migration in mobile edge computing", journal = j-CCPE, volume = "35", number = "23", pages = "e7770:1--e7770:??", day = "25", month = oct, year = "2023", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.7770", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Wed Sep 27 08:16:53 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "Concurr. Comput.", fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", onlinedate = "07 May 2023", } @Article{Fan:2023:NEA, author = "Weibei Fan and Fu Xiao and Mengjie Lv and Lei Han and Junchang Wang and Xin He", title = "Node Essentiality Assessment and Distributed Collaborative Virtual Network Embedding in Datacenters", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "34", number = "4", pages = "1265--1280", month = apr, year = "2023", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2023.3242952", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Fri Mar 3 07:00:46 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Parallel and Distributed Systems", journal-URL = "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=71", } @Article{Fragiadakis:2023:AML, author = "George Fragiadakis and Evangelia Filiopoulou and Christos Michalakelis and Thomas Kamalakis and and Mara Nikolaidou", title = "Applying Machine Learning in Cloud Service Price Prediction: The Case of {Amazon IaaS}", journal = j-FUTURE-INTERNET, volume = "15", number = "8", pages = "277", day = "19", month = aug, year = "2023", CODEN = "????", DOI = "https://doi.org/10.3390/fi15080277", ISSN = "1999-5903", bibdate = "Sat Aug 26 11:22:50 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/future-internet.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.mdpi.com/1999-5903/15/8/277", abstract = "When exploring alternative cloud solution designs, it is important to also consider cost. Thus, having a comprehensive view of the cloud market and future price evolution allows well-informed decisions to choose between alternatives. Cloud providers offer various service types with different pricing policies. Currently, infrastructure-as-a-Service (IaaS) is considered the most mature cloud service, while reserved instances, where virtual machines are reserved for a fixed period of time, have the largest market share. In this work, we employ a machine-learning approach based on the CatBoost algorithm to explore a price-prediction model for the reserve instance market. The analysis is based on historical data provided by Amazon Web Services from 2016 to 2022. Early results demonstrate the machine-learning model's ability to capture the underlying evolution patterns and predict future trends. Findings suggest that prediction accuracy is not improved by integrating data from older time periods.", acknowledgement = ack-nhfb, journal-URL = "https://www.mdpi.com/journal/futureinternet", } @Article{Gudkov:2023:BRB, author = "Andrei Gudkov and Pavel Popov and Stepan Romanov", title = "{BalCon} --- resource balancing algorithm for {VM} consolidation", journal = j-FUT-GEN-COMP-SYS, volume = "147", number = "??", pages = "265--274", month = oct, year = "2023", CODEN = "FGSEVI", DOI = "https://doi.org/10.1016/j.future.2023.05.001", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Wed Jun 14 07:39:56 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X23001760", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Guo:2023:AAV, author = "Lifeng Guo and Changhong Lu and Guanlin Wu", title = "Approximation algorithms for a virtual machine allocation problem with finite types", journal = j-INFO-PROC-LETT, volume = "180", number = "??", pages = "Article 106339", month = feb, year = "2023", CODEN = "IFPLAT", DOI = "https://doi.org/10.1016/j.ipl.2022.106339", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Mon Dec 5 06:49:46 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0020019022000965", acknowledgement = ack-nhfb, fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", } @Article{Han:2023:SSV, author = "Juhyeng Han and Insu Yun and Seongmin Kim and Taesoo Kim and Sooel Son and Dongsu Han", title = "Scalable and Secure Virtualization of {HSM} With {ScaleTrust}", journal = j-IEEE-TRANS-NETWORKING, volume = "31", number = "4", pages = "1595--1610", year = "2023", CODEN = "IEANEP", DOI = "https://doi.org/10.1109/TNET.2022.3220427", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Fri Apr 12 07:06:41 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3220427", abstract = "Hardware security modules (HSMs) have been utilized as a trustworthy foundation for cloud services. Unfortunately, existing systems using HSMs fail to meet multi-tenant scalability arising from the emerging trends such as microservices, which utilize \ldots{}", acknowledgement = ack-nhfb, ajournal = "IEEE/ACM Trans. Netw.", fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "https://dl.acm.org/loi/ton", } @Article{He:2023:NFA, author = "Jiahao He and Shuangyin Li and Xinming Wang and Shing-Chi Cheung and Gansen Zhao and Jinji Yang", title = "{Neural-FEBI}: Accurate function identification in {Ethereum Virtual Machine} bytecode", journal = j-J-SYST-SOFTW, volume = "199", number = "??", pages = "??--??", month = may, year = "2023", CODEN = "JSSODM", DOI = "https://doi.org/10.1016/j.jss.2023.111627", ISSN = "0164-1212 (print), 1873-1228 (electronic)", ISSN-L = "0164-1212", bibdate = "Wed Apr 5 08:21:19 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib; https://www.math.utah.edu/pub/tex/bib/jsystsoftw2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0164121223000225", acknowledgement = ack-nhfb, articleno = "111627", fjournal = "Journal of Systems and Software", journal-URL = "http://www.sciencedirect.com/science/journal/01641212", } @Article{Hummaida:2023:HDA, author = "Abdul R. Hummaida and Norman W. Paton and Rizos Sakellariou", title = "A hierarchical decentralized architecture to enable adaptive scalable virtual machine migration", journal = j-CCPE, volume = "35", number = "2", pages = "e7487:1--e7487:??", day = "25", month = jan, year = "2023", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.7487", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Wed Mar 15 08:11:30 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "Concurr. Comput.", fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", onlinedate = "18 November 2022", } @Article{Ishiguro:2023:RVA, author = "Kenta Ishiguro and Naoki Yasuno and Pierre-Louis Aublin and Kenji Kono", title = "Revisiting {VM}-Agnostic {KVM} {vCPU} Scheduler for Mitigating Excessive {vCPU} Spinning", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "34", number = "10", pages = "2615--2628", month = oct, year = "2023", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2023.3297688", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Thu Sep 14 07:04:55 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "IEEE Trans. Parallel Distrib. Syst.", fjournal = "IEEE Transactions on Parallel and Distributed Systems", journal-URL = "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=71", } @Article{Jiang:2023:THR, author = "Zhe Jiang and Kecheng Yang and Yunfeng Ma and Nathan Fisher and Neil Audsley and Zheng Dong", title = "Towards Hard Real-Time and Energy-Efficient Virtualization for Many-Core Embedded Systems", journal = j-IEEE-TRANS-COMPUT, volume = "72", number = "1", pages = "111--126", month = jan, year = "2023", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.2022.3207115", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Mon Dec 19 08:41:53 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Computers", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", } @Article{Karthikeyan:2023:RNE, author = "K. Karthikeyan and R. Sunder and K. Shankar and S. K. Lakshmanaprabu and V. Vijayakumar and Mohamed Elhoseny and Gunasekaran Manogaran", title = "Retraction Note: Energy consumption analysis of Virtual Machine migration in cloud using hybrid swarm optimization {(ABC-BA)}", journal = j-J-SUPERCOMPUTING, volume = "79", number = "5", pages = "5832--5833", month = mar, year = "2023", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-022-04860-2", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Sat Feb 18 09:20:30 MST 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/jsuper2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "See \cite{Karthikeyan:2020:ECA}.", URL = "https://link.springer.com/article/10.1007/s11227-022-04860-2", acknowledgement = ack-nhfb, ajournal = "J. Supercomputing", fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Kennedy:2023:MTG, author = "Jason Kennedy and Vishal Sharma and Blesson Varghese and Carlos Rea{\~n}o", title = "Multi-Tier {GPU} Virtualization for Deep Learning in Cloud-Edge Systems", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "34", number = "7", pages = "2107--2123", month = jul, year = "2023", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2023.3274957", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Thu Jun 1 13:48:01 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Parallel and Distributed Systems", journal-URL = "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=71", } @Article{Li:2023:AAP, author = "Jinxi Li and Deke Guo and Junjie Xie and Sheng Chen", title = "Availability-aware Provision of Service Function Chains in Mobile Edge Computing", journal = j-TOSN, volume = "19", number = "3", pages = "57:1--57:??", month = aug, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3565483", ISSN = "1550-4859 (print), 1550-4867 (electronic)", ISSN-L = "1550-4859", bibdate = "Wed Aug 30 06:58:37 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosn.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1145/3565483", abstract = "With the advent of Network Function Virtualization (NFV) and Mobile Edge Computing (MEC), outsourcing network functions (NFs) to the MEC is becoming popular among \ldots{}", acknowledgement = ack-nhfb, ajournal = "", articleno = "57", fjournal = "ACM Transactions on Sensor Networks (TOSN)", journal-URL = "https://dl.acm.org/loi/tosn", } @Article{Li:2023:IDP, author = "Na Li and XiaoLing Liu and Yu Wang and Musa Mojarad", title = "Improving Dynamic Placement of Virtual Machines in Cloud Data Centers Based on Open-Source Development Model Algorithm", journal = j-J-GRID-COMP, volume = "21", number = "1", pages = "??--??", month = mar, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1007/s10723-023-09651-4", ISSN = "1570-7873 (print), 1572-9184 (electronic)", ISSN-L = "1570-7873", bibdate = "Fri Mar 17 09:41:50 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/gnu.bib; https://www.math.utah.edu/pub/tex/bib/jgridcomp.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://link.springer.com/article/10.1007/s10723-023-09651-4", acknowledgement = ack-nhfb, ajournal = "J. Grid Comp.", articleno = "13", fjournal = "Journal of Grid Computing", journal-URL = "http://link.springer.com/journal/10723", } @Article{Lin:2023:PIV, author = "Weiwei Lin and Chennian Xiong and Wentai Wu and Fang Shi and Keqin Li and Minxian Xu", title = "Performance Interference of Virtual Machines: a Survey", journal = j-COMP-SURV, volume = "55", number = "12", pages = "254:1--254:??", month = dec, year = "2023", CODEN = "CMSVAN", DOI = "https://doi.org/10.1145/3573009", ISSN = "0360-0300 (print), 1557-7341 (electronic)", ISSN-L = "0360-0300", bibdate = "Wed Mar 29 06:37:13 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/compsurv.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1145/3573009", abstract = "The rapid development of cloud computing with virtualization technology has benefited both academia and industry. For any cloud data center at scale, one of the \ldots{}", acknowledgement = ack-nhfb, articleno = "254", fjournal = "ACM Computing Surveys", journal-URL = "https://dl.acm.org/loi/csur", } @Article{Lin:2023:SBO, author = "Xu Lin and Deke Guo and Yulong Shen and Guoming Tang and Bangbang Ren and Ming Xu", title = "{SFT-Box}: an Online Approach for Minimizing the Embedding Cost of Multiple Hybrid {SFCs}", journal = j-IEEE-TRANS-NETWORKING, volume = "31", number = "4", pages = "1463--1477", year = "2023", CODEN = "IEANEP", DOI = "https://doi.org/10.1109/TNET.2022.3221868", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Fri Apr 12 07:06:41 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3221868", abstract = "In Network Function Virtualization (NFV), a series of Virtual Network Functions (VNFs) organized in a specific order (called Service Function Chain, SFC) could offer an end-to-end network service for a network flow. Recently, with the new results of the \ldots{}", acknowledgement = ack-nhfb, ajournal = "IEEE/ACM Trans. Netw.", fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "https://dl.acm.org/loi/ton", } @Article{Liu:2023:PCT, author = "Bo Liu and Rui Chen and Weiwei Lin and Wentai Wu and Jianpeng Lin and Keqin Li", title = "Publisher Correction to: {Thermal}-aware virtual machine placement based on multi-objective optimization", journal = j-J-SUPERCOMPUTING, volume = "79", number = "15", pages = "17756--17757", month = oct, year = "2023", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-023-05345-6", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Fri Sep 1 07:21:16 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/jsuper2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "See \cite{Liu:2023:TAV}.", URL = "https://link.springer.com/article/10.1007/s11227-023-05345-6", acknowledgement = ack-nhfb, ajournal = "J. Supercomputing", fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Liu:2023:TAV, author = "Bo Liu and Rui Chen and Weiwei Lin and Wentai Wu and Jianpeng Lin and Keqin Li", title = "Thermal-aware virtual machine placement based on multi-objective optimization", journal = j-J-SUPERCOMPUTING, volume = "79", number = "11", pages = "12563--12590", month = jul, year = "2023", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-023-05136-z", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Sat Jun 10 08:11:52 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/jsuper2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "See publisher correction \cite{Liu:2023:PCT}.", URL = "https://link.springer.com/article/10.1007/s11227-023-05136-z", acknowledgement = ack-nhfb, ajournal = "J. Supercomputing", fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Liu:2023:VSL, author = "Zongyuan Liu and Sergei Stepanenko and Jean Pichon-Pharabod and Amin Timany and Aslan Askarov and Lars Birkedal", title = "{VMSL}: a Separation Logic for Mechanised Robust Safety of Virtual Machines Communicating above {FF-A}", journal = j-PACMPL, volume = "7", number = "PLDI", pages = "165:1--165:??", month = jun, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3591279", ISSN = "2475-1421 (electronic)", ISSN-L = "2475-1421", bibdate = "Fri May 10 10:23:34 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/pacmpl.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1145/3591279", abstract = "Thin hypervisors make it possible to isolate key security components like keychains, fingerprint readers, and digital wallets from the \ldots{}", acknowledgement = ack-nhfb, ajournal = "Proc. ACM Program. Lang.", articleno = "165", fjournal = "Proceedings of the ACM on Programming Languages (PACMPL)", journal-URL = "https://dl.acm.org/loi/pacmpl", } @Article{Lu:2023:EET, author = "Baoshan Lu and Junli Fang and Xuemin Hong and Jianghong Shi", title = "Energy-efficient task scheduling for mobile edge computing with virtual machine {I/O} interference", journal = j-FUT-GEN-COMP-SYS, volume = "148", number = "??", pages = "538--549", month = nov, year = "2023", CODEN = "FGSEVI", DOI = "https://doi.org/10.1016/j.future.2023.06.020", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Wed Sep 13 17:21:29 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X23002431", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Luo:2023:KSA, author = "Jiang-Yao Luo and Jian-Hua Yuan", title = "A kernel search algorithm for virtual machine consolidation problem in cloud computing", journal = j-J-SUPERCOMPUTING, volume = "79", number = "17", pages = "19277--19296", month = nov, year = "2023", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-023-05406-w", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Tue Oct 3 05:58:52 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/jsuper2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://link.springer.com/article/10.1007/s11227-023-05406-w", acknowledgement = ack-nhfb, ajournal = "J. Supercomputing", fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Madireddy:2023:DVM, author = "Amarendhar Reddy Madireddy and Kongara Ravindranath", title = "Dynamic virtual machine relocation system for energy-efficient resource management in the cloud", journal = j-CCPE, volume = "35", number = "3", pages = "e7520:1--e7520:??", day = "1", month = feb, year = "2023", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.7520", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Wed Mar 15 08:11:32 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "Concurr. Comput.", fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", onlinedate = "24 November 2022", } @Article{Mavridis:2023:OSC, author = "Ilias Mavridis and Helen Karatza", title = "Orchestrated sandboxed containers, unikernels, and virtual machines for isolation-enhanced multitenant workloads and serverless computing in cloud", journal = j-CCPE, volume = "35", number = "11", pages = "e6365:1--e6365:??", day = "15", month = may, year = "2023", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.6365", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Wed Sep 27 08:16:41 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "Concurr. Comput.", fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", onlinedate = "24 May 2021", } @Article{Nguyen:2023:TNQ, author = "Thien Nguyen and Dmitry Lyakh and Eugene Dumitrescu and David Clark and Jeff Larkin and Alexander McCaskey", title = "Tensor Network Quantum Virtual Machine for Simulating Quantum Circuits at Exascale", journal = j-TQC, volume = "4", number = "1", pages = "6:1--6:??", month = mar, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3547334", ISSN = "2643-6809 (print), 2643-6817 (electronic)", ISSN-L = "2643-6809", bibdate = "Sat Mar 11 09:17:52 MST 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tqc.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1145/3547334", abstract = "The numerical simulation of quantum circuits is an indispensable tool for development, verification, and validation of hybrid quantum-classical algorithms intended for near-term quantum co-processors. The emergence of exascale high-performance computing \ldots{}", acknowledgement = ack-nhfb, articleno = "6", fjournal = "ACM Transactions on Quantum Computing (TQC)", journal-URL = "https://dl.acm.org/loi/tqc", } @Article{Parra:2023:TMV, author = "Pablo Parra and Antonio {Da Silva} and Borja Losa and J. Ignacio Garc{\'\i}a and {\'O}scar R. Polo and Agust{\'\i}n Mart{\'\i}nez and Sebasti{\'a}n S{\'a}nchez", title = "Tailor-made Virtualization Monitor Design for {CPU} Virtualization on {LEON} Processors", journal = j-TECS, volume = "22", number = "4", pages = "60:1--60:??", month = jul, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3584702", ISSN = "1539-9087 (print), 1558-3465 (electronic)", ISSN-L = "1539-9087", bibdate = "Thu Aug 10 07:21:24 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tecs.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1145/3584702", abstract = "In recent decades, mixed-criticality systems have been widely adopted to reduce the complexity and development times of real-time critical applications. In these systems, applications run on a separation kernel hypervisor, a software element that controls \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Embed. Comput. Syst.", articleno = "60", fjournal = "ACM Transactions on Embedded Computing Systems", journal-URL = "https://dl.acm.org/loi/tecs", } @Article{Peng:2023:FPS, author = "Bo Peng and Yaozu Dong and Jianguo Yao and Fengguang Wu and Haibing Guan", title = "{FlexHM}: a Practical System for Heterogeneous Memory with Flexible and Efficient Performance Optimizations", journal = j-TACO, volume = "20", number = "1", pages = "13:1--13:??", month = mar, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3565885", ISSN = "1544-3566 (print), 1544-3973 (electronic)", ISSN-L = "1544-3566", bibdate = "Fri Feb 17 06:54:21 MST 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/taco.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1145/3565885", abstract = "With the rapid development of cloud computing, numerous cloud services, containers, and virtual machines have been bringing tremendous demands on high-performance memory resources to modern data centers. Heterogeneous memory, especially the newly released \ldots{}", acknowledgement = ack-nhfb, articleno = "13", fjournal = "ACM Transactions on Architecture and Code Optimization (TACO)", journal-URL = "https://dl.acm.org/loi/taco", } @Article{Perez:2023:AVB, author = "Alberto Garc{\'\i}a P{\'e}rez and Antonio L{\'o}pez Mart{\'\i}nez and Manuel Gil P{\'e}rez", title = "Adaptive vulnerability-based risk identification software with virtualization functions for dynamic management", journal = j-J-NETW-COMPUT-APPL, volume = "219", number = "??", pages = "??--??", month = oct, year = "2023", CODEN = "JNCAF3", DOI = "https://doi.org/10.1016/j.jnca.2023.103728", ISSN = "1084-8045 (print), 1095-8592 (electronic)", ISSN-L = "1084-8045", bibdate = "Tue Sep 26 11:40:42 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1084804523001479", acknowledgement = ack-nhfb, articleno = "103728", fjournal = "Journal of Network and Computer Applications", journal-URL = "http://www.sciencedirect.com/science/journal/10848045", } @Article{Picano:2023:CAF, author = "Benedetta Picano and Romano Fantacci", title = "A Channel-aware {FL} Approach for Virtual Machine Placement in {6G} Edge Intelligent Ecosystems", journal = j-TIOT, volume = "4", number = "2", pages = "12:1--12:??", month = may, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3584705", ISSN = "2691-1914 (print), 2577-6207 (electronic)", ISSN-L = "2691-1914", bibdate = "Mon Jul 3 08:54:47 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/tiot.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1145/3584705", abstract = "This article deals with an artificial intelligence (AI) framework to support Internet-of-everything (IoE) applications over sixth-generation wireless (6G) networks. An integrated IoE-Edge Intelligence ecosystem is designed to effectively face the problems \ldots{}", acknowledgement = ack-nhfb, ajournal = "", articleno = "12", fjournal = "ACM Transactions on Internet of Things (TIOT)", journal-URL = "https://dl.acm.org/loi/tiot", } @Article{Pushpa:2023:FAB, author = "Ramaiah Pushpa and Maadappa Siddappa", title = "Fractional Artificial Bee Chicken Swarm Optimization technique for {QoS} aware virtual machine placement in cloud", journal = j-CCPE, volume = "35", number = "4", pages = "e7532:1--e7532:??", day = "15", month = feb, year = "2023", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.7532", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Wed Mar 15 08:11:32 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "Concurr. Comput.", fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", onlinedate = "10 December 2022", } @Article{Qiu:2023:VNF, author = "Rixuan Qiu and Jiawen Bao and Yuancheng Li and Xin Zhou and Liang Liang and Hui Tian and Yanting Zeng and Jie Shi", title = "Virtual network function deployment algorithm based on graph convolution deep reinforcement learning", journal = j-J-SUPERCOMPUTING, volume = "79", number = "6", pages = "6849--6870", month = apr, year = "2023", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-022-04947-w", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Fri Mar 3 08:24:55 MST 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/jsuper2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://link.springer.com/article/10.1007/s11227-022-04947-w", acknowledgement = ack-nhfb, ajournal = "J. Supercomputing", fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Ridolfi:2023:IEF, author = "Lorenzo Ridolfi and David Naseh and Swapnil Sadashiv Shinde and and Daniele Tarchi", title = "Implementation and Evaluation of a Federated Learning Framework on Raspberry {PI} Platforms for {IoT} {6G} Applications", journal = j-FUTURE-INTERNET, volume = "15", number = "11", pages = "358", day = "31", month = oct, year = "2023", CODEN = "????", DOI = "https://doi.org/10.3390/fi15110358", ISSN = "1999-5903", bibdate = "Sat Dec 23 05:04:14 MST 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/future-internet.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.mdpi.com/1999-5903/15/11/358", abstract = "With the advent of 6G technology, the proliferation of interconnected devices necessitates a robust, fully connected intelligence network. Federated Learning (FL) stands as a key distributed learning technique, showing promise in recent advancements. However, the integration of novel Internet of Things (IoT) applications and virtualization technologies has introduced diverse and heterogeneous devices into wireless networks. This diversity encompasses variations in computation, communication, storage resources, training data, and communication modes among connected nodes. In this context, our study presents a pivotal contribution by analyzing and implementing FL processes tailored for 6G standards. Our work defines a practical FL platform, employing Raspberry Pi devices and virtual machines as client nodes, with a Windows PC serving as a parameter server. We tackle the image classification challenge, implementing the FL model via PyTorch, augmented by the specialized FL library, Flower. Notably, our analysis delves into the impact of computational resources, data availability, and heating issues across heterogeneous device sets. Additionally, we address knowledge transfer and employ pre-trained networks in our FL performance evaluation. This research underscores the indispensable role of artificial intelligence in IoT scenarios within the 6G landscape, providing a comprehensive framework for FL implementation across diverse and heterogeneous devices.", acknowledgement = ack-nhfb, journal-URL = "https://www.mdpi.com/journal/futureinternet", } @Article{Sa:2023:CRV, author = "Bruno S{\'a} and Luca Valente and Jos{\'e} Martins and Davide Rossi and Luca Benini and Sandro Pinto", title = "{CVA6 RISC-V} Virtualization: Architecture, Microarchitecture, and Design Space Exploration", journal = j-IEEE-TRANS-VLSI-SYST, volume = "31", number = "11", pages = "1713--1726", year = "2023", CODEN = "IEVSE9", DOI = "https://doi.org/10.1109/TVLSI.2023.3302837", ISSN = "1063-8210 (print), 1557-9999 (electronic)", ISSN-L = "1063-8210", bibdate = "Sat Dec 16 15:51:40 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/risc-v.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Very Large Scale Integration (VLSI) Systems", journal-URL = "https://ieeexplore.ieee.org/xpl/issues?punumber=92", } @Article{Sahni:2023:AAS, author = "Abdul Rasheed Sahni and Hamza Omar and Usman Ali and Omer Khan", title = "{ASM}: an Adaptive Secure Multicore for Co-located Mutually Distrusting Processes", journal = j-TACO, volume = "20", number = "3", pages = "32:1--32:??", month = sep, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3587480", ISSN = "1544-3566 (print), 1544-3973 (electronic)", ISSN-L = "1544-3566", bibdate = "Thu Aug 10 07:14:56 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/taco.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1145/3587480", abstract = "With the ever-increasing virtualization of software and hardware, the privacy of user-sensitive data is a fundamental concern in computation outsourcing. Secure processors enable a trusted execution environment to guarantee security properties based on \ldots{}", acknowledgement = ack-nhfb, ajournal = "", articleno = "32", fjournal = "ACM Transactions on Architecture and Code Optimization (TACO)", journal-URL = "https://dl.acm.org/loi/taco", } @Article{Saravanakumar:2023:ETV, author = "C. Saravanakumar and M. Geetha and S. Manoj Kumar and S. Manikandan and C. Arun and K. Srivatsan", title = "An Efficient Technique for Virtual Machine Clustering and Communications Using Task-Based Scheduling in Cloud Computing", journal = j-SCI-PROG, volume = "2023", number = "1", pages = "5586521:1--5586521:??", year = "2023", CODEN = "SCIPEV", DOI = "https://doi.org/10.1155/2021/5586521", ISSN = "1058-9244 (print), 1875-919X (electronic)", ISSN-L = "1058-9244", bibdate = "Mon Sep 2 14:36:34 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/sciprogram.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://onlinelibrary.wiley.com/doi/epdf/10.1155/2021/5586521", acknowledgement = ack-nhfb, ajournal = "Sci. Program.", fjournal = "Scientific Programming", journal-URL = "http://iospress.metapress.com/content/1058-9244", } @Article{Serodio:2023:ESI, author = "Carlos Ser{\^o}dio and Jos{\'e} Cunha and Guillermo Candela and Santiago Rodriguez and Xos{\'e} Ram{\'o}n Sousa and and Frederico Branco", title = "The {6G} Ecosystem as Support for {IoE} and Private Networks: Vision, Requirements, and Challenges", journal = j-FUTURE-INTERNET, volume = "15", number = "11", pages = "348", day = "25", month = oct, year = "2023", CODEN = "????", DOI = "https://doi.org/10.3390/fi15110348", ISSN = "1999-5903", bibdate = "Sat Dec 23 05:04:14 MST 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/future-internet.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.mdpi.com/1999-5903/15/11/348", abstract = "The emergence of the sixth generation of cellular systems (6G) signals a transformative era and ecosystem for mobile communications, driven by demands from technologies like the internet of everything (IoE), V2X communications, and factory automation. To support this connectivity, mission-critical applications are emerging with challenging network requirements. The primary goals of 6G include providing sophisticated and high-quality services, extremely reliable and further-enhanced mobile broadband (feMBB), low-latency communication (ERLLC), long-distance and high-mobility communications (LDHMC), ultra-massive machine-type communications (umMTC), extremely low-power communications (ELPC), holographic communications, and quality of experience (QoE), grounded in incorporating massive broad-bandwidth machine-type (mBBMT), mobile broad-bandwidth and low-latency (MBBLL), and massive low-latency machine-type (mLLMT) communications. In attaining its objectives, 6G faces challenges that demand inventive solutions, incorporating AI, softwarization, cloudification, virtualization, and slicing features. Technologies like network function virtualization (NFV), network slicing, and software-defined networking (SDN) play pivotal roles in this integration, which facilitates efficient resource utilization, responsive service provisioning, expanded coverage, enhanced network reliability, increased capacity, densification, heightened availability, safety, security, and reduced energy consumption. It presents innovative network infrastructure concepts, such as resource-as-a-service (RaaS) and infrastructure-as-a-service (IaaS), featuring management and service orchestration mechanisms. This includes nomadic networks, AI-aware networking strategies, and dynamic management of diverse network resources. This paper provides an in-depth survey of the wireless evolution leading to 6G networks, addressing future issues and challenges associated with 6G technology to support V2X environments considering presenting + challenges in architecture, spectrum, air interface, reliability, availability, density, flexibility, mobility, and security.", acknowledgement = ack-nhfb, journal-URL = "https://www.mdpi.com/journal/futureinternet", } @Article{Sharma:2023:CSD, author = "Sachin Sharma and Avishek Nag", title = "Cognitive Software Defined Networking and Network Function Virtualization and Applications", journal = j-FUTURE-INTERNET, volume = "15", number = "2", pages = "78", day = "17", month = feb, year = "2023", CODEN = "????", DOI = "https://doi.org/10.3390/fi15020078", ISSN = "1999-5903", bibdate = "Mon Feb 27 09:26:59 MST 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/future-internet.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.mdpi.com/1999-5903/15/2/78", abstract = "The emergence of Software-Defined Networking (SDN) and Network Function Virtualization (NFV) has revolutionized the Internet. Using SDN, network devices can be controlled from a centralized, programmable control plane that is decoupled from their data plane, whereas with NFV, network functions (such as network address translation, firewall, and intrusion detection) can be virtualized instead of being implemented on proprietary hardware. In addition, Artificial Intelligence (AI) and Machine Learning (ML) techniques will be key to automating network operations and enhancing customer service. Many of the challenges behind SDN and NFV are currently being investigated in several projects all over the world using AI and ML techniques, such as AI- and software-based networking, autonomic networking, and policy-based network management. Contributions to this Special Issue come from the above areas of research. Following a rigorous review process, four excellent articles were accepted that address and go beyond many of the challenges mentioned above.", acknowledgement = ack-nhfb, journal-URL = "https://www.mdpi.com/journal/futureinternet", } @Article{Sheeba:2023:EFT, author = "Adlin Sheeba and B. Uma Maheswari", title = "An efficient fault tolerance scheme based enhanced firefly optimization for virtual machine placement in cloud computing", journal = j-CCPE, volume = "35", number = "7", pages = "e7610:1--e7610:??", day = "25", month = mar, year = "2023", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.7610", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Wed Mar 15 08:11:34 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "Concurr. Comput.", fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", onlinedate = "17 January 2023", } @Article{Siavashi:2023:GMO, author = "Ahmad Siavashi and Mahmoud Momtazpour", title = "{gVMP}: a multi-objective joint {VM} and {vGPU} placement heuristic for {API} remoting-based {GPU} virtualization and disaggregation in cloud data centers", journal = j-J-PAR-DIST-COMP, volume = "172", number = "??", pages = "97--113", month = feb, year = "2023", CODEN = "JPDCER", DOI = "https://doi.org/10.1016/j.jpdc.2022.10.008", ISSN = "0743-7315 (print), 1096-0848 (electronic)", ISSN-L = "0743-7315", bibdate = "Wed Dec 21 08:24:25 MST 2022", bibsource = "https://www.math.utah.edu/pub/tex/bib/jpardistcomp2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0743731522002234", acknowledgement = ack-nhfb, fjournal = "Journal of Parallel and Distributed Computing", journal-URL = "http://www.sciencedirect.com/science/journal/07437315", } @Article{St-Onge:2023:NMR, author = "C{\'e}dric St-Onge and Nadjia Kara and Claes Edstrom", title = "\pkg{NFVLearn}: a multi-resource, long short-term memory-based virtual network function resource usage prediction architecture", journal = j-SPE, volume = "53", number = "3", pages = "555--578", month = mar, year = "2023", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/spe.3160", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Tue Feb 28 12:16:37 MST 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "Softw. Pract. Exp.", fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", onlinedate = "02 November 2022", } @Article{Sun:2023:SID, author = "Jie Sun and Tianyu Wo and Xudong Liu and Tianjiao Ma and Xudong Mou and Jinghong Lan and Nan Zhang and Jianwei Niu", title = "Scalable inter-domain network virtualization", journal = j-J-NETW-COMPUT-APPL, volume = "218", number = "??", pages = "??--??", month = sep, year = "2023", CODEN = "JNCAF3", DOI = "https://doi.org/10.1016/j.jnca.2023.103701", ISSN = "1084-8045 (print), 1095-8592 (electronic)", ISSN-L = "1084-8045", bibdate = "Mon Sep 18 08:38:57 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1084804523001200", acknowledgement = ack-nhfb, articleno = "103701", fjournal = "Journal of Network and Computer Applications", journal-URL = "http://www.sciencedirect.com/science/journal/10848045", } @Article{Sunil:2023:EEV, author = "Shilpa Sunil and Sanjeev Patel", title = "Energy-efficient virtual machine placement algorithm based on power usage", journal = j-COMPUTING, volume = "105", number = "7", pages = "1597--1621", month = jul, year = "2023", CODEN = "CMPTA2", DOI = "https://doi.org/10.1007/s00607-023-01152-2", ISSN = "0010-485X (print), 1436-5057 (electronic)", ISSN-L = "0010-485X", bibdate = "Thu Aug 29 07:24:18 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/computing.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://link.springer.com/article/10.1007/s00607-023-01152-2", acknowledgement = ack-nhfb, ajournal = "Computing", fjournal = "Computing", journal-URL = "http://link.springer.com/journal/607", } @Article{Tapwal:2023:SBV, author = "Riya Tapwal and Pallav Kumar Deb and Sudip Misra and Surjya Kanta Pal", title = "Shadows: Blockchain Virtualization for Interoperable Computations in {IIoT} Environments", journal = j-IEEE-TRANS-COMPUT, volume = "72", number = "3", pages = "868--879", month = mar, year = "2023", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.2022.3184271", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Sat Feb 18 16:18:34 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib; https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Computers", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", } @Article{Tournaire:2023:ECO, author = "Thomas Tournaire and Hind Castel-Taleb and Emmanuel Hyon", title = "Efficient Computation of Optimal Thresholds in Cloud Auto-scaling Systems", journal = j-TOMPECS, volume = "8", number = "4", pages = "9:1--9:??", month = dec, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1145/3603532", ISSN = "2376-3639 (print), 2376-3647 (electronic)", ISSN-L = "2376-3639", bibdate = "Tue Apr 30 13:20:44 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tompecs.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1145/3603532", abstract = "We consider a horizontal and dynamic auto-scaling technique in a cloud system where virtual machines hosted on a physical node are turned on and off to minimise energy consumption while meeting performance requirements. Finding cloud management policies \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Model. Perform. Eval. Comput. Syst.", articleno = "9", fjournal = "ACM Transactions on Modeling and Performance Evaluation of Computing Systems (TOMPECS)", journal-URL = "https://dl.acm.org/loi/tompecs", } @Article{Troia:2023:PCP, author = "Sebastian Troia and Marco Savi and Giulia Nava and Ligia Maria Moreira Zorello and Thomas Schneider and Guido Maier", title = "Performance characterization and profiling of chained {CPU}-bound {Virtual Network Functions}", journal = j-COMP-NET-AMSTERDAM, volume = "231", number = "??", pages = "??--??", month = jul, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1016/j.comnet.2023.109815", ISSN = "1389-1286 (print), 1872-7069 (electronic)", ISSN-L = "1389-1286", bibdate = "Mon Jun 5 13:55:52 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1389128623002608", acknowledgement = ack-nhfb, articleno = "109815", fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)", journal-URL = "http://www.sciencedirect.com/science/journal/13891286/", } @Article{Valsamas:2023:VTB, author = "Polychronis Valsamas and Sotiris Skaperas and Lefteris Mamatas and Luis M. Contreras", title = "{Virtualization Technology Blending} for resource-efficient edge clouds", journal = j-COMP-NET-AMSTERDAM, volume = "225", number = "??", pages = "??--??", month = apr, year = "2023", CODEN = "????", DOI = "https://doi.org/10.1016/j.comnet.2023.109646", ISSN = "1389-1286 (print), 1872-7069 (electronic)", ISSN-L = "1389-1286", bibdate = "Wed Mar 15 16:17:10 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1389128623000919", acknowledgement = ack-nhfb, articleno = "109646", fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)", journal-URL = "http://www.sciencedirect.com/science/journal/13891286/", } @Article{Vila:2023:CCV, author = "Sergi Vila and Fernando Guirado and Josep L. L{\'e}rida", title = "Cloud computing virtual machine consolidation based on stock trading forecast techniques", journal = j-FUT-GEN-COMP-SYS, volume = "145", number = "??", pages = "321--336", month = aug, year = "2023", CODEN = "FGSEVI", DOI = "https://doi.org/10.1016/j.future.2023.03.018", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Fri Apr 28 06:08:26 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X23000961", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Wu:2023:LPC, author = "Hao Wu and Yuqi Chen and Chi Zhang and Jiangchao Dong and Yuxin Wang", title = "Loads prediction and consolidation of virtual machines in cloud", journal = j-CCPE, volume = "35", number = "23", pages = "e7760:1--e7760:??", day = "25", month = oct, year = "2023", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.7760", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Wed Sep 27 08:16:53 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "Concurr. Comput.", fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", onlinedate = "25 April 2023", } @Article{Wu:2023:PTL, author = "Qiang Wu and Xiangping Bryce Zhai and Xi Liu and Chun-Ming Wu and Fangliang Lou and Hongke Zhang", title = "Performance Tuning via Lean Measurements for Acceleration of Network Functions Virtualization", journal = j-IEEE-TRANS-NETWORKING, volume = "31", number = "1", pages = "366--379", year = "2023", CODEN = "IEANEP", DOI = "https://doi.org/10.1109/TNET.2022.3193686", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Wed May 17 13:15:15 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1109/TNET.2022.3193686", abstract = "Network Functions Virtualization (NFV) replaces the specialized hardware with the software-based forwarding to promise the flexibility, scalability and automation benefits. With an increasing range of applications, NFV must ultimately forward packets at \ldots{}", acknowledgement = ack-nhfb, fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "https://dl.acm.org/loi/ton", } @Article{Xevgenis:2023:AZS, author = "Michael Xevgenis and Dimitrios G. Kogias and Panagiotis A. Karkazis and Helen C. Leligou", title = "Addressing {ZSM} Security Issues with Blockchain Technology", journal = j-FUTURE-INTERNET, volume = "15", number = "4", pages = "129", day = "28", month = mar, year = "2023", CODEN = "????", DOI = "https://doi.org/10.3390/fi15040129", ISSN = "1999-5903", bibdate = "Fri Apr 28 07:04:49 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib; https://www.math.utah.edu/pub/tex/bib/future-internet.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.mdpi.com/1999-5903/15/4/129", abstract = "Undoubtedly, we are witnessing a new era of computer networks that aspire to support modern demanding applications by providing the highest Quality of Experience (QoE) to the end user. Next Generations Networks (NGNs) ensure that characteristics such as ultra-low latency, high availability and wide service coverage can be met across the network regardless of the network infrastructure ownership. To accomplish that, beyond the necessary improvements in the radio propagation field, changes have been made in the core network functions which are now characterized as programmable, and software defined. Software Defined Networks (SDNs) and Network Function Virtualization (NFV) are the keystones of the NGNs flexibility. The high expectations of NGNs' performance and the continuous changes in the network conditions lead to the development of new network management frameworks that add elasticity and dynamicity and minimize human intervention. ETSI (the European Standards Organization) presents the Zero-touch Service Management (ZSM) framework that uses hyped technologies such as Artificial Intelligence (AI) and Machine Learning (ML) to achieve full end-to-end automation of the network services' management across one or many different domains. Focusing on multi-domain network service management, there are several security issues identified by the standardization team which mostly derive from the lack of trust among network providers. In the present research, we explore the suitability of blockchain technology adoption for facing these security issues. Blockchain technology inherently addresses security in trustless environments such as the infrastructures defined by the ZSM team. Our contribution is three-fold: (a) we define the architecture of a multi-domain network infrastructure that adopts the ZSM approach and integrates blockchain functionality, (b) we explore the adoption of different blockchain and distributed ledger technologies (DLT) approaches to address ZSM security needs and (c) we provide guidelines to prospective solution designers\slash implementors on the detailed requirements that this solution has to meet to maximize the offered value.", acknowledgement = ack-nhfb, journal-URL = "https://www.mdpi.com/journal/futureinternet", } @Article{Xu:2023:FTQ, author = "Heyang Xu and Sen Xu and Wei Wei and Naixuan Guo", title = "Fault tolerance and quality of service aware virtual machine scheduling algorithm in cloud data centers", journal = j-J-SUPERCOMPUTING, volume = "79", number = "3", pages = "2603--2625", month = feb, year = "2023", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-022-04760-5", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Sat Feb 18 09:20:28 MST 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/jsuper2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://link.springer.com/article/10.1007/s11227-022-04760-5", acknowledgement = ack-nhfb, ajournal = "J. Supercomputing", fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Yang:2023:HIH, author = "Xingyuan Yang and Jie Yuan and Hao Yang and Ya Kong and Hao Zhang and Jinyu Zhao", title = "A Highly Interactive Honeypot-Based Approach to Network Threat Management", journal = j-FUTURE-INTERNET, volume = "15", number = "4", pages = "127", day = "28", month = mar, year = "2023", CODEN = "????", DOI = "https://doi.org/10.3390/fi15040127", ISSN = "1999-5903", bibdate = "Fri Apr 28 07:04:49 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/future-internet.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.mdpi.com/1999-5903/15/4/127", abstract = "In this paper, considering the problem that the common defensive means in the current cyber confrontation often fall into disadvantage, honeypot technology is adopted to turn reactive into proactive to deal with the increasingly serious cyberspace security problem. We address the issue of common defensive measures in current cyber confrontations that frequently lead to disadvantages. To tackle the progressively severe cyberspace security problem, we propose the adoption of honeypot technology to shift from a reactive to a proactive approach. This system uses honeypot technology for active defense, tempting attackers into a predetermined sandbox to observe the attacker's behavior and attack methods to better protect equipment and information security. During the research, it was found that due to the singularity of traditional honeypots and the limitations of low-interactivity honeypots, the application of honeypot technology has difficulty in achieving the desired protective effect. Therefore, the system adopts a highly interactive honeypot and a modular design idea to distinguish the honeypot environment from the central node of data processing, so that the honeypot can obtain more sufficient information and the honeypot technology can be used more easily. By managing honeypots at the central node, i.e., adding, deleting, and modifying honeypots and other operations, it is easy to maintain and upgrade the system, while reducing the difficulty of using honeypots. The high-interactivity honeypot technology not only attracts attackers into pre-set sandboxes to observe their behavior and attack methods, but also performs a variety of advanced functions, such as network threat analysis, virtualization, vulnerability perception, tracing reinforcement, and camouflage detection. We have conducted a large number of experimental comparisons and proven that our method has significant advantages compared to traditional honeypot technology and provides detailed data support. Our research provides new ideas and effective methods for network security protection.", acknowledgement = ack-nhfb, journal-URL = "https://www.mdpi.com/journal/futureinternet", } @Article{Yao:2023:EEL, author = "Wenbin Yao and Zhuqing Wang and Yingying Hou and Xikang Zhu and Xiaoyong Li and Yamei Xia", title = "An energy-efficient load balance strategy based on virtual machine consolidation in cloud environment", journal = j-FUT-GEN-COMP-SYS, volume = "146", number = "??", pages = "222--233", month = sep, year = "2023", CODEN = "FGSEVI", DOI = "https://doi.org/10.1016/j.future.2023.04.014", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Sat May 20 14:13:35 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X23001498", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Yao:2023:EOG, author = "Jianguo Yao and Qiumin Lu and Run Tian and Keqin Li and Haibing Guan", title = "An Economy-Oriented {GPU} Virtualization With Dynamic and Adaptive Oversubscription", journal = j-IEEE-TRANS-COMPUT, volume = "72", number = "5", pages = "1371--1383", month = may, year = "2023", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.2022.3199998", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Fri Apr 28 11:15:52 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Computers", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", } @Article{Zeng:2023:EES, author = "Deze Zeng and Andong Zhu and Lin Gu and Peng Li and Quan Chen and Minyi Guo", title = "Enabling Efficient Spatio-Temporal {GPU} Sharing for Network Function Virtualization", journal = j-IEEE-TRANS-COMPUT, volume = "72", number = "10", pages = "2963--2977", month = oct, year = "2023", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.2023.3278541", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Thu Sep 14 07:25:14 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "IEEE Trans. Comput.", fjournal = "IEEE Transactions on Computers", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", } @Article{Zhao:2023:FTM, author = "Ziming Zhao and Mingyu Wu and Xujie Cao and Haibo Chen and Binyu Zang", title = "{Flock}: Towards Multitasking Virtual Machines for Function-as-a-Service", journal = j-IEEE-TRANS-COMPUT, volume = "72", number = "11", pages = "3153--3166", month = nov, year = "2023", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.2023.3288751", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Sat Dec 2 09:49:58 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Computers", journal-URL = "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", } @Article{Zhao:2023:VPA, author = "Hui Zhao and Nanzhi Feng and Jianhua Li and Guobin Zhang and Jing Wang and Quan Wang and Bo Wan", title = "{VM} performance-aware virtual machine migration method based on ant colony optimization in cloud environment", journal = j-J-PAR-DIST-COMP, volume = "176", number = "??", pages = "17--27", month = jun, year = "2023", CODEN = "JPDCER", DOI = "https://doi.org/10.1016/j.jpdc.2023.02.003", ISSN = "0743-7315 (print), 1096-0848 (electronic)", ISSN-L = "0743-7315", bibdate = "Mon Mar 27 07:37:15 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/jpardistcomp2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0743731523000187", acknowledgement = ack-nhfb, fjournal = "Journal of Parallel and Distributed Computing", journal-URL = "http://www.sciencedirect.com/science/journal/07437315", } @Article{Ajmera:2024:DVM, author = "Kashav Ajmera and Tribhuwan Kumar Tewari", title = "Dynamic Virtual Machine Scheduling Using Residual Optimum Power-Efficiency In The Cloud Data Center", journal = j-COMP-J, volume = "67", number = "3", pages = "1099--1110", month = mar, year = "2024", CODEN = "CMPJA6", DOI = "https://doi.org/10.1093/comjnl/bxad045", ISSN = "0010-4620 (print), 1460-2067 (electronic)", ISSN-L = "0010-4620", bibdate = "Wed Apr 17 12:30:48 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://academic.oup.com/comjnl/article/67/3/1099/7161852", acknowledgement = ack-nhfb, fjournal = "Computer Journal", journal-URL = "http://comjnl.oxfordjournals.org/", } @Article{Alkhalaf:2024:EDD, author = "Asma Alkhalaf and Farookh Khadeer Hussain", title = "{EleVMate} --- a data-driven approach for `on-the-fly' horizontal small datacentre scalability and {VM} starvation", journal = j-FUT-GEN-COMP-SYS, volume = "159", number = "??", pages = "91--101", month = oct, year = "2024", CODEN = "FGSEVI", DOI = "https://doi.org/10.1016/j.future.2024.04.036", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Mon Jun 10 07:08:35 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X24001651", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Alubaidan:2024:PMI, author = "Haya A. Alubaidan and Sumayh S. Aljameel", title = "A prediction model for improving virtual machine live migration performance in cloud computing using artificial intelligence techniques", journal = j-INT-J-COMPUT-APPL, volume = "46", number = "12", pages = "1069--1087", year = "2024", CODEN = "IJCAFW", DOI = "https://doi.org/10.1080/1206212X.2024.2409988", ISSN = "1206-212X (print), 1925-7074 (electronic)", ISSN-L = "1206-212X", bibdate = "Fri Jan 24 06:02:33 MST 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/ijca.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.tandfonline.com/doi/full/10.1080/1206212X.2024.2409988", acknowledgement = ack-nhfb, ajournal = "Int. J. Comput. Appl.", fjournal = "International Journal of Computers and Applications", journal-URL = "https://www.tandfonline.com/loi/tjca20", } @Article{Asanuma:2024:DAL, author = "Kota Asanuma and Hiroshi Yamada", title = "{DBMS}-Assisted Live Migration of Virtual Machines", journal = j-IEEE-TRANS-COMPUT, volume = "73", number = "2", pages = "380--393", month = feb, year = "2024", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.2023.3329943", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Fri Feb 16 07:37:44 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "IEEE Trans. Comput.", fjournal = "IEEE Transactions on Computers", journal-URL = "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", keywords = "Central Processing Unit; cloud computing; database management systems; Live migration; Memory management; Prototypes; Software; system virtualization; Task analysis; Virtual machine monitors; Virtual machining", } @Article{Aslan:2024:FRA, author = "Fatih Aslan and George Iosifidis and Jose A. Ayala-Romero and Andres Garcia-Saavedra and Xavier Costa-Perez", title = "Fair Resource Allocation in Virtualized {O-RAN} Platforms", journal = j-POMACS, volume = "8", number = "1", pages = "17:1--17:??", month = mar, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3639043", ISSN = "2476-1249", ISSN-L = "2476-1249", bibdate = "Tue Aug 20 07:19:54 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/pomacs.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1145/3639043", abstract = "O-RAN systems and their deployment in virtualized general-purpose computing platforms (O-Cloud) constitute a paradigm shift expected to bring unprecedented performance gains. However, these architectures raise new implementation challenges and threaten \ldots{}", acknowledgement = ack-nhfb, articleno = "17", fjournal = "Proceedings of the ACM on Measurement and Analysis of Computing Systems (POMACS)", journal-URL = "https://dl.acm.org/loi/pomacs", } @Article{Benedictis:2024:NAV, author = "Marco {De Benedictis} and Ludovic Jacquin and Ignazio Pedone and Andrea Atzeni and Antonio Lioy", title = "A novel architecture to virtualise a hardware-bound trusted platform module", journal = j-FUT-GEN-COMP-SYS, volume = "150", number = "??", pages = "21--36", month = jan, year = "2024", CODEN = "FGSEVI", DOI = "https://doi.org/10.1016/j.future.2023.08.012", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Tue Oct 17 15:34:19 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X2300314X", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Bermejo:2024:GNC, author = "Belen Bermejo and Carlos Juiz and Maria Carla Calzarossa", title = "The Goodness of Nesting Containers in Virtual Machines for Server Consolidation", journal = j-J-GRID-COMP, volume = "22", number = "4", pages = "??--??", month = dec, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1007/s10723-024-09782-2", ISSN = "1570-7873 (print), 1572-9184 (electronic)", ISSN-L = "1570-7873", bibdate = "Wed Mar 26 11:50:38 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/jgridcomp.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://link.springer.com/article/10.1007/s10723-024-09782-2", acknowledgement = ack-nhfb, ajournal = "J. Grid Comp.", articleno = "67", fjournal = "Journal of Grid Computing", journal-URL = "http://link.springer.com/journal/10723", } @Article{Bosse:2024:VMP, author = "Stefan Bosse", title = "A Virtual Machine Platform Providing Machine Learning as a Programmable and Distributed Service for {IoT} and Edge On-Device Computing: Architecture, Transformation, and Evaluation of Integer Discretization", journal = j-ALGORITHMS-BASEL, volume = "17", number = "8", year = "2024", CODEN = "ALGOCH", DOI = "https://doi.org/10.3390/a17080356", ISSN = "1999-4893 (electronic)", ISSN-L = "1999-4893", bibdate = "Fri Aug 30 05:57:31 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/algorithms.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.mdpi.com/1999-4893/17/8/356", abstract = "Data-driven models used for predictive classification and regression tasks are commonly computed using floating-point arithmetic and powerful computers. We address constraints in distributed sensor networks like the IoT, edge, and material-integrated computing, providing only low-resource embedded computers with sensor data that are acquired and processed locally. Sensor networks are characterized by strong heterogeneous systems. This work introduces and evaluates a virtual machine architecture that provides ML as a service layer (MLaaS) on the node level and addresses very low-resource distributed embedded computers (with less than 20 kB of RAM). The VM provides a unified ML instruction set architecture that can be programmed to implement decision trees, ANN, and CNN model architectures using scaled integer arithmetic only. Models are trained primarily offline using floating-point arithmetic, finally converted by an iterative scaling and transformation process, demonstrated in this work by two tests based on simulated and synthetic data. This paper is an extended version of the FedCSIS 2023 conference paper providing new algorithms and ML applications, including ANN/CNN-based regression and classification tasks studying the effects of discretization on classification and regression accuracy.", acknowledgement = ack-nhfb, articleno = "356", fjournal = "Algorithms (Basel)", journal-URL = "https://www.mdpi.com/journal/algorithms", } @Article{Carberry:2024:RTR, author = "Joshua R. Carberry and John Rahme and Haiping Xu", title = "Real-Time rejuvenation scheduling for cloud systems with virtualized software spares", journal = j-J-SYST-SOFTW, volume = "217", number = "??", pages = "??--??", month = nov, year = "2024", CODEN = "JSSODM", DOI = "https://doi.org/10.1016/j.jss.2024.112168", ISSN = "0164-1212 (print), 1873-1228 (electronic)", ISSN-L = "0164-1212", bibdate = "Thu Aug 29 16:28:04 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/jsystsoftw2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0164121224002139", acknowledgement = ack-nhfb, articleno = "112168", fjournal = "Journal of Systems and Software", journal-URL = "http://www.sciencedirect.com/science/journal/01641212", } @Article{Carvalho:2024:SDD, author = "Fabr{\'\i}cio B. Carvalho and Ronaldo A. Ferreira and {\'I}talo Cunha and Marcos A. M. Vieira and Murali K. Ramanathan", title = "State Disaggregation for Dynamic Scaling of Network Functions", journal = j-IEEE-TRANS-NETWORKING, volume = "32", number = "1", pages = "81--95", year = "2024", CODEN = "IEANEP", DOI = "https://doi.org/10.1109/TNET.2023.3282562", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Fri Apr 12 07:06:49 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1109/TNET.2023.3282562", abstract = "Network Function Virtualization promises better utilization of computational resources by dynamically scaling resources on demand. However, most network functions (NFs) are stateful and require state updates on a per-packet basis. During a scaling \ldots{}", acknowledgement = ack-nhfb, ajournal = "IEEE/ACM Trans. Netw.", fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "https://dl.acm.org/loi/ton", } @Article{Cerveira:2024:RV, author = "Frederico Cerveira and Ant{\'o}nio Howcroft Ferreira and Raul Barbosa", title = "Resilient Virtualization", journal = j-COMPUTER, volume = "57", number = "2", pages = "70--78", month = feb, year = "2024", CODEN = "CPTRB4", DOI = "https://doi.org/10.1109/MC.2023.3306617", ISSN = "0018-9162 (print), 1558-0814 (electronic)", ISSN-L = "0018-9162", bibdate = "Fri Mar 15 08:20:18 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/computer2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "Computer", journal-URL = "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2", keywords = "Hardware; Scalability; Virtualization", } @Article{Chen:2024:CEH, author = "Bochuan Chen and Xiao Guo and Yuting Chen and Xiaofeng Yu and Lei Bu", title = "Constructing exception handling chains for testing {Java} virtual machine implementations", journal = j-J-SOFTW-EVOL-PROC, volume = "36", number = "4", pages = "e2562:1--e2562:??", month = apr, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1002/smr.2562", ISSN = "2047-7473 (print), 2047-7481 (electronic)", ISSN-L = "2047-7473", bibdate = "Sat May 25 07:47:43 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/jsoftwevolproc.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "J. Softw. Evol. Proc.", fjournal = "Journal of Software: Evolution and Process", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)2047-7481", onlinedate = "15 April 2023", } @Article{Cheng:2024:ITD, author = "Pau-Chen Cheng and Wojciech Ozga and Enriquillo Valdez and Salman Ahmed and Zhongshu Gu and Hani Jamjoom and Hubertus Franke and James Bottomley", title = "{Intel TDX} Demystified: a Top-Down Approach", journal = j-COMP-SURV, volume = "56", number = "9", pages = "238:1--238:??", month = sep, year = "2024", CODEN = "CMSVAN", DOI = "https://doi.org/10.1145/3652597", ISSN = "0360-0300 (print), 1557-7341 (electronic)", ISSN-L = "0360-0300", bibdate = "Thu May 16 09:22:05 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/compsurv.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1145/3652597", abstract = "Intel Trust Domain Extensions (TDX) is an architectural extension in the 4th Generation Intel Xeon Scalable Processor that supports confidential computing. TDX allows the deployment of virtual machines in the Secure-Arbitration Mode (SEAM) with encrypted CPU state and memory, integrity protection, and remote attestation. TDX aims at enforcing hardware-assisted isolation for virtual machines and minimize the attack surface exposed to host platforms, which are considered to be untrustworthy or adversarial in the confidential computing's new threat model. TDX can be leveraged by regulated industries or sensitive data holders to outsource their computations and data with end-to-end protection in public cloud infrastructures.\par This article aims at providing a comprehensive understanding of TDX to potential adopters, domain experts, and security researchers looking to leverage the technology for their own purposes. We adopt a top-down approach, starting with high-level security principles and moving to low-level technical details of TDX. Our analysis is based on publicly available documentation and source code, offering insights from security researchers outside of Intel.", acknowledgement = ack-nhfb, ajournal = "ACM Comput. Surv.", articleno = "238", fjournal = "ACM Computing Surveys", journal-URL = "https://dl.acm.org/loi/csur", } @Article{Cinque:2024:TIA, author = "Marcello Cinque and Luigi {De Simone} and Daniele Ottaviano", title = "Temporal isolation assessment in virtualized safety-critical mixed-criticality systems: a case study on {Xen} hypervisor", journal = j-J-SYST-SOFTW, volume = "216", number = "??", pages = "??--??", month = oct, year = "2024", CODEN = "JSSODM", DOI = "https://doi.org/10.1016/j.jss.2024.112147", ISSN = "0164-1212 (print), 1873-1228 (electronic)", ISSN-L = "0164-1212", bibdate = "Thu Aug 29 16:28:03 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/jsystsoftw2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0164121224001924", acknowledgement = ack-nhfb, articleno = "112147", fjournal = "Journal of Systems and Software", journal-URL = "http://www.sciencedirect.com/science/journal/01641212", } @Article{Claudino:2024:PQC, author = "Daniel Claudino and Dmitry I. Lyakh and Alexander J. McCaskey", title = "Parallel quantum computing simulations via quantum accelerator platform virtualization", journal = j-FUT-GEN-COMP-SYS, volume = "160", number = "??", pages = "264--273", month = nov, year = "2024", CODEN = "FGSEVI", DOI = "https://doi.org/10.1016/j.future.2024.06.007", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Mon Aug 12 06:41:13 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X24003054", acknowledgement = ack-nhfb, fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Cloosters:2024:MCB, author = "Tobias Cloosters and Oussama Draissi and Johannes Willbold and Thorsten Holz and Lucas Davi", title = "Memory Corruption at the Border of Trusted Execution", journal = j-IEEE-SEC-PRIV, volume = "22", number = "4", pages = "87--96", month = jul # "\slash " # aug, year = "2024", DOI = "https://doi.org/10.1109/MSEC.2024.3381439", ISSN = "1540-7993 (print), 1558-4046 (electronic)", ISSN-L = "1540-7993", bibdate = "Thu Aug 8 11:50:27 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeesecpriv.bib; https://www.math.utah.edu/pub/tex/bib/risc-v.bib; https://www.math.utah.edu/pub/tex/bib/rust.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Security \& Privacy", journal-URL = "https://publications.computer.org/security-and-privacy/", keywords = "AMD Secure Encrypted Virtualization; ARM Trustzone; Codes; Computer security; Fuzzing; Instruction sets; Kernel; Libraries; Protection; Random access memory; RISC-V Keystone; Rust SGX SDK; Security; Trusted computing", } @Article{Drummond:2024:DAW, author = "L{\'u}cia Maria A. Drummond and Luciano Andrade and Pedro de Brito Muniz and Matheus Marotti Pereira and Thiago do Prado Silva and Luan Teylo", title = "Design and analyses of web scraping on burstable virtual machines", journal = j-CCPE, volume = "36", number = "9", pages = "e7999:1--e7999:??", day = "25", month = apr, year = "2024", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.7999", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Tue May 28 09:32:34 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "Concurr. Comput.", fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", onlinedate = "27 December 2023", } @Article{Entrialgo:2024:JAC, author = "Joaqu{\'\i}n Entrialgo and Manuel Garc{\'\i}a and Javier Garc{\'\i}a and Jos{\'e} Mar{\'\i}a L{\'o}pez and Jos{\'e} Luis D{\'\i}az", title = "Joint Autoscaling of Containers and Virtual Machines for Cost Optimization in Container Clusters", journal = j-J-GRID-COMP, volume = "22", number = "1", pages = "??--??", month = mar, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1007/s10723-023-09732-4", ISSN = "1570-7873 (print), 1572-9184 (electronic)", ISSN-L = "1570-7873", bibdate = "Fri May 31 15:30:13 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/jgridcomp.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://link.springer.com/article/10.1007/s10723-023-09732-4", acknowledgement = ack-nhfb, ajournal = "J. Grid Comp.", articleno = "17", fjournal = "Journal of Grid Computing", journal-URL = "http://link.springer.com/journal/10723", } @Article{Fang:2024:PPV, author = "Yaozheng Fang and Zhiyuan Zhou and Surong Dai and Jinni Yang and Hui Zhang and Ye Lu", title = "{PaVM}: a Parallel Virtual Machine for Smart Contract Execution and Validation", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "35", number = "1", pages = "186--202", year = "2024", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2023.3334208", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Thu Dec 21 07:25:29 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Parallel and Distributed Systems", journal-URL = "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=71", } @Article{Femminella:2024:IIT, author = "Mauro Femminella and Gianluca Reali", title = "Implementing {Internet of Things} Service Platforms with Network Function Virtualization Serverless Technologies", journal = j-FUTURE-INTERNET, volume = "16", number = "3", pages = "91", day = "08", month = mar, year = "2024", CODEN = "????", DOI = "https://doi.org/10.3390/fi16030091", ISSN = "1999-5903", bibdate = "Wed Apr 10 09:47:36 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/future-internet.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.mdpi.com/1999-5903/16/3/91", abstract = "The need for adaptivity and scalability in telecommunication systems has led to the introduction of a software-based approach to networking, in which network functions are virtualized and implemented in software modules, based on network function virtualization (NFV) technologies. The growing demand for low latency, efficiency, flexibility and security has placed some limitations on the adoption of these technologies, due to some problems of traditional virtualization solutions. However, the introduction of lightweight virtualization approaches is paving the way for new and better infrastructures for implementing network functions. This article discusses these new virtualization solutions and shows a proposal, based on serverless computing, that uses them to implement container-based virtualized network functions for the delivery of advanced Internet of Things (IoT) services. It includes open source software components to implement both the virtualization layer, implemented through Firecracker, and the runtime environment, based on Kata containers. A set of experiments shows that the proposed approach is fast, in order to boost new network functions, and more efficient than some baseline solutions, with minimal resource footprint. Therefore, it is an excellent candidate to implement NFV functions in the edge deployment of serverless services for the IoT.", acknowledgement = ack-nhfb, journal-URL = "https://www.mdpi.com/journal/futureinternet", } @Article{Ferrise:2024:MEE, author = "Francesco Ferrise and Monica Bordegoni and Alberto Gallace and Stefania Serafin", title = "Multisensory Experiences in Extended Reality", journal = j-IEEE-CGA, volume = "44", number = "4", pages = "11--13", month = jul # "\slash " # aug, year = "2024", CODEN = "ICGADZ", DOI = "https://doi.org/10.1109/MCG.2024.3428110", ISSN = "0272-1716 (print), 1558-1756 (electronic)", ISSN-L = "0272-1716", bibdate = "Fri Aug 23 11:49:56 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeecga.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Computer Graphics and Applications", journal-URL = "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=38", keywords = "Auditory system; Complexity theory; Extended reality; Head-mounted displays; Multisensory integration; Object recognition; Special issues and sections; Virtual environments; Virtual reality; Virtualization; Visualization", } @Article{Fu:2024:EDF, author = "Ying Fu and Meng Ren and Fuchen Ma and Xin Yang and Heyuan Shi and Shanshan Li and Xiangke Liao", title = "{EVMFuzz}: Differential fuzz testing of {Ethereum} virtual machine", journal = j-J-SOFTW-EVOL-PROC, volume = "36", number = "4", pages = "e2556:1--e2556:??", month = apr, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1002/smr.2556", ISSN = "2047-7473 (print), 2047-7481 (electronic)", ISSN-L = "2047-7473", bibdate = "Sat May 25 07:47:43 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib; https://www.math.utah.edu/pub/tex/bib/jsoftwevolproc.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "J. Softw. Evol. Proc.", fjournal = "Journal of Software: Evolution and Process", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)2047-7481", onlinedate = "26 March 2023", } @Article{Gentile:2024:OVP, author = "Antonio Francesco Gentile and Davide Macr{\`\i} and Emilio Greco and Peppino Fazio", title = "Overlay and Virtual Private Networks Security Performances Analysis with Open Source Infrastructure Deployment", journal = j-FUTURE-INTERNET, volume = "16", number = "8", pages = "??--??", day = "7", month = aug, year = "2024", CODEN = "????", DOI = "https://doi.org/10.3390/fi16080283", ISSN = "1999-5903", bibdate = "Fri Aug 30 06:19:01 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/future-internet.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.mdpi.com/1999-5903/16/8/283", abstract = "Nowadays, some of the most well-deployed infrastructures are Virtual Private Networks (VPNs) and Overlay Networks (ONs). They consist of hardware and software components designed to build private/secure channels, typically over the Internet. They are currently among the most reliable technologies for achieving this objective. VPNs are well-established and can be patched to address security vulnerabilities, while overlay networks represent the next-generation solution for secure communication. In this paper, for both VPNs and ONs, we analyze some important network performance components (RTT and bandwidth) while varying the type of overlay networks utilized for interconnecting traffic between two or more hosts (in the same data center, in different data centers in the same building, or over the Internet). These networks establish connections between KVM (Kernel-based Virtual Machine) instances rather than the typical Docker/LXC/Podman containers. The first analysis aims to assess network performance as it is, without any overlay channels. Meanwhile, the second establishes various channels without encryption and the final analysis encapsulates overlay traffic via IPsec (Transport mode), where encrypted channels like VTI are not already available for use. A deep set of traffic simulation campaigns shows the obtained performance.", acknowledgement = ack-nhfb, articleno = "283", journal-URL = "https://www.mdpi.com/journal/futureinternet", } @Article{Ghasemi:2024:EVM, author = "Arezoo Ghasemi and Abolfazl Toroghi Haghighat and Amin Keshavarzi", title = "Enhancing virtual machine placement efficiency in cloud data centers: a hybrid approach using multi-objective reinforcement learning and clustering strategies", journal = j-COMPUTING, volume = "106", number = "9", pages = "2897--2922", month = sep, year = "2024", CODEN = "CMPTA2", DOI = "https://doi.org/10.1007/s00607-024-01311-z", ISSN = "0010-485X (print), 1436-5057 (electronic)", ISSN-L = "0010-485X", bibdate = "Thu Aug 29 07:24:23 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/computing.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://link.springer.com/article/10.1007/s00607-024-01311-z", acknowledgement = ack-nhfb, ajournal = "Computing", fjournal = "Computing", journal-URL = "http://link.springer.com/journal/607", } @Article{Gupta:2024:SVL, author = "Ambika Gupta and Suyel Namasudra and Prabhat Kumar", title = "A secure {VM} live migration technique in a cloud computing environment using blowfish and blockchain technology", journal = j-J-SUPERCOMPUTING, volume = "80", number = "19", pages = "27370--27393", month = dec, year = "2024", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-024-06461-7", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Tue Oct 8 08:03:35 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/bitcoin.bib; https://www.math.utah.edu/pub/tex/bib/jsuper2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://link.springer.com/article/10.1007/s11227-024-06461-7", acknowledgement = ack-nhfb, ajournal = "J. Supercomputing", fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Haris:2024:COP, author = "Raseena M. Haris and Mahmoud Barhamgi and Armstrong Nhlabatsi and Khaled M. Khan", title = "Correction to: {Optimizing} pre-copy live virtual machine migration in cloud computing using machine learning-based prediction model", journal = j-COMPUTING, volume = "106", number = "12", pages = "4249--4249", month = dec, year = "2024", CODEN = "CMPTA2", DOI = "https://doi.org/10.1007/s00607-024-01350-6", ISSN = "0010-485X (print), 1436-5057 (electronic)", ISSN-L = "0010-485X", bibdate = "Sat Apr 12 11:40:14 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/computing.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "See \cite{Haris:2024:OPC}.", URL = "https://link.springer.com/article/10.1007/s00607-024-01350-6", acknowledgement = ack-nhfb, ajournal = "Computing", fjournal = "Computing", journal-URL = "http://link.springer.com/journal/607", } @Article{Haris:2024:OPC, author = "Raseena M. Haris and Mahmoud Barhamgi and Armstrong Nhlabatsi and Khaled M. Khan", title = "Optimizing pre-copy live virtual machine migration in cloud computing using machine learning-based prediction model", journal = j-COMPUTING, volume = "106", number = "9", pages = "3031--3062", month = sep, year = "2024", CODEN = "CMPTA2", DOI = "https://doi.org/10.1007/s00607-024-01318-6", ISSN = "0010-485X (print), 1436-5057 (electronic)", ISSN-L = "0010-485X", bibdate = "Thu Aug 29 07:24:23 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/computing.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "See correction \cite{Haris:2024:COP}.", URL = "https://link.springer.com/article/10.1007/s00607-024-01318-6", acknowledgement = ack-nhfb, ajournal = "Computing", fjournal = "Computing", journal-URL = "http://link.springer.com/journal/607", } @Article{Harutyunyan:2024:DCA, author = "Ashot Harutyunyan and Arnak Poghosyan and Tigran Bunarjyan and Andranik Haroyan and Marine Harutyunyan and Lilit Harutyunyan and Nelson Baloian", title = "Discovery of Cloud Applications from Logs", journal = j-FUTURE-INTERNET, volume = "16", number = "6", pages = "216", day = "18", month = jun, year = "2024", CODEN = "????", DOI = "https://doi.org/10.3390/fi16060216", ISSN = "1999-5903", bibdate = "Tue Jul 2 10:12:15 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/future-internet.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.mdpi.com/1999-5903/16/6/216", abstract = "Continuous discovery and update of applications or their boundaries running in cloud environments in an automatic way is a highly required function of modern data center operation solutions. Prior attempts to address this problem within various products or projects were/are applying rule-driven approaches or machine learning techniques on specific types of data--network traffic as well as property/configuration data of infrastructure objects, which all have their drawbacks in effectively identifying roles of those resources. The current proposal (ADLog) leverages log data of sources, which contain incomparably richer contextual information, and demonstrates a reliable way of discriminating application objects. Specifically, using native constructs of VMware Aria Operations for Logs in terms of event types and their distributions, we group those entities, which then can be potentially enriched with indicative tags automatically and recommended for further management tasks and policies. Our methods differentiate not only diverse kinds of applications, but also their specific deployments, thus providing hierarchical representation of the applications in time and topology. For several applications under Aria Ops management in our experimental test bed, we discover those in terms of similarity behavior of their components with a high accuracy. The validation of the proposal paves the path for an AI-driven solution in cloud management scenarios.", acknowledgement = ack-nhfb, journal-URL = "https://www.mdpi.com/journal/futureinternet", } @Article{He:2024:MDC, author = "Xinfeng He and Riyang Li", title = "Malware detection for container runtime based on virtual machine introspection", journal = j-J-SUPERCOMPUTING, volume = "80", number = "6", pages = "7245--7268", month = apr, year = "2024", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-023-05727-w", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Tue Mar 26 07:19:20 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/jsuper2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://link.springer.com/article/10.1007/s11227-023-05727-w", acknowledgement = ack-nhfb, ajournal = "J. Supercomputing", fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Huang:2024:PPV, author = "Haojun Huang and Jialin Tian and Geyong Min and Hao Yin and Cheng Zeng and Yangming Zhao and Dapeng Oliver Wu", title = "Parallel Placement of Virtualized Network Functions via Federated Deep Reinforcement Learning", journal = j-IEEE-TRANS-NETWORKING, volume = "32", number = "4", pages = "2936--2949", month = jun, year = "2024", CODEN = "IEANEP", DOI = "https://doi.org/10.1109/TNET.2024.3366950", ISSN = "1063-6692 (print), 1558-2566 (electronic)", ISSN-L = "1063-6692", bibdate = "Sat Sep 21 06:19:41 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransnetworking.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1109/TNET.2024.3366950", abstract = "Network Function Virtualization (NFV) introduces a new network architecture that offers different network services flexibly and dynamically in the form of Service Function Chains (SFCs), which refer to a set of Virtualization Network Functions (VNFs) \ldots{}", acknowledgement = ack-nhfb, ajournal = "IEEE/ACM Trans. Netw.", fjournal = "IEEE\slash ACM Transactions on Networking", journal-URL = "https://dl.acm.org/loi/ton", } @Article{Huang:2024:VEC, author = "Hang Huang and Honglei Wang and Jia Rao and Song Wu and Hao Fan and Chen Yu and Hai Jin and Kun Suo and Lisong Pan", title = "{vKernel}: Enhancing Container Isolation via Private Code and Data", journal = j-IEEE-TRANS-COMPUT, volume = "73", number = "7", pages = "1711--1723", month = jul, year = "2024", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.2024.3383988", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Wed Jun 12 15:57:24 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "IEEE Trans. Comput.", fjournal = "IEEE Transactions on Computers", journal-URL = "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", keywords = "Codes; Container; Containers; Interference; isolation; kernel; Kernel; performance; Security; Virtual machine monitors; Virtualization", } @Article{Juiz:2024:SSC, author = "Carlos Juiz and Belen Bermejo", title = "On the scalability of the speedup considering the overhead of consolidating virtual machines in servers for data centers", journal = j-J-SUPERCOMPUTING, volume = "80", number = "9", pages = "12463--12511", month = jun, year = "2024", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-024-05943-y", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Wed Jun 5 08:12:13 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/jsuper2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://link.springer.com/article/10.1007/s11227-024-05943-y", acknowledgement = ack-nhfb, ajournal = "J. Supercomputing", fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Kabamba:2024:VLO, author = "Herve M. Kabamba and Matthew Khouzam and Michel R. Dagenais", title = "{Vnode}: Low-Overhead Transparent Tracing of {{\tt Node.js}}-Based Microservice Architectures", journal = j-FUTURE-INTERNET, volume = "16", number = "1", pages = "13", day = "29", month = dec, year = "2024", CODEN = "????", DOI = "https://doi.org/10.3390/fi16010013", ISSN = "1999-5903", bibdate = "Wed Apr 10 09:47:35 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/future-internet.bib; https://www.math.utah.edu/pub/tex/bib/java2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.mdpi.com/1999-5903/16/1/13", abstract = "Tracing serves as a key method for evaluating the performance of microservices-based architectures, which are renowned for their scalability, resource efficiency, and high availability. Despite their advantages, these architectures often pose unique debugging challenges that necessitate trade-offs, including the burden of instrumentation overhead. With Node.js emerging as a leading development environment recognized for its rapidly growing ecosystem, there is a pressing need for innovative performance debugging approaches that reduce the telemetry data collection efforts and the overhead incurred by the environment's instrumentation. In response, we introduce a new approach designed for transparent tracing and performance debugging of microservices in cloud settings. This approach is centered around our newly developed Internal Transparent Tracing and Context Reconstruction (ITTCR) technique. ITTCR is adept at correlating internal metrics from various distributed trace files to reconstruct the intricate execution contexts of microservices operating in a Node.js environment. Our method achieves transparency by directly instrumenting the Node.js virtual machine, enabling the collection and analysis of trace events in a transparent manner. This process facilitates the creation of visualization tools, enhancing the understanding and analysis of microservice performance in cloud environments. Compared to other methods, our approach incurs an overhead of approximately 5\% on the system for the trace collection infrastructure while exhibiting minimal utilization of system resources during analysis execution. Experiments demonstrate that our technique scales well with very large trace files containing huge numbers of events and performs analyses in very acceptable timeframes.", acknowledgement = ack-nhfb, journal-URL = "https://www.mdpi.com/journal/futureinternet", } @Article{Kappes:2024:DFU, author = "Giorgos Kappes and Stergios V. Anastasiadis", title = "{Diciclo}: Flexible User-level Services for Efficient Multitenant Isolation", journal = j-TOCS, volume = "42", number = "1--2", pages = "3:1--3:??", month = may, year = "2024", CODEN = "ACSYEC", DOI = "https://doi.org/10.1145/3639404", ISSN = "0734-2071 (print), 1557-7333 (electronic)", ISSN-L = "0734-2071", bibdate = "Thu May 16 10:49:47 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tocs.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1145/3639404", abstract = "Containers are a mainstream virtualization technique for running stateful workloads over persistent storage. In highly utilized multitenant hosts, resource contention at the system kernel leads to inefficient container input/output (I/O) handling. Although there are interesting techniques to address this issue, they incur high implementation complexity and execution overhead. As a cost-effective alternative, we introduce the Diciclo architecture with our assumptions, goals, and principles. For each tenant, Diciclo isolates the control and data I/O path at user level and runs dedicated storage systems. Diciclo includes the libservice unified user-level abstraction of system services and the node structure design pattern for the application and server side. We prototyped a toolkit of user-level components that comprise the library to invoke the standard I/O calls, the I/O communication mechanism, and the I/O services. Based on Diciclo, we built Danaus, a filesystem client that integrates a union filesystem with a Ceph distributed filesystem client and configurable shared cache. Across different host configurations, workloads, and systems, Danaus achieves improved performance stability, because it handles I/O with reserved per-tenant resources and avoids intensive kernel locking. Based on having built and evaluated Danaus, we share valuable lessons about resource contention, file management, service separation, and performance stability in multitenant systems.", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Comput. Syst.", articleno = "3", fjournal = "ACM Transactions on Computer Systems", journal-URL = "https://dl.acm.org/loi/tocs", } @Article{Karamzadeh:2024:RCS, author = "Amirmohammad Karamzadeh and Alireza Shameli-Sendi", title = "Reducing cold start delay in serverless computing using lightweight virtual machines", journal = j-J-NETW-COMPUT-APPL, volume = "232", number = "??", pages = "??--??", month = dec, year = "2024", CODEN = "JNCAF3", DOI = "https://doi.org/10.1016/j.jnca.2024.104030", ISSN = "1084-8045 (print), 1095-8592 (electronic)", ISSN-L = "1084-8045", bibdate = "Mon Nov 18 13:35:23 MST 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.sciencedirect.com/science/article/pii/S1084804524002078", acknowledgement = ack-nhfb, articleno = "104030", fjournal = "Journal of Network and Computer Applications", journal-URL = "http://www.sciencedirect.com/science/journal/10848045", } @Article{Kumar:2024:EPV, author = "K. Dinesh Kumar and E. Umamaheswari", title = "An efficient proactive {VM} consolidation technique with improved {LSTM} network in a cloud environment", journal = j-COMPUTING, volume = "106", number = "1", pages = "1--28", month = jan, year = "2024", CODEN = "CMPTA2", DOI = "https://doi.org/10.1007/s00607-023-01214-5", ISSN = "0010-485X (print), 1436-5057 (electronic)", ISSN-L = "0010-485X", bibdate = "Thu Aug 29 07:24:20 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/computing.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://link.springer.com/article/10.1007/s00607-023-01214-5", acknowledgement = ack-nhfb, ajournal = "Computing", fjournal = "Computing", journal-URL = "http://link.springer.com/journal/607", } @Article{Lauwaerts:2024:WEW, author = "Tom Lauwaerts and Robbert Gurdeep Singh and Christophe Scholliers", title = "{WARDuino}: an embedded {WebAssembly} virtual machine", journal = j-J-COMPUT-LANG, volume = "79", number = "??", pages = "1--35", month = jun, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1016/j.cola.2024.101268", ISSN = "2665-9182 (print), 2590-1184 (electronic)", ISSN-L = "2590-1184", bibdate = "Mon Sep 29 08:54:39 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/jcomputlang.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S259011842400011X", acknowledgement = ack-nhfb, ajournal = "J. Comput. Lang.", articleno = "101268", fjournal = "Journal of Computer Languages", journal-URL = "https://www.sciencedirect.com/journal/journal-of-computer-languages", } @Article{Li:2024:BLI, author = "Huiba Li and Zhihao Zhang and Yifan Yuan and Rui Du and Kai Ma and Lanzheng Liu and Yiming Zhang and Windsor Hsu", title = "Block-level Image Service for the Cloud", journal = j-TOS, volume = "20", number = "1", pages = "1:1--1:??", month = feb, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3620672", ISSN = "1553-3077 (print), 1553-3093 (electronic)", ISSN-L = "1553-3077", bibdate = "Fri Feb 23 16:50:38 MST 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tos.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1145/3620672", abstract = "Businesses increasingly need agile and elastic computing infrastructure to respond quickly to real-world situations. By offering efficient process-based virtualization and a layered image system, containers are designed to enable agile and elastic \ldots{}", acknowledgement = ack-nhfb, articleno = "1", fjournal = "ACM Transactions on Storage", journal-URL = "https://dl.acm.org/loi/tos", } @Article{Li:2024:MSM, author = "Di Li and Zhibang Yang and Siyang Yu and Mingxing Duan and Shenghong Yang", title = "A Micro-Segmentation Method Based on {VLAN-VxLAN} Mapping Technology", journal = j-FUTURE-INTERNET, volume = "16", number = "9", pages = "320", day = "4", month = sep, year = "2024", CODEN = "????", DOI = "https://doi.org/10.3390/fi16090320", ISSN = "1999-5903", bibdate = "Mon Sep 30 08:13:31 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/future-internet.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.mdpi.com/1999-5903/16/9/320", abstract = "As information technology continues to evolve, cloud data centres have become increasingly prominent as the preferred infrastructure for data storage and processing. However, this shift has introduced a new array of security challenges, necessitating innovative approaches distinct from traditional network security architectures. In response, the Zero Trust Architecture (ZTA) has emerged as a promising solution, with micro-segmentation identified as a crucial component for enabling continuous auditing and stringent security controls. VxLAN technology is widely utilized in data centres for tenant isolation and virtual machine interconnection within tenant environments. Despite its prevalent use, limited research has focused on its application in micro-segmentation scenarios. To address this gap, we propose a method that leverages VLAN and VxLAN many-to-one mapping, requiring that all internal data centre traffic routes through the VxLAN gateway. This method can be implemented cost-effectively, without necessitating business modifications or causing service disruptions, thereby overcoming the challenges associated with micro-segmentation deployment. Importantly, this approach is based on standard public protocols, making it independent of specific product brands and enabling a network-centric framework that avoids software compatibility issues. To assess the effectiveness of our micro-segmentation approach, we provide a comprehensive evaluation that includes network aggregation and traffic visualization. Building on the implementation of micro-segmentation, we also introduce an enhanced asset behaviour algorithm. This algorithm constructs behavioural profiles based on the historical traffic of internal network assets, enabling the rapid identification of abnormal behaviours and facilitating timely defensive actions. Empirical results demonstrate that our algorithm is highly effective in detecting anomalous behaviour in intranet assets, making it a powerful tool for enhancing security in cloud data centres. In summary, the proposed approach offers a robust and efficient solution to the challenges of micro-segmentation in cloud data centres, contributing to the advancement of secure and reliable cloud infrastructure.", acknowledgement = ack-nhfb, journal-URL = "https://www.mdpi.com/journal/futureinternet", } @Article{Liu:2024:DNO, author = "Lisi Liu and Zijie Xu and Xiaobin Qu", title = "Development of a Novel Open Control System Implementation Method under Industrial {IoT}", journal = j-FUTURE-INTERNET, volume = "16", number = "8", pages = "??--??", day = "14", month = aug, year = "2024", CODEN = "????", DOI = "https://doi.org/10.3390/fi16080293", ISSN = "1999-5903", bibdate = "Fri Aug 30 06:19:01 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/future-internet.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.mdpi.com/1999-5903/16/8/293", abstract = "The closed architecture of modern control systems impedes them from further development in the environment of the industrial IoT. The open control system is proposed to tackle this issue. Numerous open control prototypes have been proposed, but they do not reach high openness. According to the definition and criteria of open control systems, this paper suggests that the independence between control tasks and the independence between control tasks and infrastructures are the keys to the open control system under the industrial IoT. Through the control domain's formal description and control task virtualization to deal with the keys, this paper proposes a new method to implement open control systems under the industrial IoT. Specifically, given the hybrid characteristic of the control domain, a hierarchical semantic formal based on an extended finite state machine and a dependency network model with the time property is designed to describe the control domain. Considering the infrastructure's heterogeneity in the industrial IoT, a hybrid virtualization approach based on containers and WebAssembly is designed to virtualize control tasks. The proposed open control system implementation method is illustrated by constructing an open computer numerical control demonstration and compared to current open control prototypes.", acknowledgement = ack-nhfb, articleno = "293", journal-URL = "https://www.mdpi.com/journal/futureinternet", } @Article{Liu:2024:HAK, author = "Jianzhong Liu and Yuheng Shen and Yiru Xu and Hao Sun and Yu Jiang", title = "{Horus}: Accelerating Kernel Fuzzing through Efficient {Host--VM} Memory Access Procedures", journal = j-TOSEM, volume = "33", number = "1", pages = "11:1--11:??", month = jan, year = "2024", CODEN = "ATSMER", DOI = "https://doi.org/10.1145/3611665", ISSN = "1049-331X (print), 1557-7392 (electronic)", ISSN-L = "1049-331X", bibdate = "Wed Apr 10 09:12:06 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tosem.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1145/3611665", abstract = "Kernel fuzzing is an effective technique in operating system vulnerability detection. Fuzzers such as Syzkaller and Moonshine frequently pass highly structured data between fuzzer processes in guest virtual machines and manager processes in the host \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Softw. Eng. Methodol.", articleno = "11", fjournal = "ACM Transactions on Software Engineering and Methodology", journal-URL = "https://dl.acm.org/loi/tosem", } @Article{Mahmoodabadi:2024:AAV, author = "Zahra Mahmoodabadi and Mostafa Nouri-Baygi", title = "An approximation algorithm for virtual machine placement in cloud data centers", journal = j-J-SUPERCOMPUTING, volume = "80", number = "1", pages = "915--941", month = jan, year = "2024", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-023-05505-8", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Thu Feb 15 10:23:12 MST 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/jsuper2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://link.springer.com/article/10.1007/s11227-023-05505-8", acknowledgement = ack-nhfb, ajournal = "J. Supercomputing", fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Malhotra:2024:SLR, author = "Ruchika Malhotra and Anjali Bansal and Marouane Kessentini", title = "A Systematic Literature Review on Maintenance of Software Containers", journal = j-COMP-SURV, volume = "56", number = "8", pages = "193:1--193:??", month = aug, year = "2024", CODEN = "CMSVAN", DOI = "https://doi.org/10.1145/3645092", ISSN = "0360-0300 (print), 1557-7341 (electronic)", ISSN-L = "0360-0300", bibdate = "Thu May 16 09:22:04 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/compsurv.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1145/3645092", abstract = "Nowadays, cloud computing is gaining tremendous attention to deliver information via the internet. Virtualization plays a major role in cloud computing as it deploys multiple virtual machines on the same physical machine and thus results in improving resource utilization. Hypervisor-based virtualization and containerization are two commonly used approaches in operating system virtualization. In this article, we provide a systematic literature review on various phases in maintenance of containers including container image detection, container scheduling, container security measures, and performance evaluation of containers. We have selected 145 primary studies out of which 24\% of studies are related to container performance evaluation, 42\% of studies are related to container scheduling techniques, 22\% of studies are related to container security measures, and 12\% of studies are related to container image detection process. A few studies are related to container image detection process and evaluation of container security measures. Resource utilization is the most considered performance objective in almost all container scheduling techniques. We conclude that there is a need to introduce new tagging approaches, smell detection approaches, and also new approaches to detect and resolve threat issues in containers so that we can maintain the security of containers.", acknowledgement = ack-nhfb, ajournal = "ACM Comput. Surv.", articleno = "193", fjournal = "ACM Computing Surveys", journal-URL = "https://dl.acm.org/loi/csur", } @Article{Mao:2024:JVN, author = "Yingling Mao and Xiaojun Shang and Yu Liu and Yuanyuan Yang", title = "Joint Virtual Network Function Placement and Flow Routing in Edge-Cloud Continuum", journal = j-IEEE-TRANS-COMPUT, volume = "73", number = "3", pages = "872--886", month = mar, year = "2024", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.2023.3347671", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Fri Feb 16 07:37:44 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "IEEE Trans. Comput.", fjournal = "IEEE Transactions on Computers", journal-URL = "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", keywords = "Approximation algorithms; Cloud computing; cloud computing; Costs; edge computing; Edge computing; Heuristic algorithms; joint resource and latency optimization; Network function virtualization; Routing; Servers; service function chain deployment", } @Article{Marques:2024:ISQ, author = "Francisco Marques and Manuel Rodr{\'\i}guez and Bruno S{\'a} and Sandro Pinto", title = "``{Interrupting}'' the Status Quo: a First Glance at the {RISC-V Advanced Interrupt Architecture (AIA)}", journal = j-IEEE-ACCESS, volume = "12", pages = "9822--9833", year = "2024", DOI = "https://doi.org/10.1109/ACCESS.2024.3352114", ISSN = "2169-3536", bibdate = "Sun Oct 5 10:31:31 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/risc-v.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Access", journal-URL = "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6287639", keywords = "Advanced interrupt architecture; AIA; architecture; Computer architecture; CVA6; FPGA; Hardware; interrupt controller; IP networks; Microarchitecture; microarchitecture; Registers; RISC-V; Standards; virtualization; Virtualization", } @Article{Mirobi:2024:RND, author = "G. Justy Mirobi and L. Arockiam", title = "Retraction Note: {DAVmS: Distance Aware Virtual Machine Scheduling} approach for reducing the response time in cloud computing", journal = j-J-SUPERCOMPUTING, volume = "80", number = "13", pages = "19945--19945", month = sep, year = "2024", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-024-05970-9", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Sat Aug 3 09:56:31 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/jsuper2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "See \cite{Mirobi:2021:DDA}.", URL = "https://link.springer.com/article/10.1007/s11227-024-05970-9", acknowledgement = ack-nhfb, ajournal = "J. Supercomputing", fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Moreno-Vozmediano:2024:IRO, author = "Rafael Moreno-Vozmediano and Rub{\'e}n S. Montero and Eduardo Huedo and Ignacio M. Llorente", title = "Intelligent Resource Orchestration for {5G} Edge Infrastructures", journal = j-FUTURE-INTERNET, volume = "16", number = "3", pages = "103", day = "19", month = mar, year = "2024", CODEN = "????", DOI = "https://doi.org/10.3390/fi16030103", ISSN = "1999-5903", bibdate = "Wed Apr 10 09:47:36 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/future-internet.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.mdpi.com/1999-5903/16/3/103", abstract = "The adoption of edge infrastructure in 5G environments stands out as a transformative technology aimed at meeting the increasing demands of latency-sensitive and data-intensive applications. This research paper presents a comprehensive study on the intelligent orchestration of 5G edge computing infrastructures. The proposed Smart 5G Edge-Cloud Management Architecture, built upon an OpenNebula foundation, incorporates a ONEedge5G experimental component, which offers intelligent workload forecasting and infrastructure orchestration and automation capabilities, for optimal allocation of virtual resources across diverse edge locations. The research evaluated different forecasting models, based both on traditional statistical techniques and machine learning techniques, comparing their accuracy in CPU usage prediction for a dataset of virtual machines (VMs). Additionally, an integer linear programming formulation was proposed to solve the optimization problem of mapping VMs to physical servers in distributed edge infrastructure. Different optimization criteria such as minimizing server usage, load balancing, and reducing latency violations were considered, along with mapping constraints. Comprehensive tests and experiments were conducted to evaluate the efficacy of the proposed architecture.", acknowledgement = ack-nhfb, journal-URL = "https://www.mdpi.com/journal/futureinternet", } @Article{Mousavi:2024:EAE, author = "Tayebeh Sadat Mousavi and Achyut Shankar and Mohammad Hossein Rezvani and Hamid Ghadiri", title = "Entropy-aware energy-efficient virtual machine placement in cloud environments using type information", journal = j-CCPE, volume = "36", number = "15", pages = "e7950:1--e7950:??", day = "10", month = jul, year = "2024", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.7950", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Tue Nov 11 07:14:52 MST 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "Concurr. Comput.", fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", onlinedate = "14 November 2023", } @Article{Naeen:2024:CDC, author = "Mohammad Ali Monshizadeh Naeen and Hamid Reza Ghaffari and Hossein Monshizadeh Naeen", title = "Cloud data center cost management using virtual machine consolidation with an improved artificial feeding birds algorithm", journal = j-COMPUTING, volume = "106", number = "6", pages = "1795--1823", month = jun, year = "2024", CODEN = "CMPTA2", DOI = "https://doi.org/10.1007/s00607-024-01267-0", ISSN = "0010-485X (print), 1436-5057 (electronic)", ISSN-L = "0010-485X", bibdate = "Thu Aug 29 07:24:22 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/computing.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://link.springer.com/article/10.1007/s00607-024-01267-0", acknowledgement = ack-nhfb, ajournal = "Computing", fjournal = "Computing", journal-URL = "http://link.springer.com/journal/607", } @Article{Nie:2024:VSP, author = "Chen Nie and Chenyu Tang and Jie Lin and Huan Hu and Chenyang Lv and Ting Cao and Weifeng Zhang and Li Jiang and Xiaoyao Liang and Weikang Qian and Yanan Sun and Zhezhi He", title = "{VSPIM}: {SRAM} Processing-in-Memory {DNN} Acceleration via Vector--Scalar Operations", journal = j-IEEE-TRANS-COMPUT, volume = "73", number = "10", pages = "2378--2390", month = oct, year = "2024", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.2023.3285095", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Tue Oct 15 13:00:14 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "IEEE Trans. Comput.", fjournal = "IEEE Transactions on Computers", journal-URL = "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", keywords = "Acceleration of machine learning; Computer architecture; Costs; emerging architecture; general matrix multiplication; Loading; Optimization; Parallel processing; Random access memory; SRAM processing -in- memory; Virtual machine monitors", } @Article{Nogales:2024:SDC, author = "Borja Nogales and Ivan Vidal and Francisco Valera and Victor Sanchez-Aguero and Diego R. Lopez", title = "Software-Driven Connectivity Orchestration for Multidomain Network Functions Virtualization Ecosystems", journal = j-IEEE-SOFTWARE, volume = "41", number = "2", pages = "88--97", month = mar # "\slash " # apr, year = "2024", CODEN = "IESOEG", DOI = "https://doi.org/10.1109/MS.2023.3304854", ISSN = "0740-7459 (print), 1937-4194 (electronic)", ISSN-L = "0740-7459", bibdate = "Fri Apr 5 17:28:57 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeesoft2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Software", journal-URL = "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=52", keywords = "5G mobile communication; Ecosystems; IP networks; Overlay networks; Routing; Software; Virtualization", } @Article{Papazis:2024:HFM, author = "Kon Papazis and Naveen Chilamkurti", title = "{Hydrakon}, a Framework for Measuring Indicators of Deception in Emulated Monitoring Systems", journal = j-FUTURE-INTERNET, volume = "16", number = "12", pages = "455", day = "4", month = dec, year = "2024", CODEN = "????", DOI = "https://doi.org/10.3390/fi16120455", ISSN = "1999-5903", bibdate = "Tue Dec 31 12:05:17 MST 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/future-internet.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.mdpi.com/1999-5903/16/12/455", abstract = "The current cybersecurity ecosystem is proving insufficient in today's increasingly sophisticated cyber attacks. Malware authors and intruders have pursued innovative avenues to circumvent emulated monitoring systems (EMSs) such as honeypots, virtual machines, sandboxes and debuggers to continue with their malicious activities while remaining inconspicuous. Cybercriminals are improving their ability to detect EMS, by finding indicators of deception (IoDs) to expose their presence and avoid detection. It is proving a challenge for security analysts to deploy and manage EMS to evaluate their deceptive capability. In this paper, we introduce the Hydrakon framework, which is composed of an EMS controller and several Linux and Windows 10 clients. The EMS controller automates the deployment and management of the clients and EMS for the purpose of measuring EMS deceptive capabilities. Experiments were conducted by applying custom detection vectors to client real machines, virtual machines and sandboxes, where various artifacts were extracted and stored as csv files on the EMS controller. The experiment leverages the cosine similarity metric to compare and identify similar artifacts between a real system and a virtual machine or sandbox. Our results show that Hydrakon offers a valid approach to assess the deceptive capabilities of EMS without the need to target specific IoD within the target system, thereby fostering more robust and effective emulated monitoring systems.", acknowledgement = ack-nhfb, journal-URL = "https://www.mdpi.com/journal/futureinternet", } @Article{Queiroz:2024:CBV, author = "Rui Queiroz and Tiago Cruz and J{\'e}r{\^o}me Mendes and Pedro Sousa and Paulo Sim{\~o}es", title = "Container-based Virtualization for Real-time Industrial Systems --- a Systematic Review", journal = j-COMP-SURV, volume = "56", number = "3", pages = "59:1--59:??", month = mar, year = "2024", CODEN = "CMSVAN", DOI = "https://doi.org/10.1145/3617591", ISSN = "0360-0300 (print), 1557-7341 (electronic)", ISSN-L = "0360-0300", bibdate = "Fri Nov 3 15:05:35 MDT 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/compsurv.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1145/3617591", abstract = "Industrial Automation and Control systems have matured into a stable infrastructure model that has been kept fundamentally unchanged, using discrete \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Comput. Surv.", articleno = "59", fjournal = "ACM Computing Surveys", journal-URL = "https://dl.acm.org/loi/csur", } @Article{Reano:2024:AV, author = "Carlos Rea{\~n}o and Federico Silla and Blesson Varghese", title = "Accelerator virtualization", journal = j-CCPE, volume = "36", number = "10", pages = "e6254:1--e6254:??", day = "1", month = may, year = "2024", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.6254", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Tue May 28 09:32:35 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "Concurr. Comput.", fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", onlinedate = "26 February 2021", } @Article{Rjeib:2024:VEV, author = "Hasanein D. Rjeib and Gabor Kecskemeti", title = "{VMP-ER}: an Efficient Virtual Machine Placement Algorithm for Energy and Resources Optimization in Cloud Data Center", journal = j-ALGORITHMS-BASEL, volume = "17", number = "7", year = "2024", CODEN = "ALGOCH", DOI = "https://doi.org/10.3390/a17070295", ISSN = "1999-4893 (electronic)", ISSN-L = "1999-4893", bibdate = "Fri Aug 30 05:57:31 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/algorithms.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.mdpi.com/1999-4893/17/7/295", abstract = "Cloud service providers deliver computing services on demand using the Infrastructure as a Service (IaaS) model. In a cloud data center, several virtual machines (VMs) can be hosted on a single physical machine (PM) with the help of virtualization. The virtual machine placement (VMP) involves assigning VMs across various physical machines, which is a crucial process impacting energy draw and resource usage in the cloud data center. Nonetheless, finding an effective settlement is challenging owing to factors like hardware heterogeneity and the scalability of cloud data centers. This paper proposes an efficient algorithm named VMP-ER aimed at optimizing power consumption and reducing resource wastage. Our algorithm achieves this by decreasing the number of running physical machines, and it gives priority to energy-efficient servers. Additionally, it improves resource utilization across physical machines, thus minimizing wastage and ensuring balanced resource allocation.", acknowledgement = ack-nhfb, articleno = "295", fjournal = "Algorithms (Basel)", journal-URL = "https://www.mdpi.com/journal/algorithms", } @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; https://www.math.utah.edu/pub/tex/bib/virtual-machines.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{Rozehkhani:2024:ECD, author = "Seyyed Meysam Rozehkhani and Farnaz Mahan and Witold Pedrycz", title = "Efficient cloud data center: an adaptive framework for dynamic {Virtual Machine Consolidation}", journal = j-J-NETW-COMPUT-APPL, volume = "226", number = "??", pages = "??--??", month = jun, year = "2024", CODEN = "JNCAF3", DOI = "https://doi.org/10.1016/j.jnca.2024.103885", ISSN = "1084-8045 (print), 1095-8592 (electronic)", ISSN-L = "1084-8045", bibdate = "Wed May 8 06:41:40 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1084804524000626", acknowledgement = ack-nhfb, articleno = "103885", fjournal = "Journal of Network and Computer Applications", journal-URL = "http://www.sciencedirect.com/science/journal/10848045", } @Article{Saadatfar:2024:NDG, author = "Hamid Saadatfar and Hamid Gholampour Ahangar and Javad Hassannataj Joloudari", title = "A New Dynamic Game-Based Pricing Model for Cloud Environment", journal = j-FUTURE-INTERNET, volume = "16", number = "2", pages = "49", day = "31", month = jan, year = "2024", CODEN = "????", DOI = "https://doi.org/10.3390/fi16020049", ISSN = "1999-5903", bibdate = "Wed Apr 10 09:47:35 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/future-internet.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.mdpi.com/1999-5903/16/2/49", abstract = "Resource pricing in cloud computing has become one of the main challenges for cloud providers. The challenge is determining a fair and appropriate price to satisfy users and resource providers. To establish a justifiable price, it is imperative to take into account the circumstances and requirements of both the provider and the user. This research tries to provide a pricing mechanism for cloud computing based on game theory. The suggested approach considers three aspects: the likelihood of faults, the interplay among virtual machines, and the amount of energy used, in order to determine a justifiable price. In the game that is being proposed, the provider is responsible for determining the price of the virtual machine that can be made available to the user on each physical machine. The user, on the other hand, has the authority to choose between the virtual machines that are offered in order to run their application. The whole game is implemented as a function of the resource broker component. The proposed mechanism is simulated and evaluated using the CloudSim simulator. Its performance is compared with several previous recent mechanisms. The results indicate that the suggested mechanism has successfully identified a more rational price for both the user and the provider, consequently enhancing the overall profitability of the cloud system.", acknowledgement = ack-nhfb, journal-URL = "https://www.mdpi.com/journal/futureinternet", } @Article{Sadolewski:2024:VCS, author = "Jan Sadolewski and Bartosz Trybus", title = "Verification of Control System Runtime Using an Executable Semantic Model", journal = j-ALGORITHMS-BASEL, volume = "17", number = "7", year = "2024", CODEN = "ALGOCH", DOI = "https://doi.org/10.3390/a17070273", ISSN = "1999-4893 (electronic)", ISSN-L = "1999-4893", bibdate = "Fri Aug 30 05:57:31 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/algorithms.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.mdpi.com/1999-4893/17/7/273", abstract = "The paper outlines a methodology for validating the accuracy of a control system's runtime implementation. The runtime takes the form of a virtual machine executing portable code compliant with IEC 61131-3 standards. A formal model, comprising denotational semantics equations, has been devised to specify machine instruction decoding and operations, including arithmetic functions across various data types, arrays, and subprogram calls. The model also encompasses exception-handling mechanisms for runtime errors, such as division by zero and invalid array index access. This denotational model is translated into executable form using the functional $ F \# $ language. Verification involves comparing the actual implementation of the virtual machine against this executable model. Any disparities between the model and implementation indicate deviations from the specification. Implemented within the CPDev engineering environment, this approach ensures consistent and predictable control program execution across different target platforms.", acknowledgement = ack-nhfb, articleno = "273", fjournal = "Algorithms (Basel)", journal-URL = "https://www.mdpi.com/journal/algorithms", } @Article{Sha:2024:HSC, author = "Sai Sha and Chuandong Li and Xiaolin Wang and Zhenlin Wang and Yingwei Luo", title = "Hardware--Software Collaborative Tiered-Memory Management Framework for Virtualization", journal = j-TOCS, volume = "42", number = "1--2", pages = "4:1--4:??", month = may, year = "2024", CODEN = "ACSYEC", DOI = "https://doi.org/10.1145/3639564", ISSN = "0734-2071 (print), 1557-7333 (electronic)", ISSN-L = "0734-2071", bibdate = "Thu May 16 10:49:47 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tocs.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1145/3639564", abstract = "The tiered-memory system can effectively expand the memory capacity for virtual machines (VMs). However, virtualization introduces new challenges specifically in enforcing performance isolation, minimizing context switching, and providing resource overcommit. None of the state-of-the-art designs consider virtualization and address these challenges; we observe that a VM with tiered memory incurs up to a $ 2 \times $ slowdown compared to a DRAM-only VM.\par We propose vTMM, a hardware-software collaborative tiered-memory management framework for virtualization. A key insight in vTMM is to leverage the unique system features in virtualization to meet the above challenges. vTMM automatically determines page hotness and migrates pages between fast and slow memory to achieve better performance. Specially, vTMM optimizes page tracking and migration based on page-modification logging (PML), a hardware-assisted virtualization mechanism, and adaptively distinguishes hot/cold pages through the page ``temperature'' sorting. vTMM also dynamically adjusts fast memory among multi-VMs on demand by using a memory pool. Further, vTMM tracks huge pages at regular-page granularity in hardware and splits/merges pages in software, realizing hybrid-grained page management and optimization. We implement and evaluate vTMM with single-grained page management on an Intel processor, and the hybrid-grained page management on a Sunway processor with hardware mode supporting hardware/software co-designs. Experiments show that vTMM outperforms existing tiered-memory management designs in virtualization.", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Comput. Syst.", articleno = "4", fjournal = "ACM Transactions on Computer Systems", journal-URL = "https://dl.acm.org/loi/tocs", } @Article{Shahid:2024:ONP, author = "Kamal Shahid and Saleem Naseer Ahmad and Syed Tahir Hussain Rizvi", title = "Optimizing Network Performance: a Comparative Analysis of {EIGRP}, {OSPF}, and {BGP} in {IPv6}-Based Load-Sharing and Link-Failover Systems", journal = j-FUTURE-INTERNET, volume = "16", number = "9", pages = "339", day = "20", month = sep, year = "2024", CODEN = "????", DOI = "https://doi.org/10.3390/fi16090339", ISSN = "1999-5903", bibdate = "Mon Sep 30 08:13:31 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/future-internet.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.mdpi.com/1999-5903/16/9/339", abstract = "The purpose of this study is to evaluate and compare how well different routing protocols perform in terms of load sharing, link failover, and overall network performance. Wireshark was used for packet-level analysis, VMWare was used for virtualization, GNS3 was used for network simulation, and Iperf3 was used to measure network performance parameters. Convergence time, packet losses, network jitter, and network delay are the parameters that were selected for assessment. To examine the behaviors of Open Shortest Path First (OSPF) and Enhanced Interior Gateway Routing Protocol (EIGRP) routing protocols in a variety of network settings, a simulated network environment incorporating both protocols along with Border Gateway Protocol (BGP) is created for the research. The setup for the experiment entails simulating different network conditions, such as fluctuating traffic loads and connection failures, to track how the protocols function in dynamic situations. The efficiency metrics for OSPF and EIGRP with BGP are measured and evaluated using the data generated by Wireshark and Iperf3. The results of this research show that EIGRP has a better failover convergence time and packet loss percentage as compared to the OSPF.", acknowledgement = ack-nhfb, journal-URL = "https://www.mdpi.com/journal/futureinternet", } @Article{Sharma:2024:NCM, author = "Sidharth Sharma and Admela Jukan and Aashi Malik and Ashwin Gumaste", title = "A Network Calculus Model for {SFC} Realization and Traffic Bounds Estimation in Data Centers", journal = j-TOIT, volume = "24", number = "4", pages = "21:1--21:??", month = nov, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3700440", ISSN = "1533-5399 (print), 1557-6051 (electronic)", ISSN-L = "1533-5399", bibdate = "Fri Nov 22 08:40:16 MST 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/toit.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1145/3700440", abstract = "Network Function Virtualization (NFV) is a promising technology that can transform how internet service providers deliver their services. However, recent studies have \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Internet Technol.", articleno = "21", fjournal = "ACM Transactions on Internet Technology (TOIT)", journal-URL = "https://dl.acm.org/loi/toit", } @Article{Shi:2024:GAB, author = "Feng Shi", title = "A genetic algorithm-based virtual machine scheduling algorithm for energy-efficient resource management in cloud computing", journal = j-CCPE, volume = "36", number = "22", pages = "e8207:1--e8207:??", day = "10", month = oct, year = "2024", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.8207", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Tue Nov 11 07:14:57 MST 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "Concurr. Comput.", fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", onlinedate = "02 July 2024", } @Article{Shingarov:2024:TDV, author = "Boris Shingarov and Jan Vran{\'y}", title = "Towards a {Dynabook} for verified {VM} construction", journal = j-J-COMPUT-LANG, volume = "80", number = "??", pages = "1--14", month = aug, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1016/j.cola.2024.101275", ISSN = "2665-9182 (print), 2590-1184 (electronic)", ISSN-L = "2590-1184", bibdate = "Mon Sep 29 08:54:40 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/jcomputlang.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S2590118424000182", acknowledgement = ack-nhfb, ajournal = "J. Comput. Lang.", articleno = "101275", fjournal = "Journal of Computer Languages", journal-URL = "https://www.sciencedirect.com/journal/journal-of-computer-languages", } @Article{Silva:2024:EDE, author = "Lucas Silva and Jos{\'e} Metr{\^o}lho and Fernando Ribeiro", title = "Efficient Data Exchange between {WebAssembly} Modules", journal = j-FUTURE-INTERNET, volume = "16", number = "9", pages = "341", day = "20", month = sep, year = "2024", CODEN = "????", DOI = "https://doi.org/10.3390/fi16090341", ISSN = "1999-5903", bibdate = "Mon Sep 30 08:13:31 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/future-internet.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.mdpi.com/1999-5903/16/9/341", abstract = "In the past two decades, there has been a noticeable decoupling of machines and operating systems. In this context, WebAssembly has emerged as a promising alternative to traditional virtual machines. Originally designed for execution in web browsers, it has expanded to executing code in restricted and secure environments, and it stands out for its rapid startup, small footprint, and portability. However, WebAssembly presents significant challenges in data transfer and the management of interactions with the module. Its specification requires each module to have its own memory, resulting in a ``share-nothing'' architecture. This restriction, combined with the limitations of importing and exporting functions that only handle numerical values, and the absence of an application binary interface (ABI) for sharing more complex data structures, leads to efficiency problems; these are exacerbated by the variety of programming languages that can be compiled and executed in the same environment. To address this inefficiency, the Karmem was designed and developed. It includes a new interface description language (IDL) aimed at facilitating the definition of data, functions, and relationships between modules. Additionally, a proprietary protocol---an optimized ABI for efficient data reading and minimal decoding cost---was created. A code generator capable of producing code for various programming languages was also conceived, ensuring harmonious interaction with the ABI and the foreign function interface. Finally, the compact runtime of Karmem, built atop a WebAssembly runtime, enables communication between modules and shared memory. Results of the experiments conducted show that Karmem represents an innovation in data communication for WASM in multiple environments and demonstrates the ability to overcome challenges of efficiency and interoperability.", acknowledgement = ack-nhfb, journal-URL = "https://www.mdpi.com/journal/futureinternet", } @Article{Sousa:2024:HVH, author = "Jo{\~a}o Sousa and Jos{\'e} Martins and Tiago Gomes and Sandro Pinto", title = "{HSP-V}: Hypervisor-Less Static Partitioning for {RISC-V COTS} Platforms", journal = j-IEEE-ACCESS, volume = "12", pages = "71131--71144", year = "2024", DOI = "https://doi.org/10.1109/ACCESS.2024.3399601", ISSN = "2169-3536", bibdate = "Sun Oct 5 10:31:31 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/risc-v.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Access", journal-URL = "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6287639", keywords = "Field programmable gate arrays; Hardware; Interference; Mixed-criticality systems; OpenSBI; Protection; Reduced instruction set computing; RISC-V; Software; static-partitioning; Virtual machine monitors; virtualization; Virtualization", } @Article{Struhar:2024:HRO, author = "V{\'a}clav Struh{\'a}r and Silviu S. Craciunas and Mohammad Ashjaei and Moris Behnam and Alessandro V. Papadopoulos", title = "Hierarchical Resource Orchestration Framework for Real-time Containers", journal = j-TECS, volume = "23", number = "1", pages = "4:1--4:??", month = jan, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1145/3592856", ISSN = "1539-9087 (print), 1558-3465 (electronic)", ISSN-L = "1539-9087", bibdate = "Sat Feb 3 11:10:48 MST 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/tecs.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://dl.acm.org/doi/10.1145/3592856", abstract = "Container-based virtualization is a promising deployment model in fog and edge computing applications, because it allows a seamless co-existence of virtualized applications in a heterogeneous environment without introducing significant overhead. Certain \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Embed. Comput. Syst.", articleno = "4", fjournal = "ACM Transactions on Embedded Computing Systems", journal-URL = "https://dl.acm.org/loi/tecs", } @Article{Sturley:2024:VVC, author = "Hamish Sturley and Augustin Fournier and Andoni Salcedo-Navarro and Miguel Garcia-Pineda and Jaume Segura-Garcia", title = "Virtualization vs. Containerization, a Comparative Approach for Application Deployment in the Computing Continuum Focused on the Edge", journal = j-FUTURE-INTERNET, volume = "16", number = "11", pages = "427", day = "19", month = nov, year = "2024", CODEN = "????", DOI = "https://doi.org/10.3390/fi16110427", ISSN = "1999-5903", bibdate = "Sat Nov 30 05:39:07 MST 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/future-internet.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.mdpi.com/1999-5903/16/11/427", abstract = "With the emergence of containerization 10 years ago, we saw a compact, convenient and portable way of running apps directly concurrently with virtualization. The major difference is in the architecture. Containers share the same kernel as the guest and then do not virtualize low-layer components like the Central Processing Unit (CPU). On the one hand, they are lighter and more flexible than virtual machines (VMs). On the other hand, VMs can more precisely meet the low-layer needs and are completely autonomous systems. Nowadays, what is the best architecture to use to develop an application? In this paper, we will study the two main virtual methods of deploying this. We will compare both methods on several criteria: compatibility based on user experience and the ease of installation/deployment, scalability based on the automatic elasticity facing the workload and energy efficiency in terms of energy and computer resources. After the tests, we conclude that the containerization option is the most ecologically advantageous option in terms of energy consumption.", acknowledgement = ack-nhfb, journal-URL = "https://www.mdpi.com/journal/futureinternet", } @Article{Tian:2024:OPM, author = "Shu-Juan Tian and Ke-Ke Xu and Wen-Jian Ding and Yan-Chun Li and De-Ze Zeng", title = "An offloading and pricing mechanism based on virtualization in edge-cloud computing", journal = j-COMP-NET-AMSTERDAM, volume = "248", number = "??", pages = "??--??", month = jun, year = "2024", CODEN = "????", DOI = "https://doi.org/10.1016/j.comnet.2024.110468", ISSN = "1389-1286 (print), 1872-7069 (electronic)", ISSN-L = "1389-1286", bibdate = "Thu May 30 10:09:31 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/compnetamsterdam2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1389128624003001", acknowledgement = ack-nhfb, articleno = "110468", fjournal = "Computer Networks (Amsterdam, Netherlands: 1999)", journal-URL = "http://www.sciencedirect.com/science/journal/13891286/", } @Article{Wang:2024:OPT, author = "Liang Wang and Jinzhe Yang and Jidong Zhai and Guangwen Yang", title = "Optimizing {I/O} Performance Through Effective {vCPU} Scheduling Interference Management", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "35", number = "12", pages = "2315--2330", month = dec, year = "2024", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2023.3329298", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Thu Oct 17 08:10:54 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "IEEE Trans. Parallel Distrib. Syst.", fjournal = "IEEE Transactions on Parallel and Distributed Systems", journal-URL = "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=71", keywords = "Cloud computing; cloud computing; Dynamic scheduling; I/O performance; Interference; interference diagnosis; Performance evaluation; Processor scheduling; Production; Task analysis; vCPU scheduling; Virtualization", } @Article{Yoo:2024:EAO, author = "Seehwan Yoo and Youngpil Kim and Hyunchan Park and Jaehyun Hwang and Kitak Kim", title = "{enCloud}: Aspect-oriented trusted service migration on {SGX}-enabled cloud {VM}", journal = j-SPE, volume = "54", number = "12", pages = "2454--2480", month = dec, year = "2024", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/spe.3357", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Wed Sep 10 12:02:14 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "Softw. Pract. Exp.", fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", onlinedate = "18 June 2024", } @Article{Younes:2024:DTM, author = "Sana Younes and Maroua Idi and Riadh Robbana", title = "Discrete-time {Markov} decision process for performance analysis of virtual machine allocation schemes in {C-RAN}", journal = j-J-NETW-COMPUT-APPL, volume = "225", number = "??", pages = "??--??", month = may, year = "2024", CODEN = "JNCAF3", DOI = "https://doi.org/10.1016/j.jnca.2024.103859", ISSN = "1084-8045 (print), 1095-8592 (electronic)", ISSN-L = "1084-8045", bibdate = "Wed Apr 10 11:07:43 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1084804524000365", acknowledgement = ack-nhfb, articleno = "103859", fjournal = "Journal of Network and Computer Applications", journal-URL = "http://www.sciencedirect.com/science/journal/10848045", } @Article{Younes:2024:FDA, author = "Sana Younes and Maroua Idi", title = "Formal dependability analysis of fault tolerant {Virtual Machine} allocation strategies in {Cloud Radio Access Network}", journal = j-J-NETW-COMPUT-APPL, volume = "229", number = "??", pages = "??--??", month = sep, year = "2024", CODEN = "JNCAF3", DOI = "https://doi.org/10.1016/j.jnca.2024.103917", ISSN = "1084-8045 (print), 1095-8592 (electronic)", ISSN-L = "1084-8045", bibdate = "Tue Aug 6 13:30:46 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1084804524000948", acknowledgement = ack-nhfb, articleno = "103917", fjournal = "Journal of Network and Computer Applications", journal-URL = "http://www.sciencedirect.com/science/journal/10848045", } @Article{Yousefi:2024:HEA, author = "Malek Yousefi and Seyed Morteza Babamir", title = "A hybrid energy-aware algorithm for virtual machine placement in cloud computing", journal = j-COMPUTING, volume = "106", number = "5", pages = "1297--1320", month = may, year = "2024", CODEN = "CMPTA2", DOI = "https://doi.org/10.1007/s00607-024-01280-3", ISSN = "0010-485X (print), 1436-5057 (electronic)", ISSN-L = "0010-485X", bibdate = "Thu Aug 29 07:24:21 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/computing.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://link.springer.com/article/10.1007/s00607-024-01280-3", acknowledgement = ack-nhfb, ajournal = "Computing", fjournal = "Computing", journal-URL = "http://link.springer.com/journal/607", } @Article{Zhang:2024:AAD, author = "Kai Zhang and Jiahui Hong and Zhengying He and Yinan Jing and X. Sean Wang", title = "{AdaptChain}: Adaptive Data Sharing and Synchronization for {NFV} Systems on Heterogeneous Architectures", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "35", number = "7", pages = "1281--1292", month = jul, year = "2024", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2024.3400594", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Wed Jun 19 16:27:44 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Parallel and Distributed Systems", journal-URL = "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=71", keywords = "Adaptive synchronization; Costs; Data transfer; GPU; Graphics processing units; heterogeneous architecture; Memory management; Network function virtualization; network function virtualization; Noise measurement; Synchronization", } @Article{Zhang:2024:CEV, author = "Zheng Zhang and Jingfeng Xue and Thar Baker and Tian Chen and Yu-an Tan and Yuanzhang Li", title = "{COVER}: Enhancing virtualization obfuscation through dynamic scheduling using flash controller-based secure module", journal = j-COMPUT-SECUR, volume = "146", number = "??", pages = "??--??", month = nov, year = "2024", CODEN = "CPSEDU", DOI = "https://doi.org/10.1016/j.cose.2024.104038", ISSN = "0167-4048 (print), 1872-6208 (electronic)", ISSN-L = "0167-4048", bibdate = "Sat Aug 31 16:23:30 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167404824003432", acknowledgement = ack-nhfb, articleno = "104038", fjournal = "Computers \& Security", journal-URL = "http://www.sciencedirect.com/science/journal/01674048", } @Article{Zhang:2024:IAB, author = "Zongpu Zhang and Chenbo Xia and Cunming Liang and Jian Li and Chen Yu and Tiwei Bie and Roberts Martin and Daly Dan and Xiao Wang and Yong Liu and Haibing Guan", title = "{Un-IOV}: Achieving Bare-Metal Level {I/O} Virtualization Performance for Cloud Usage With Migratability, Scalability and Transparency", journal = j-IEEE-TRANS-COMPUT, volume = "73", number = "7", pages = "1655--1668", month = jul, year = "2024", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.2024.3375589", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Wed Jun 12 15:57:24 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "IEEE Trans. Comput.", fjournal = "IEEE Transactions on Computers", journal-URL = "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", keywords = "Cloud computing; Hardware; I/O virtualization; Kernel; live migration; Performance evaluation; SR-IOV; Switches; Virtual machine monitors; Virtualization", } @Article{Zhao:2024:EML, author = "Xiaotian Zhao and Ruge Xu and Yimin Gao and Vaibhav Verma and Mircea R. Stan and Xinfei Guo", title = "{Edge-MPQ}: Layer-Wise Mixed-Precision Quantization With Tightly Integrated Versatile Inference Units for Edge Computing", journal = j-IEEE-TRANS-COMPUT, volume = "73", number = "11", pages = "2504--2519", month = nov, year = "2024", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.2024.3441860", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Tue Oct 15 13:00:14 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "IEEE Trans. Comput.", fjournal = "IEEE Transactions on Computers", journal-URL = "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", keywords = "Accuracy; ASIP; Computer architecture; Edge inference; Hardware; mixed-precision quantization; Pipelines; PTQ; QAT; Quantization (signal); Training; Virtual machine monitors", } @Article{Zheng:2024:MBA, author = "Luxin Zheng and Jian Zhang and Xiangyi Wang and Faxin Lin and Zheng Meng", title = "Multimodal-based abnormal behavior detection method in virtualization environment", journal = j-COMPUT-SECUR, volume = "143", number = "??", pages = "??--??", month = aug, year = "2024", CODEN = "CPSEDU", DOI = "https://doi.org/10.1016/j.cose.2024.103908", ISSN = "0167-4048 (print), 1872-6208 (electronic)", ISSN-L = "0167-4048", bibdate = "Wed Jun 12 11:39:29 MDT 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167404824002104", acknowledgement = ack-nhfb, articleno = "103908", fjournal = "Computers \& Security", journal-URL = "http://www.sciencedirect.com/science/journal/01674048", } @Article{Ali:2025:OSL, author = "Tassawar Ali and Hikmat Ullah Khan and Babar Nazir and Fawaz Khaled Alarfaj and Mohammed Alreshoodi", title = "Optimizing service level agreement in cloud computing with smart virtual machine scheduling using clustered differential evolution and deep learning", journal = j-J-NETW-COMPUT-APPL, volume = "244", number = "??", pages = "??--??", month = dec, year = "2025", CODEN = "JNCAF3", DOI = "https://doi.org/10.1016/j.jnca.2025.104361", ISSN = "1084-8045 (print), 1095-8592 (electronic)", ISSN-L = "1084-8045", bibdate = "Mon Dec 8 09:40:44 MST 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S1084804525002589", acknowledgement = ack-nhfb, ajournal = "J. Netw. Comput. Appl.", articleno = "104361", fjournal = "Journal of Network and Computer Applications", journal-URL = "http://www.sciencedirect.com/science/journal/10848045", } @Article{Avritzer:2025:SAD, author = "Alberto Avritzer and Andrea Janes and Andrea Marin and Catia Trubiani and Andre van Hoorn and Matteo Camilli and Daniel S. Menasch{\'e} and Andr{\'e} B. Bondi", title = "Software Aging Detection and Rejuvenation Assessment in Heterogeneous Virtual Networks", journal = j-IEEE-TRANS-EMERG-TOP-COMPUT, volume = "13", number = "2", pages = "299--313", year = "2025", DOI = "https://doi.org/10.1109/TETC.2025.3547612", ISSN = "2168-6750 (print), 2376-4562 (electronic)", bibdate = "Tue Sep 9 13:42:38 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransemergtopcomput.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Emerging Topics in Computing", journal-URL = "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6245516", keywords = "Aging; Computational modeling; Degradation; Markov decision processes; Monitoring; Resilience; Scalability; Size measurement; Software; software aging; software rejuvenation; Software resiliency; Virtual machines", } @Article{Baydoun:2025:NCR, author = "Ali Mohammad Baydoun and Ahmed Sherif Zekri", title = "Network-, Cost-, and Renewable-Aware Ant Colony Optimization for Energy-Efficient Virtual Machine Placement in Cloud Datacenters", journal = j-FUTURE-INTERNET, volume = "17", number = "6", pages = "261", day = "14", month = jun, year = "2025", CODEN = "????", DOI = "https://doi.org/10.3390/fi17060261", ISSN = "1999-5903", bibdate = "Thu Oct 2 09:27:55 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/future-internet.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.mdpi.com/1999-5903/17/6/261", abstract = "Virtual machine (VM) placement in cloud datacenters is a complex multi-objective challenge involving trade-offs among energy efficiency, carbon emissions, and network performance. This paper proposes NCRA-DP-ACO (Network-, Cost-, and Renewable-Aware Ant Colony Optimization with Dynamic Power Usage Effectiveness (PUE)), a bio-inspired metaheuristic that optimizes VM placement across geographically distributed datacenters. The approach integrates real-time solar energy availability, dynamic PUE modeling, and multi-criteria decision-making to enable environmentally and cost-efficient resource allocation. The experimental results show that NCRA-DP-ACO reduces power consumption by 13.7\%, carbon emissions by 6.9\%, and live VM migrations by 48.2\% compared to state-of-the-art methods while maintaining Service Level Agreement (SLA) compliance. These results indicate the algorithm's potential to support more environmentally and cost-efficient cloud management across dynamic infrastructure scenarios.", acknowledgement = ack-nhfb, journal-URL = "https://www.mdpi.com/journal/futureinternet", } @Article{Berry:2025:ITI, author = "Christopher Berry and Michael Becht and Tim Bubb and Howard Haynie and Robert Sonnelitter and Katie Seggerman and Jonathan Hsieh and Edward Malley and Mike Cadigan and Susan M. Eickhoff and Matthias Klein and Craig Walters and Christian G. Zoellin and Cedric Lichtenau", title = "The {IBM Telum II} Processor", journal = j-IEEE-MICRO, volume = "45", number = "3", pages = "66--75", month = may # "\slash " # jun, year = "2025", CODEN = "IEMIDZ", DOI = "https://doi.org/10.1109/MM.2025.3563803", ISSN = "0272-1732 (print), 1937-4143 (electronic)", ISSN-L = "0272-1732", bibdate = "Wed Jul 9 16:21:35 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/hot-chips.bib; https://www.math.utah.edu/pub/tex/bib/ieeemicro.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Micro", journal-URL = "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=40", keywords = "Artificial intelligence; Coprocessors; Hardware; Mainframes; Microcontrollers; Microprogramming; Product design; Protocols; Registers; Virtualization", } @Article{Bompotas:2025:CMP, author = "Agorakis Bompotas and Nikitas-Rigas Kalogeropoulos and Christos Makris", title = "{CommC}: a Multi-Purpose {COMModity} Hardware Cluster", journal = j-FUTURE-INTERNET, volume = "17", number = "3", pages = "121", day = "11", month = mar, year = "2025", CODEN = "????", DOI = "https://doi.org/10.3390/fi17030121", ISSN = "1999-5903", bibdate = "Fri Mar 28 06:12:07 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/future-internet.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.mdpi.com/1999-5903/17/3/121", abstract = "The high costs of acquiring and maintaining high-performance computing (HPC) resources pose significant barriers for medium-sized enterprises and educational institutions, often forcing them to rely on expensive cloud-based solutions with recurring costs. This paper introduces CommC, a multi-purpose commodity hardware cluster designed to reduce operational expenses and extend hardware lifespan by repurposing underutilized computing resources. By integrating virtualization (KVM and Proxmox) and containerization (Kubernetes and Docker), CommC creates a scalable, secure, and cost-efficient computing environment. The proposed system enables seamless resource sharing, ensuring high availability and fault tolerance for both containerized and virtualized workloads. To demonstrate its versatility, we deploy big data engines like Apache Spark alongside traditional web services, showcasing CommC's ability to support diverse workloads efficiently. Our cost analysis reveals that CommC reduces computing expenses by up to 77.93\% compared to cloud-based alternatives while also mitigating e-waste accumulation by extending the lifespan of existing hardware. This significantly improves environmental sustainability compared to cloud providers, where frequent hardware turnover contributes to rising carbon emissions. This research contributes to the fields of cloud computing, resource management, and sustainable IT infrastructure by providing a replicable, adaptable, and financially viable alternative to traditional cloud-based solutions. Future work will focus on automating resource allocation, enhancing real-time monitoring, and integrating advanced security mechanisms to further optimize performance and usability.", acknowledgement = ack-nhfb, journal-URL = "https://www.mdpi.com/journal/futureinternet", } @Article{Cerdeira:2025:AOI, author = "David Cerdeira and Jos{\'e} Martins and Nuno Santos and Sandro Pinto", title = "{AnyTEE}: an Open and Interoperable Software Defined {TEE} Framework", journal = j-IEEE-ACCESS, volume = "13", pages = "109983--109998", year = "2025", DOI = "https://doi.org/10.1109/ACCESS.2025.3581487", ISSN = "2169-3536", bibdate = "Sun Oct 5 10:31:31 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/risc-v.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Access", journal-URL = "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6287639", keywords = "Computational modeling; Hardware; intel SGX; Interoperability; Protection; Security; Servers; Software; Switches; system security; Trusted execution environments; TrustZone; Virtual machine monitors; Virtual machines; virtualization", } @Article{Chen:2025:ULH, author = "Zhenqian Chen and Yuchun Zhan and Peng Hu and Xinkui Zhao and Muyu Yang and Siwei Tan and Lufei Zhang and Liqiang Lu and Jianwei Yin and Zuoning Chen", title = "{UKFaaS}: Lightweight, High-Performance and Secure {FaaS} Communication With Unikernel", journal = j-IEEE-TRANS-COMPUT, volume = "74", number = "10", pages = "3305--3318", month = oct, year = "2025", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.2025.3586031", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Wed Sep 24 11:33:47 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "IEEE Trans. Comput.", fjournal = "IEEE Transactions on Computers", journal-URL = "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", keywords = "Containers; Indexes; Kernel; Libraries; library operation system; Optimization; Runtime; Security; serverless computing; Switches; Unikernel; Virtual machine monitors; Virtual machines; virtualization", } @Article{Chevaphatrakul:2025:MMB, author = "Thananont Chevaphatrakul and Han Wang and Sukhpal Singh Gill", title = "{MambaNet0}: {Mamba}-Based Sustainable Cloud Resource Prediction Framework Towards Net Zero Goals", journal = j-FUTURE-INTERNET, volume = "17", number = "10", pages = "480", day = "21", month = oct, year = "2025", CODEN = "????", DOI = "https://doi.org/10.3390/fi17100480", ISSN = "1999-5903", bibdate = "Tue Nov 4 11:31:15 MST 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/future-internet.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.mdpi.com/1999-5903/17/10/480", abstract = "With the ever-growing reliance on cloud computing, efficient resource allocation is crucial for maximising the effective use of provisioned resources from cloud service providers. Proactive resource management is therefore critical for minimising costs and striving for net zero emission goals. One of the most promising methods involves the use of Artificial Intelligence (AI) techniques to analyse and predict resource demand, such as cloud CPU utilisation. This paper presents MambaNet0, a Mamba-based cloud resource prediction framework. The model is implemented on Google's Vertex AI workbench and uses the real-world Bitbrains Grid Workload Archive-T-12 dataset, which contains the resource usage metrics of 1750 virtual machines. The Mamba model's performance is then evaluated against established baseline models, including Autoregressive Integrated Moving Average (ARIMA), Long Short-Term Memory (LSTM), and Amazon Chronos, to demonstrate its potential for accurate prediction of CPU utilisation. The MambaNet0 model achieved a 29\% improvement in Symmetric Mean Absolute Percentage Error (SMAPE) compared to the best-performing baseline Amazon Chronos. These findings reinforce the Mamba model's ability to forecast accurate CPU utilisation, highlighting its potential for optimising cloud resource allocation in contribution to net zero goals.", acknowledgement = ack-nhfb, journal-URL = "https://www.mdpi.com/journal/futureinternet", } @Article{Coppolino:2025:WLW, author = "Luigi Coppolino and Salvatore D'Antonio and Giovanni Mazzeo and Roberto Nardone and Luigi Romano and Mathieu Schmitt", title = "{WASMBOX}: a Lightweight {Wasm}-Based Runtime for Trustworthy Multi-Tenant Embedded Systems", journal = j-IEEE-TRANS-EMERG-TOP-COMPUT, volume = "13", number = "2", pages = "467--480", year = "2025", DOI = "https://doi.org/10.1109/TETC.2024.3409817", ISSN = "2168-6750 (print), 2376-4562 (electronic)", bibdate = "Tue Sep 9 13:42:38 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransemergtopcomput.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Emerging Topics in Computing", journal-URL = "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6245516", keywords = "Anomaly detection; Companies; Containers; Embedded systems; embedded systems; Hardware; multi-tenancy; sandboxing; Security; Software; trusted execution environment; Virtualization; WebAssembly", } @Article{Esmat:2025:PEN, author = "Haitham H. Esmat", title = "Performance Evaluation of Network Slicing in Multi-Domain, Multi-Technology Wireless Networks", journal = j-SIGMETRICS, volume = "53", number = "3", pages = "44--47", month = dec, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3788882.3788900", ISSN = "0163-5999 (print), 1557-9484 (electronic)", ISSN-L = "0163-5999", bibdate = "Wed Jan 14 06:41:57 MST 2026", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigmetrics.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "To meet the growing demand for wireless services with diverse throughput, latency, and reliability requirements, network providers employ virtualization to create multiple virtual networks over a shared physical infrastructure. Network slicing (NS) \ldots{}", acknowledgement = ack-nhfb, ajournal = "Perform. Eval. Rev.", fjournal = "ACM SIGMETRICS Performance Evaluation Review", journal-URL = "https://dl.acm.org/loi/sigmetrics", } @Article{Feng:2025:BEP, author = "Yanchang Feng and Junchao Ma and Haojun Xia and Da Zhang and Bibo Tu", title = "{BLFair}: enabling proportional {I/O} sharing for {NVMe SSD} in {SPDK} para-virtualization architecture", journal = j-COMP-J, volume = "68", number = "8", pages = "953--967", month = aug, year = "2025", CODEN = "CMPJA6", DOI = "https://doi.org/10.1093/comjnl/bxaf016", ISSN = "0010-4620 (print), 1460-2067 (electronic)", ISSN-L = "0010-4620", bibdate = "Thu Aug 21 15:26:43 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/compj2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://academic.oup.com/comjnl/article/68/8/953/8069015", acknowledgement = ack-nhfb, fjournal = "Computer Journal", journal-URL = "http://comjnl.oxfordjournals.org/", } @Article{Ghaseminya:2025:ACV, author = "Mohammad Mahdi Ghaseminya and Elahe Eslami and Seyed Mehdi Karbassi", title = "Advancing cloud virtualization: a comprehensive survey on integrating {IoT}, {Edge}, and {Fog} computing with {FaaS} for heterogeneous smart environments", journal = j-J-SUPERCOMPUTING, volume = "81", number = "14", pages = "??--??", month = sep, year = "2025", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-025-07799-2", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Tue Sep 30 07:53:37 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/jsuper2025.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://link.springer.com/article/10.1007/s11227-025-07799-2", acknowledgement = ack-nhfb, ajournal = "J. Supercomputing", articleno = "1303", fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", online-date = "02 September 2025", } @Article{Gheibi-Fetrat:2025:SSS, author = "Atiyeh Gheibi-Fetrat and Fatemeh Serajeh Hassani and Masoud Mohammadi-Lak and Amir Mirzaei and Negar Akbarzadeh and Mahmoud Reza Kheyrati-Fard and Mohammad Hosseini and Ahmad Javadi Nezhad and Arash Tavakkol and Jeong A. Lee and Hamid Sarbazi-Azad", title = "A survey of {SSD} simulators and emulators", journal = j-J-SUPERCOMPUTING, volume = "81", number = "4", pages = "??--??", month = mar, year = "2025", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-025-07078-0", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Wed Mar 26 17:38:53 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/jsuper2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://link.springer.com/article/10.1007/s11227-025-07078-0", acknowledgement = ack-nhfb, ajournal = "J. Supercomputing", articleno = "592", fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Goyal:2025:AMO, author = "Sahul Goyal and Lalit Kumar Awasthi", title = "Adaptive Multi-Objective Virtual Machine Consolidation for Energy-Efficient Cloud Data Centers", journal = j-J-GRID-COMP, volume = "23", number = "2", pages = "??--??", month = jun, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1007/s10723-025-09808-3", ISSN = "1570-7873 (print), 1572-9184 (electronic)", ISSN-L = "1570-7873", bibdate = "Thu Sep 25 15:54:22 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/jgridcomp.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://link.springer.com/article/10.1007/s10723-025-09808-3", acknowledgement = ack-nhfb, ajournal = "J. Grid Comp.", articleno = "21", fjournal = "Journal of Grid Computing", journal-URL = "http://link.springer.com/journal/10723", online-date = "04 June 2025", } @Article{Huang:2025:ESF, author = "Yaodong Huang and Tingting Yao and Zelin Lin and Xiaojun Shang and Yukun Yuan and Laizhong Cui and Yuanyuan Yang", title = "Efficient Service Function Chain Placement Over Heterogeneous Devices in Deviceless Edge Computing Environments", journal = j-IEEE-TRANS-COMPUT, volume = "74", number = "1", pages = "222--236", month = jan, year = "2025", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.2024.3475590", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Fri Mar 14 07:34:19 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "IEEE Trans. Comput.", fjournal = "IEEE Transactions on Computers", journal-URL = "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", keywords = "Computational modeling; Computers; Delays; deviceless edge computing; Edge computing; Hardware; heterogeneous edge devices; Optimization; Resource management; Servers; Service function chain; Service function chaining; Virtualization", } @Article{Huang:2025:SDF, author = "Zhaoyang Huang and Yifu Zhu and Xin Kuang and Yanjie Tan and Huailiang Tan and Keqin Li", title = "State-driven fairness control for efficient {I/O} queue scheduling in {NVMe} virtualization", journal = j-FUT-GEN-COMP-SYS, volume = "173", number = "??", pages = "??--??", month = dec, year = "2025", CODEN = "FGSEVI", DOI = "https://doi.org/10.1016/j.future.2025.107902", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Sat Jun 7 08:09:07 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X25001979", acknowledgement = ack-nhfb, ajournal = "Future Gener. Comput. Syst.", articleno = "107902", fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Kiaee:2025:JVC, author = "Farkhondeh Kiaee and Ehsan Arianyan", title = "Joint {VM} and container consolidation with auto-encoder based contribution extraction of decision criteria in {Edge--Cloud} environment", journal = j-J-NETW-COMPUT-APPL, volume = "233", number = "??", pages = "??--??", month = jan, year = "2025", CODEN = "JNCAF3", DOI = "https://doi.org/10.1016/j.jnca.2024.104049", ISSN = "1084-8045 (print), 1095-8592 (electronic)", ISSN-L = "1084-8045", bibdate = "Sat Nov 30 06:26:10 MST 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/jnetwcomputappl.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.sciencedirect.com/science/article/pii/S1084804524002261", acknowledgement = ack-nhfb, articleno = "104049", fjournal = "Journal of Network and Computer Applications", journal-URL = "http://www.sciencedirect.com/science/journal/10848045", } @Article{Kishani:2025:EEL, author = "Mostafa Kishani and Sina Ahmadi and Saba Ahmadian and Reza Salkhordeh and Zdenek Becvar and Onur Mutlu and Andr{\'e} Brinkmann and Hossein Asadi", title = "{ELICA}: Efficient and Load Balanced {I/O} Cache Architecture for Hyperconverged Infrastructures", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "36", number = "10", pages = "2152--2168", month = oct, year = "2025", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2025.3592275", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Wed Sep 24 10:13:41 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Parallel and Distributed Systems", journal-URL = "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=71", keywords = "Computer architecture; Dynamic scheduling; Hyperconverged infrastructures (HCIs); I/O cache; I/O traffic; load balancing; Optimization; quality of service; Quality of service; Resource management; Scalability; Servers; Telecommunication traffic; Virtual machine monitors; Virtual machines; virtualization", } @Article{Kwon:2025:CSP, author = "Miryeong Kwon and Donghyun Gouk and Eunjee Na and Jiseon Kim and Junhee Kim and Hyein Woo and Eojin Ryu and Hyunkyu Choi and Jinwoo Baek and Hanyeoreum Bae and Mahmut Kandemir and Myoungsoo Jung", title = "Containerized In-Storage Processing and Computing-Enabled Solid-State Drive Disaggregation", journal = j-IEEE-MICRO, volume = "45", number = "6", pages = "24--35", month = nov # "\slash " # dec, year = "2025", CODEN = "IEMIDZ", DOI = "https://doi.org/10.1109/MM.2025.3574261", ISSN = "0272-1732 (print), 1937-4143 (electronic)", ISSN-L = "0272-1732", bibdate = "Wed Jan 14 15:32:33 2026", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeemicro.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Micro", journal-URL = "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=40", keywords = "Computational modeling; Ethernet; Media; Microprogramming; Nonvolatile memory; Runtime; Storage management; Training; Virtualization", } @Article{Li:2025:DPH, author = "Yinuo Li and Jin-Kao Hao and Liwei Song", title = "Dynamic Bin Packing With Heterogeneous Dependent Bins for Regionless in Geo-Distributed Clouds", journal = j-IEEE-TRANS-COMPUT, volume = "74", number = "11", pages = "3596--3608", month = nov, year = "2025", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.2025.3602297", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Wed Oct 15 16:45:16 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "IEEE Trans. Comput.", fjournal = "IEEE Transactions on Computers", journal-URL = "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", keywords = "Cloud computing; Costs; dynamic online bin packing; Dynamic scheduling; Geo-distributed clouds; Heuristic algorithms; Processor scheduling; Quality of service; resource allocation; Resource management; Servers; simulation based optimization; Uncertainty; Virtual machines", } @Article{Li:2025:REQ, author = "Zhihua Li and Zhaonan Li and Ran Yang and Junhao Qian and Ning Yu", title = "Resource-Efficient and Quality-Aware Virtual Machine Consolidation Method", journal = j-J-GRID-COMP, volume = "23", number = "1", pages = "??--??", month = mar, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1007/s10723-024-09793-z", ISSN = "1570-7873 (print), 1572-9184 (electronic)", ISSN-L = "1570-7873", bibdate = "Wed Mar 26 11:50:39 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/jgridcomp.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://link.springer.com/article/10.1007/s10723-024-09793-z", acknowledgement = ack-nhfb, ajournal = "J. Grid Comp.", articleno = "6", fjournal = "Journal of Grid Computing", journal-URL = "http://link.springer.com/journal/10723", } @Article{Liu:2025:ECN, author = "Tianyi Liu and Zhenfei Zhang and Yuncong Zhang and Wenqing Hu and Ye Zhang", title = "\pkg{Ceno}: Non-uniform, Segment and Parallel Zero-Knowledge Virtual Machine", journal = j-J-CRYPTOLOGY, volume = "38", number = "2", pages = "??--??", month = apr, year = "2025", CODEN = "JOCREQ", DOI = "https://doi.org/10.1007/s00145-024-09533-2", ISSN = "0933-2790 (print), 1432-1378 (electronic)", ISSN-L = "0933-2790", bibdate = "Fri May 9 07:18:26 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/jcryptology.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://link.springer.com/article/10.1007/s00145-024-09533-2", acknowledgement = ack-nhfb, ajournal = "J. Cryptology", articleno = "17", fjournal = "Journal of Cryptology", journal-URL = "http://link.springer.com/journal/145", } @Article{Marevac:2025:FDD, author = "Elmin Marevac and Esad Kadusi{\'c} and Natasa Zivi{\'c} and Nevzudin Buzadija and Samir Lemes", title = "Framework Design for the Dynamic Reconfiguration of {IoT}-Enabled Embedded Systems and ``On-the-Fly'' Code Execution", journal = j-FUTURE-INTERNET, volume = "17", number = "1", pages = "23", day = "7", month = jan, year = "2025", CODEN = "????", DOI = "https://doi.org/10.3390/fi17010023", ISSN = "1999-5903", bibdate = "Tue Feb 4 07:04:57 MST 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/future-internet.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.mdpi.com/1999-5903/17/1/23", abstract = "Embedded systems, particularly when integrated into the Internet of Things (IoT) landscape, are critical for projects requiring robust, energy-efficient interfaces to collect real-time data from the environment. As these systems become complex, the need for dynamic reconfiguration, improved availability, and stability becomes increasingly important. This paper presents the design of a framework architecture that supports dynamic reconfiguration and ``on-the-fly'' code execution in IoT-enabled embedded systems, including a virtual machine capable of hot reloads, ensuring system availability even during configuration updates. A ``hardware-in-the-loop'' workflow manages communication between the embedded components, while low-level coding constraints are accessible through an additional abstraction layer, with examples such as MicroPython or Lua. The study results demonstrate the VM's ability to handle serialization and deserialization with minimal impact on system performance, even under high workloads, with serialization having a median time of 160 microseconds and deserialization having a median of 964 microseconds. Both processes were fast and resource-efficient under normal conditions, supporting real-time updates with occasional outliers, suggesting room for optimization and also highlighting the advantages of VM-based firmware update methods, which outperform traditional approaches like Serial and OTA (Over-the-Air, the ability to update or configure firmware, software, or devices via wireless connection) updates by achieving lower latency and greater consistency. With these promising results, however, challenges like occasional deserialization time outliers and the need for optimization in memory management and network protocols remain for future work. This study also provides a comparative analysis of currently available commercial solutions, highlighting their strengths and weaknesses.", acknowledgement = ack-nhfb, journal-URL = "https://www.mdpi.com/journal/futureinternet", } @Article{Martinez-Morfa:2025:FLS, author = "Mario Mart{\'\i}nez-Morfa and Carlos Ruiz de Mendoza and Cristina Cervell{\'o}-Pastor and Sebastia Sallent-Ribes", title = "Federated Learning System for Dynamic Radio\slash {MEC} Resource Allocation and Slicing Control in Open Radio Access Network", journal = j-FUTURE-INTERNET, volume = "17", number = "3", pages = "106", day = "26", month = feb, year = "2025", CODEN = "????", DOI = "https://doi.org/10.3390/fi17030106", ISSN = "1999-5903", bibdate = "Fri Mar 28 06:12:07 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/future-internet.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.mdpi.com/1999-5903/17/3/106", abstract = "The evolution of cellular networks from fifth-generation (5G) architectures to beyond 5G (B5G) and sixth-generation (6G) systems necessitates innovative solutions to overcome the limitations of traditional Radio Access Network (RAN) infrastructures. Existing monolithic and proprietary RAN components restrict adaptability, interoperability, and optimal resource utilization, posing challenges in meeting the stringent requirements of next-generation applications. The Open Radio Access Network (O-RAN) and Multi-Access Edge Computing (MEC) have emerged as transformative paradigms, enabling disaggregation, virtualization, and real-time adaptability-which are key to achieving ultra-low latency, enhanced bandwidth efficiency, and intelligent resource management in future cellular systems. This paper presents a Federated Deep Reinforcement Learning (FDRL) framework for dynamic radio and edge computing resource allocation and slicing management in O-RAN environments. An Integer Linear Programming (ILP) model has also been developed, resulting in the proposed FDRL solution drastically reducing the system response time. On the other hand, unlike centralized Reinforcement Learning (RL) approaches, the proposed FDRL solution leverages Federated Learning (FL) to optimize performance while preserving data privacy and reducing communication overhead. Comparative evaluations against centralized models demonstrate that the federated approach improves learning efficiency and reduces bandwidth consumption. The system has been rigorously tested across multiple scenarios, including multi-client O-RAN environments and loss-of-synchronization conditions, confirming its resilience in distributed deployments. Additionally, a case study simulating realistic traffic profiles validates the proposed framework's ability to dynamically manage radio and computational resources, ensuring efficient and adaptive O-RAN slicing for diverse and high-mobility scenarios.", acknowledgement = ack-nhfb, journal-URL = "https://www.mdpi.com/journal/futureinternet", } @Article{Mhatre:2025:AGS, author = "Swapneel C. Mhatre and Priya Chandran", title = "Automatic Generation of Simulators for Processors Enhanced for Security in Virtualization", journal = j-IEEE-ACCESS, volume = "13", pages = "11930--11943", year = "2025", DOI = "https://doi.org/10.1109/ACCESS.2025.3529667", ISSN = "2169-3536", bibdate = "Sun Oct 5 10:31:31 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/risc-v.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Access", journal-URL = "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6287639", keywords = "Compiler; Computer architecture; computer architecture; Generators; hypervisor; operating system; Pipelines; Register transfer level; Registers; Security; security in virtualization; simulation; Timing; Virtual machine monitors; Virtual machines; Virtualization", } @Article{Moron:2025:BWE, author = "Konrad Moron and Stefan Wallentowitz", title = "Benchmarking {WebAssembly} for Embedded Systems", journal = j-TACO, volume = "22", number = "3", pages = "83:1--83:21", month = sep, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3736169", ISSN = "1544-3566 (print), 1544-3973 (electronic)", ISSN-L = "1544-3566", bibdate = "Tue Sep 30 09:04:15 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/taco.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "WebAssembly is a modern, low-level virtual machine with designed for improved application performance in web browsers. Recently, WebAssembly gained interest for its use outside the web, for example as a replacement for serverless container runtimes. A \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Archit. Code Optim.", articleno = "83", fjournal = "ACM Transactions on Architecture and Code Optimization (TACO)", journal-URL = "https://dl.acm.org/loi/taco", } @Article{Naji:2025:REC, author = "Hamid Reza Naji and Reza Esmaeili", title = "Reduction of energy consumption in cloud data centers with proper placement of virtual machines", journal = j-J-SUPERCOMPUTING, volume = "81", number = "17", pages = "??--??", month = nov, year = "2025", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-025-08072-2", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Wed Dec 24 08:18:14 MST 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/jsuper2025.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://link.springer.com/article/10.1007/s11227-025-08072-2", acknowledgement = ack-nhfb, ajournal = "J. Supercomputing", articleno = "1590", fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", online-date = "23 November 2025", } @Article{Parsafar:2025:RLB, author = "Parsa Parsafar", title = "A reinforcement learning-based {GWO--RNN} approach for energy efficiency in data centers by minimizing virtual machine migration", journal = j-J-SUPERCOMPUTING, volume = "81", number = "1", pages = "??--??", month = jan, year = "2025", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-024-06510-1", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Thu Feb 13 07:09:33 MST 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/jsuper2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://link.springer.com/article/10.1007/s11227-024-06510-1", acknowledgement = ack-nhfb, ajournal = "J. Supercomputing", articleno = "184", fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Pizzi:2025:VDA, author = "Simeone Pizzi and Samuele Doria and Nicholas Miazzo and Eleonora Losiouk", title = "{VirtualPatch}: Distributing {Android} security patches through {Android} virtualization", journal = j-COMPUT-SECUR, volume = "157", number = "??", pages = "??--??", month = oct, year = "2025", CODEN = "CPSEDU", DOI = "https://doi.org/10.1016/j.cose.2025.104615", ISSN = "0167-4048 (print), 1872-6208 (electronic)", ISSN-L = "0167-4048", bibdate = "Sat Sep 6 07:22:27 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.sciencedirect.com/science/article/pii/S0167404825003049", acknowledgement = ack-nhfb, ajournal = "Comput. Secur.", articleno = "104615", fjournal = "Computers \& Security", journal-URL = "http://www.sciencedirect.com/science/journal/01674048", } @Article{Roselin:2025:DDL, author = "J. Roselin and Israelin J. Insulata", title = "Decentralized dynamic load balancing for virtual machines in cloud computing: a blockchain-enabled system with state channel optimization", journal = j-J-SUPERCOMPUTING, volume = "81", number = "3", pages = "??--??", month = feb, year = "2025", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-025-06922-7", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Wed Feb 19 09:44:27 MST 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/jsuper2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://link.springer.com/article/10.1007/s11227-025-06922-7", acknowledgement = ack-nhfb, ajournal = "J. Supercomputing", articleno = "469", fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Shabestari:2025:IVP, author = "Ehsan Rasoulpour Shabestari and Alireza Shameli-Sendi", title = "An Intelligent {VM} Placement Method for Minimizing Energy Cost and Carbon Emission in Distributed Cloud Data Centers", journal = j-J-GRID-COMP, volume = "23", number = "1", pages = "??--??", month = mar, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1007/s10723-025-09798-2", ISSN = "1570-7873 (print), 1572-9184 (electronic)", ISSN-L = "1570-7873", bibdate = "Wed Mar 26 11:50:39 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/jgridcomp.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://link.springer.com/article/10.1007/s10723-025-09798-2", acknowledgement = ack-nhfb, ajournal = "J. Grid Comp.", articleno = "12", fjournal = "Journal of Grid Computing", journal-URL = "http://link.springer.com/journal/10723", } @Article{Singh:2025:EGC, author = "Radheshyam Singh and Line M. P. Larsen and Eder Ollora Zaballa and Michael St{\"u}bert Berger and Christian Kloch and Lars Dittmann", title = "Enabling Green Cellular Networks: a Review and Proposal Leveraging Software-Defined Networking, Network Function Virtualization, and Cloud-Radio Access Network", journal = j-FUTURE-INTERNET, volume = "17", number = "4", pages = "161", day = "5", month = apr, year = "2025", CODEN = "????", DOI = "https://doi.org/10.3390/fi17040161", ISSN = "1999-5903", bibdate = "Mon Apr 28 09:37:50 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/future-internet.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.mdpi.com/1999-5903/17/4/161", abstract = "The increasing demand for enhanced communication systems, driven by applications such as real-time video streaming, online gaming, critical operations, and Internet-of-Things (IoT) services, has necessitated the optimization of cellular networks to meet evolving requirements while addressing power consumption challenges. In this context, various initiatives undertaken by industry, academia, and researchers to reduce the power consumption of cellular network systems are comprehensively reviewed. Particular attention is given to emerging technologies, including Software-Defined Networking (SDN), Network Function Virtualization (NFV), and Cloud-Radio Access Network (C-RAN), which are identified as key enablers for reshaping cellular infrastructure. Their collective potential to enhance energy efficiency while addressing convergence challenges is analyzed, and solutions for sustainable network evolution are proposed. A conceptual architecture based on SDN, NFV, and C-RAN is presented as an illustrative example of integrating these technologies to achieve significant power savings. The proposed framework outlines an approach to developing energy-efficient cellular networks, capable of reducing power consumption by approximately 40 to 50\% through the optimal placement of virtual network functions.", acknowledgement = ack-nhfb, journal-URL = "https://www.mdpi.com/journal/futureinternet", } @Article{Siruvoru:2025:HMA, author = "Vahini Siruvoru and Shivampeta Aparna", title = "Harmonic Migration Algorithm for Virtual Machine Migration and Switching Strategy in Cloud Computing", journal = j-CCPE, volume = "37", number = "1", pages = "e8320:1--e8320:??", day = "10", month = jan, year = "2025", CODEN = "CCPEBO", DOI = "https://doi.org/10.1002/cpe.8320", ISSN = "1532-0626 (print), 1532-0634 (electronic)", ISSN-L = "1532-0626", bibdate = "Tue Nov 11 07:06:16 MST 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/ccpe2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "Concurr. Comput.", fjournal = "Concurrency and Computation: Practice and Experience", journal-URL = "http://www.interscience.wiley.com/jpages/1532-0626", onlinedate = "29 October 2024", } @Article{Su:2025:SGS, author = "Jianzhong Su and Jiachi Chen and Zhiyuan Fang and Xingwei Lin and Yutian Tang and Zibin Zheng", title = "{SmartOracle}: Generating Smart Contract Oracle via Fine-Grained Invariant Detection", journal = j-IEEE-TRANS-SOFTW-ENG, volume = "51", number = "4", pages = "947--959", month = apr, year = "2025", CODEN = "IESEDJ", DOI = "https://doi.org/10.1109/TSE.2025.3534567", ISSN = "0098-5589 (print), 1939-3520 (electronic)", ISSN-L = "0098-5589", bibdate = "Wed Sep 24 16:34:43 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranssoftweng2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "IEEE Trans. Softw. Eng.", fjournal = "IEEE Transactions on Software Engineering", journal-URL = "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=32", keywords = "Blockchains; Decentralized applications; Detectors; invariant detection; Recording; Research and development; Robustness; Security; Smart contract; Smart contracts; Usability; Virtual machines; vulnerability detection", } @Article{Swain:2025:IVM, author = "Smruti Rekha Swain and Anshu Parashar and Ashutosh Kumar Singh and Chung Nan Lee", title = "An intelligent virtual machine allocation optimization model for energy-efficient and reliable cloud environment", journal = j-J-SUPERCOMPUTING, volume = "81", number = "1", pages = "??--??", month = jan, year = "2025", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-024-06734-1", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Thu Feb 13 07:09:32 MST 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/jsuper2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://link.springer.com/article/10.1007/s11227-024-06734-1", acknowledgement = ack-nhfb, ajournal = "J. Supercomputing", articleno = "237", fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Tan:2025:HPR, author = "Kai Tan and Dongyang Zhan and Lin Ye and Hongli Zhang and Binxing Fang and Zhihong Tian", title = "A high-performance real-time container file monitoring approach based on virtual machine introspection", journal = j-J-SUPERCOMPUTING, volume = "81", number = "1", pages = "??--??", month = jan, year = "2025", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/s11227-024-06779-2", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Thu Feb 13 07:09:31 MST 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/jsuper2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://link.springer.com/article/10.1007/s11227-024-06779-2", acknowledgement = ack-nhfb, ajournal = "J. Supercomputing", articleno = "260", fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", } @Article{Tikhe:2025:FAA, author = "Gajanan Nanaji Tikhe and Pushpinder Singh Patheja", title = "Feature attention assisted convolutional stacked sparse auto-encoder model for intrusion detection in network function virtualization environment", journal = j-COMPUT-SECUR, volume = "157", number = "??", pages = "??--??", month = oct, year = "2025", CODEN = "CPSEDU", DOI = "https://doi.org/10.1016/j.cose.2025.104595", ISSN = "0167-4048 (print), 1872-6208 (electronic)", ISSN-L = "0167-4048", bibdate = "Sat Sep 6 07:22:27 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/computsecur2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.sciencedirect.com/science/article/pii/S0167404825002846", acknowledgement = ack-nhfb, ajournal = "Comput. Secur.", articleno = "104595", fjournal = "Computers \& Security", journal-URL = "http://www.sciencedirect.com/science/journal/01674048", } @Article{Torquato:2025:ETB, author = "Matheus Torquato and Paulo Maciel and Marco Vieira", title = "Evaluation of time-based virtual machine migration as moving target defense against host-based attacks", journal = j-J-SYST-SOFTW, volume = "219", number = "??", pages = "??--??", month = jan, year = "2025", CODEN = "JSSODM", DOI = "https://doi.org/10.1016/j.jss.2024.112222", ISSN = "0164-1212 (print), 1873-1228 (electronic)", ISSN-L = "0164-1212", bibdate = "Thu Nov 7 07:42:59 MST 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/jsystsoftw2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0164121224002668", acknowledgement = ack-nhfb, articleno = "112222", fjournal = "Journal of Systems and Software", journal-URL = "http://www.sciencedirect.com/science/journal/01641212", } @Article{Wang:2025:BEC, author = "Yicheng Wang and Lijie Xu and Tian Guo and Wensheng Dou and Hongbin Zeng and Wei Wang and Jun Wei and Tao Huang", title = "{BridgeGC}: an Efficient Cross-Level Garbage Collector for Big Data Frameworks", journal = j-TACO, volume = "22", number = "2", pages = "68:1--68:??", month = jun, year = "2025", CODEN = "????", DOI = "https://doi.org/10.1145/3722110", ISSN = "1544-3566 (print), 1544-3973 (electronic)", ISSN-L = "1544-3566", bibdate = "Thu Jul 3 06:51:03 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2020.bib; https://www.math.utah.edu/pub/tex/bib/taco.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Popular big data frameworks commonly run atop Java Virtual Machine (JVM) and rely on garbage collection (GC) mechanism to automatically allocate/reclaim in-memory objects. Existing garbage collectors are designed based on the hypothesis that most objects are short lived. However, big data frameworks usually generate many long-lived data objects, which can cause heavy GC overhead. Recent approaches have reduced GC overhead in big data frameworks but still suffer from heavy human efforts, additional runtime overhead, or suboptimal GC efficiency.\par This article describes the design of BridgeGC, a big-data-friendly garbage collector that significantly reduces GC overhead introduced by long-lived data objects. BridgeGC follows a cross-level co-design. At the big data framework level, BridgeGC provides two annotations for framework developers to denote the creation and release of data objects. Based on the annotations, BridgeGC tracks the lifecycles of annotated data objects and optimizes their allocation/reclamation at the GC level. At the GC level, we design a label-based allocator that stores data objects separately from other objects and balances their memory usage in the same JVM, leading to fewer GC cycles. We further design an efficient collector to eliminate unnecessary marking and copying of data objects during GC cycles, lowering the GC time. We have integrated BridgeGC into OpenJDK ZGC. The extensive evaluation, using two popular big data frameworks (Flink and Spark) and a key--value database (Cassandra), shows that BridgeGC achieves 31--82\% GC time reduction compared to the baseline ZGC. BridgeGC also outperforms other traditional and academic garbage collectors in end-to-end performance.", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Archit. Code Optim.", articleno = "68", fjournal = "ACM Transactions on Architecture and Code Optimization (TACO)", journal-URL = "https://dl.acm.org/loi/taco", } @Article{Wang:2025:TDV, author = "Dan Wang and Jinjiang Wang and Xize Liu and Junyang Yu and Hangyu Gu and Congyang Wang and Jinghan Liu and Yanhao Zhang", title = "Towards dynamic virtual machine placement based on safety parameters and resource utilization fluctuation for energy savings and {QoS} improvement in cloud computing", journal = j-FUT-GEN-COMP-SYS, volume = "171", number = "??", pages = "??--??", month = oct, year = "2025", CODEN = "FGSEVI", DOI = "https://doi.org/10.1016/j.future.2025.107853", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Tue May 13 06:32:24 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X25001487", acknowledgement = ack-nhfb, ajournal = "Future Gener. Comput. Syst.", articleno = "107853", fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Wei:2025:EEM, author = "Wenting Wei and Huaxi Gu and Zhe Xiao and Yi Chen", title = "Energy Efficient and Multi-Resource Optimization for Virtual Machine Placement by Improving {MOEA/D}", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "36", number = "6", pages = "1087--1099", month = jun, year = "2025", CODEN = "ITDSEO", DOI = "https://doi.org/10.1109/TPDS.2025.3538525", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Wed May 14 14:40:09 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "IEEE Trans. Parallel Distrib. Syst.", fjournal = "IEEE Transactions on Parallel and Distributed Systems", journal-URL = "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=71", keywords = "bi-objective optimization; Cloud computing; Computational modeling; Costs; Data centers; Energy consumption; energy efficiency; multi-resource balance; Optimization; Power demand; Resource management; Servers; Virtual machine placement; Virtual machines", } @Article{Wen:2025:TER, author = "Xiaoqing Wen and Quanbi Feng and Hanzheng Lyu and Jianyu Niu and Yinqian Zhang and Chen Feng", title = "{TeeRollup}: Efficient Rollup Design Using Heterogeneous {TEE}", journal = j-IEEE-TRANS-COMPUT, volume = "74", number = "10", pages = "3546--3558", month = oct, year = "2025", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.2025.3596698", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Wed Sep 24 11:33:47 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "IEEE Trans. Comput.", fjournal = "IEEE Transactions on Computers", journal-URL = "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", keywords = "Blockchain; Blockchains; Costs; Delays; Metadata; rollup; Scalability; scalability; Security; Smart contracts; Throughput; Training; trusted execution environment; Virtual machines", } @Article{Xue:2025:HAV, author = "Yuqi Xue and Yiqi Liu and Lifeng Nai and Jian Huang", title = "Hardware-Assisted Virtualization of Neural Processing Units for Cloud Platforms", journal = j-IEEE-MICRO, volume = "45", number = "4", pages = "29--36", month = jul # "\slash " # aug, year = "2025", CODEN = "IEMIDZ", DOI = "https://doi.org/10.1109/MM.2025.3574630", ISSN = "0272-1732 (print), 1937-4143 (electronic)", ISSN-L = "0272-1732", bibdate = "Thu Oct 2 11:21:26 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeemicro.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "IEEE Micro", fjournal = "IEEE Micro", journal-URL = "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=40", keywords = "Bandwidth; Cloud computing; Computational modeling; Computer architecture; Dynamic scheduling; Hardware; Hardware acceleration; Processor scheduling; Resource management; Tensors; Virtualization", } @Article{Yang:2025:TDV, author = "Ran Yang and Zhaonan Li and Junhao Qian and Zhihua Li", title = "Task-Driven Virtual Machine Optimization Placement Model and Algorithm", journal = j-FUTURE-INTERNET, volume = "17", number = "2", pages = "73", day = "7", month = feb, year = "2025", CODEN = "????", DOI = "https://doi.org/10.3390/fi17020073", ISSN = "1999-5903", bibdate = "Fri Feb 28 06:11:52 MST 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/future-internet.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "https://www.mdpi.com/1999-5903/17/2/73", abstract = "In cloud data centers, determining how to balance the interests of the user and the cloud service provider is a challenging issue. In this study, a task-loading-oriented virtual machine (VM) optimization placement model and algorithm is proposed integrating consideration of both VM placement and the user's computing requirements. First, the VM placement is modeled as a multi-objective optimization problem to minimize the makespan of the loading tasks, user rental costs, and energy consumption of cloud data centers; then, an improved chaos-elite NSGA-III (CE-NSGAIII) algorithm is presented by casting the logistic mapping-based population initialization (LMPI) and the elite-guided algorithm in NSGA-III; finally, the presented CE-NSGAIII is employed to solve the aforementioned optimization model, and further, through combination of the above sub-algorithms, a CE-NSGAIII-based VM placement method is developed. The experiment results show that the Pareto solution set obtained using the CE-NSGAIII exhibits better convergence and diversity than those of the compared algorithms and yields an optimized VM placement scheme with shorter makespan, less user rental costs, and lower energy consumption.", acknowledgement = ack-nhfb, journal-URL = "https://www.mdpi.com/journal/futureinternet", } @Article{Zahedi:2025:BEI, author = "Mahdi Zahedi and Taha Shahroodi and Carlos Escuin and Georgi Gaydadjiev and Stephan Wong and Said Hamdioui", title = "{BCIM}: Efficient Implementation of Binary Neural Network Based on Computation in Memory", journal = j-IEEE-TRANS-EMERG-TOP-COMPUT, volume = "13", number = "2", pages = "395--408", year = "2025", DOI = "https://doi.org/10.1109/TETC.2024.3406628", ISSN = "2168-6750 (print), 2376-4562 (electronic)", bibdate = "Tue Sep 9 13:42:38 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetransemergtopcomput.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Emerging Topics in Computing", journal-URL = "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6245516", keywords = "Binary neural network; computation-in-memory; Energy efficiency; energy-efficient accelerator; Hardware; Memory management; memristor; Memristors; Performance evaluation; Sensors; Virtual machine monitors", } @Article{Zhang:2025:TCS, author = "Zhihao Zhang and Weinan Liu and Zhenlong Song and Xinbiao Gan and Yue Yu and Yiming Zhang", title = "Tiered Cache-Sharing Service for Virtual Machine Images Based on Memory Pool", journal = j-IEEE-MICRO, volume = "45", number = "6", pages = "65--72", month = nov # "\slash " # dec, year = "2025", CODEN = "IEMIDZ", DOI = "https://doi.org/10.1109/MM.2025.3574139", ISSN = "0272-1732 (print), 1937-4143 (electronic)", ISSN-L = "0272-1732", bibdate = "Wed Jan 14 15:32:33 2026", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeemicro.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, fjournal = "IEEE Micro", journal-URL = "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=40", keywords = "Cloud computing; Data centers; Informatics; Memory management; Redundancy; Servers; Virtual machines; Virtualization", } @Article{Zhang:2025:TEA, author = "Da Zhang and Haojun Xia and Xiaotong Wang and Yanchang Feng and Haohao Liu and Bibo Tu", title = "Thermal Elasticity-Aware Host Resource Provision for Carbon Efficiency on Virtualized Servers", journal = j-IEEE-TRANS-COMPUT, volume = "74", number = "11", pages = "3682--3695", month = nov, year = "2025", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.2025.3603698", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Wed Oct 15 16:45:16 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "IEEE Trans. Comput.", fjournal = "IEEE Transactions on Computers", journal-URL = "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", keywords = "carbon efficiency; Cooling; Data centers; dynamic power and thermal management; energy efficiency; Energy efficiency; Resource management; Runtime; Servers; Thermal management; Thermal stresses; Tuning; Virtual machines; Virtualized server", } @Article{Ahmad:2026:IRI, author = "Raza Ahmad and Naga Nithin Manne and Tanu Malik", title = "Improving reproducibility of interactive notebooks using application virtualization", journal = j-FUT-GEN-COMP-SYS, volume = "175", number = "??", pages = "??--??", month = feb, year = "2026", CODEN = "FGSEVI", DOI = "https://doi.org/10.1016/j.future.2025.108043", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Mon Nov 3 14:04:14 MST 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X25003383", acknowledgement = ack-nhfb, ajournal = "Future Gener. Comput. Syst.", articleno = "108043", fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Deng:2026:SWA, author = "Quanfeng Deng and Jing Wu and Qiangyu Pei and Chuangxun Lin and Chen Yu and Hai Jin", title = "{Sonnet}: a Workflow-Aware Serverless Platform for Time-Sensitive Edge Computing With {WebAssembly}", journal = j-IEEE-TRANS-COMPUT, volume = "75", number = "1", pages = "395--408", month = jan, year = "2026", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.2025.3628246", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Tue Dec 23 07:42:14 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "IEEE Trans. Comput.", fjournal = "IEEE Transactions on Computers", journal-URL = "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", keywords = "Cloud gaming; Containers; Edge computing; edge computing; function scheduling; Real-time systems; Security; Serverless; Serverless computing; Surges; Throughput; Virtual machines; WebAssembly; Webassembly", } @Article{Lambert:2026:CVM, author = "Simon Lambert and Eddy Caron and Laurent Lefevre and R{\'e}mi Grivel", title = "Consolidation of virtual machines to reduce energy consumption of data centers by using ballooning, sharing and swapping mechanisms", journal = j-FUT-GEN-COMP-SYS, volume = "174", number = "??", pages = "??--??", month = jan, year = "2026", CODEN = "FGSEVI", DOI = "https://doi.org/10.1016/j.future.2025.107968", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Tue Sep 30 13:08:59 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X25002638", acknowledgement = ack-nhfb, ajournal = "Future Gener. Comput. Syst.", articleno = "107968", fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Ma:2026:TAV, author = "Donglai Ma and Xiaoyu Cao and Jianchen Hu and Tianyi Xia and Yuzhou Zhou and Kang Liu and Lei Zhu and Li Su and Feng Gao", title = "Topology-aware virtual machine placement for improving cloud servers resource utilization", journal = j-FUT-GEN-COMP-SYS, volume = "179", number = "??", pages = "??--??", month = jun, year = "2026", CODEN = "FGSEVI", DOI = "https://doi.org/10.1016/j.future.2025.108361", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Tue Jan 27 15:18:42 MST 2026", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X25006557", acknowledgement = ack-nhfb, ajournal = "Future Gener. Comput. Syst.", articleno = "108361", fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Perez-Cerrolaza:2026:VTD, author = "Jon Perez-Cerrolaza and Patricia Balbastre and Enrico Mezzetti and Alfons Crespo and Jon Gonz{\'a}lez Eguiluz and Miguel Martin Acosta and Charles-Alexis Lefebvre", title = "Virtualization Technology for Dependable Embedded Systems: a Survey for Transportation and Industrial Domains", journal = j-COMP-SURV, volume = "58", number = "4", pages = "108:1--108:37", month = mar, year = "2026", CODEN = "CMSVAN", DOI = "https://doi.org/10.1145/3765736", ISSN = "0360-0300 (print), 1557-7341 (electronic)", ISSN-L = "0360-0300", bibdate = "Fri Dec 5 09:55:50 MST 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/compsurv.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Next-generation transportation and industrial systems are characterized by a continuously increasing number of integrated software functionalities and computational performance requirements. Nevertheless, there is also a need to reduce the cost, number, \ldots{}", acknowledgement = ack-nhfb, ajournal = "ACM Comput. Surv.", articleno = "108", fjournal = "ACM Computing Surveys", journal-URL = "https://dl.acm.org/loi/csur", } @Article{Prades:2026:EPG, author = "Javier Prades and Carlos Rea{\~n}o and Federico Silla", title = "Enhancing the performance of {GPU} acceleration in virtual environments: Thoroughly benchmarking the rigidity of mediated device passthrough", journal = j-FUT-GEN-COMP-SYS, volume = "174", number = "??", pages = "??--??", month = jan, year = "2026", CODEN = "FGSEVI", DOI = "https://doi.org/10.1016/j.future.2025.107944", ISSN = "0167-739X (print), 1872-7115 (electronic)", ISSN-L = "0167-739X", bibdate = "Tue Sep 30 13:08:59 MDT 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/futgencompsys2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0167739X25002390", acknowledgement = ack-nhfb, ajournal = "Future Gener. Comput. Syst.", articleno = "107944", fjournal = "Future Generation Computer Systems", journal-URL = "http://www.sciencedirect.com/science/journal/0167739X", } @Article{Wang:2026:TTP, author = "Li Wang and Shi Qiu and Jianqin Yan and Zhirong Shen and Qingbo Wu and Xin Yao and Meiling Wang and Renhai Chen and Yiming Zhang", title = "A Tale of Two Paths: Optimizing Paravirtualized Storage {I/O} with {eBPF}", journal = j-TOS, volume = "22", number = "1", pages = "6:1--6:24", month = feb, year = "2026", CODEN = "????", DOI = "https://doi.org/10.1145/3760404", ISSN = "1553-3077 (print), 1553-3093 (electronic)", ISSN-L = "1553-3077", bibdate = "Mon Feb 2 08:42:48 MST 2026", bibsource = "https://www.math.utah.edu/pub/tex/bib/tos.bib", abstract = "KVM is the dominant VM hypervisor on Linux, and relies on QEMU to realize the backends of the virtio family of devices such as virtio-blk. However, KVM/QEMU-based paravirtualization prolongs the guest I/O path with multiple context switches. As fast NVMe storage devices have been widely used, the software overhead becomes non-negligible. To shorten the I/O path, virtio-blk's variations, vhost-kernel-blk and vhost-user-blk, respectively perform all guest I/O processing in kernel and user spaces. Unfortunately, they essentially forsake the collaboration between KVM and QEMU, sacrifice important QEMU features including live migration, snapshots, and flexible image format support. This article presents EXO, an extension of virtio-blk for efficient KVM/QEMU-based storage paravirtualization. The insight is that no matter how complex the QEMU backend's processing is, to handle a guest I/O request, the host storage stack only needs to know the request's guest-to-host address mapping. Therefore, we preserve the original slow I/O path of virtio-blk as a fallback, and leverage eBPF to introduce an in-kernel fast path that directly queries the address mapping without switching to the user-space backend processing. Extensive evaluation shows that EXO achieves similar or even higher performance compared to the variations (vhost-kernel-blk/vhost-user-blk) of virtio-blk, while preserving virtio-blk's flexibility, safety, and compatibility.", acknowledgement = ack-nhfb, articleno = "6", fjournal = "ACM Transactions on Storage", journal-URL = "https://dl.acm.org/loi/tos", } @Article{Xiong:2026:DDL, author = "Chenglai Xiong and Junjie Wen and Guoqi Xie and Zhongjia Wang and Zhenli He and Shaowen Yao and Jianfeng Tan and Tianyu Zhou and Tiwei Bie and Yan Yan and Shoumeng Yan", title = "{DCS3}: a Dual-Layer Co-Aware Scheduler With Stealing Balance and Synchronized Priority in Virtualization Environments", journal = j-IEEE-TRANS-COMPUT, volume = "75", number = "1", pages = "365--379", month = jan, year = "2026", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.2025.3628012", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Tue Dec 23 07:42:14 2025", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput2020.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, ajournal = "IEEE Trans. Comput.", fjournal = "IEEE Transactions on Computers", journal-URL = "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", keywords = "Bidirectional coordination; Central Processing Unit; Containers; dual-layer co-aware scheduling; Job shop scheduling; Load management; Processor scheduling; Runtime; Semantics; Synchronization; Throughput; Virtual machine monitors; virtualization environments", } @Article{Zheng:2026:EJG, author = "Kai Zheng and Zan Wang and Yingquan Zhao and Junjie Chen and Hanmo You and Haoyu Wang and Yiheng Du and Tianchang Gao", title = "Exploring {JVM} Garbage Collector Testing with Event-Coverage", journal = j-TOSEM, volume = "35", number = "2", pages = "52:1--52:38", month = feb, year = "2026", CODEN = "ATSMER", DOI = "https://doi.org/10.1145/3733598", ISSN = "1049-331X (print), 1557-7392 (electronic)", ISSN-L = "1049-331X", bibdate = "Tue Feb 3 06:21:48 MST 2026", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2020.bib; https://www.math.utah.edu/pub/tex/bib/tosem.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", abstract = "Garbage Collection (GC) in the Java Virtual Machine (JVM) serves as an automatic memory management mechanism, efficiently reclaiming unused memory space in different production scenarios. To optimize JVM performance, developers typically fine-tune the garbage collector by identifying an optimal set of GC configurations for specific scenarios. Despite the sophisticated design of garbage collectors, they still have the potential for bugs in different settings, and these bugs can result in more severe consequences. Hence, comprehensive testing of these garbage collectors is imperative before their release. Code coverage criteria are typically employed to assess the comprehensiveness of a test suite. However, traditional code coverage metrics, such as branch coverage, are hardly applicable for GC testing due to their inherent concurrency. Additionally, existing JVM testing techniques do not adequately consider the characteristics of garbage collectors, making it difficult to test these garbage collectors sufficiently. In this article, we make the first effort to design coverage criteria against garbage collectors based on the events of GC called Event-Coverage. Its key insight is to measure the diversity of GC executions for testing purposes by assessing the range of GC events these executions cover. Furthermore, we design a new testing method for maximizing Event-Coverage called GCFuzz. GCFuzz conducts an exhaustive investigation of the memory state space of GC and thoroughly explores the memory state under various GC configurations. To enhance GCFuzz's efficiency in achieving higher Event-Coverage, we have further designed a coverage-driven strategy for preserving candidate seed programs and selecting GC configurations. Extensive evaluations demonstrate a positive correlation between Event-Coverage and the bug-revealing efficiency. Moreover, GCFuzz outperforms state-of-the-art techniques in detecting unique GC-related inconsistencies and achieving higher Event-Coverage. Remarkably, GCFuzz has identified 20 previously undetected GC bugs, with 15 of them already confirmed or fixed by developers.", acknowledgement = ack-nhfb, ajournal = "ACM Trans. Softw. Eng. Methodol.", articleno = "52", fjournal = "ACM Transactions on Software Engineering and Methodology", journal-URL = "https://dl.acm.org/loi/tosem", } %%% ==================================================================== %%% Cross-referenced entries must come last; entries are sorted by year, %%% and then by citation label, with `bibsort --byyear': @Proceedings{ACM:1975:PFS, editor = "{ACM}", booktitle = "{Proceedings of the Fifth Symposium on Operating System Principles, November 19--21, 1975, The University of Texas at Austin, Austin, Texas, USA}", title = "{Proceedings of the Fifth Symposium on Operating System Principles, November 19--21, 1975, The University of Texas at Austin, Austin, Texas, USA}", volume = "9(5)", publisher = pub-ACM, address = pub-ACM:adr, pages = "????", year = "1975", CODEN = "OSRED8", ISSN = "0163-5980 (print), 1943-586X (electronic)", bibdate = "Mon Apr 10 09:00:42 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", series = j-OPER-SYS-REV, acknowledgement = ack-nhfb, annote = "I: Virtual memory algorithms II: Protection and security III: Case studies IV: Network operating systems V: Virtual machines VI: Correctness and reliability VII: System design VIII: The Hydra operating system IX: Processor scheduling X: Security and protection XI: Memory measurement and modelling", descriptor = "Betriebssystem, Hydra-Betriebssystem, Netzwerk-Betriebssystem, Prozessorvergabe, Scheduling, Speicher, Systementwurf, Virtuelle Maschine, Virtueller Speicher", xxnote = "Check editor??", } @Proceedings{Muhlbacher:1975:GIF, editor = "J{\"o}rg M{\"u}hlbacher", booktitle = "{GI} --- 5. [i.e. funfte] Jahrestagung: Dortmund, 8.--10. Oktober 1975", title = "{GI} --- 5. [i.e. funfte] Jahrestagung: Dortmund, 8.--10. Oktober 1975", volume = "34", publisher = pub-SV, address = pub-SV:adr, pages = "x + 755", year = "1975", CODEN = "LNCSD9", ISBN = "0-387-07410-4", ISBN-13 = "978-0-387-07410-8", ISSN = "0302-9743 (print), 1611-3349 (electronic)", LCCN = "QA267.A1 L43 no.34", bibdate = "Fri Apr 12 07:13:21 1996", bibsource = "ftp://ftp.math.utah.edu/pub/bibnet/authors/g/gebhardt-friedrich.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "English or German.", series = ser-LNCS, keywords = "electronic data processing --- congresses; electronic digital computers --- congresses; programming languages (electronic computers) --- congresses", } @Proceedings{ACM:1981:ASC, editor = "{ACM}", booktitle = "{ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, University of Nevada, Las Vegas, Nevada, USA, September 14--16, 1981, Proceedings}", title = "{ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, University of Nevada, Las Vegas, Nevada, USA, September 14--16, 1981, Proceedings}", volume = "10(3)", publisher = pub-ACM, address = pub-ACM:adr, month = "Fall", year = "1981", ISBN = "????", ISBN-13 = "????", LCCN = "????", bibdate = "Mon Apr 10 11:59:38 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", series = "Performance Evaluation Review", acknowledgement = ack-nhfb, } @Proceedings{Martin:1981:RFS, editor = "Thea Martin", booktitle = "{1981 Rochester FORTH Standards Conference, May 12--15, 1981}", title = "{1981 Rochester FORTH Standards Conference, May 12--15, 1981}", publisher = "The Institute for Applied Forth Research, Inc.", address = "70 Elmwood Avenue, Rochester, New York 14611, USA", pages = "378", year = "1981", ISBN = "????", ISBN-13 = "????", LCCN = "QA76.73.F24 R63 1981", bibdate = "Mon Apr 10 08:08:04 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, } @Proceedings{STUG:1983:PUA, editor = "{Software Tools Users Group}", booktitle = "{Proceedings: USENIX Association [and] Software Tools Users Group Summer Conference, Toronto 1983, July 1983, Toronto, Ontario, Canada}", title = "{Proceedings: USENIX Association [and] Software Tools Users Group Summer Conference, Toronto 1983, July 1983, Toronto, Ontario, Canada}", publisher = pub-USENIX, address = pub-USENIX-EL-CERRITO:adr, pages = "xii + 443", year = "1983", ISBN = "????", ISBN-13 = "????", LCCN = "QA76.8.U65 U74 1983", bibdate = "Mon Oct 26 08:42:38 1998", bibsource = "ftp://ftp.math.utah.edu/pub/bibnet/authors/a/turing-alan-mathison.bib; ftp://ftp.math.utah.edu/pub/tex/bib/usenix1980.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "Sponsored by USENIX Association in cooperation with Software Tools Users Group.", acknowledgement = ack-nhfb, keywords = "UNIX (computer operating system) --- congresses", } @Proceedings{IEEE:1984:DE, editor = "{IEEE}", booktitle = "{Proceedings of the First International Conference on Data Engineering, Los Angeles, CA, USA}", title = "{Proceedings of the First International Conference on Data Engineering, Los Angeles, CA, USA}", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "xiii + 630", year = "1984", ISBN = "0-8186-0533-2 (paperback), 0-8186-8533-6 (hard), 0-8186-4533-4 (microfiche)", ISBN-13 = "978-0-8186-0533-8 (paperback), 978-0-8186-8533-0 (hard), 978-0-8186-4533-4 (microfiche)", LCCN = "QA76.9.D3 I5582 1984", bibdate = "Mon Apr 10 09:49:54 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; melvyl.cdlib.org:210/CDL90", acknowledgement = ack-nhfb, subject = "Database management; Congresses; Computer architecture", } @Proceedings{IEEE:1984:PSS, editor = "{IEEE}", booktitle = "{Proceedings of the 1984 Symposium on Security and Privacy, April 29--May 2, 1984, Oakland, California}", title = "{Proceedings of the 1984 Symposium on Security and Privacy, April 29--May 2, 1984, Oakland, California}", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "vi + 227", year = "1984", ISBN = "0-8186-0532-4 (paperback), 0-8186-8532-8 (hard), 0-8186-4532-6 (microfiche)", ISBN-13 = "978-0-8186-0532-1 (paperback), 978-0-8186-8532-3 (hard), 978-0-8186-4532-7 (microfiche)", LCCN = "QA76.9.A25 S95 1984", bibdate = "Mon Apr 10 09:22:10 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; melvyl.cdlib.org:210/CDL90", acknowledgement = ack-nhfb, meetingname = "Symposium on Security and Privacy (1984: Oakland, Calif.)", subject = "Computers; Access control; Congresses; Data protection; Privacy, Right of", } @Proceedings{IEEE:1985:CPA, editor = "{IEEE}", booktitle = "{Conference proceedings: the 12th Annual International Symposium on Computer Architecture, June 17--19, 1985, Boston, Massachusetts}", title = "{Conference proceedings: the 12th Annual International Symposium on Computer Architecture, June 17--19, 1985, Boston, Massachusetts}", volume = "13(3)", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "xiv + 428", month = jun, year = "1985", ISBN = "0-8186-0634-7, 0-8186-4634-9, 0-8186-8634-0", ISBN-13 = "978-0-8186-0634-2, 978-0-8186-4634-8, 978-0-8186-8634-4", LCCN = "QA76.9.A73; QA76.9.A73 C65; QA76.9.A73 S97 1985; QA76.9.A73 I56 1985", bibdate = "Mon Apr 10 12:04:13 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; melvyl.cdlib.org:210/CDL90", series = "SIGARCH newsletter", acknowledgement = ack-nhfb, meetingname = "International Symposium on Computer Architecture (12th: 1985: Boston, Mass.)", remark = "ACM order number 415850. IEEE catalog number 85CH2144-4. IEEE Computer Society order number 634.", subject = "Computer architecture; Congresses", } @Proceedings{Jouannaud:1985:FPL, editor = "Jean-Pierre Jouannaud", booktitle = "{Functional programming languages and computer architecture: Nancy, France, September 1985}", title = "{Functional programming languages and computer architecture: Nancy, France, September 1985}", volume = "201", publisher = pub-SV, address = pub-SV:adr, pages = "vi + 413", year = "1985", CODEN = "LNCSD9", ISBN = "0-387-15975-4 (paperback)", ISBN-13 = "978-0-387-15975-1 (paperback)", ISSN = "0302-9743 (print), 1611-3349 (electronic)", LCCN = "QA267.A1 L43 no.201", bibdate = "Fri Apr 12 07:14:49 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", series = ser-LNCS, URL = "http://link.springer-ny.com/link/service/series/0558/tocs/t0201.htm; http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=201", acknowledgement = ack-nhfb, keywords = "computer architecture --- congresses; functional programming languages --- congresses", } @Proceedings{USENIX:1985:SCP, editor = "{USENIX Association}", booktitle = "{Summer conference proceedings, Portland 1985: June 11--14, 1985, Portland, Oregon, USA}", title = "{Summer conference proceedings, Portland 1985: June 11--14, 1985, Portland, Oregon, USA}", publisher = pub-USENIX, address = pub-USENIX-EL-CERRITO:adr, pages = "viii + 612", year = "1985", LCCN = "QA76.8.U65 U8 1985", bibdate = "Sun Feb 18 07:46:09 MST 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, keywords = "UNIX (Computer operating system) --- Congresses.", remark = "Spine title: USENIX Conference proceedings.", } @Proceedings{USENIX:1986:SCP, editor = "{USENIX Association}", booktitle = "{Summer conference proceedings, Atlanta 1986: June 9--13, 1986, Atlanta, Georgia, USA}", title = "{Summer conference proceedings, Atlanta 1986: June 9--13, 1986, Atlanta, Georgia, USA}", publisher = pub-USENIX, address = pub-USENIX-EL-CERRITO:adr, pages = "x + 528", year = "1986", bibdate = "Sun Feb 18 07:46:09 MST 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, annote = "Spine title: USENIX Conference proceedings.", keywords = "UNIX (Computer operating system) --- Congresses.", } @Proceedings{ACM:1989:PSN, editor = "{ACM}", booktitle = "{Proceedings, Supercomputing '89: November 13--17, 1989, Reno, Nevada}", title = "{Proceedings, Supercomputing '89: November 13--17, 1989, Reno, Nevada}", publisher = pub-ACM, address = pub-ACM:adr, pages = "xviii + 849", year = "1989", ISBN = "0-89791-341-8", ISBN-13 = "978-0-89791-341-6", LCCN = "QA 76.5 S87 1989", bibdate = "Wed Aug 28 06:48:31 MDT 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; University of California MELVYL catalog.", note = "IEEE 89CH2802-7.", acknowledgement = ack-nhfb, annote = "89CM2802-7. ACM Order Number 415892. IEEE 89CH2802-7. IEEE Computer Society Order Number 2021.", classification = "A0130C (Conference proceedings); A0270 (Computational techniques); A0500 (Statistical physics and thermodynamics); A4700 (Fluid dynamics); B0100 (General electrical engineering topics); B0290 (Numerical analysis); B1130B (Computer-aided circuit analysis and design); C4100 (Numerical analysis); C4240 (Programming and algorithm theory); C5440 (Multiprocessor systems and techniques); C5470 (Performance evaluation and testing); C6110B (Software engineering techniques); C6150J (Operating systems); C7000 (Computer applications)", keywords = "benchmarking; computer applications; parallel algorithms; parallel processing; performance evaluation; performance measurements; performance tools; pipeline processing; software environments; supercomputer architectures; supercomputers --- congresses; technology integration; vector algorithms", } @Proceedings{Shriver:1989:PTA, editor = "B. D. Shriver", booktitle = "{Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Vol.II: Software Track, Kailua-Kona, HI, USA, January 3--6, 1989}", title = "{Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Vol.II: Software Track, Kailua-Kona, HI, USA, January 3--6, 1989}", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "xvii + 1106", year = "1989", ISBN = "0-8186-1912-0", ISBN-13 = "978-0-8186-1912-0", LCCN = "????", bibdate = "Sun Sep 29 06:28:50 MDT 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "IEEE catalog number 89TH0243-6.", acknowledgement = ack-nhfb, confsponsor = "IEEE; Univ. Hawaii; PRIISM; ACM", } @Proceedings{ACM:1990:PAC, editor = "{ACM}", booktitle = "{Proceedings of the 1990 ACM Conference on LISP and Functional Programming: papers presented at the conference, Nice, France, June 27--29, 1990}", title = "{Proceedings of the 1990 ACM Conference on LISP and Functional Programming: papers presented at the conference, Nice, France, June 27--29, 1990}", publisher = pub-ACM, address = pub-ACM:adr, pages = "viii + 348", year = "1990", ISBN = "0-89791-368-X", ISBN-13 = "978-0-89791-368-3", LCCN = "QA 76.73 L23 A24 1990", bibdate = "Wed Apr 16 07:21:40 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "ACM order no. 552900.", acknowledgement = ack-nhfb, confsponsor = "ACM", } @Proceedings{Board:1990:TRA, editor = "J. A. Board", booktitle = "{Transputer Research and Applications 2. NATUG-2 Proceedings of the North American Transputer Users Group, Durham, NC, USA, October 18--19, 1989}", title = "{Transputer Research and Applications 2. NATUG-2 Proceedings of the North American Transputer Users Group, Durham, NC, USA, October 18--19, 1989}", publisher = pub-IOS, address = pub-IOS:adr, pages = "ix + 451", year = "1990", bibdate = "Sat Sep 28 20:21:01 MDT 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, pubcountry = "Netherlands", } @Proceedings{IEEE:1990:PIC, editor = "{IEEE}", booktitle = "{Proceedings, 1990 IEEE Computer Society Symposium on Research in Security and Privacy: May 7--9, 1990, Oakland, California}", title = "{Proceedings, 1990 IEEE Computer Society Symposium on Research in Security and Privacy: May 7--9, 1990, Oakland, California}", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "ix + 401", year = "1990", ISBN = "0-8186-2060-9, 0-8186-6060-0, 0-8186-9060-7", ISBN-13 = "978-0-8186-2060-7, 978-0-8186-6060-3, 978-0-8186-9060-0", LCCN = "QA76.9.A25; QA76.9.A25 S95 1990eb; QA76.9.A25 I34 1990", bibdate = "Mon Apr 10 09:18:28 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; melvyl.cdlib.org:210/CDL90", note = "IEEE Computer Society Order Number 2060. IEEE Catalog Number 90CH2884-5.", acknowledgement = ack-nhfb, meetingname = "IEEE Computer Society Symposium on Research in Security and Privacy (1990: Oakland, Calif.)", subject = "Computers; Access control; Congresses; Data protection; Privacy, Right of; Telecommunication; Security measures", } @Proceedings{IEEE:1990:PSN, editor = "{IEEE}", booktitle = "{Proceedings, Supercomputing '90: November 12--16, 1990, New York Hilton at Rockefeller Center, New York, New York}", title = "{Proceedings, Supercomputing '90: November 12--16, 1990, New York Hilton at Rockefeller Center, New York, New York}", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "xxv + 982", year = "1990", ISBN = "0-8186-2056-0 (paperback) (IEEE Computer Society), 0-89791-412-0 (paperback) (ACM)", ISBN-13 = "978-0-8186-2056-0 (paperback) (IEEE Computer Society), 978-0-89791-412-3 (paperback) (ACM)", LCCN = "QA 76.88 S87 1990", bibdate = "Wed Aug 28 06:48:31 MDT 1996", bibsource = "ftp://ftp.math.utah.edu/pub/bibnet/authors/d/dongarra-jack-j.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; University of California MELVYL catalog", note = "ACM order number 415903. IEEE Computer Society Press order number 2056. IEEE catalog number 90CH2916-5.", acknowledgement = ack-nhfb, classification = "C5440 (Multiprocessor systems and techniques); C5470 (Performance evaluation and testing); C6110 (Systems analysis and programming); C7000 (Computer applications)", keywords = "biological applications; computer applications; computer chess; innovative architectures; linear algebra algorithms; memory; networking computing; parallel languages; parallel processing; particle transport; partitioning; performance evaluation; performance visualizations; pipeline processing; program analysis; program restructuring; scheduling; supercomputers --- congresses; vector algorithms", } @Proceedings{IEEE:1991:PIC, editor = "{IEEE}", booktitle = "{Proceedings, 1991 IEEE Computer Society Symposium on Research in Security and Privacy: May 20--22, 1991, Oakland, California}", title = "{Proceedings, 1991 IEEE Computer Society Symposium on Research in Security and Privacy: May 20--22, 1991, Oakland, California}", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "ix + 389", year = "1991", ISBN = "0-8186-9168-9, 0-8186-2168-0, 0-8186-6168-2", ISBN-13 = "978-0-8186-9168-3, 978-0-8186-2168-0, 978-0-8186-6168-6", LCCN = "QA76.9.A25; QA76.9.A25 I34 1991; QA76.9.A25 S95 1991eb; QA76.9.A25 S95 1991", bibdate = "Mon Apr 10 12:15:57 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; melvyl.cdlib.org:210/CDL90", note = "IEEE Catalog Number 91CH2986-8. IEEE Computer Society Order Number 2168", acknowledgement = ack-nhfb, meetingname = "IEEE Computer Society Symposium on Research in Security and Privacy (1991: Oakland, Calif.)", subject = "Computers; Access control; Congresses; Privacy, Right of; Telecommunication; Security measures; Data protection", } @Proceedings{Milutinovic:1991:PTA, editor = "V. Milutinovic and B. D. Shriver", booktitle = "{Proceedings of the Twenty-Fourth Annual Hawaii International Conference on System Sciences}", title = "{Proceedings of the Twenty-Fourth Annual Hawaii International Conference on System Sciences}", publisher = pub-IEEE, address = pub-IEEE:adr, year = "1991", ISBN = "0-8186-2119-2 (vol. 1), 0-8186-2120-6 (vol. 2), 0-8186-2010-2 (vol. 3), 0-8186-2122-2 (vol. 4)", ISBN-13 = "978-0-8186-2119-2 (vol. 1), 978-0-8186-2120-8 (vol. 2), 978-0-8186-2010-2 (vol. 3), 978-0-8186-2122-2 (vol. 4)", LCCN = "QA76.9.S88 H38 1991; QA76.9.S88; QA76.9.S88 H375 1991; Internet; TA168 .H37a 1991", bibdate = "Wed Oct 30 06:04:36 MST 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "Four volumes. IEEE catalog number 91TH0350-9.", acknowledgement = ack-nhfb, confdate = "8--11 Jan. 1991", conflocation = "Kauai, HI, USA", confsponsor = "IEEE; Univ. Hawaii; ACM; Pacific Res. Inst. Inf. Syst. Manage", pagesf = "xv + 717 (vol. 1), xiii + 605 (vol. 2), xiv + 827 (vol. 3), xi + 574 (vol. 4)", pubcountry = "USA", } @Proceedings{Mylopoulos:1991:IPT, editor = "John Mylopoulos and Ray Reiter", booktitle = "{IJCAI-91: proceedings of the Twelfth International Conference on Artificial Intelligence, Darling Harbour, Sydney, Australia, 24--30 August 1991}", title = "{IJCAI-91: proceedings of the Twelfth International Conference on Artificial Intelligence, Darling Harbour, Sydney, Australia, 24--30 August 1991}", publisher = pub-MORGAN-KAUFMANN, address = pub-MORGAN-KAUFMANN:adr, pages = "xxiii + 1318", year = "1991", ISBN = "1-55860-160-0", ISBN-13 = "978-1-55860-160-4", LCCN = "Q334 .I57 1991", bibdate = "Mon Apr 10 12:12:49 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; melvyl.cdlib.org:210/CDL90", note = "Two volumes.", acknowledgement = ack-nhfb, meetingname = "International Joint Conference on Artificial Intelligence (12th: 1991: Sydney, N.S.W.)", subject = "Artificial intelligence; Congresses", } @Proceedings{USENIX:1991:PUM, editor = "{USENIX}", booktitle = "{Proceedings of the USENIX Mach Symposium: November 20--22, 1991, Monterey, California, USA}", title = "{Proceedings of the USENIX Mach Symposium: November 20--22, 1991, Monterey, California, USA}", publisher = pub-USENIX, address = pub-USENIX:adr, pages = "262", year = "1991", LCCN = "QAX 27", bibdate = "Sun Feb 18 07:46:09 MST 1996", bibsource = "ftp://ftp.uu.net/library/bibliography; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, keywords = "Memory management (Computer science) --- Congresses; Operating systems (Computers) --- Congresses.; UNIX (Computer file) --- Congresses", } @Proceedings{IEEE:1992:PSM, editor = "{IEEE Computer Society. Technical Committee on Computer Architecture}", booktitle = "{Proceedings, Supercomputing '92: Minneapolis, Minnesota, November 16--20, 1992}", title = "{Proceedings, Supercomputing '92: Minneapolis, Minnesota, November 16--20, 1992}", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "xxiv + 848", year = "1992", ISBN = "0-8186-2632-1 (case), 0-8186-2630-5 (paper), 0-8186-2631-3 (microfiche), 0-89791-537-2 (ACM Library series)", ISBN-13 = "978-0-8186-2632-6 (case), 978-0-8186-2630-2 (paper), 978-0-8186-2631-9 (microfiche), 978-0-89791-537-3 (ACM Library series)", LCCN = "QA76.5 .S894 1992", bibdate = "Wed Aug 28 06:48:31 MDT 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; University of California MELVYL catalog.", note = "Cover title: Supercomputing '91. ACM order number 415922. IEEE Computer Society Press order number 2630 IEEE catalog number 92CH3216-9.", acknowledgement = ack-nhfb, keywords = "artificial intelligence; biosciences; cache; compiling; distributed computing; fluids; industrial modeling; instruction-level optimization; interconnections; massively parallel systems; multiprocessing programs; multiprocessing systems; numerical applications; parallel algorithms; parallel programming; parallelizing transformations; particles; performance evaluation; performance methodology; register efficiency; scheduling; sparse matrix algorithms; supercomputers --- congresses; symbolic algorithms; waves", } @Proceedings{Anonymous:1993:NCS, editor = "Anonymous", booktitle = "{16th National Computer Security Conference: September 20--23, 1993, Baltimore Convention Center, Baltimore, Maryland: proceedings: information systems security, user choices}", title = "{16th National Computer Security Conference: September 20--23, 1993, Baltimore Convention Center, Baltimore, Maryland: proceedings: information systems security, user choices}", publisher = "National Institute of Standards and Technology/National Computer Security Center", address = "Gaithersburg, MD, USA", pages = "xvii + 542", year = "1993", bibdate = "Mon Apr 10 09:56:55 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; melvyl.cdlib.org:210/CDL90", acknowledgement = ack-nhfb, meetingname = "National Computer Security Conference (16th: 1993: Baltimore Convention Center)", remark = "Shipping list number 94-0118-M.", subject = "Computer security; United States; Congresses", } @Proceedings{Grebe:1993:TAS, editor = "R. Grebe and J. Hektor and S. C. Hilton and M. R. Jane and P. H. Welch", booktitle = "{Transputer applications and systems '93: proceedings of the 1993 World Transputer Congress, 20--22 September 1993, Aachen, Germany}", title = "{Transputer applications and systems '93: proceedings of the 1993 World Transputer Congress, 20--22 September 1993, Aachen, Germany}", publisher = pub-IOS, address = pub-IOS:adr, pages = "1317", year = "1993", ISBN = "90-5199-140-1", ISBN-13 = "978-90-5199-140-6", LCCN = "????", bibdate = "Wed Apr 16 11:39:32 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, confdate = "20--22 Sept. 1993", conflocation = "Aachen, Germany", pubcountry = "Netherlands", } @Proceedings{IEEE:1993:PSI, editor = "{IEEE}", booktitle = "{Proceedings of the Second International Conference on Parallel and Distributed Information Systems, San Diego, CA, USA, January 20--22, 1993}", title = "{Proceedings of the Second International Conference on Parallel and Distributed Information Systems, San Diego, CA, USA, January 20--22, 1993}", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "xiv + 272", year = "1993", ISBN = "0-8186-3330-1", ISBN-13 = "978-0-8186-3330-0", LCCN = "QA76.58 .I54 1993", bibdate = "Thu May 07 17:26:31 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "IEEE catalog number 93TH0493-7.", acknowledgement = ack-nhfb, confsponsor = "IEEE; ACM", } @Proceedings{IEEE:1993:PSP, editor = "{IEEE}", key = "Supercomputing'93", booktitle = "{Proceedings, Supercomputing '93: Portland, Oregon, November 15--19, 1993}", title = "{Proceedings, Supercomputing '93: Portland, Oregon, November 15--19, 1993}", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "xxii + 935", year = "1993", ISBN = "0-8186-4340-4 (paperback), 0-8186-4341-2 (microfiche), 0-8186-4342-0 (hardback), 0-8186-4346-3 (CD-ROM)", ISBN-13 = "978-0-8186-4340-8 (paperback), 978-0-8186-4341-5 (microfiche), 978-0-8186-4342-2 (hardback), 978-0-8186-4346-0 (CD-ROM)", ISSN = "1063-9535", LCCN = "QA76.5 .S96 1993", bibdate = "Mon Jan 15 11:06:21 1996", bibsource = "ftp://ftp.math.utah.edu/pub/bibnet/authors/d/dongarra-jack-j.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, classification = "631.1; 722.1; 722.3; 722.4; 723.2; 921.6", keywords = "Algorithms; Cache coherence; Clustered workstations; Computer graphics; Computer networks; Computer programming languages; Data parallel compilers; Data partitioning; Distributed computer systems; Eigenvalues and eigenfunctions; Finite element method; Flow visualization; Fluid mechanics; Linear algebra; Mass storage; Massively parallel processors; Natural sciences computing; Parallel languages; Parallel processing systems; Parallel rendering; Program compilers; Quantum theory; Scheduling; Sparse matrices; Supercomputers", sponsor = "Institute of Electrical and Electronics Engineers; Computer Society. Association for Computing Machinery; SIGARCH.", } @Proceedings{Thomas:1993:PIS, editor = "I. Thomas", booktitle = "{Proceedings of the 7th International Software Process Workshop: communication and coordination in the software process: October 15--18, 1991, Yountville, California}", title = "{Proceedings of the 7th International Software Process Workshop: communication and coordination in the software process: October 15--18, 1991, Yountville, California}", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "viii + 138", year = "1993", ISBN = "0-8186-4050-2, 0-8186-4051-0", ISBN-13 = "978-0-8186-4050-6, 978-0-8186-4051-3", LCCN = "QA76.755 .I58 1991", bibdate = "Mon Apr 10 09:34:17 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; melvyl.cdlib.org:210/CDL90", acknowledgement = ack-nhfb, meetingname = "International Software Process Workshop (7th: 1991: Yountville, Calif.)", subject = "Computer software; Congresses", } @Proceedings{USENIX:1993:PUM, editor = "{USENIX}", booktitle = "{Proceedings of the USENIX Mobile and Location-Independent Computing Symposium: August 2--3, 1993, Cambridge, Massachusetts, USA}", title = "{Proceedings of the USENIX Mobile and Location-Independent Computing Symposium: August 2--3, 1993, Cambridge, Massachusetts, USA}", publisher = pub-USENIX, address = pub-USENIX:adr, pages = "138", year = "1993", ISBN = "1-880446-51-0", ISBN-13 = "978-1-880446-51-5", LCCN = "QA 76.76 O63 U86 1993", bibdate = "Tue Oct 22 08:33:21 2002", bibsource = "ftp://ftp.uu.net/library/bibliography; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.usenix.org/publications/library/proceedings/mobile93/", acknowledgement = ack-nhfb, annote = "Spine title: Mobile and Location-Independent Computing Symposium, Summer 1993.", keywords = "Computer networks --- Congresses; Portable computers --- Communication systems --- Congresses.; UNIX (Computer file) --- Congresses", } @Proceedings{Horiguchi:1994:ISP, editor = "S. Horiguchi and D. F. Hsu and M. Kimura", booktitle = "{International Symposium on Parallel Architectures, Algorithms, and Networks (ISPAN): proceedings of the 1994, December 14--16, 1994, Kanazawa, Japan}", title = "{International Symposium on Parallel Architectures, Algorithms, and Networks (ISPAN): proceedings of the 1994, December 14--16, 1994, Kanazawa, Japan}", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "xi + 452", year = "1994", ISBN = "0-8186-6507-6", ISBN-13 = "978-0-8186-6507-3", LCCN = "QA76.58 .I5673 1994", bibdate = "Sun Dec 22 10:20:45 MST 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "IEEE catalog no. 94TH0697-3", acknowledgement = ack-nhfb, confsponsor = "Japan Advanced Inst. Sci. and Technol.; IEEE Comput. Soc.; IEEE Comput. Soc. Tech. Committee on Comput. Archit.; IEEE Comput. Soc. Tech. Committee on Parallel Process.; IPSJ Tech. Committee on Algorithms; IPSJ Tech. Committee on Comput. Archit.; IEICE Tech. Committee on Comput. Syst", pubcountry = "USA", } @Proceedings{Joubert:1994:PCT, editor = "G. R. Joubert and F. J. Peters and D. Trystram and D. J. Evans", booktitle = "{Parallel computing: trends and applications: proceedings of the international conference ParCo93, Grenoble, France, 7--10 September 1993}", title = "{Parallel computing: trends and applications: proceedings of the international conference ParCo93, Grenoble, France, 7--10 September 1993}", volume = "9", publisher = pub-NORTH-HOLLAND, address = pub-NORTH-HOLLAND:adr, pages = "xvi + 728", year = "1994", ISBN = "0-444-81841-3", ISBN-13 = "978-0-444-81841-6", LCCN = "QA76.58 .P3794 1993", bibdate = "Sun Dec 22 10:19:23 MST 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", series = "Advances in parallel computing", acknowledgement = ack-nhfb, confsponsor = "ARCHIPEL; CNRS; Elsevier Sci. Publishers; IMAG; INPG; INRIA; et al", pubcountry = "Netherlands", xxeditor = "G. R. Joubert and D. Trystram and F. J. Peters and D. J. Evans", } @Proceedings{Ostrand:1994:PIS, editor = "Thomas Ostrand", booktitle = "{Proceedings of the 1994 International Symposium on Software Testing and Analysis (ISSTA): August 17--19, 1994, Seattle, Washington, USA}", title = "{Proceedings of the 1994 International Symposium on Software Testing and Analysis (ISSTA): August 17--19, 1994, Seattle, Washington, USA}", publisher = pub-ACM, address = pub-ACM:adr, year = "1994", CODEN = "SFENDP", ISBN = "0-89791-683-2", ISBN-13 = "978-0-89791-683-7", ISSN = "0163-5948", LCCN = "QA76.76.T48 I58 1994", bibdate = "Sun Dec 22 10:18:08 MST 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/pvm.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", series = j-SIGSOFT, acknowledgement = ack-nhfb, fjournal = "ACM SIGSOFT Software Engineering Notes", issue = "spec. issue. p. 216-227", journal-URL = "https://dl.acm.org/citation.cfm?id=J728", } @Proceedings{ACM:1996:SCP, editor = "{ACM}", booktitle = "Supercomputing '96 Conference Proceedings: November 17--22, Pittsburgh, PA", title = "Supercomputing '96 Conference Proceedings: November 17--22, Pittsburgh, {PA}", publisher = pub-ACM # " and " # pub-IEEE, address = pub-ACM:adr # " and " # pub-IEEE:adr, pages = "????", year = "1996", ISBN = "0-89791-854-1", ISBN-13 = "978-0-89791-854-1", LCCN = "????", bibdate = "Mon Mar 23 12:30:13 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "ACM Order Number: 415962, IEEE Computer Society Press Order Number: RS00126.", URL = "http://www.supercomp.org/sc96/proceedings/", acknowledgement = ack-nhfb, } @Proceedings{IEEE:1996:HCV, editor = "IEEE", booktitle = "Hot chips VIII: symposium record: Stanford University, Stanford, California, August 18--20, 1996", title = "Hot chips {VIII}: symposium record: Stanford University, Stanford, California, August 18--20, 1996", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "????", year = "1996", ISBN = "????", ISBN-13 = "????", LCCN = "????", bibdate = "Sat Jan 6 19:21:13 MST 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/java.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; OCLC Proceedings database", acknowledgement = ack-nhfb, keywords = "hot chips", } @Proceedings{IEEE:1996:PFIa, editor = "{IEEE}", booktitle = "Proceedings of the Fifth IEEE International Symposium on High Performance Distributed Computing, August 6--9, 1996, Syracuse, New York", title = "Proceedings of the Fifth {IEEE} International Symposium on High Performance Distributed Computing, August 6--9, 1996, Syracuse, New York", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "xviii + 642", year = "1996", ISBN = "0-8186-7582-9", ISBN-13 = "978-0-8186-7582-9", LCCN = "QA76.88.I52 1996", bibdate = "Fri May 16 15:50:00 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/java.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "IEEE order plan catalog number 96TB100069. EEE Computer Society Press order number PR07582.", acknowledgement = ack-nhfb, } @Proceedings{ACM:1997:PTA, editor = "{ACM}", booktitle = "Proceedings of the {TRI-Ada'97} Conference, {November} 9--13, 1997, {St. Louis, MO}", title = "Proceedings of the {TRI-Ada'97} Conference, {November} 9--13, 1997, {St. Louis, MO}", publisher = pub-ACM, address = pub-ACM:adr, pages = "xiii + 312", year = "1997", ISBN = "0-89791-981-5", ISBN-13 = "978-0-89791-981-4", LCCN = "QA 76.73 A35 T75 1997", bibdate = "Fri Oct 29 17:03:04 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/java.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "Theme title: Ada; the right choice for reliable software. ACM order number: 825970.", acknowledgement = ack-nhfb, sponsor = "Association for Computing Machinery; Special Interest Group on Ada.", } @Proceedings{IEEE:1997:HCI, editor = "{IEEE}", booktitle = "Hot Chips IX: Stanford University, Stanford, California, August 24--26, 1997", title = "Hot Chips {IX}: Stanford University, Stanford, California, August 24--26, 1997", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "????", year = "1997", ISBN = "????", ISBN-13 = "????", LCCN = "????", bibdate = "Mon Jan 08 05:05:12 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/java.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, } @Proceedings{ACM:1998:AWJ, editor = "{ACM}", booktitle = "ACM 1998 Workshop on Java for High-Performance Network Computing", title = "{ACM} 1998 Workshop on Java for High-Performance Network Computing", publisher = pub-ACM, address = pub-ACM:adr, pages = "287", year = "1998", CODEN = "CPEXEI", ISSN = "1040-3108", LCCN = "????", bibdate = "Thu Apr 27 10:40:59 2000", bibsource = "https://www.math.utah.edu/pub/tex/bib/java.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "Also published as {\em Concurrency: Practice and Experience}, {\bf 10}(11--13), September 1998, CODEN CPEXEI, ISSN 1040-3108.", series = j-CPE, URL = "http://www.cs.ucsb.edu/conferences/java98/program.html", acknowledgement = ack-nhfb, xxISBN = "none", xxnote = "Appears to be the same as \cite{Fox:1998:JHP}.", } @Proceedings{ACM:1999:PPA, editor = "{ACM}", booktitle = "POPL '99. Proceedings of the 26th ACM SIGPLAN-SIGACT on Principles of programming languages, January 20--22, 1999, San Antonio, TX", title = "{POPL} '99. Proceedings of the 26th {ACM} {SIGPLAN}-{SIGACT} on Principles of programming languages, January 20--22, 1999, San Antonio, {TX}", publisher = pub-ACM, address = pub-ACM:adr, pages = "viii + 324", year = "1999", ISBN = "1-58113-095-3", ISBN-13 = "978-1-58113-095-9", LCCN = "????", bibdate = "Mon May 03 18:41:35 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/java.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.acm.org/pubs/contents/proceedings/plan/292540/index.html", acknowledgement = ack-nhfb, } @Proceedings{Anonymous:1999:PII, editor = "Anonymous", booktitle = "Proceedings of the IASTED International Conference on Internet and Multimedia Systems and Applications (IMSA). Nassau, Bahamas, October 1999", title = "Proceedings of the {IASTED} International Conference on Internet and Multimedia Systems and Applications ({IMSA}). Nassau, Bahamas, October 1999", publisher = "Acta Press", address = "Anaheim, CA, USA", pages = "????", year = "1999", ISBN = "????", ISBN-13 = "????", LCCN = "????", bibdate = "Tue Oct 24 10:38:48 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, } @Proceedings{IEEE:1999:HCS, editor = "IEEE", booktitle = "Hot Chips 11: Stanford University, Stanford, California, August 15--17, 1999", title = "Hot Chips 11: Stanford University, Stanford, California, August 15--17, 1999", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "????", year = "1999", ISBN = "????", ISBN-13 = "????", LCCN = "????", bibdate = "Mon Jan 08 05:26:43 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/java.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.hotchips.org/hotc11_index.html", acknowledgement = ack-nhfb, } @Proceedings{USENIX:1999:PFU, editor = "{USENIX}", booktitle = "Proceedings of the fifth USENIX Conference on Object-Oriented Technologies and Systems (COOTS '99): May 3--7, 1999, San Diego, California, USA", title = "Proceedings of the fifth {USENIX} Conference on Object-Oriented Technologies and Systems ({COOTS} '99): May 3--7, 1999, San Diego, California, {USA}", publisher = pub-USENIX, address = pub-USENIX:adr, pages = "iv + 240", year = "1999", ISBN = "????", ISBN-13 = "????", LCCN = "QA76.64 .U84 1999", bibdate = "Fri Oct 29 08:40:21 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/java.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.usenix.org/publications/library/proceedings/coots99/", acknowledgement = ack-nhfb, } @Proceedings{ACM:2000:CPI, editor = "{ACM}", booktitle = "{Conference proceedings of the 2000 International Conference on Supercomputing: Santa Fe, New Mexico, May 8--11, 2000}", title = "{Conference proceedings of the 2000 International Conference on Supercomputing: Santa Fe, New Mexico, May 8--11, 2000}", publisher = pub-ACM, address = pub-ACM:adr, pages = "xi + 347", year = "2000", ISBN = "1-58113-270-0", ISBN-13 = "978-1-58113-270-0", LCCN = "QA76.88 .I573 2000", bibdate = "Tue Oct 24 10:04:24 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; melvyl.cdlib.org:210/CDL90", URL = "http://www.acm.org/pubs/contents/proceedings/supercomputing/335231", acknowledgement = ack-nhfb, subject = "Supercomputers; Congresses", } @Book{Boszormenyi:2000:SNW, editor = "L{\'a}szl{\'o} B{\"o}sz{\"o}rm{\'e}nyi and Jurg Gutknecht and Gustav Pomberger", booktitle = "The School of {Niklaus Wirth}: The Art of Simplicity", title = "The School of {Niklaus Wirth}: The Art of Simplicity", publisher = pub-MORGAN-KAUFMANN, address = pub-MORGAN-KAUFMANN:adr, pages = "viii + 260", year = "2000", ISBN = "1-55860-723-4", ISBN-13 = "978-1-55860-723-1", LCCN = "QA76.756 .S36 2000", bibdate = "Sat Apr 20 11:12:33 2002", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", price = "US\$39.95", URL = "http://www.mkp.com/books_catalog/catalog.asp?ISBN=1-55860-723-4", acknowledgement = ack-nhfb, } @Proceedings{USENIX:2000:PAL, editor = "{USENIX}", booktitle = "Proceedings of the 4th Annual Linux Showcase and Conference, Atlanta, October 10--14, 2000, Atlanta, Georgia, USA", title = "Proceedings of the 4th Annual Linux Showcase and Conference, Atlanta, October 10--14, 2000, Atlanta, Georgia, {USA}", publisher = pub-USENIX, address = pub-USENIX:adr, pages = "394", year = "2000", ISBN = "1-880446-17-0", ISBN-13 = "978-1-880446-17-1", LCCN = "????", bibdate = "Wed Oct 16 06:06:36 2002", bibsource = "https://www.math.utah.edu/pub/tex/bib/usenix2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.usenix.org/publications/library/proceedings/als2000/", acknowledgement = ack-nhfb, } @Proceedings{USENIX:2000:PNU, editor = "{USENIX}", booktitle = "Proceedings of the Ninth USENIX Security Symposium, August 14--17, 2000, Denver, Colorado", title = "Proceedings of the Ninth {USENIX} Security Symposium, August 14--17, 2000, Denver, Colorado", publisher = pub-USENIX, address = pub-USENIX:adr, pages = "275", year = "2000", ISBN = "1-880446-18-9", ISBN-13 = "978-1-880446-18-8", LCCN = "????", bibdate = "Wed Oct 16 06:36:41 2002", bibsource = "https://www.math.utah.edu/pub/tex/bib/usenix2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.usenix.org/publications/library/proceedings/sec2000", acknowledgement = ack-nhfb, } @Proceedings{ACM:2001:ASS, editor = "{ACM}", booktitle = "{ACM SIGPLAN--SIGSOFT workshop on Program analysis for software tools and engineering: June 18--19, 2001, Snowbird, Utah, USA: PASTE'01}", title = "{ACM SIGPLAN--SIGSOFT workshop on Program analysis for software tools and engineering: June 18--19, 2001, Snowbird, Utah, USA: PASTE'01}", publisher = pub-ACM, address = pub-ACM:adr, pages = "viii + 104", year = "2001", ISBN = "1-58113-413-4", ISBN-13 = "978-1-58113-413-1", LCCN = "QA76.758", bibdate = "Thu Aug 30 08:01:24 MDT 2001", bibsource = "http://www.acm.org/pubs/contents/proceedings/series/paste/; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "Supplement to ACM SIGPLAN Notices.", acknowledgement = ack-nhfb, } @Proceedings{ACM:2001:PAJ, editor = "{ACM}", booktitle = "{Proceedings of the ACM 2001 Java Grande\slash ISCOPE Conference: Palo Alto, Calif., June 2--4, 2001}", title = "{Proceedings of the ACM 2001 Java Grande\slash ISCOPE Conference: Palo Alto, Calif., June 2--4, 2001}", publisher = pub-ACM, address = pub-ACM:adr, pages = "vi + 186", year = "2001", ISBN = "1-58113-359-6", ISBN-13 = "978-1-58113-359-2", LCCN = "QA76.9.O35 A26 2001", bibdate = "Mon May 6 06:26:30 MDT 2002", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, keywords = "Java (computer program language) -- congresses; object-oriented methods (computer science) -- congresses", } @Proceedings{Anonymous:2001:PJV, editor = "Anonymous", booktitle = "{Proceedings of the Java Virtual Machine Research and Technology Symposium (JVM '01) April 23--24, 2001, Monterey, California, USA}", title = "{Proceedings of the Java Virtual Machine Research and Technology Symposium (JVM '01) April 23--24, 2001, Monterey, California, USA}", publisher = pub-USENIX, address = pub-USENIX:adr, pages = "232", year = "2001", ISBN = "1-880446-11-1", ISBN-13 = "978-1-880446-11-9", LCCN = "????", bibdate = "Mon Apr 10 10:43:56 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.bibsys.no:2100/BIBSYS", acknowledgement = ack-nhfb, meetingname = "Java Virtual Machine Research and Technology Symposium. 2001. Monterey, Calif.", subject = "JVM", } @Proceedings{IEEE:2001:EIW, editor = "IEEE", booktitle = "{Eighth IEEE Workshop on Hot Topics in Operating Systems (HotOS-VIII). May 20--23, 2001, Schloss Elmau, Germany}", title = "{Eighth IEEE Workshop on Hot Topics in Operating Systems (HotOS-VIII). May 20--23, 2001, Schloss Elmau, Germany}", publisher = pub-IEEE, address = pub-IEEE:adr, year = "2001", ISBN = "0-7695-1040-X", ISBN-13 = "978-0-7695-1040-8", bibdate = "Mon May 28 08:55:24 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "IEEE catalog number PR01040.", price = "US\$135.00", URL = "http://computer.org/CSPRESS/CATALOG/pr01040.htm", } @Proceedings{USENIX:2001:PJV, editor = "{USENIX}", booktitle = "{Proceedings of the Java Virtual Machine Research and Technology Sy[m]posium (JVM '01): April 23--24, 2001, Monterey, California, USA. Berkeley, CA}", title = "{Proceedings of the Java Virtual Machine Research and Technology Sy[m]posium (JVM '01): April 23--24, 2001, Monterey, California, USA. Berkeley, CA}", publisher = pub-USENIX, address = pub-USENIX:adr, pages = "232", year = "2001", ISBN = "1-880446-11-1", ISBN-13 = "978-1-880446-11-9", LCCN = "QA76.73.J38 J42 2001", bibdate = "Tue Oct 15 12:35:06 2002", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.usenix.org/publications/library/proceedings/jvm01/", acknowledgement = ack-nhfb, } @Proceedings{USENIX:2001:PUA, editor = "{USENIX}", booktitle = "Proceedings of the 2001 USENIX Annual Technical Conference: June 25--30, 2001, Marriott Copley Place Hotel, Boston, Massachusetts, USA", title = "Proceedings of the 2001 {USENIX} Annual Technical Conference: June 25--30, 2001, Marriott Copley Place Hotel, Boston, Massachusetts, {USA}", publisher = pub-USENIX, address = pub-USENIX:adr, pages = "346", year = "2001", ISBN = "1-880446-09-X", ISBN-13 = "978-1-880446-09-6", LCCN = "QA76.8.U65 U84 2001", bibdate = "Mon Oct 14 07:43:52 2002", bibsource = "https://www.math.utah.edu/pub/tex/bib/usenix2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.usenix.org/publications/library/proceedings/usenix01/technical.html", acknowledgement = ack-nhfb, } @Proceedings{USENIX:2001:PUC, editor = "{USENIX}", booktitle = "Proceedings of the 6th USENIX Conference on Object-Oriented Technologies and Systems, January 29--February 2, 2001, San Antonio, Texas, USA", title = "Proceedings of the 6th {USENIX} Conference on Object-Oriented Technologies and Systems, January 29--February 2, 2001, San Antonio, Texas, {USA}", publisher = pub-USENIX, address = pub-USENIX:adr, pages = "202", year = "2001", ISBN = "1-880446-12-X", ISBN-13 = "978-1-880446-12-6", LCCN = "????", bibdate = "Tue Oct 15 18:08:16 2002", bibsource = "https://www.math.utah.edu/pub/tex/bib/usenix2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.usenix.org/publications/library/proceedings/coots01/", acknowledgement = ack-nhfb, keyword = "COOTS'01", } @Proceedings{USENIX:2001:UJV, editor = "{USENIX}", booktitle = "{Usenix Java Virtual Machine Research and Technology Symposium (JVM '01)}", title = "{Usenix Java Virtual Machine Research and Technology Symposium (JVM '01)}", publisher = pub-USENIX, address = pub-USENIX:adr, month = apr, year = "2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", } @Proceedings{IEEE:2002:WII, editor = "{IEEE}", booktitle = "{WWC-5: 2002 IEEE International Workshop on Workload Characterization: November 25, 2002, Austin, Texas}", title = "{WWC-5: 2002 IEEE International Workshop on Workload Characterization: November 25, 2002, Austin, Texas}", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "vi + 140", year = "2002", ISBN = "0-7803-7681-1", ISBN-13 = "978-0-7803-7681-6", LCCN = "QA76.9.S88; QA76.9.S88 W67 2002eb; Internet", bibdate = "Tue Oct 24 10:16:21 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; melvyl.cdlib.org:210/CDL90", note = "IEEE Catalog Number 02EX633.", URL = "http://ieeexplore.ieee.org/servlet/opac?punumber=8689", acknowledgement = ack-nhfb, subject = "Electronic digital computers; Workload; Congresses; System design; Computer engineering; Computer networks; Computer systems", } @Proceedings{USENIX:2002:PJV, editor = "USENIX", booktitle = "{Proceedings of the Java Virtual Machine Research and Technology Symposium (JVM '02): August 1--2, 2002, San Francisco, California, US}", title = "{Proceedings of the Java Virtual Machine Research and Technology Symposium (JVM '02): August 1--2, 2002, San Francisco, California, US}", publisher = pub-USENIX, address = pub-USENIX:adr, pages = "194", day = "1--2", month = aug, year = "2002", ISBN = "1-931971-01-3", ISBN-13 = "978-1-931971-01-0", LCCN = "QA76.73 .J38 J42 2002", bibdate = "Tue Oct 15 12:35:06 2002", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.usenix.org/publications/library/proceedings/javavm02/", acknowledgement = ack-nhfb, conflocation = "San Francisco, CA, USA", confyear = "2002", } @Proceedings{ACM:2003:ATA, editor = "Allyn Romanow and Jeff Mogul", booktitle = "{Proceedings of the ACM SIGCOMM Workshop on Network-I/O Convergence: experience, Lessons, Implications 2003, Karlsruhe, Germany, August 25--27, 2003}", title = "{Proceedings of the ACM SIGCOMM Workshop on Network-I/O Convergence: experience, Lessons, Implications 2003, Karlsruhe, Germany, August 25--27, 2003}", publisher = pub-ACM, address = pub-ACM:adr, pages = "????", year = "2003", ISBN = "????", ISBN-13 = "????", LCCN = "TK5105.5", bibdate = "Sat Oct 14 14:04:48 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "ACM order number 534032.", acknowledgement = ack-nhfb, } @Proceedings{ACM:2003:SII, editor = "{ACM}", booktitle = "SC2003: Igniting Innovation. {Phoenix, AZ, November 15--21, 2003}", title = "{SC2003}: Igniting Innovation. {Phoenix, AZ, November 15--21, 2003}", publisher = pub-ACM # " and " # pub-IEEE, address = pub-ACM:adr # " and " # pub-IEEE:adr, pages = "????", year = "2003", ISBN = "1-58113-695-1", ISBN-13 = "978-1-58113-695-1", LCCN = "????", bibdate = "Thu Feb 21 18:29:36 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, } @Proceedings{ACM:2003:SPA, editor = "{ACM}", booktitle = "{SOSP '03: proceedings of the 19th ACM Symposium on Operating Systems Principles: the Sagamore, Bolton Landing, Lake George, New York, USA, October 19--22, 2003}", title = "{SOSP '03: proceedings of the 19th ACM Symposium on Operating Systems Principles: the Sagamore, Bolton Landing, Lake George, New York, USA, October 19--22, 2003}", volume = "37(5)", publisher = pub-ACM, address = pub-ACM:adr, pages = "x + 330", month = dec, year = "2003", ISBN = "1-58113-757-5", ISBN-13 = "978-1-58113-757-6", ISSN = "0163-5980 (print), 1943-586X (electronic)", bibdate = "Wed Nov 30 07:45:41 MST 2005", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; melvyl.cdlib.org:210/CDL90", note = "ACM order number 534030.", series = "Operating systems review", URL = "ftp://uiarchive.cso.uiuc.edu/pub/etext/gutenberg/; http://uclibs.org/PID/34720", acknowledgement = ack-nhfb, subject = "Operating systems (Computers); Congresses", } @Proceedings{Basin:2003:TPH, editor = "David Basin and Burkhart Wolff", booktitle = "{Theorem Proving in Higher Order Logics: 16th International Conference, TPHOLs 2003, Rome, Italy, September 8--12, 2003: Proceedings}", title = "{Theorem Proving in Higher Order Logics: 16th International Conference, TPHOLs 2003, Rome, Italy, September 8--12, 2003: Proceedings}", volume = "2758", publisher = pub-SV, address = pub-SV:adr, pages = "x + 366", year = "2003", CODEN = "LNCSD9", DOI = "https://doi.org/10.1007/b11828", ISBN = "3-540-40664-6", ISBN-13 = "978-3-540-40664-8", ISSN = "0302-9743 (print), 1611-3349 (electronic)", LCCN = "QA76.9.A96", bibdate = "Thu Nov 11 19:26:30 MST 2004", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", series = ser-LNCS, URL = "http://link.springer-ny.com/link/service/series/0558/tocs/t2758.htm; http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=2758; http://www.springerlink.com/openurl.asp?genre=volume&id=doi:10.1007/b11828", acknowledgement = ack-nhfb, } @Proceedings{Ertl:2003:IVM, editor = "M. Anton Ertl", key = "IVME '03", booktitle = "{Interpreters, Virtual Machines and Emulators (IVME '03)}", title = "{Interpreters, Virtual Machines and Emulators (IVME '03)}", publisher = pub-ACM, address = pub-ACM:adr, pages = "76", year = "2003", ISBN = "1-58311-655-2", ISBN-13 = "978-1-58311-655-5", LCCN = "QA76.7", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.complang.tuwien.ac.at/anton/ivme03/proceedings/ivme.ps.gz", url2 = "http://portal.acm.org/toc.cfm?id=858570&type=proceeding", } @Proceedings{IEEE:2003:IIW, editor = "{IEEE}", booktitle = "{2003 IEEE International Workshop on Workload Characterization: WWC-6: October 27, 2003, Austin, Texas}", title = "{2003 IEEE International Workshop on Workload Characterization: WWC-6: October 27, 2003, Austin, Texas}", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "iii + 130", year = "2003", ISBN = "0-7803-8229-3", ISBN-13 = "978-0-7803-8229-9", LCCN = "QA76.9.S88 W67 2003", bibdate = "Sat Oct 14 17:05:44 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, } @Proceedings{ACM:2004:PWA, editor = "{ACM}", booktitle = "{Proceedings of the 11th workshop on ACM SIGOPS European workshop: beyond the PC 2004, Leuven, Belgium, September 19--22, 2004}", title = "{Proceedings of the 11th workshop on ACM SIGOPS European workshop: beyond the PC 2004, Leuven, Belgium, September 19--22, 2004}", publisher = pub-ACM, address = pub-ACM:adr, pages = "????", year = "2004", ISBN = "????", ISBN-13 = "????", LCCN = "????", bibdate = "Sat Oct 14 14:29:05 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, } @Proceedings{ACM:2004:SHP, editor = "{ACM}", booktitle = "{SC 2004: High Performance Computing, Networking and Storage: Bridging communities: Proceedings of the IEEE\slash ACM Supercomputing 2004 Conference, Pittsburgh, PA, November 6--12, 2004}", title = "{SC 2004: High Performance Computing, Networking and Storage: Bridging communities: Proceedings of the IEEE\slash ACM Supercomputing 2004 Conference, Pittsburgh, PA, November 6--12, 2004}", publisher = pub-ACM # " and " # pub-IEEE, address = pub-ACM:adr # " and " # pub-IEEE:adr, pages = "????", year = "2004", ISBN = "0-7695-2153-3", ISBN-13 = "978-0-7695-2153-4", LCCN = "QA76.88", bibdate = "Tue Dec 27 08:08:01 2005", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "IEEE order number E2153. ACM order number 415043.", acknowledgement = ack-nhfb, } @Proceedings{Anonymous:2004:PTV, editor = "Anonymous", booktitle = "{Proceedings of the Third Virtual Machine Research and Technology Symposium (VM '04): May 6--7, 2004, San Jose, California, USA}", title = "{Proceedings of the Third Virtual Machine Research and Technology Symposium (VM '04): May 6--7, 2004, San Jose, California, USA}", publisher = pub-USENIX, address = pub-USENIX:adr, pages = "190", year = "2004", ISBN = "1-931971-20-X", ISBN-13 = "978-1-931971-20-1", LCCN = "QA76.9.V5 V565 2004", bibdate = "Mon Apr 10 10:43:28 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; melvyl.cdlib.org:210/CDL90", series = "Conference proceedings / USENIX Association", acknowledgement = ack-nhfb, meetingname = "Virtual Machine Research and Technology Symposium (3rd: 2004: San Jose, Calif.)", remark = "Sponsored by the USENIX Association in cooperation with ACM SIGPLAN.", subject = "Virtual computer systems; Congresses", } @Proceedings{IEEE:2004:FIA, editor = "{IEEE}", booktitle = "{Fifth IEEE\slash ACM International Workshop on Grid Computing: proceedings; 8 November 2004, Pittsburgh, PA}", title = "{Fifth IEEE\slash ACM International Workshop on Grid Computing: proceedings; 8 November 2004, Pittsburgh, PA}", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "xiv + 469", year = "2004", ISBN = "0-7695-2256-4", ISBN-13 = "978-0-7695-2256-2", LCCN = "QA76.9.C58; QA76.9.C58 I585 2004eb; Internet", bibdate = "Sat Oct 14 14:21:36 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; melvyl.cdlib.org:210/CDL90", note = "IEEE Computer Society Order Number P2256.", URL = "http://ieeexplore.ieee.org/servlet/opac?punumber=9495", acknowledgement = ack-nhfb, meetingname = "GRID (Conference) (2004: Pittsburgh, Pa.)", subject = "Computational grids (Computer systems); Congresses", } @Proceedings{ACM:2005:APS, editor = "{ACM}", booktitle = "{AADEBUG 2005: proceedings of the Sixth International Symposium on Automated and Analysis-Driven Debugging: Monterey, California, USA, September 19--21, 2005}", title = "{AADEBUG 2005: proceedings of the Sixth International Symposium on Automated and Analysis-Driven Debugging: Monterey, California, USA, September 19--21, 2005}", publisher = pub-ACM, address = pub-ACM:adr, pages = "viii + 164", year = "2005", ISBN = "1-59593-050-7", ISBN-13 = "978-1-59593-050-7", LCCN = "QA76.9.D43 I58 2005", bibdate = "Sat Oct 14 15:22:07 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.loc.gov:7090/Voyager", acknowledgement = ack-nhfb, meetingname = "International Symposium on Automated and Analysis-Driven Debugging (6th: 2005: Monterey, CA)", subject = "Debugging in computer science; Congresses", } @Proceedings{ACM:2005:MPI, editor = "{ACM}", booktitle = "{MGC'05: Proceedings of the 3rd International Workshop on Middleware for Grid Computing, Grenoble, France, November 28--December 02, 2005}", title = "{MGC'05: Proceedings of the 3rd International Workshop on Middleware for Grid Computing, Grenoble, France, November 28--December 02, 2005}", publisher = pub-ACM, address = pub-ACM:adr, pages = "????", year = "2005", ISBN = "1-59593-269-0", ISBN-13 = "978-1-59593-269-3", LCCN = "????", bibdate = "Sat Oct 14 13:52:46 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, } @Proceedings{ACM:2005:PAI, editor = "{ACM}", booktitle = "{Proceedings of the 2005 ACM\slash IEEE conference on Supercomputing 2005, Seattle, WA, November 12--18 2005}", title = "{Proceedings of the 2005 ACM\slash IEEE conference on Supercomputing 2005, Seattle, WA, November 12--18 2005}", publisher = pub-ACM # " and " # pub-IEEE, address = pub-ACM:adr # " and " # pub-IEEE:adr, pages = "????", year = "2005", ISBN = "1-59593-061-2", ISBN-13 = "978-1-59593-061-3", LCCN = "????", bibdate = "Tue Dec 27 08:08:01 2005", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; http://www.sc05.supercomputing.org", acknowledgement = ack-nhfb, } @Proceedings{ACM:2005:PFA, editor = "{ACM}", booktitle = "{Proceedings of the First ACM\slash USENIX International Conference on Virtual Execution Environments: VEE '05: June 11--12, 2005, Chicago, Illinois, USA}", title = "{Proceedings of the First ACM\slash USENIX International Conference on Virtual Execution Environments: VEE '05: June 11--12, 2005, Chicago, Illinois, USA}", publisher = pub-ACM, address = pub-ACM:adr, pages = "viii + 208", year = "2005", ISBN = "1-59593-047-7", ISBN-13 = "978-1-59593-047-7", LCCN = "QA76.9.V5 I575 2005", bibdate = "Sat Oct 14 15:31:34 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; melvyl.cdlib.org:210/CDL90; z3950.loc.gov:7090/Voyager", note = "ACM order number 548059.", URL = "http://www.loc.gov/catdir/toc/fy0611/2006530661.html", acknowledgement = ack-nhfb, meetingname = "International Conference on Virtual Execution Environments (1st: 2005: Chicago, IL)", subject = "Virtual computer systems; Congresses", } @Proceedings{IEEE:2005:PAC, editor = "{IEEE}", booktitle = "{Proceedings of the 21st Annual Computer Security Applications Conference 2005, December 05--09, 2005, Tucson, Arizona}", title = "{Proceedings of the 21st Annual Computer Security Applications Conference 2005, December 05--09, 2005, Tucson, Arizona}", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "xxv + 510", year = "2005", ISBN = "0-7695-2461-3", ISBN-13 = "978-0-7695-2461-0", ISSN = "1063-9527", LCCN = "L787.5", bibdate = "Sat Oct 14 14:14:01 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "IEEE Computer Society Order Number P2461.", acknowledgement = ack-nhfb, } @Proceedings{Shih:2005:ICA, editor = "Timothy K. Shih and Yoshitaka Shibata", booktitle = "{19th International Conference on Advanced Information Networking and Applications: proceedings, AINA 2005, 28--30 March, 2005, Taipei, Taiwan}", title = "{19th International Conference on Advanced Information Networking and Applications: proceedings, AINA 2005, 28--30 March, 2005, Taipei, Taiwan}", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "????", year = "2005", ISBN = "0-7695-2249-1 (paperback)", ISBN-13 = "978-0-7695-2249-4 (paperback)", ISSN = "1550-445X", LCCN = "TK5105.5 .I5616 2005", bibdate = "Sat Oct 14 15:28:40 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.loc.gov:7090/Voyager", note = "IEEE Computer Society Order Number P2249.", URL = "http://ieeexplore.ieee.org/servlet/opac?punumber=9746", acknowledgement = ack-nhfb, meetingname = "International Conference on Advanced Information Networking and Applications (19th: 2005: Taipei, Taiwan)", subject = "Computer networks; Congresses; Information networks", } @Proceedings{Vrable:2005:SPA, editor = "Michael Daniel Vrable", booktitle = "{SOSP '05: proceedings of the 20th ACM Symposium on Operating Systems Principles: October 23--26, 2005, Brighton, United Kingdom}", title = "{SOSP '05: proceedings of the 20th ACM Symposium on Operating Systems Principles: October 23--26, 2005, Brighton, United Kingdom}", volume = "39, no. 5 (Dec. 2005)", publisher = pub-ACM, address = pub-ACM:adr, pages = "ix + 291", year = "2005", ISBN = "1-59593-079-5", ISBN-13 = "978-1-59593-079-8", LCCN = "QA76.6 .S9196 2005; QA76.6; QA76.6 .S9196 2005eb; Internet", bibdate = "Sat Oct 14 14:49:06 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; melvyl.cdlib.org:210/CDL90", series = j-OPER-SYS-REV, acknowledgement = ack-nhfb, meetingname = "Symposium on Operating Systems Principles (20th: 2005: Brighton, England)", remark = "ACM order number 534050. II. Scalability, fidelity, and containment in the Potemkin virtual honeyfarm / Michael Vrable.", subject = "Operating systems (Computers); Congresses", } @Proceedings{ACM:2006:AAI, editor = "{ACM}", booktitle = "{Annual ACM IEEE Design Automation Conference, Proceedings of the 43rd Annual Conference on Design Automation, San Francisco, CA, USA}", title = "{Annual ACM IEEE Design Automation Conference, Proceedings of the 43rd Annual Conference on Design Automation, San Francisco, CA, USA}", publisher = pub-ACM, address = pub-ACM:adr, pages = "????", year = "2006", ISBN = "1-59593-381-6", ISBN-13 = "978-1-59593-381-2", LCCN = "????", bibdate = "Sat Oct 14 14:07:21 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, } @Proceedings{ACM:2006:PCC, editor = "{ACM}", booktitle = "{Proceedings of the 3rd conference on Computing Frontiers, May 3--5, 2006, Ischia, Italy}", title = "{Proceedings of the 3rd conference on Computing Frontiers, May 3--5, 2006, Ischia, Italy}", publisher = pub-ACM, address = pub-ACM:adr, year = "2006", ISBN = "1-59593-302-6", ISBN-13 = "978-1-59593-302-7", LCCN = "????", bibdate = "Tue Jun 20 06:45:04 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/java2000.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "ACM order number 104060.", acknowledgement = ack-nhfb, } @Proceedings{ACM:2006:PIW, editor = "{ACM}", booktitle = "{Proceedings of the 1st international workshop on Wireless network testbeds, experimental evaluation and characterization 2006, Los Angeles, CA, USA, September 29, 2006}", title = "{Proceedings of the 1st international workshop on Wireless network testbeds, experimental evaluation and characterization 2006, Los Angeles, CA, USA, September 29, 2006}", publisher = pub-ACM, address = pub-ACM:adr, pages = "????", year = "2006", ISBN = "1-59593-540-0", ISBN-13 = "978-1-59593-540-3", LCCN = "????", bibdate = "Sat Oct 14 14:39:09 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, } @Proceedings{ACM:2006:PPI, editor = "{ACM}", booktitle = "{PACT'06: Proceedings of the 15th International Conference on Parallel Architectures and Compilation Techniques 2006, Seattle, Washington, USA, September 16--20, 2006}", title = "{PACT'06: Proceedings of the 15th International Conference on Parallel Architectures and Compilation Techniques 2006, Seattle, Washington, USA, September 16--20, 2006}", publisher = pub-ACM, address = pub-ACM:adr, pages = "????", year = "2006", ISBN = "1-59593-264-X", ISBN-13 = "978-1-59593-264-8", LCCN = "????", bibdate = "Sat Oct 14 15:04:43 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, } @Proceedings{ACM:2006:PST, editor = "{ACM}", booktitle = "{Proceedings of the 37th SIGCSE Technical Symposium on Computer Science Education 2006, Houston, Texas, USA, March 03--05, 2006}", title = "{Proceedings of the 37th SIGCSE Technical Symposium on Computer Science Education 2006, Houston, Texas, USA, March 03--05, 2006}", publisher = pub-ACM, address = pub-ACM:adr, pages = "xxiv + 587", year = "2006", CODEN = "SIGSD3", ISBN = "????", ISBN-13 = "????", ISSN = "0097-8418 (print), 2331-3927 (electronic)", LCCN = "QA76.27", bibdate = "Sat Oct 14 15:15:41 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.bibsys.no:2100/BIBSYS", note = "ACM order number 457060.", series = j-SIGCSE, acknowledgement = ack-nhfb, } @Proceedings{ACM:2006:VPS, editor = "{ACM}", booktitle = "{VEE 2006: proceedings of the Second International Conference on Virtual Execution Environments, June 14-16, 2006, Ottawa, Ontario, Canada}", title = "{VEE 2006: proceedings of the Second International Conference on Virtual Execution Environments, June 14-16, 2006, Ottawa, Ontario, Canada}", publisher = pub-ACM, address = pub-ACM:adr, pages = "viii + 186", year = "2006", ISBN = "1-59593-332-6 (??invalid ISBN??)", ISBN-13 = "978-1-59593-332-4", LCCN = "QA76.9.V4", bibdate = "Sat Oct 14 13:44:27 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.bibsys.no:2100/BIBSYS", acknowledgement = ack-nhfb, meetingname = "ACM/USENIX International Conference on Virtual Execution Environments 2 2006 Ottawa", } @Proceedings{Anonymous:2006:PGI, editor = "Anonymous", booktitle = "{Proceedings of Gelato ICE: Itanium Conference and Expo: Spotlighting Linux on Itanium-based Platforms, October 1-4, 2006, Biopolis, Singapore}", title = "{Proceedings of Gelato ICE: Itanium Conference and Expo: Spotlighting Linux on Itanium-based Platforms, October 1-4, 2006, Biopolis, Singapore}", publisher = "????", address = "????", pages = "????", year = "2006", ISBN = "????", ISBN-13 = "????", LCCN = "????", bibdate = "Sat Oct 14 18:23:38 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.ice.gelato.org/; http://www.ice.gelato.org/about/oct06_presentations.php", acknowledgement = ack-nhfb, } @Proceedings{IEEE:2006:PIC, editor = "{IEEE}", booktitle = "{Proceedings of the International conference on Networking and Services 2006, July 16--18, 2006}", title = "{Proceedings of the International conference on Networking and Services 2006, July 16--18, 2006}", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "????", year = "2006", ISBN = "0-7695-2622-5", ISBN-13 = "978-0-7695-2622-5", LCCN = "????", bibdate = "Sat Oct 14 14:18:22 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.loc.gov:7090/Voyager", acknowledgement = ack-nhfb, } @Proceedings{IEEE:2006:PIS, editor = "{IEEE}", booktitle = "{Proceedings of the 20th International Symposium on High-Performance Computing in an Advanced Collaborative Environment (HPCS'06), St. John's, Newfoundland, May 14--17, 2006}", title = "{Proceedings of the 20th International Symposium on High-Performance Computing in an Advanced Collaborative Environment (HPCS'06), St. John's, Newfoundland, May 14--17, 2006}", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "????", year = "2006", ISBN = "0-7695-2582-2", ISBN-13 = "978-0-7695-2582-2", ISSN = "1550-5243", LCCN = "QA76.88", bibdate = "Sat Oct 14 13:58:07 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "ACM product number E2582.", acknowledgement = ack-nhfb, } @Proceedings{Min:2006:FHP, editor = "Geyong Min and others", booktitle = "{Frontiers of high performance computing and networking: ISPA 2006 workshops: ISPA 2006 international workshops, FHPCN, XHPC, S-GRACE, GridGIS, HPC-GTP, PDCE, ParDMCom, WOMP, ISDF, and UPWN, Sorrento, Italy, December 4-7, 2006: proceedings}", title = "{Frontiers of high performance computing and networking: ISPA 2006 workshops: ISPA 2006 international workshops, FHPCN, XHPC, S-GRACE, GridGIS, HPC-GTP, PDCE, ParDMCom, WOMP, ISDF, and UPWN, Sorrento, Italy, December 4-7, 2006: proceedings}", volume = "4331", publisher = pub-SV, address = pub-SV:adr, pages = "xxxvii + 1141", year = "2006", ISBN = "3-540-49860-5 (paperback)", ISBN-13 = "978-3-540-49860-5 (paperback)", LCCN = "QA76.58 .I88 2006a; QA76.88 .F76 2006", bibdate = "Mon Sep 13 11:21:54 MDT 2010", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.loc.gov:7090/Voyager", series = "Lecture notes in computer science, 0302-9743", URL = "http://www.loc.gov/catdir/enhancements/fy0825/2006937143-d.html", acknowledgement = ack-nhfb, meetingname = "ISPA 2006 (2006 : Sorrento, Italy)", remark = "Revised papers presented at the 10 workshops held in conjunction with the 4th International Symposium on Parallel and Distributed Processing and Applications (ISPA 2006)\\ International Workshop on Frontiers of High-Performance Computing and Networking (FHPCN 2006) \\ International Workshop on XEN in HPC Cluster and Grid Computing Environments (XHPC 2006) \\ International Workshop on Semantic GRid Applications in Computing and Engineering (S-GRACE 2006) \\ International Workshop on Fertilization of Grid Computing and Geographic Information Systems (GridGIS 2006) \\ International Workshop on High-Performance Computing in Genomic Proteomics and Transcriptomics (HPC-GTP 2006) \\ International Workshop on Parallel and Distributed Computing in Engineering (PDCE 2006) \\ International Workshop on Parallel and Distributed Multimedia Computing (ParDMCom 2006) \\ International Workshop on Middleware Performance (WOMP 2006) \\ International Workshop on Information Security and Digital Forensics (ISDF 2006) \\ International Workshop on Ubiquitous Processing for Wireless Networks (UPWN 2006)", subject = "Parallel processing (Electronic computers); Congresses; Electronic data processing; Distributed processing; High performance computing; Computational grids (Computer systems)", } @Proceedings{Turner:2006:SIS, editor = "Stephen John Turner and Bu Sung Lee and Wientong Cai", booktitle = "{Sixth International Symposium on Cluster Computing and the Grid CCGrid 06: 16--19 May, 2006, Singapore}", title = "{Sixth International Symposium on Cluster Computing and the Grid CCGrid 06: 16--19 May, 2006, Singapore}", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "xxiii + 662", year = "2006", ISBN = "0-7695-2585-7", ISBN-13 = "978-0-7695-2585-3", LCCN = "QA76.9.C58", bibdate = "Sat Oct 14 15:36:24 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib; z3950.loc.gov:7090/Voyager", note = "IEEE Computer Society Order Number P2585.", acknowledgement = ack-nhfb, } @Proceedings{USENIX:2006:PUA, editor = "{USENIX}", booktitle = "{Proceedings of the 2006 USENIX Annual Technical Conference: May 30--June 3, 2006, Boston, MA, USA}", title = "{Proceedings of the 2006 USENIX Annual Technical Conference: May 30--June 3, 2006, Boston, MA, USA}", publisher = pub-USENIX, address = pub-USENIX:adr, pages = "386 (est.)", year = "2006", ISBN = "1-931971-44-7", ISBN-13 = "978-1-931971-44-7", LCCN = "????", bibdate = "Wed Oct 18 11:37:53 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, } @Proceedings{Anonymous:2010:NDS, editor = "Anonymous", booktitle = "{17th Annual Network and Distributed System Symposium, NDSS '10, The Dana on Misson Bay, San Diego, California. February 28--March 3, 2010}", title = "{17th Annual Network and Distributed System Symposium, NDSS '10, The Dana on Misson Bay, San Diego, California. February 28--March 3, 2010}", publisher = "Internet Society", address = "Reston, VA, USA", pages = "????", year = "2010", ISBN = "1-891562-29-0, 1-891562-30-4", ISBN-13 = "978-1-891562-29-7, 978-1-891562-30-3", LCCN = "????", bibdate = "Fri Mar 13 09:39:28 MDT 2015", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/cryptography2010.bib; https://www.math.utah.edu/pub/tex/bib/hash.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://www.isoc.org/isoc/conferences/ndss/10/proceedings.shtml", acknowledgement = ack-nhfb, } @Proceedings{Lathrop:2011:SPI, editor = "Scott Lathrop and Jim Costa and William Kramer", booktitle = "{SC'11: Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis, Seattle, WA, November 12--18 2011}", title = "{SC'11: Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis, Seattle, WA, November 12--18 2011}", publisher = pub-ACM # " and " # pub-IEEE, address = pub-ACM:adr # " and " # pub-IEEE:adr, pages = "????", year = "2011", ISBN = "1-4503-0771-X", ISBN-13 = "978-1-4503-0771-0", LCCN = "????", bibdate = "Fri Dec 16 11:11:35 2011", bibsource = "https://www.math.utah.edu/pub/tex/bib/supercomputing2011.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", acknowledgement = ack-nhfb, xxeditor = "{ACM}", } @Book{Dhillon:2018:BEA, author = "Vikram Dhillon and David Metcalf and Max Hooper", booktitle = "Blockchain enabled applications: understand the blockchain ecosystem and how to make it work for you", title = "Blockchain enabled applications: understand the blockchain ecosystem and how to make it work for you", publisher = pub-APRESS, address = pub-APRESS:adr, pages = "xvii + 218 + 103", year = "2018", DOI = "https://doi.org/10.1007/978-1-4842-3081-7", ISBN = "1-4842-3080-9 (print), 1-4842-3081-7 (e-book)", ISBN-13 = "978-1-4842-3080-0 (print), 978-1-4842-3081-7 (e-book)", LCCN = "QA76.9.D32", bibdate = "Wed Jan 24 12:32:42 MST 2018", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/bitcoin.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", URL = "http://link.springer.com/10.1007/978-1-4842-3081-7", abstract = "Work with blockchain and understand its potential application beyond cryptocurrencies in the domains of healthcare, Internet of Things, finance, decentralized organizations, and open science. Featuring case studies and practical insights generated from a start-up spun off from the authors own lab, this book covers a unique mix of topics not found in others and offers insight into how to overcome real hurdles that arise as the market and consumers grow accustomed to blockchain based start-ups. You'll start with a review of the historical origins of blockchain and explore the basic cryptography needed to make the blockchain work for Bitcoin. You will then learn about the technical advancements made in the surrounded ecosystem: the Ethereum virtual machine, Solidity, Colored Coins, the Hyperledger Project, Blockchain-as-a-service offered through IBM, Microsoft and more. This book looks at the consequences of machine-to-machine transactions using the blockchain socially, technologically, economically and politically. \booktitle{Blockchain Enabled Applications} provides you with a clear perspective of the ecosystem that has developed around the blockchain and the various industries it has penetrated.", acknowledgement = ack-nhfb, subject = "Blockchains (Databases); COMPUTERS / Databases / General.; Blockchains (Databases)", tableofcontents = "1. Behold the Dreamers \\ 2. The Gold Rush \\ 3. Blocks in a Chain \\ 4. Ether in the Air \\ 5. Decentralized Organizations \\ 6. The DAO Hacked \\ 7. Ethereum Tokens: High Performance Computing \\ 8. Blockchain in Science \\ 9. Blockchain in Healthcare \\ 10. The Hyperledger Project \\ 11. Recent Developments in Blockchain \\ 12. Technological Revolutions and Financial Capital \\ Appendix. Building a Healthcare Consortium", }