2003 IEEE International Conference on Communications (Cat. No.03CH37441)最新文献

PacketBench: a tool for workload characterization of network processing packketbench:一个网络处理的工作负载表征工具

2003 IEEE International Conference on Communications (Cat. No.03CH37441) Pub Date : 2003-12-03 DOI: 10.1109/WWC.2003.1249056

Ramaswamy Ramaswamy, T. Wolf

{"title":"PacketBench: a tool for workload characterization of network processing","authors":"Ramaswamy Ramaswamy, T. Wolf","doi":"10.1109/WWC.2003.1249056","DOIUrl":"https://doi.org/10.1109/WWC.2003.1249056","url":null,"abstract":"Network processing is becoming an increasingly important paradigm as the Internet moves towards an architecture with more complex functionality inside the network. Modern routers not only forward packets, but also process headers and payloads to implement a variety of functions related to security, performance, and customization. It is important to get a detailed understanding of the workloads associated with this processing in order to be able to develop efficient network processing engines. We present a tool called PacketBench, which provides a framework for implementing network processing applications and obtaining an extensive set of workload characteristics. PacketBench provides the support functions to handle various packet traces and manage packet memory. For statistics collection, PacketBench provides the ability to derive a number of microarchitectural and networking related metrics. We present the results of such measurements for four different networking applications ranging from simple packet forwarding to complex packet payload encryption. The results show that such workload analysis has a range of uses from network processor design to application optimization.","PeriodicalId":432745,"journal":{"name":"2003 IEEE International Conference on Communications (Cat. No.03CH37441)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115315193","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}

引用次数: 106

Intrinsic data locality of modern scientific workloads 现代科学工作负载的内在数据局部性

2003 IEEE International Conference on Communications (Cat. No.03CH37441) Pub Date : 2003-12-03 DOI: 10.1109/WWC.2003.1249059

S. Ramanathan, R. Srinivasan, J. Cook

引用次数: 1

Exploiting streams in instruction and data address trace compression 利用指令和数据地址跟踪压缩中的流

2003 IEEE International Conference on Communications (Cat. No.03CH37441) Pub Date : 2003-12-03 DOI: 10.1109/WWC.2003.1249061

A. Milenković, M. Milenkovic

引用次数: 36

Performance characterization of TCP/IP packet processing in commercial server workloads 商用服务器工作负载中TCP/IP数据包处理的性能表征

2003 IEEE International Conference on Communications (Cat. No.03CH37441) Pub Date : 2003-12-03 DOI: 10.1109/WWC.2003.1249055

S. Makineni, R. Iyer

{"title":"Performance characterization of TCP/IP packet processing in commercial server workloads","authors":"S. Makineni, R. Iyer","doi":"10.1109/WWC.2003.1249055","DOIUrl":"https://doi.org/10.1109/WWC.2003.1249055","url":null,"abstract":"TCP/IP is the communication protocol of choice for many current and next generation server applications (Web services, e-commerce, storage, etc.). As a result, the performance of these applications can be heavily dependent on the efficient TCP/IP packet processing within the termination nodes. Motivated by this, our work presented in this paper focuses on analyzing the underlying architectural characteristics of TCP/IP packet processing component within server workloads. Our analysis and characterization methodology is based on in-depth measurement experiments of TCP/IP packet processing performance on Intel's state-of-the-art low-power Pentium/spl reg/ M microprocessor running the Microsoft Windows* Server 2003 operating system. We start by analyzing the impact of NIC features such as Large Segment Offload and the use of Jumbo frames on TCP/IP packet processing performance. We then show that the architectural characteristics of transmit-side processing (largely compute-bound) are significantly different than receive-side processing (mostly memory-bound). Finally we quantify the computational requirements for sending/receiving packets within commercial workloads (SPECweb99, TPC-C and TPC-W) and show that they can form a substantial component.","PeriodicalId":432745,"journal":{"name":"2003 IEEE International Conference on Communications (Cat. No.03CH37441)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133418683","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}

引用次数: 24

A characterization of visual feature recognition 视觉特征识别的表征

2003 IEEE International Conference on Communications (Cat. No.03CH37441) Pub Date : 2003-12-03 DOI: 10.1109/WWC.2003.1249052

B. Mathew, A. Davis, R. Evans

{"title":"A characterization of visual feature recognition","authors":"B. Mathew, A. Davis, R. Evans","doi":"10.1109/WWC.2003.1249052","DOIUrl":"https://doi.org/10.1109/WWC.2003.1249052","url":null,"abstract":"Natural human interfaces are a key to realizing the dream of ubiquitous computing. This implies that embedded systems must be capable of sophisticated perception tasks. This paper analyzes the nature of a visual feature recognition workload. Visual feature recognition is a key component of a number of important applications, e.g. gesture based interfaces, lip tracking to augment speech recognition, smart cameras, automated surveillance systems, robotic vision, etc. Given the power sensitive nature of the embedded space and the natural conflict between low-power and high-performance implementations, a precise understanding of these algorithms is an important step in developing efficient visual feature recognition applications for the embedded space. In particular, this work analyzes the performance characteristics of flesh toning, face detection and face recognition codes based on well known algorithms. We show that the problem can be decomposed into a pipeline of filters which could lead to efficient implementations as stream processors. With better than 92% hit rate for a modest 16KB L1 data cache, the algorithms have memory system behavior commensurate with embedded processors. However, our results indicate that their execution requirements strain the performance available on current embedded systems.","PeriodicalId":432745,"journal":{"name":"2003 IEEE International Conference on Communications (Cat. No.03CH37441)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132879458","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}

引用次数: 19

Identifying program power phase behavior using power vectors 使用功率矢量识别程序功率相位行为

2003 IEEE International Conference on Communications (Cat. No.03CH37441) Pub Date : 2003-12-03 DOI: 10.1109/WWC.2003.1249062

C. Isci, M. Martonosi

{"title":"Identifying program power phase behavior using power vectors","authors":"C. Isci, M. Martonosi","doi":"10.1109/WWC.2003.1249062","DOIUrl":"https://doi.org/10.1109/WWC.2003.1249062","url":null,"abstract":"Characterizing program behavior is important for both hardware and software research. Most modern applications exhibit distinctly different behavior throughout their runtimes, which constitute several phases of execution that share a greater amount of resemblance within themselves compared to other regions of execution. These execution phases can occur at very large scales, necessitating prohibitively long simulation times for characterization. Due to the implementation of extensive clock gating and additional power and thermal management techniques in modern processors, these program phases are also reflected in program power behavior, which can be used as an alternative means of program behavior characterization for power-oriented research. In this paper, we present our methodology for identifying phases in program power behavior and determining execution points that correspond to these phases, as well as defining a small set of power signatures representative of overall program power behavior. We define a power similarity metric as an intersection of both magnitude based and ratio-wise similarities in the power dissipation of processor components. We then develop a thresholding algorithm in order to partition the power behavior into similarity groups. We illustrate our methodology with the gzip benchmark for its whole runtime and characterize gzip power behavior with both the selected execution points and defined signature vectors.","PeriodicalId":432745,"journal":{"name":"2003 IEEE International Conference on Communications (Cat. No.03CH37441)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125646415","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}

引用次数: 79

An analysis of disk performance in VMware ESX server virtual machines VMware ESX服务器虚拟机的磁盘性能分析

2003 IEEE International Conference on Communications (Cat. No.03CH37441) Pub Date : 2003-12-03 DOI: 10.1109/WWC.2003.1249058

Irfan Ahmad, Jennifer M. Anderson, Anne M. Holler, Rajit Kambo, Vikram Makhija

引用次数: 83

Towards workload characterization of auction sites 对拍卖网站的工作量特征

2003 IEEE International Conference on Communications (Cat. No.03CH37441) Pub Date : 2003-12-03 DOI: 10.1109/WWC.2003.1249053

D. Menascé, V. Akula

引用次数: 18

Evaluating and modeling window synchronization in highly multiplexed flows 高复用流中窗口同步的评估与建模

2003 IEEE International Conference on Communications (Cat. No.03CH37441) Pub Date : 2003-12-03 DOI: 10.1109/WWC.2003.1249057

J. Gast, P. Barford

{"title":"Evaluating and modeling window synchronization in highly multiplexed flows","authors":"J. Gast, P. Barford","doi":"10.1109/WWC.2003.1249057","DOIUrl":"https://doi.org/10.1109/WWC.2003.1249057","url":null,"abstract":"In this paper, we investigate issues of synchronization in highly aggregated flows such as would be found in the Internet backbone. Our hypothesis is that regularly spaced loss events lead to window synchronization in long lived flows. We argue that window synchronization is likely to be more common in the Internet than previously reported. We support our argument with evidence of the existence and evaluation of the characteristics of periodic discrete congestion events using active probe data gathered in the Surveyor infrastructure. When connections experience loss events which are periodic, the aggregate offered load to neighboring links rises and falls in cadence with the loss events. Connections whose cWnd values grow from W/2 to W at approximately the same rate as the loss event period soon synchronize their cWnd additive increases and multiplicative decreases. We find that this window synchronization can scale to large numbers of connections depending on the diversity of roundtrip times of individual flows. A model is presented that predicts important characteristics of the loss events in window synchronized flows including the quantity, intensity, and duration. The model effectively explains the prevalence of discrete loss events in fast links with high multiplexing factors as well as the queue buildup and queue draining phases of congestion.","PeriodicalId":432745,"journal":{"name":"2003 IEEE International Conference on Communications (Cat. No.03CH37441)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127560105","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}

引用次数: 0

Characterization of embedded applications for decoupled processor architecture 解耦处理器架构的嵌入式应用特性

2003 IEEE International Conference on Communications (Cat. No.03CH37441) Pub Date : 2003-12-03 DOI: 10.1109/WWC.2003.1249063

A. Djabelkhir, André Seznec

引用次数: 11