EW 11Pub Date : 2004-09-19DOI: 10.1145/1133572.1133608
R. Isaacs, P. Barham, James R. Bulpin, R. Mortier, D. Narayanan
{"title":"Request extraction in Magpie: events, schemas and temporal joins","authors":"R. Isaacs, P. Barham, James R. Bulpin, R. Mortier, D. Narayanan","doi":"10.1145/1133572.1133608","DOIUrl":"https://doi.org/10.1145/1133572.1133608","url":null,"abstract":"This paper addresses the problem of extracting individual request activity from interleaved event traces. We present a new technique for event correlation which applies a form of temporal join over timestamped, parameterized event streams in order to identify the events pertaining to an individual request. Event schemas ensure that the request extraction mechanism applies to any server application or service without modification, and is robust against future changes in application behavior. This work is part of the Magpie project [2], which is developing infrastructure to track requests end-to-end in a distributed system.","PeriodicalId":285758,"journal":{"name":"EW 11","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122381314","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}
EW 11Pub Date : 2004-09-19DOI: 10.1145/1133572.1133573
Frank Bellosa
{"title":"When physical is not real enough","authors":"Frank Bellosa","doi":"10.1145/1133572.1133573","DOIUrl":"https://doi.org/10.1145/1133572.1133573","url":null,"abstract":"This position paper argues that policies for physical memory management and for memory power mode control should be relocated to the system software of a programmable memory management controller (MMC). Similarly to the mapping of virtual to physical addresses done by an MMU of a processor, this controller offers another level of mapping from physical addresses to real addresses in a multi-bank multi-technology (DRAM, MRAM, FLASH) memory system. Furthermore, the programmable memory controller is responsible for the allocation and migration of memory according to power and performance demands.Our approach dissociates the aspects of memory protection and sharing from the aspect of energy-aware management of real memory. In this way, legacy operating systems do not have to be extended to reduce memory power dissipation, and power-aware memory is no longer limited to CPUs with an MMU.","PeriodicalId":285758,"journal":{"name":"EW 11","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131477248","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}
EW 11Pub Date : 2004-09-19DOI: 10.1145/1133572.1133593
F. Douglis, John Palmer, Elizabeth S. Richards, David Tao, W. Tetzlaff, J. Tracey, Jian Yin
{"title":"Position: short object lifetimes require a delete-optimized storage system","authors":"F. Douglis, John Palmer, Elizabeth S. Richards, David Tao, W. Tetzlaff, J. Tracey, Jian Yin","doi":"10.1145/1133572.1133593","DOIUrl":"https://doi.org/10.1145/1133572.1133593","url":null,"abstract":"Early file systems were designed with the expectation that data would typically be read from disk many times before being deleted; on-disk structures were therefore optimized for reading. As main memory sizes increased, more read requests could be satisfied from data cached in memory, motivating file system designs that optimize write performance. Here, we describe how one might build a storage system that optimizes not only reading and writing, but creation and deletion as well. Efficiency is achieved, in part, by automating deletion based on relative retention values rather than requiring data be deleted explicitly by an application. This approach is well suited to an emerging class of applications that process data at consistently high rates of ingest. This paper explores trade-offs in clustering data by retention value and age and examines the effects of allowing the retention values to change under application control.","PeriodicalId":285758,"journal":{"name":"EW 11","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129363534","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}
EW 11Pub Date : 2004-09-19DOI: 10.1145/1133572.1133589
P. Levis, D. Culler
{"title":"The firecracker protocol","authors":"P. Levis, D. Culler","doi":"10.1145/1133572.1133589","DOIUrl":"https://doi.org/10.1145/1133572.1133589","url":null,"abstract":"We propose the Firecracker protocol for data dissemination in wireless sensor networks. Firecracker uses a combination of routing and broadcasts to rapidly deliver a piece of data to every node in a network. To start dissemination, the data source sends data to distant points in the network. Once the data reaches its destinations, broadcast-based dissemination begins along the paths, like a string of firecrackers.By using an initial routing phase, Firecracker can disseminate at a faster rate than scalable broadcasts while sending fewer packets. The selection of points to route to has a large effect on performance, indicating possible requirements for any-to-any routing protocols in wireless sensor networks.","PeriodicalId":285758,"journal":{"name":"EW 11","volume":"351 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125357801","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}
EW 11Pub Date : 2004-09-19DOI: 10.1145/1133572.1133612
S. Handurukande, Anne-Marie Kermarrec, F. L. Fessant, L. Massoulié
{"title":"Exploiting semantic clustering in the eDonkey P2P network","authors":"S. Handurukande, Anne-Marie Kermarrec, F. L. Fessant, L. Massoulié","doi":"10.1145/1133572.1133612","DOIUrl":"https://doi.org/10.1145/1133572.1133612","url":null,"abstract":"Peer-to-peer file sharing now represents a significant portion of the Internet traffic and has generated a lot of interest from the research community. Some recent measurements studies of peer-to-peer workloads have demonstrated the presence of semantic proximity between peers. One way to improve performance of peer-to-peer file sharing systems is to exploit this locality of interest in order to connect semantically related peers so as to improve the search both in flooding- and server-based systems. Creating these additional connections raises interesting challenges and in particular (i) how to capture the semantic relationship between peers (ii) how to exploit these relationships and (iii) how to evaluate these improvements. In this paper, we evaluate several strategies to exploit the semantic proximity between peers against a real trace collected in November 2003 in the eDonkey 2000 peer-to-peer network. We present the results of this evaluation which confirm the presence of clustering in such networks and the interest to exploit it.","PeriodicalId":285758,"journal":{"name":"EW 11","volume":"22 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125844069","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}
EW 11Pub Date : 2004-09-19DOI: 10.1145/1133572.1133600
James Hendricks, L. V. Doorn
{"title":"Secure bootstrap is not enough: shoring up the trusted computing base","authors":"James Hendricks, L. V. Doorn","doi":"10.1145/1133572.1133600","DOIUrl":"https://doi.org/10.1145/1133572.1133600","url":null,"abstract":"We propose augmenting secure boot with a mechanism to protect against compromises to field-upgradeable devices. In particular, secure boot standards should verify the firmware of all devices in the computer, not just devices that are accessible by the host CPU. Modern computers contain many autonomous processing elements, such as disk controllers, disks, network adapters, and coprocessors, that all have field-upgradeable firmware and are an essential component of the computer system's trust model. Ignoring these devices opens the system to attacks similar to those secure boot was engineered to defeat.","PeriodicalId":285758,"journal":{"name":"EW 11","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127853422","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号
