Ymir Vigfusson | Emory University (original) (raw)
Uploads
Papers by Ymir Vigfusson
Here, we take a different stance and claim that clouds are now mature enough to become first-clas... more Here, we take a different stance and claim that clouds are now mature enough to become first-class research subjects, posing a range of unique and exciting challenges deserving collective attention from the research community. For example, the realization of privacy in clouds is a cross-cutting interdisciplinary challenge, permeating the entire stack of any imaginable cloud architecture. The goal of this
Multicast traffic patterns play a key role in dependable data centers, arising when data is repli... more Multicast traffic patterns play a key role in dependable data centers, arising when data is replicated and distributed over multiple machines for fault-tolerance and availability. Such settings involve large numbers of multicast groups as well as multiple senders to each group — a single system can have hundreds of such multicast channels. Without ef- fective multi-channel rate control, multicast senders
Proceedings of The Vldb Endowment, 2009
We consider the problem of how to best parallelize range queries in a massive scale distributed d... more We consider the problem of how to best parallelize range queries in a massive scale distributed database. In tradi- tional systems the focus has been on maximizing paral- lelism, for example by laying out data to achieve the highest throughput. However, in a massive scale database such as our PNUTS system (11) or BigTable (10), maximizing par- allelism is not
Workshop on Workstation Operating Systems (now HotOS)/Workshop on Hot Topics in Operating Systems, 2007
Existing distributed hash tables provide efficient mecha- nisms for storing and retrieving a data... more Existing distributed hash tables provide efficient mecha- nisms for storing and retrieving a data item based on an exact key, but are unsuitable when the search key is simi- lar, but not identical, to the key used to store the data item. In this paper, we present a scalable and efficient peer- to-peer system with a new search primitive that
Proceeding of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing - PODC '10, 2010
Proceedings of the Fourth ACM International Conference on Distributed Event-Based Systems - DEBS '10, 2010
Proceedings of the 4th International Workshop on Large Scale Distributed Systems and Middleware - LADIS '10, 2010
Proceedings of the 2012 ACM symposium on Principles of distributed computing - PODC '12, 2012
Proceedings of the 4th annual Symposium on Cloud Computing - SOCC '13, 2013
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing - PODC '08, 2008
Here, we take a different stance and claim that clouds are now mature enough to become first-clas... more Here, we take a different stance and claim that clouds are now mature enough to become first-class research subjects, posing a range of unique and exciting challenges deserving collective attention from the research community. For example, the realization of privacy in clouds is a cross-cutting interdisciplinary challenge, permeating the entire stack of any imaginable cloud architecture. The goal of this
Multicast traffic patterns play a key role in dependable data centers, arising when data is repli... more Multicast traffic patterns play a key role in dependable data centers, arising when data is replicated and distributed over multiple machines for fault-tolerance and availability. Such settings involve large numbers of multicast groups as well as multiple senders to each group — a single system can have hundreds of such multicast channels. Without ef- fective multi-channel rate control, multicast senders
Proceedings of The Vldb Endowment, 2009
We consider the problem of how to best parallelize range queries in a massive scale distributed d... more We consider the problem of how to best parallelize range queries in a massive scale distributed database. In tradi- tional systems the focus has been on maximizing paral- lelism, for example by laying out data to achieve the highest throughput. However, in a massive scale database such as our PNUTS system (11) or BigTable (10), maximizing par- allelism is not
Workshop on Workstation Operating Systems (now HotOS)/Workshop on Hot Topics in Operating Systems, 2007
Existing distributed hash tables provide efficient mecha- nisms for storing and retrieving a data... more Existing distributed hash tables provide efficient mecha- nisms for storing and retrieving a data item based on an exact key, but are unsuitable when the search key is simi- lar, but not identical, to the key used to store the data item. In this paper, we present a scalable and efficient peer- to-peer system with a new search primitive that
Proceeding of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing - PODC '10, 2010
Proceedings of the Fourth ACM International Conference on Distributed Event-Based Systems - DEBS '10, 2010
Proceedings of the 4th International Workshop on Large Scale Distributed Systems and Middleware - LADIS '10, 2010
Proceedings of the 2012 ACM symposium on Principles of distributed computing - PODC '12, 2012
Proceedings of the 4th annual Symposium on Cloud Computing - SOCC '13, 2013
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing - PODC '08, 2008