Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Laura E. Grit

dblp:77/1381 · DBLP profile ↗
← Back
6ranked-venue papers
1as first author
0since 2021 · last 2008
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 5 · 1 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
6 papers
Cloud and datacenter computing · 79% Distributed systems · 16% Parallel and multicore computing · 4%

Topics — the 18 heaviest of 19, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing › cluster resource management and scheduling
cluster resource management
0.132008
Weighted fair sharing for dynamic virtual clusters · SIGMETRICS 2008
Dynamic Virtual Clusters in a Grid Site Manager · HPDC 2003
Grid allocation and reservation - Toward a doctrine of containment: grid hosting with adaptive resource control · SC 2006
Cloud and datacenter computing
resource management
0.122006
Grid allocation and reservation - Toward a doctrine of containment: grid hosting with adaptive resource control · SC 2006
Dynamic Virtual Clusters in a Grid Site Manager · HPDC 2003
Cloud and datacenter computing › cluster resource management and scheduling
cluster scheduling
0.112008
Weighted fair sharing for dynamic virtual clusters · SIGMETRICS 2008
Distributed systems › distributed resource management
fair resource allocation
0.112008
Weighted fair sharing for dynamic virtual clusters · SIGMETRICS 2008
Cloud and datacenter computing › resource management
resource management and scheduling
0.112007
Automated and on-demand provisioning of virtual machines for database applications · SIGMOD Conference 2007
Cloud and datacenter computing › cloud service management
service level agreement management
0.112007
Automated and on-demand provisioning of virtual machines for database applications · SIGMOD Conference 2007
Cloud and datacenter computing
utility computing
0.112007
Automated and on-demand provisioning of virtual machines for database applications · SIGMOD Conference 2007
Cloud and datacenter computing › resource provisioning
virtual machine provisioning
0.112007
Automated and on-demand provisioning of virtual machines for database applications · SIGMOD Conference 2007
Cloud and datacenter computing › workload isolation
container isolation
0.112006
Grid allocation and reservation - Toward a doctrine of containment: grid hosting with adaptive resource control · SC 2006
Distributed systems
resource sharing
0.112006
Sharing Networked Resources with Brokered Leases · USENIX ATC, General Track 2006
Cloud and datacenter computing › resource allocation
market-based resource allocation
0.012004
Balancing Risk and Reward in a Market-Based Task Service · HPDC 2004
Parallel and multicore computing
task scheduling
0.012004
Balancing Risk and Reward in a Market-Based Task Service · HPDC 2004
Cloud and datacenter computing › resource provisioning
dynamic resource provisioning
0.012003
Dynamic Virtual Clusters in a Grid Site Manager · HPDC 2003
Cloud and datacenter computing › virtualization
virtual cluster
0.012003
Dynamic Virtual Clusters in a Grid Site Manager · HPDC 2003
Cloud and datacenter computing
cluster resource management and scheduling
0.012006
Sharing Networked Resources with Brokered Leases · USENIX ATC, General Track 2006
Distributed systems
distributed coordination
0.012004
Balancing Risk and Reward in a Market-Based Task Service · HPDC 2004
Distributed systems › peer-to-peer systems
incentive mechanisms
0.012004
Balancing Risk and Reward in a Market-Based Task Service · HPDC 2004
Distributed systems
grid computing
0.012003
Dynamic Virtual Clusters in a Grid Site Manager · HPDC 2003

Methods — techniques the papers use, named apart from their topics

start-time fair queuing · 0.1calendar scheduler · 0.1on-demand provisioning · 0.1automated resource allocation · 0.1job-level and container-level resource management · 0.1adaptive provisioning · 0.1market-based mechanism design · 0.0resource reservation · 0.0policy-based cluster sharing · 0.0
YearPublicationVenuePosition
2008 Weighted fair sharing for dynamic virtual clusters
abstract
In a shared server infrastructure, a scheduler controls how quantities of resources are shared over time in a fair manner across multiple, competing consumers. It should support wide (parallel) requests for variable-sized pool of resources, provide assurance of minimum resource allotment on demand, and give predictable assignments. Our approach integrates a fair queuing algorithm with a calendar scheduler. We present WINKS, a proportional share allocation policy that addresses the needs of shared server environments. It extends start-time fair queuing to support wide requests with backfill, advance reservations, dynamic cluster sizing, dynamic request sizing, and intra-flow request prioritization. It also preserves fairness properties across queue transformations and calendar operations needed to implement these extensions.
Laura E. Grit, Jeffrey S. Chase
SIGMETRICS1
2007 Automated and on-demand provisioning of virtual machines for database applications
abstract
Utility computing delivers compute and storage resources to applications as an 'on-demand utility', much like electricity, from a distributed collection of computing resources. There is great interest in running database applications on utility resources (e.g., Oracle's Grid initiative) due to reduced infrastructure and management costs, higher resource utilization, and the ability to handle sudden load surges. Virtual Machine (VM) technology offers powerful mechanisms to manage a utility resource infrastructure. However, provisioning VMs for applications to meet system performance goals, e.g., to meet service level agreements (SLAs), is an open problem. We are building two systems at Duke - Shirako and NIMO - that collectively address this problem.
Piyush Shivam, Azbayar Demberel, Pradeep Gunda, David Irwin 0001, Laura E. Grit, Aydan R. Yumerefendi, Shivnath Babu, Jeffrey S. Chase
SIGMOD Conference5
2006 Grid allocation and reservation - Toward a doctrine of containment: grid hosting with adaptive resource control
abstract
Grid computing environments need secure resource control and predictable service quality in order to be sustainable. We propose a grid hosting model in which independent, self-contained grid deployments run within isolated containers on shared resource provider sites. Sites and hosted grids interact via an underlying resource control plane to manage a dynamic binding of computational resources to containers. We present a prototype grid hosting system, in which a set of independent Globus grids share a network of cluster sites. Each grid instance runs a coordinator that leases and configures cluster resources for its grid on demand. Experiments demonstrate adaptive provisioning of cluster resources and contrast job-level and container-level resource management in the context of two grid application managers.
Lavanya Ramakrishnan, David Irwin 0001, Laura E. Grit, Aydan R. Yumerefendi, Adriana Iamnitchi, Jeffrey S. Chase
SC3
2006 Sharing Networked Resources with Brokered Leases
David Irwin 0001, Jeffrey S. Chase, Laura E. Grit, Aydan R. Yumerefendi, Ken Yocum
USENIX ATC, General Track3
2004 Balancing Risk and Reward in a Market-Based Task Service
David Irwin 0001, Laura E. Grit, Jeffrey S. Chase
HPDC2
2003 Dynamic Virtual Clusters in a Grid Site Manager
abstract
This paper presents new mechanisms for dynamic resource management in a cluster manager called Cluster-on-Demand (COD). COD allocates servers from a common pool to multiple virtual clusters (vclusters), with independently configured software environments, name spaces, user access controls, and network storage volumes. We present experiments using the popular Sun GridEngine batch scheduler to demonstrate that dynamic virtual clusters are an enabling abstraction for advanced resource management in computing utilities and grids. In particular, they support dynamic, policy-based cluster sharing between local users and hosted Grid services, resource reservation and adaptive provisioning, scavenging of the idle resources, and dynamic instantiation of Grid services. These goals are achieved in a direct and general way through a new set of fundamental cluster management functions, with minimal impact on the Grid middleware itself.
Jeffrey S. Chase, David Irwin 0001, Laura E. Grit, Justin D. Moore, Sara Sprenkle
HPDC3