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

Performance最新文献

筛选
英文 中文
Predicting when not to predict 预测什么时候不该预测
Performance Pub Date : 2004-10-04 DOI: 10.1109/MASCOT.2004.1348297
K. Brandt, D. Long, A. Amer
{"title":"Predicting when not to predict","authors":"K. Brandt, D. Long, A. Amer","doi":"10.1109/MASCOT.2004.1348297","DOIUrl":"https://doi.org/10.1109/MASCOT.2004.1348297","url":null,"abstract":"File prefetching based on previous file access patterns has been shown to be an effective means of reducing file system latency by implicitly loading caches with files that are likely to be needed in the near future. Mistaken prefetching requests can be very costly in terms of added performance overheads, including increased latency and bandwidth consumption. Such costs of mispredictions are easily overlooked when considering access prediction algorithms only in terms of their accuracy; we describe a novel algorithm that uses machine learning not only to improve overall prediction accuracy, but also as a means to avoid those costly mispredictions. Our algorithm is fully adaptive to changing workloads, and is fully automated in its ability to refrain from offering predictions when they are likely to be mistaken. Our trace-based simulations show that our algorithm produces prediction accuracies of up to 98%. While this appears to be at the expense of a very slight reduction in cache hit ratios, application of this algorithm actually results in substantial reductions in unnecessary (and costly) I/O operations.","PeriodicalId":32394,"journal":{"name":"Performance","volume":"6 1","pages":"419-426"},"PeriodicalIF":0.0,"publicationDate":"2004-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75486798","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
Design and implementation of a high speed microprocessor simulator BurstScalar 高速微处理器仿真器BurstScalar的设计与实现
Performance Pub Date : 2004-10-04 DOI: 10.1109/MASCOT.2004.1348291
Takashi Nakada, H. Nakashima
{"title":"Design and implementation of a high speed microprocessor simulator BurstScalar","authors":"Takashi Nakada, H. Nakashima","doi":"10.1109/MASCOT.2004.1348291","DOIUrl":"https://doi.org/10.1109/MASCOT.2004.1348291","url":null,"abstract":"This paper describes the design and implementation of our high speed simulator for out-of-order microprocessors named BurstScalar. The simulator is based on the well-known SimpleScalar simulator but its execution speed is accelerated by a computation reuse technique. Each time a loop is iterated, BurstScalar consults its state transition table to examine whether the iteration turns the microarchitectural state into what has already occurred. If the behavior of the iteration matches a state transition table entry, we reuse the complicated computation for out-of-order microarchitectural simulation by simply following the transition arc registered in the table. Moreover in order to minimize the overhead of the reuse, we apply the reuse technique only to loops with enough iterations. This loop selection is performed by an instruction level pre-execution which only costs 1/10 to 1/100 of out-of-order cycle accurate simulation. The evaluation of BurstScalar with SPEC CPU95 benchmarks proves its efficiency showing up to 5.1 and 2.3-fold speedups over SimpleScalar for SPECfp and SPECint respectively, and 2.6 and 1.5-fold in average.","PeriodicalId":32394,"journal":{"name":"Performance","volume":"7 1","pages":"364-372"},"PeriodicalIF":0.0,"publicationDate":"2004-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90475581","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
Stable node-disjoint multipath routing with low overhead in mobile ad hoc networks 移动自组织网络中稳定的低开销节点分离多路径路由
Performance Pub Date : 2004-10-04 DOI: 10.1109/MASCOT.2004.1348196
Xuefei Li, L. Cuthbert
{"title":"Stable node-disjoint multipath routing with low overhead in mobile ad hoc networks","authors":"Xuefei Li, L. Cuthbert","doi":"10.1109/MASCOT.2004.1348196","DOIUrl":"https://doi.org/10.1109/MASCOT.2004.1348196","url":null,"abstract":"Mobile ad hoc networks are characterized by the use of wireless links with limited bandwidth, dynamically varying network topology and multi-hop connectivity. AODV and DSR are the two most widely studied on-demand ad hoc routing protocols. Previous work has shown some limitations of the two protocols: whenever there is a link break on the active route, each of the routing protocols has to invoke a route discovery process. This leads to an increase in both delay and control overhead as well as a decrease in packet delivery ratio. To alleviate these problems, we modify and extend AODV to include the path accumulation feature of DSR in route request/reply packets so that lower route overhead is employed to discover multiple node-disjoint routing paths. The extended AODV is called stable node-disjoint multipath routing (NDMR) protocol, which has two novel aspects compared to the other on-demand multipath protocols: it reduces routing overhead dramatically and achieves multiple node-disjoint routing paths. Simulation results show that performance of NDMR is much better than that of AODV and DSR.","PeriodicalId":32394,"journal":{"name":"Performance","volume":"66 1","pages":"184-191"},"PeriodicalIF":0.0,"publicationDate":"2004-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90764828","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}
引用次数: 83
Topology control, resources allocation and routing in wireless sensor networks 无线传感器网络中的拓扑控制、资源分配和路由
Performance Pub Date : 2004-10-04 DOI: 10.1109/MASCOT.2004.1348294
Xiaofei Wang, T. Berger
{"title":"Topology control, resources allocation and routing in wireless sensor networks","authors":"Xiaofei Wang, T. Berger","doi":"10.1109/MASCOT.2004.1348294","DOIUrl":"https://doi.org/10.1109/MASCOT.2004.1348294","url":null,"abstract":"The recently proposed self-organizing redundancy-cellular architecture (SoRCA) can significantly simplify wireless sensor network (WSN) topologies. We present three additional components for SoRCA: the distributed resource allocation algorithm (DRAA), the optimal path algorithm (OPA) and the distributed probabilistic routing algorithm (DPRA). The number of channels required for SoRCA is calculated and channels can be assigned by applying DRAA. Various WSN properties such as network lifetime are analytically derived assuming channelized MAC protocols and traffic models predicted based on OPA and DPRA.","PeriodicalId":32394,"journal":{"name":"Performance","volume":"27 1","pages":"391-399"},"PeriodicalIF":0.0,"publicationDate":"2004-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78757317","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}
引用次数: 16
Performance engineering with the UML profile for schedulability, performance and time: a case study 使用用于可调度性、性能和时间的UML概要文件的性能工程:一个案例研究
Performance Pub Date : 2004-10-04 DOI: 10.1109/MASCOT.2004.1348183
Andrew J. Bennett, T. Field
{"title":"Performance engineering with the UML profile for schedulability, performance and time: a case study","authors":"Andrew J. Bennett, T. Field","doi":"10.1109/MASCOT.2004.1348183","DOIUrl":"https://doi.org/10.1109/MASCOT.2004.1348183","url":null,"abstract":"We describe the application of a performance engineering methodology based on UML (unified modelling language) diagrams with annotations taken from the profile for schedulability, performance and time. The methodology targets the early stages of the development process and works exclusively with system scenarios. These scenarios are mechanically translated into the stochastic process algebra FSP and are analysed using existing tools to study both the behavioural and performance properties of the system. A case study of a mobile telecommunications billing system is used to assess the effectiveness of the approach. The results show that our methodology is effective at detecting, quantifying and locating performance bottlenecks. A set of guidelines for resolving performance problems is devised and used with performance analysis results to drive a series of design changes until the performance requirements of the system have been met.","PeriodicalId":32394,"journal":{"name":"Performance","volume":"51 1","pages":"67-75"},"PeriodicalIF":0.0,"publicationDate":"2004-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84648787","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}
引用次数: 30
Hybrid WLAN for data dissemination applications 用于数据分发应用的混合WLAN
Performance Pub Date : 2004-10-04 DOI: 10.1109/MASCOT.2004.1348188
K. Lin, Cheng-Fu Chou
{"title":"Hybrid WLAN for data dissemination applications","authors":"K. Lin, Cheng-Fu Chou","doi":"10.1109/MASCOT.2004.1348188","DOIUrl":"https://doi.org/10.1109/MASCOT.2004.1348188","url":null,"abstract":"In a traditional infrastructure-based IEEE 802.11 wireless LAN, all the mobile nodes associated with an access point (AP) share the same wireless channel. In such a wireless network environment, there are two major inefficiencies: (a) load imbalance among different APs when the distribution of the location of mobile nodes is non-uniform; this might result in a situation where a lot of mobile nodes access a single AP and the rest of the APs are idle; (b) poor resource utilization; most of the mobile nodes contend for the wireless channels of APs while there are some unused and available wireless channels, which can be used to set up ad hoc groups. We propose a hybrid WLAN (H-WLAN) framework to address these two problems. First, the H-WLAN framework provides an adaptive service selection module for the mobile node to figure out a better wireless channel and the server to get its service. Second, a popularity-aware channel management module is able to integrate the ad hoc mode efficiently with the infrastructure mode by allowing mobile nodes to set up a new ad hoc group and then share their resources with other nodes within that group. The simulation results show that our H-WLAN framework can substantially (a) achieve high utilization and load balance among wireless channels with lower control overhead, and (b) provide better quality of service for the mobile nodes.","PeriodicalId":32394,"journal":{"name":"Performance","volume":"4 1","pages":"113-120"},"PeriodicalIF":0.0,"publicationDate":"2004-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74397002","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
Modeling the burstiness of TCP TCP的突发性建模
Performance Pub Date : 2004-10-04 DOI: 10.1109/MASCOT.2004.1348195
P. Dimopoulos, P. Zeephongsekul, Z. Tari
{"title":"Modeling the burstiness of TCP","authors":"P. Dimopoulos, P. Zeephongsekul, Z. Tari","doi":"10.1109/MASCOT.2004.1348195","DOIUrl":"https://doi.org/10.1109/MASCOT.2004.1348195","url":null,"abstract":"The Transmission Control Protocol (TCP) is the most widely used transport protocol on the Internet. We investigate the burstiness of TCP and its impact on a network of finite TCP connections. A detailed TCP and network model is developed to quantify both the burstiness and throughput of TCP connections sharing a single bottleneck router. The range of parameters which are most important when considering burstiness are investigated. We find that, under high loads, the burstiness of the TCP protocol becomes a less significant performance factor. Extensive simulation is then used to validate our model over a wide range of parameters.","PeriodicalId":32394,"journal":{"name":"Performance","volume":"167 1","pages":"175-183"},"PeriodicalIF":0.0,"publicationDate":"2004-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76632587","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}
引用次数: 13
SPOT: an extensible model checking library using transition-based generalized Bu/spl uml/chi automata SPOT:一个可扩展的模型检查库，使用基于转换的通用Bu/spl uml/chi自动机
Performance Pub Date : 2004-10-04 DOI: 10.1109/MASCOT.2004.1348184
A. Duret-Lutz, D. Poitrenaud
{"title":"SPOT: an extensible model checking library using transition-based generalized Bu/spl uml/chi automata","authors":"A. Duret-Lutz, D. Poitrenaud","doi":"10.1109/MASCOT.2004.1348184","DOIUrl":"https://doi.org/10.1109/MASCOT.2004.1348184","url":null,"abstract":"SPOT (SPOT produces our traces), is a C++ library offering model checking bricks that can be combined and interfaced with third party tools to build a model checker. It relies on transition-based generalized Bu/spl uml/chi automata (TGBA) and does not need to degeneralize these automata to check their emptiness. We motivate the choice of TGBA by illustrating a very simple (yet efficient) translation of LTL (linear temporal logic) into TGBA. We then show how it supports on-the-fly computations, and how it can be extended or integrated in other tools.","PeriodicalId":32394,"journal":{"name":"Performance","volume":"14 1","pages":"76-83"},"PeriodicalIF":0.0,"publicationDate":"2004-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78300113","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}
引用次数: 114
Performance analysis of reliable multicast transport protocols for GEO satellite networks 地球同步轨道卫星网络可靠组播传输协议性能分析
Performance Pub Date : 2004-10-04 DOI: 10.1109/MASCOT.2004.1348286
Prawit Chumchu, R. Boreli, A. Seneviratne
{"title":"Performance analysis of reliable multicast transport protocols for GEO satellite networks","authors":"Prawit Chumchu, R. Boreli, A. Seneviratne","doi":"10.1109/MASCOT.2004.1348286","DOIUrl":"https://doi.org/10.1109/MASCOT.2004.1348286","url":null,"abstract":"We present a comparison of reliable multicast transport protocols for GEO satellite networks. The performance is analyzed using the general design principle of end-to-end transport protocols, mathematical model and simulation model. The mathematical model is used to present approximated performance. The simulator is implemented to support 3 types of medium access control protocols and 3 types of loss models. We consider 3 end-to-end reliable multicast transport protocols. These protocols present most of the reliable multicast transport protocol design issues for satellite networks, such as forward error correction, congestion control, feedback control, feedback adaptation. Our goal is to understand the performance in several aspects of reliable multicast transport protocols in different environments.","PeriodicalId":32394,"journal":{"name":"Performance","volume":"20 1","pages":"318-326"},"PeriodicalIF":0.0,"publicationDate":"2004-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77175623","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}
引用次数: 6
A computational complexity-aware model for performance analysis of software servers 软件服务器性能分析的计算复杂性感知模型
Performance Pub Date : 2004-10-04 DOI: 10.1109/MASCOT.2004.1348310
Vipul Mathur, V. Apte
{"title":"A computational complexity-aware model for performance analysis of software servers","authors":"Vipul Mathur, V. Apte","doi":"10.1109/MASCOT.2004.1348310","DOIUrl":"https://doi.org/10.1109/MASCOT.2004.1348310","url":null,"abstract":"Queueing models are routinely used to analyze the performance of software systems. However, contrary to common assumptions, the time that a software server takes to complete jobs may depend on the total number of active sessions in the server. We present a queueing model that explicitly takes into account the time, taken by algorithms in the server, that varies with the user population. The model analytically predicts the response time and the \"saturation number\" of such systems. We validate our model with simulation and further demonstrate its usefulness by suggesting a heuristic technique to \"discover\" the complexity of algorithms in server software, solely from response time measurement. We applied the discovery technique to a Web-server testbed, and found that we can identify the asymptotic behavior of processing time as a function of the user population with a fair amount of accuracy. The results show that this promises to be one of the many \"black-box analysis\" techniques, often found necessary in the real world.","PeriodicalId":32394,"journal":{"name":"Performance","volume":"6 1","pages":"537-544"},"PeriodicalIF":0.0,"publicationDate":"2004-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81037277","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
首页 上一页 下一页 尾页
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学术文献互助群
群 号：604180095
Book学术官方微信