Multiple operating systems on one processor complex

Borden, T. L.; Hennessy, J. P.; Rymarczyk, James W.

doi:10.1147/sj.281.0104

Cited by 47 publications

(18 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We assume that the data center is based on logical partitioning [23], i.e., the underlying physical resources are timemultiplexed between different VMs, and time is partitioned into slots of equal length. We denote the computing resource demand of a VN v at time t by R(v, t), and assume it is the probabilistic combination of three parts: a basic part R 0 (v, t), which exists throughout the lifetime of the VN, and two variable parts R 1 (v, t) and R 2 (v, t), which occur with probabilities of p v 1 and p v 2 , respectively, i.e., R 1 (v, t) and Fig.…”

Section: A Probabilistic Combination As Resource Demandmentioning

confidence: 99%

Leveraging tenant flexibility in resource allocation for virtual networks

Zhang

Qian

et al. 2014

2014 23rd International Conference on Computer Communication and Networks (ICCCN)

View full text Add to dashboard Cite

Abstract-Virtual networks that allow tenants to explicitly specify their computing as well as networking resources are recently proposed to be better interfaces between cloud providers and tenants. Many virtual networks have time-varying resource demands, as evidenced in prior studies [1][2][3]. New opportunities emerge when such variation is exploited. In this paper, we design a novel resource demand model for tenants to flexibly trade off between application performance and cost, and propose a work-conserving allocation algorithm, WCA, for deploying virtual networks with time-varying resource demands. WCA places virtual nodes in a first-fit fashion, and places virtual links through path-splitting. In each physical node or link, by opportunistically sharing physical resources among multiple variable parts of resource demands, physical utilization can be improved, and more virtual networks can be deployed concurrently. Our evaluation results show that WCA achieves a 4% higher physical resource utilization and rejects 18% less virtual network requests than a state-of-the-art algorithm [4].

show abstract

Section: A Probabilistic Combination As Resource Demandmentioning

confidence: 99%

Leveraging tenant flexibility in resource allocation for virtual networks

Zhang

Qian

et al. 2014

2014 23rd International Conference on Computer Communication and Networks (ICCCN)

View full text Add to dashboard Cite

show abstract

“…OSs on a physical machine [10]. Each OS executes in an isolated virtual machine (VM), observing a hardware interface that is usually identical to the underlying hardware interface [81].…”

Section: Virtualizationmentioning

confidence: 99%

File system virtual appliances

et al. 2012

View full text Add to dashboard Cite

Implementing and maintaining file systems is painful. OS functionality is notoriously difficult to develop and debug, and file systems are more so than most because of their size and interactions with other OS components.In-kernel file systems must adhere to a large number of internal OS interfaces.Though difficult during initial file system development, these dependencies particularly complicate porting a file system to different OSs or even across OS versions.This dissertation describes an architecture that addresses the file system portability problem. Virtual machines are used to decouple the OS on which a file system runs from the OS on which user applications run. The file system is distributed as a file system virtual appliance (FSVA), a virtual machine running the file system developers' preferred OS (version). Users runs their applications in a separate virtual machine, using their preferred OS (version).An FSVA design and implementation is described that maintains file system semantics with few, if any, code changes. This is achieved by sending all file system operations from the user OS to the FSVA. A unified buffer cache is maintained by using shared memory between the user OS and FSVA and by letting the user OS control the FSVA's buffer cache size. core is dedicated to an FSVA, a power-efficient polling mechanism reduces the overheads to 0-10%. Alternatively, relaxing the FSVA design goals by handling the frequent access-control file system checks in the user OS leads to similar overhead reductions as polling, but without the need for an additional core. AcknowledgementsI had a great time in graduate school. This was in large part due to the wonderful people that I was fortunate enough to interact with. First and foremost, I cannot thank my advisors Greg Ganger and MikeReiter enough. I was lucky to have not one, but two advisors that cared about my development and research interests, always made time for me, and were always supportive. They taught me how to identify interesting problems, develop a solution, evaluate it, and clearly describe it. I enjoyed our interactions tremendously. I also owe all my knowledge of college basketball and football to them.My dissertation grew out of Garth Gibson's idea of running a file system in a virtual machine. I thank him for his guidance during this work. Orran Krieger had many useful insights, encouraging me to view this work as leveraging multicores and motivating virtual machine-based microkernels.I was fortunate to work with many great graduate students. Jay Wylie and Garth Goodson patiently explained distributed systems to me, and were wonderful mentors during my first two years. Jay continued informally mentoring even after finishing graduate school, for which I am very grateful.

show abstract

“…Various virtual machine monitor approaches have been suggested [14,42,7] for supporting COTS applications while reliably separating different domains of data. In general, for these approaches to be trustworthy requires both the use of strictly virtualizable hardware [29], and a trustworthy monitor mechanism for separating the activities of the virtual machines.…”

Section: Related Workmentioning

confidence: 99%

MYSEA: The Monterey Security Architecture

Irvine¹,

Nguyen²,

Shifflett³

et al. 2009

View full text Add to dashboard Cite

Mandated requirements to share information across different sensitivity domains necessitate the design of distributed architectures to enforce information flow policies while providing protection from malicious code and attacks devised by highly motivated adversaries. The MYSEA architecture uses component security services and mechanisms to extend and inter-operate with commodity PCs, commodity client software, applications, trusted components, and legacy single level networks, providing new capabilities for composing secure, distributed multilevel secure solutions. This results in an architecture that meets two compelling requirements: first, that users have a familiar work environment, and, second, that critical mandatory security policies are enforced.

show abstract

Multiple operating systems on one processor complex

Cited by 47 publications

References 2 publications

Leveraging tenant flexibility in resource allocation for virtual networks

Leveraging tenant flexibility in resource allocation for virtual networks

File system virtual appliances

MYSEA: The Monterey Security Architecture

Contact Info

Product

Resources

About