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

Aydan R. Yumerefendi

dblp:75/6541 · also Aydan Rafet Yumerefendi · DBLP profile ↗
← Back
10ranked-venue papers
4as first author
0since 2021 · last 2011
—ORCID · none

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

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

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 · 68% Storage systems · 19% Distributed systems · 13%
Network and information security
4 papers
Systems and software security · 51% Authentication and access control · 25% Cryptographic protocols and secure computation · 25%
Software engineering, system software, and programming languages
2 papers
Operating systems · 100%

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

TopicWeightPapersLastEvidence papers
Storage systems
networked storage
0.122007
Strong accountability for network storage · ACM Trans. Storage 2007
Strong Accountability for Network Storage · FAST 2007
Authentication and access control
authorization
0.112007
Authorizing applications in singularity · EuroSys 2007
Systems and software security
information flow control
0.112007
TightLip: Keeping Applications from Spilling the Beans · NSDI 2007
Cryptographic protocols and secure computation
verifiable computation
0.112007
Strong accountability for network storage · ACM Trans. Storage 2007
Operating systems › system security › operating system security
access control
0.112007
Authorizing applications in singularity · EuroSys 2007
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
Cloud and datacenter computing
resource management
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
Systems and software security › data security
data leakage prevention
0.112005
LLSS: toward system support for plugging privacy leaks · SOSP 2005
Systems and software security
operating system security
0.012007
Authorizing applications in singularity · EuroSys 2007
Operating systems › system security
operating system security
0.012007
TightLip: Keeping Applications from Spilling the Beans · NSDI 2007
Distributed systems
fault tolerance
0.012007
Strong Accountability for Network Storage · FAST 2007
Cloud and datacenter computing › cluster resource management and scheduling
cluster resource management
0.012006
Grid allocation and reservation - Toward a doctrine of containment: grid hosting with adaptive resource control · SC 2006
Cloud and datacenter computing
cluster resource management and scheduling
0.012006
Sharing Networked Resources with Brokered Leases · USENIX ATC, General Track 2006
Distributed systems
peer-to-peer systems
0.012005
LLSS: toward system support for plugging privacy leaks · SOSP 2005

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

security model · 0.1information flow control · 0.1cryptographic evidence · 0.1audit protocols · 0.1access control lists · 0.1encryption · 0.1on-demand provisioning · 0.1automated resource allocation · 0.1job-level and container-level resource management · 0.1adaptive provisioning · 0.1
YearPublicationVenuePosition
2011 Provisioning and Evaluating Multi-domain Networked Clouds for Hadoop-based Applications
abstract
This paper presents the design, implementation, and evaluation of a new system for on-demand provisioning of Hadoop clusters across multiple cloud domains. The Hadoop clusters are created "on-demand" and are composed of virtual machines from multiple cloud sites linked with bandwidth-provisioned network pipes. The prototype uses an existing federated cloud control framework called Open Resource Control Architecture (ORCA), which orchestrates the leasing and configuration of virtual infrastructure from multiple autonomous cloud sites and network providers. ORCA enables computational and network resources from multiple clouds and network substrates to be aggregated into a single virtual "slice" of resources, built to order for the needs of the application. The experiments examine various provisioning alternatives by evaluating the performance of representative Hadoop benchmarks and applications on resource topologies with varying bandwidths. The evaluations examine conditions in which multi-cloud Hadoop deployments pose significant advantages or disadvantages during Map/Reduce/Shuffle operations. Further, the experiments compare multi-cloud Hadoop deployments with single-cloud deployments and investigate Hadoop Distributed File System (HDFS) performance under varying network configurations. The results show that networked clouds make cross-cloud Hadoop deployment feasible with high bandwidth network links between clouds. As expected, performance for some benchmarks degrades rapidly with constrained inter-cloud bandwidth. MapReduce shuffle patterns and certain Hadoop Distributed File System (HDFS) operations that span the constrained links are particularly sensitive to network performance. Hadoop's topology-awareness feature can mitigate these penalties to a modest degree in these hybrid bandwidth scenarios. Additional observations show that contention among co-located virtual machines is a source of irregular performance for Hadoop applications on virtual cloud infrastructure.
Anirban Mandal, Yufeng Xin, Ilya Baldin, Paul Ruth, Chris Heermann, Jeffrey S. Chase, Victor Orlikowski, Aydan R. Yumerefendi
CloudCom8
2007 Authorizing applications in singularity
abstract
We describe a new design for authorization in operating systems in which applications are first-class entities. In this design, principals reflect application identities. Access control lists are patterns that recognize principals. We present a security model that embodies this design in an experimental operating system, and we describe the implementation of our design and its performance in the context of this operating system.
Ted Wobber, Aydan R. Yumerefendi, Martín Abadi, Andrew Birrell, Daniel R. Simon
EuroSys2
2007 Strong Accountability for Network Storage
Aydan R. Yumerefendi, Jeffrey S. Chase
FAST1
2007 TightLip: Keeping Applications from Spilling the Beans
Aydan R. Yumerefendi, Benjamin Mickle, Landon P. Cox
NSDI1
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 Conference6
2007 Strong accountability for network storage
abstract
This article presents the design, implementation, and evaluation of CATS, a network storage service with strong accountability properties. CATS offers a simple web services interface that allows clients to read and write opaque objects of variable size. This interface is similar to the one offered by existing commercial Internet storage services. CATS extends the functionality of commercial Internet storage services by offering support for strong accountability. A CATS server annotates read and write responses with evidence of correct execution, and offers audit and challenge interfaces that enable clients to verify that the server is faithful. A faulty server cannot conceal its misbehavior, and evidence of misbehavior is independently verifiable by any participant. CATS clients are also accountable for their actions on the service. A client cannot deny its actions, and the server can prove the impact of those actions on the state views it presented to other clients. Experiments with a CATS prototype evaluate the cost of accountability under a range of conditions and expose the primary factors influencing the level of assurance and the performance of a strongly accountable storage server. The results show that strong accountability is practical for network storage systems in settings with strong identity and modest degrees of write-sharing. We discuss how the accountability concepts and techniques used in CATS generalize to other classes of network services.
Aydan R. Yumerefendi, Jeffrey S. Chase
ACM Trans. Storage1
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
SC4
2006 Sharing Networked Resources with Brokered Leases
David Irwin 0001, Jeffrey S. Chase, Laura E. Grit, Aydan R. Yumerefendi, Ken Yocum
USENIX ATC, General Track4
2005 The Architecture of PIER: an Internet-Scale Query Processor
Ryan Huebsch, Brent N. Chun, Joseph M. Hellerstein, Boon Thau Loo, Petros Maniatis, Timothy Roscoe, Scott Shenker, Ion Stoica, Aydan R. Yumerefendi
CIDR9
2005 LLSS: toward system support for plugging privacy leaks
abstract
Imagine that two users, Alice and Bob, have a conversation about a sensitive subject over email. Alice is vigilant about protecting the secrecy of the discussion and encrypts all copies of her sent and received emails. Bob, on the other hand, is well-meaning but negligent, and does not bother to encrypt any of his on-disk files. Worse, he unwittingly stores his email files in the portion of his hard drive that is shared with the rest of the Internet via a peer-to-peer client. One night, unbeknownst to either Alice or Bob, someone on the peer-to-peer network peruses Bob's shared space, finds his email files, and reads their private conversation. Despite Alice's best efforts and Bob's best intentions, the privacy of their discussion has leaked.
Aydan R. Yumerefendi, Landon P. Cox
SOSP1