发布求助
文献互助 智能选刊 最新文献

2007 IEEE International Performance, Computing, and Communications Conference最新文献

筛选
英文 中文
A Queue-based Adaptive Polling Scheme to Improve System Performance in Gigabit Ethernet Networks 基于队列的自适应轮询方案在千兆以太网中提高系统性能
2007 IEEE International Performance, Computing, and Communications Conference Pub Date : 2007-04-11 DOI: 10.1109/PCCC.2007.358886
Xiaolin Chang, J. Muppala, Wei-ning Kong, Pengcheng Zou, Xiangkai Li, Z. Zheng
{"title":"A Queue-based Adaptive Polling Scheme to Improve System Performance in Gigabit Ethernet Networks","authors":"Xiaolin Chang, J. Muppala, Wei-ning Kong, Pengcheng Zou, Xiangkai Li, Z. Zheng","doi":"10.1109/PCCC.2007.358886","DOIUrl":"https://doi.org/10.1109/PCCC.2007.358886","url":null,"abstract":"Gigabit Ethernet is now finding wider deployment in computer networks. The conventional operating system suffers from the receive livelock problem in Gigabit Ethernet networks. The device hybrid (interrupt + polling) scheme has been widely used to overcome this problem in current operating systems such as GNU/Linux and FreeBSD. However, controlling the polling time without regard to the system state can degrade the ability of a hybrid scheme in some situations. This paper focuses on the system performance of the operating systems that employ the device hybrid scheme in kernel space. A queue-based adaptive polling (QAPolling) scheme is introduced that: (1) significantly improves system goodput and reduces packet loss over a wide range of computer hardware configurations and traffic conditions, (2) is scalable and easily deployed. The key idea behind QAPolling is to adjust the polling time adaptively according to the information of the application receiving queues, which are in kernel space and change with the system state, instead of the packet arrival rate. We validate our design through experimental results in Gigabit Ethernet networks.","PeriodicalId":356565,"journal":{"name":"2007 IEEE International Performance, Computing, and Communications Conference","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122344892","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}
引用次数: 8
An Efficient Technique for Preventing Mimicry and Impossible Paths Execution Attacks 一种有效防止模仿和不可能路径执行攻击的技术
2007 IEEE International Performance, Computing, and Communications Conference Pub Date : 2007-04-11 DOI: 10.1109/PCCC.2007.358922
D. Bruschi, L. Cavallaro, A. Lanzi
{"title":"An Efficient Technique for Preventing Mimicry and Impossible Paths Execution Attacks","authors":"D. Bruschi, L. Cavallaro, A. Lanzi","doi":"10.1109/PCCC.2007.358922","DOIUrl":"https://doi.org/10.1109/PCCC.2007.358922","url":null,"abstract":"In this paper we propose a new strategy for dealing with the impossible path execution (IPE) and the mimicry attack in the N-gram based HIDS model. Our strategy is based on a kernel-level module which interacts with an underlying HIDS and whose main scope is to \"randomize\" sequences of system calls produced by an application to make them unpredictable by any attacker. We implemented a prototype of such a module on a Linux system in order to experimentally verify the feasibility and efficacy of our idea. The results obtained are quite encouraging, furthermore it turned out that our module is quite efficient, as it affected the performance of a testbed Web server with a slowdown factor of only 5.9%.","PeriodicalId":356565,"journal":{"name":"2007 IEEE International Performance, Computing, and Communications Conference","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121099368","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
Opportunistic Networks for Emergency Applications and Their Standard Implementation Framework 应急应用的机会网络及其标准实现框架
2007 IEEE International Performance, Computing, and Communications Conference Pub Date : 2007-04-11 DOI: 10.1109/PCCC.2007.358946
L. Lilien, Ajay K. Gupta, Zijiang Yang
{"title":"Opportunistic Networks for Emergency Applications and Their Standard Implementation Framework","authors":"L. Lilien, Ajay K. Gupta, Zijiang Yang","doi":"10.1109/PCCC.2007.358946","DOIUrl":"https://doi.org/10.1109/PCCC.2007.358946","url":null,"abstract":"We present a novel paradigm of opportunistic networks or oppnets in the context of emergency preparedness and response (EPR). Oppnets constitute the category of ad hoc networks where diverse systems, not employed originally as nodes of an oppnet, join it dynamically in order to perform certain tasks they have been called to participate in. After describing the oppnets and their operation, we discuss the oppnet virtual machine (OVM) - a standard implementation framework for oppnet applications. Oppnets can significantly improve effectiveness and efficiency of EPR one of the six mission areas within the national strategy for homeland security. They can also improve other diverse applications, including agriculture, environment, healthcare, manufacturing, surveillance, and transportation. Oppnets should create new application niches as yet hard to imagine. To the best of our knowledge we have been the first to work on oppnets.","PeriodicalId":356565,"journal":{"name":"2007 IEEE International Performance, Computing, and Communications Conference","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125976005","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}
引用次数: 85
Compiler-Directed Functional Unit Shutdown for Microarchitecture Power Optimization 面向微架构电源优化的编译器定向功能单元关闭
2007 IEEE International Performance, Computing, and Communications Conference Pub Date : 2007-04-11 DOI: 10.1109/PCCC.2007.358916
Santosh Talli, R. Srinivasan, Jeanine E. Cook
{"title":"Compiler-Directed Functional Unit Shutdown for Microarchitecture Power Optimization","authors":"Santosh Talli, R. Srinivasan, Jeanine E. Cook","doi":"10.1109/PCCC.2007.358916","DOIUrl":"https://doi.org/10.1109/PCCC.2007.358916","url":null,"abstract":"Leakage power is a major concern in current microarchitectures as it is increasing exponentially with decreasing transistor feature sizes. In this paper, we present a technique called functional unit shutdown to reduce the static leakage power consumption of a microprocessor by power gating functional units when not used. We use profile information to identify functional unit idle periods that is used by the compiler to issue corresponding OFF/ON instructions. The decision to power gate during idle periods is made based on the comparison between the energy consumed by leaving the units ON and the overhead and leakage energy involved in power cycling them. This comparison identifies short idle periods where less power is consumed if a functional unit is left ON rather than cycling the power during that period. The results show that this technique saves up to 18% of the total energy and between 4 and 11% on average with a performance degradation of 1%.","PeriodicalId":356565,"journal":{"name":"2007 IEEE International Performance, Computing, and Communications Conference","volume":"163 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116644093","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}
引用次数: 9
Performance Guarantees for Flow-Mapping Parallel Packet Switch 流映射并行分组交换机的性能保证
2007 IEEE International Performance, Computing, and Communications Conference Pub Date : 2007-04-11 DOI: 10.1109/PCCC.2007.358885
Lei Shi, Gao Xia, B. Liu
{"title":"Performance Guarantees for Flow-Mapping Parallel Packet Switch","authors":"Lei Shi, Gao Xia, B. Liu","doi":"10.1109/PCCC.2007.358885","DOIUrl":"https://doi.org/10.1109/PCCC.2007.358885","url":null,"abstract":"Flow-mapping parallel packet switch (FM-PPS) is the class of parallel packet switch adopting flow-level load-balancing algorithms. It dispatches packets of a micro-flow into an unchanged parallel switch, thus natively guarantees intra-flow packet orders. Due to the heavy tail of flow size distribution, it is concerned that FM-PPS may suffer from unpredictable performance which prevents it from real deployments. Motivated to clarify this issue, in this paper, we present an effective analytical model on FM-PPS and carry out intensive performance analysis. We find that under current Internet traffic patterns, both statistical packet delay and backlog bounds can be guaranteed if only several stability conditions are met. We further validate that a FM-PPS with OC-768c line rate is able to provide such guarantees under state-of-the-art RAM technology. A practical flow-mapping algorithm, namely constrained output round robin (CORR), is also proposed, which is designed to conform to these stability conditions, hence holds the delay and backlog bound.","PeriodicalId":356565,"journal":{"name":"2007 IEEE International Performance, Computing, and Communications Conference","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122284462","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}
引用次数: 3
Scalable and Decentralized Content-Aware Dispatching in Web Clusters Web集群中可扩展和分散的内容感知调度
2007 IEEE International Performance, Computing, and Communications Conference Pub Date : 2007-04-11 DOI: 10.1109/PCCC.2007.358896
Zhiyong Xu, Jizhong Han, L. Bhuyan
{"title":"Scalable and Decentralized Content-Aware Dispatching in Web Clusters","authors":"Zhiyong Xu, Jizhong Han, L. Bhuyan","doi":"10.1109/PCCC.2007.358896","DOIUrl":"https://doi.org/10.1109/PCCC.2007.358896","url":null,"abstract":"In this paper, we propose a novel and efficient content-aware dispatching algorithm. Our approach eliminates the potential bottleneck and the single point of failure problems completely by using totally decentralized P2P architecture. It is scalable, the system throughput increases nearly linearly with the increased number of servers. Meanwhile, it does not introduce heavy communication overhead among back-end servers which appeared in the previous decentralized mechanisms. Our simulation results show that our approach is superior to the previous solutions.","PeriodicalId":356565,"journal":{"name":"2007 IEEE International Performance, Computing, and Communications Conference","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114402542","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}
引用次数: 7
IMPACT - A Family of Cross-Layer Transmission Protocols for Wireless Sensor Networks IMPACT -无线传感器网络的跨层传输协议族
2007 IEEE International Performance, Computing, and Communications Conference Pub Date : 2007-04-11 DOI: 10.1109/PCCC.2007.358951
M. Brzozowski, R. Karnapke, J. Nolte
{"title":"IMPACT - A Family of Cross-Layer Transmission Protocols for Wireless Sensor Networks","authors":"M. Brzozowski, R. Karnapke, J. Nolte","doi":"10.1109/PCCC.2007.358951","DOIUrl":"https://doi.org/10.1109/PCCC.2007.358951","url":null,"abstract":"For economic reasons sensor networks are often implemented with resource constrained micro-controllers and low-end radio transceivers. Consequently, communication is inherently unreliable and especially multi-hop communication suffers severely from packet losses. Transmission protocols that rely on implicit acknowledges for multi-hop communication are energy efficient but require symmetric communication links to work properly. In this paper we introduce IMPACT, a family of transmission protocols that rely on implicit acknowledges and employ a cross layer approach to handle asymmetric links.","PeriodicalId":356565,"journal":{"name":"2007 IEEE International Performance, Computing, and Communications Conference","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125563347","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}
引用次数: 10
Reducing ALU and Register File Energy by Dynamic Zero Detection 动态零检测降低ALU和寄存器文件能量
2007 IEEE International Performance, Computing, and Communications Conference Pub Date : 2007-04-11 DOI: 10.1109/PCCC.2007.358915
Soontae Kim
{"title":"Reducing ALU and Register File Energy by Dynamic Zero Detection","authors":"Soontae Kim","doi":"10.1109/PCCC.2007.358915","DOIUrl":"https://doi.org/10.1109/PCCC.2007.358915","url":null,"abstract":"Register files and ALU are dominant energy consumers in the datapath of typical pipelined processors. Reducing energy consumption of these components has a big impact on processor energy budget. Consequently, several techniques have been proposed at circuit and architectural levels. In contrast, we propose a dynamic zero detection technique for reducing energy in the register files and ALU in this paper. We find that zero is the most frequent value used in the register files and ALU. When a register value is determined to be zero before reading a register file, an access to the register file is prevented to save energy and zero is directly provided to the datapath. When one of operand register values of an add instruction is zero, it is prevented from being executed on ALU since its result is just the value of the other operand register. Since adds/subs constitute most of arithmetic and logic instructions, this optimization saves large ALU energy. Our dynamic zero detection technique is demonstrated to save 9.0% and 20.2% of energy in the register files and the adder of ALU for SPEC2000 floating-point and integer benchmarks, respectively.","PeriodicalId":356565,"journal":{"name":"2007 IEEE International Performance, Computing, and Communications Conference","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128635382","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}
引用次数: 10
Inverse Geolocation: Worms with a Sense of Direction 逆向地理定位:有方向感的蠕虫
2007 IEEE International Performance, Computing, and Communications Conference Pub Date : 2007-04-11 DOI: 10.1109/PCCC.2007.358931
Randal Acton, N. Friess, John Aycock
{"title":"Inverse Geolocation: Worms with a Sense of Direction","authors":"Randal Acton, N. Friess, John Aycock","doi":"10.1109/PCCC.2007.358931","DOIUrl":"https://doi.org/10.1109/PCCC.2007.358931","url":null,"abstract":"Mapping Internet addresses into physical locations is accomplished through geolocation and reverse geolocation, two different but related problems. We introduce a third problem, inverse geolocation, which can be used by worms to locate potential targets. Techniques for inverse geolocation are presented, along with a discussion of defenses... assuming inverse geolocation can be prevented at all.","PeriodicalId":356565,"journal":{"name":"2007 IEEE International Performance, Computing, and Communications Conference","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128281165","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}
引用次数: 2
Adaptive Transmission Scheme in IEEE 802.16 WMAN with Error Prone Channel 具有易出错信道的IEEE 802.16 WMAN自适应传输方案
2007 IEEE International Performance, Computing, and Communications Conference Pub Date : 2007-04-11 DOI: 10.1109/PCCC.2007.358898
Haitang Wang, D. Agrawal, Qing-An Zeng
{"title":"Adaptive Transmission Scheme in IEEE 802.16 WMAN with Error Prone Channel","authors":"Haitang Wang, D. Agrawal, Qing-An Zeng","doi":"10.1109/PCCC.2007.358898","DOIUrl":"https://doi.org/10.1109/PCCC.2007.358898","url":null,"abstract":"The wide area wireless network (IEEE 802.16 WMAN) supports integrated services such as constant bit rate voice, variable bit rate video, high speed FTP and low speed www data. Efficient resource management in such network is a real challenge because of QoS requirements of integrated services and the error prone nature of the radio channel. In this paper, we mainly focus on the efficient packet transmission mechanism in such network. We propose an efficient channel prediction scheme which combines the handshake probing and prediction together to probe the channel state before transmission. Based on the maximum tolerant BER of different services, channel state is classified into three different states and an adaptive packet transmission scheme for all services under different channel states is introduced. The performance of the proposed schemes are evaluated and the results verified by using extensive simulations.","PeriodicalId":356565,"journal":{"name":"2007 IEEE International Performance, Computing, and Communications Conference","volume":"191 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123389331","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}
引用次数: 1
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信