Gunho Lee, N. Tolia, Parthasarathy Ranganathan, R. Katz
{"title":"Topology-aware resource allocation for data-intensive workloads","authors":"Gunho Lee, N. Tolia, Parthasarathy Ranganathan, R. Katz","doi":"10.1145/1851276.1851278","DOIUrl":"https://doi.org/10.1145/1851276.1851278","url":null,"abstract":"This paper proposes an architecture for optimized resource allocation in Infrastructure-as-a-Service (IaaS)-based cloud systems. Current IaaS systems are usually unaware of the hosted application's requirements and therefore allocate resources independently of its needs, which can significantly impact performance for distributed data-intensive applications. To address this resource allocation problem, we propose an architecture that adopts a \"what if\" methodology to guide allocation decisions taken by the IaaS. The architecture uses a prediction engine with a lightweight simulator to estimate the performance of a given resource allocation and a genetic algorithm to find an optimized solution in the large search space. We have built a prototype for Topology-Aware Resource Allocation (TARA) and evaluated it on a 80 server cluster with two representative MapReduce-based benchmarks. Our results show that TARA reduces the job completion time of these applications by up to 59% when compared to application-independent allocation policies.","PeriodicalId":202924,"journal":{"name":"Asia Pacific Workshop on Systems","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124630093","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Kok-Kiong Yap, Te-Yuan Huang, B. Dodson, M. Lam, N. McKeown
{"title":"Towards software-friendly networks","authors":"Kok-Kiong Yap, Te-Yuan Huang, B. Dodson, M. Lam, N. McKeown","doi":"10.1145/1851276.1851288","DOIUrl":"https://doi.org/10.1145/1851276.1851288","url":null,"abstract":"There has usually been a clean separation between networks and the applications that use them. Applications send packets over a simple socket API; the network delivers them. However, there are many occasions when applications can benefit from more direct interaction with the network: to observe more of the current network state and to obtain more control over the network behavior. This paper explores some of the potential benefits of closer interaction between applications and the network. Exploiting the emergence of so-called \"software-defined networks\" (SDN) built above network-wide control planes, we explore how to build a more \"software-friendly network\". We present results from a preliminary exploration that aims to provide network services to applications via an explicit communication channel.","PeriodicalId":202924,"journal":{"name":"Asia Pacific Workshop on Systems","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124144219","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On-line consistent backup in transactional file systems","authors":"Lipika Deka, G. Barua","doi":"10.1145/1851276.1851285","DOIUrl":"https://doi.org/10.1145/1851276.1851285","url":null,"abstract":"A consistent backup, preserving data integrity across files in a file system, is of utmost importance for the purpose of correctness and minimizing system downtime during the process of data recovery. With the present day demand for continuous access to data, backup has to be taken of an active file system, putting the consistency of the backup copy at risk. We propose a scheme to take a consistent backup of an active file system assuming that the file system supports transactions. We take into consideration that file operations include, besides reading and writing of files, directory operations, file descriptor operations and operations such as append, truncate, etc. We are putting our scheme into a formal framework to prove its correctness and we have devised algorithms for implementing the scheme. We intend to simulate the algorithms and run experiments to help tune the algorithms.","PeriodicalId":202924,"journal":{"name":"Asia Pacific Workshop on Systems","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113976240","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
B. Leong, Youming Wang, S. Wen, Cristina Carbunaru, Y. M. Teo, Christopher S. Chang, T. Ho
{"title":"Improving peer-to-peer file distribution: winner doesn't have to take all","authors":"B. Leong, Youming Wang, S. Wen, Cristina Carbunaru, Y. M. Teo, Christopher S. Chang, T. Ho","doi":"10.1145/1851276.1851289","DOIUrl":"https://doi.org/10.1145/1851276.1851289","url":null,"abstract":"Recent work on BitTorrent has shown that the choke/unchoke mechanism implements an auction where each peer tries to induce other peers into \"unchoking\" it by uploading more data than competing peers. Under such a scenario, fast peers tend to trade with one another and neglect slower peers. In this work, we revisit the peer-to-peer (p2p) file distribution problem and show that this does not have to be the case. We describe a p2p file distribution algorithm, the Tit-For-Tat Transport Protocol (TFTTP), that is able to achieve faster download performance than BitTorrent by employing a new mechanism called a promise. Our experiments show that the average throughput for TFTTP is some 30% to 70% higher than that for BitTorrent under controlled and realistic network conditions. We also show that TFTTP exhibits fairer sharing behavior and avoids the situation where \"winner takes all\".","PeriodicalId":202924,"journal":{"name":"Asia Pacific Workshop on Systems","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129314711","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"capDL: a language for describing capability-based systems","authors":"I. Kuz, G. Klein, Corey Lewis, Adam Walker","doi":"10.1145/1851276.1851284","DOIUrl":"https://doi.org/10.1145/1851276.1851284","url":null,"abstract":"Capabilities provide an access control model that can be used to construct systems where safety of protection can be precisely determined. However, in order to be certain of the security provided by such systems it is necessary to verify that their capability distributions do in fact fulfil requirements relating to isolation and information flow, and that there is a direct connection to the actual capability distribution in the system. We claim that, in order to do this effectively, systems need to have explicit descriptions of their capability distributions. In this paper we present the capDL capability distribution language for the capability-based seL4 microkernel. We present the capDL model, its main features and their motivations, and provide a small example to illustrate the language syntax and semantics. CapDL plays a key role in our approach to development, analysis, and verification of trustworthy systems.","PeriodicalId":202924,"journal":{"name":"Asia Pacific Workshop on Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130353897","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The case for active device drivers","authors":"L. Ryzhyk, Yanjin Zhu, G. Heiser","doi":"10.1145/1851276.1851283","DOIUrl":"https://doi.org/10.1145/1851276.1851283","url":null,"abstract":"We revisit the device-driver architecture supported by the majority of operating systems, where a driver is a passive object that does not have its own thread of control and is only activated when an external thread invokes one of its entry points. This architecture complicates driver development and induces errors in two ways. First, since multiple threads can invoke the driver concurrently, it must take care to synchronise the invocations to avoid race conditions. Second, since every invocation occurs in the context of its own thread, the driver cannot rely on programming-language constructs to maintain its control flow. Both issues make the control logic of the driver difficult to implement and even harder to understand and verify.\u0000 To address these issues, we propose a device-driver architecture where each driver has its own thread of control and communicates with other threads in the system via message passing. We show how this architecture addresses both of the above problems. Unlike previous message-based driver frameworks, it does not require any special language support and can be implemented inside an existing operating system as a kernel extension. We present our Linux-based implementation in progress and report on preliminary performance results.","PeriodicalId":202924,"journal":{"name":"Asia Pacific Workshop on Systems","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134379073","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The OKL4 microvisor: convergence point of microkernels and hypervisors","authors":"G. Heiser, Ben Leslie","doi":"10.1145/1851276.1851282","DOIUrl":"https://doi.org/10.1145/1851276.1851282","url":null,"abstract":"We argue that recent hypervisor-vs-microkernel discussions completely miss the point. Fundamentally, the two classes of systems have much in common, and provide similar abstractions. We assert that the requirements for both types of systems can be met with a single set of abstractions, a single design, and a single implementation. We present partial proof of the existence of this convergence point, in the guise of the OKL4 microvisor, an industrial-strength system designed as a highly-efficient hypervisor for use in embedded systems. It is also a third-generation microkernel that aims to support the construction of similarly componentised systems as classical microkernels. Benchmarks show that the microvisor's virtualization performance is highly competitive.","PeriodicalId":202924,"journal":{"name":"Asia Pacific Workshop on Systems","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121309958","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Suppressing bot traffic with accurate human attestation","authors":"M. Jamshed, Wonho Kim, KyoungSoo Park","doi":"10.1145/1851276.1851287","DOIUrl":"https://doi.org/10.1145/1851276.1851287","url":null,"abstract":"Human attestation is a promising technique to suppress unwanted bot traffic in the Internet. With a proof of human existence attached to the message, the receiving end can verify whether the content is actually drafted by humans. This technique can significantly reduce bot-generated abuse such as spamming, password cracking or even distributed denial-of-service (DDoS) attacks. Unfortunately, existing methods rely on the probabilistic characteristics of attestations and can be exploited by smart attackers.\u0000 In this paper, we propose deterministic human attestation based on trustworthy input devices. By placing the root of trust on the input device, we tightly bind the input events to the content for network delivery. Each input event is generated with a cryptographic hash that attests to human activity and the message consisting of such events gets a third-party verifiable digital signature that is carried to the remote application. For this, we augment the input device with a trusted platform module (TPM) chip and a small attester running inside the device. We focus on trustworthy keyboards here but we plan to extend the framework to other input devices.","PeriodicalId":202924,"journal":{"name":"Asia Pacific Workshop on Systems","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134163098","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"DDE: dynamic data structure excavation","authors":"Asia Slowinska, T. Stancescu, H. Bos","doi":"10.1145/1851276.1851280","DOIUrl":"https://doi.org/10.1145/1851276.1851280","url":null,"abstract":"Dynamic Datastructure Excavation (DDE) is a new approach to extract datastructures from C binaries without any need for debugging symbols. Unlike most existing tools, DDE uses dynamic analysis (on a QEMU-based emulator) and detects data structures by tracking how a program uses memory. Its results are much more accurate than those of previous methods.","PeriodicalId":202924,"journal":{"name":"Asia Pacific Workshop on Systems","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114367260","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Architecture optimisation with Currawong","authors":"Nicholas Fitzroy-Dale, I. Kuz, G. Heiser","doi":"10.1145/1851276.1851279","DOIUrl":"https://doi.org/10.1145/1851276.1851279","url":null,"abstract":"We describe Currawong, a tool to perform system software architecture optimisation. Currawong is an extensible tool which applies optimisations at the point where an application invokes framework or library code. Currawong does not require source code to perform optimisations, effectively decoupling the relationship between compilation and optimisation. We show, through examples written for the popular Android smartphone platform, that Currawong is capable of significant performance improvement to existing applications.","PeriodicalId":202924,"journal":{"name":"Asia Pacific Workshop on Systems","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114066730","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
