Now showing items 1-7 of 7

    • Concatenated Codes for Deletion Channels 

      Chen, Johnny; Mitzenmacher, Michael D.; Ng, Chaki; Varnica, Nedeljko (2003)
      We design concatenated codes suitable for the deletion channel. The inner code is a combination of a single deletion correcting Varshamov-Tenengolts block code and a marker code. The outer code is a low-density parity-check ...
    • Egg: An Extensible and Economics-Inspired Open Grid Computing Platform 

      Brunelle, John A; Hurst, Peter; Huth, John; Kang, Laura; Ng, Chaki; Parkes, David C.; Seltzer, Margo I.; Shank, Jim; Youssef, Saul (World Scientific Publishing, 2006)
      The Egg project provides a vision and implementation of how heterogeneous computational requirements will be supported within a single grid and a compelling reason to explain why computational grids will thrive. Environment ...
    • Mirage: A Microeconomic Resource Allocation System for Sensornet Testbeds 

      Chun, Brent N.; Buonadonna, Philip; AuYoung, Alvin; Ng, Chaki; Parkes, David C.; Shneidman, Jeffery; Snoeren, Alex C.; Vahdat, Amin (Institute of Electrical and Electronics Engineers, 2005)
      In this paper, we argue that a microeconomic resource allocation scheme, specifically the combinatorial auction, is well suited to testbed resource management. To demonstrate this, we present the Mirage resource allocation ...
    • Strategyproof Computing: Systems Infrastructures for Self-Interested Parties 

      Ng, Chaki; Parkes, David C.; Seltzer, Margo I. (2003)
      The widespread deployment of high-speed internet access is ushering in a new era of distributed computing, in which parties both contribute to a global pool of shared resources and access the pooled resources to support ...
    • Two Auction-Based Resource Allocation Environments: Design and Experience 

      AuYoung, Alvin; Buonadonna, Phil; Chun, Brent N.; Ng, Chaki; Parkes, David; Shneidman, Jeffrey; Snoeren, Alex C.; Vahdat, Amin (Wiley, 2009)
      Many computer systems have reached the point where the goal of resource allocation is no longer to maximize utilization; instead, when demand exceeds supply and not all needs can be met, one needs a policy to guide resource ...
    • Virtual Worlds: Fast and Strategyproof Auctions for Dynamic Resource Allocation 

      Ng, Chaki; Parkes, David C.; Seltzer, Margo I. (Association for Computing Machinery, 2003)
      We consider the problem of designing fast and strategyproof exchanges for dynamic resource allocation problems in distributed systems. The exchange is implemented as a sequence of auctions, with dynamically arriving requests ...
    • Why Markets Could (But Don't Currently) Solve Resource Allocation Problems in Systems 

      Shneidman, Jeffery; Ng, Chaki; Parkes, David C.; Young, Alvin Au; Snoeren, Alex C.; Vahdat, Amin; Chun, Brent (USENIX, 2005)
      Using market mechanisms for resource allocation in distributed systems is not a new idea, nor is it one that has caught on in practice or with a large body of computer science research. Yet, projects that use markets for ...