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

Performance最新文献

筛选
英文 中文
A GSPN model for the analysis of DNS-based redirection in distributed Web systems 分布式Web系统中基于dns的重定向分析的GSPN模型
Performance Pub Date : 2004-10-04 DOI: 10.1109/MASCOT.2004.1348180
R. Gaeta, M. Gribaudo, D. Manini, M. Sereno
{"title":"A GSPN model for the analysis of DNS-based redirection in distributed Web systems","authors":"R. Gaeta, M. Gribaudo, D. Manini, M. Sereno","doi":"10.1109/MASCOT.2004.1348180","DOIUrl":"https://doi.org/10.1109/MASCOT.2004.1348180","url":null,"abstract":"The rapid growth of the Internet, in both user numbers and Web content, has fueled extensive efforts to improve the user's overall Internet experience. A growing number of providers deliver content from multiple servers or proxies to reduce response time by moving content closer to end users. An increasingly popular mechanism to direct client requests towards one of the replica servers is DNS-based redirection. In this mechanism, the authoritative domain name server (ADNS) of the Web site takes the request dispatcher role by mapping the URL host name into the IP address of one of the replica servers (both locally and geographically distributed). However, the ADNS controls only a very small fraction of the requests reaching the Web site because the address mapping is not requested for each client access. Indeed, to reduce Internet traffic due to DNS requests, address resolution is cached at various name servers for a time-to-live (TTL) period, opening a new set of problems not addressed in classical centralized schedulers of parallel and/or distributed systems. We present an approximate generalized stochastic Petri nets (GSPN) model for the analysis of the workload offered to replica servers in a DNS based redirection architecture. Different dispatching algorithms, as well as different strategies to manage TTL assignment at the ADNS, are considered to show the potential of the GSPN based analysis.","PeriodicalId":32394,"journal":{"name":"Performance","volume":"8 1","pages":"39-48"},"PeriodicalIF":0.0,"publicationDate":"2004-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87107733","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
Approximate analysis of non Markovian stochastic systems with multiple time scale delays 具有多时间尺度延迟的非马尔可夫随机系统的近似分析
Performance Pub Date : 2004-10-04 DOI: 10.1109/MASCOT.2004.1348178
S. Haddad, P. Moreaux
{"title":"Approximate analysis of non Markovian stochastic systems with multiple time scale delays","authors":"S. Haddad, P. Moreaux","doi":"10.1109/MASCOT.2004.1348178","DOIUrl":"https://doi.org/10.1109/MASCOT.2004.1348178","url":null,"abstract":"We address the problem of transient and steady-state analysis of stochastic discrete event systems which include concurrent activities with multiple time scale finite support distributions (and consequently non Markovian). Rather than compute an approximate distribution of the model (as done in previous methods), we develop an exact analysis of an approximate model. The design of this method leads to a uniform handling for the computation of the transient and steady-state behaviour of the model. We extend a previous result restricted to one time scale in order to handle different time scales. Furthermore, we show that some useful classes of non ergodic systems can be analyzed in an exact way with this method. We have evaluated our algorithms on standard queuing model benchmarks. Our results demonstrate that, in most of the cases, the solution of the approximate model converges quickly to the solution of the exact model, and, in the difficult cases (e.g. an heavy load on the queue), our method is more robust than previous ones.","PeriodicalId":32394,"journal":{"name":"Performance","volume":"3 1","pages":"23-30"},"PeriodicalIF":0.0,"publicationDate":"2004-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80216437","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}
引用次数: 12
SimplePipe: a simulation tool for task allocation and design of processor pipelines with application to network processors SimplePipe:一个用于任务分配和处理器管道设计的仿真工具，适用于网络处理器
Performance Pub Date : 2004-10-04 DOI: 10.1109/MASCOT.2004.1348182
M. Franklin, Vinayak Joshi
{"title":"SimplePipe: a simulation tool for task allocation and design of processor pipelines with application to network processors","authors":"M. Franklin, Vinayak Joshi","doi":"10.1109/MASCOT.2004.1348182","DOIUrl":"https://doi.org/10.1109/MASCOT.2004.1348182","url":null,"abstract":"SimplePipe is a simulation framework/tool based on SimpleScalar (Austin, T. et al., IEEE Computer, 2002; http://www.simplescalar.com). SimplePipe analyzes the performance effects of alternative task allocations in systems of multiple pipelines where pipeline stages are either processors or dedicated hardware functions. Tasks are defined in terms of sequences of separate C program executions with each sequence representing the functional requirements of a flow. Performance effects associated with alternative assignment of shared memory modules to the pipeline stage can also be explored. SimplePipe was motivated by the performance requirements of network processors (NPs) that are configurable into multiple processor pipelines. The assignment of communication flow tasks to pipeline stages, selection of the number of stages, determination of processor cache sizes and the assignment of shared memory modules are important design decisions impacting performance. An assignment study illustrating SimplePipe capabilities is presented.","PeriodicalId":32394,"journal":{"name":"Performance","volume":"21 1","pages":"59-66"},"PeriodicalIF":0.0,"publicationDate":"2004-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75376363","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}
引用次数: 5
Assessing the effectiveness of IEEE 802.11e in multi-hop mobile network environments 评估IEEE 802.11e在多跳移动网络环境中的有效性
Performance Pub Date : 2004-10-04 DOI: 10.1109/MASCOT.2004.1348232
C. Calafate, P. Manzoni, Manuel P. Malumbres
{"title":"Assessing the effectiveness of IEEE 802.11e in multi-hop mobile network environments","authors":"C. Calafate, P. Manzoni, Manuel P. Malumbres","doi":"10.1109/MASCOT.2004.1348232","DOIUrl":"https://doi.org/10.1109/MASCOT.2004.1348232","url":null,"abstract":"The IEEE 802.11e technology is receiving much interest due to the promising enhancements it offers to wireless local area networks in terms of QoS support. Until now, research has focused on single hop, access point based environments, which are the most common. We review the enhancements proposed in the last IEEE 802.11e draft (version 8.0). We analyze the performance of the IEEE 802.11e protocol on ad-hoc networks (multi-hop) in terms of throughput and end-to-end delay. We also measure the effectiveness for static and fully dynamic networks with a variable number of source stations. Finally, we analyze the performance of IEEE 802.11e when legacy IEEE 802.11 stations (no IEEE 802.11e support) are present in the network. Simulation results show that IEEE 802.11e does not lose effectiveness in multi-hop mobile environments, though the existence of legacy stations in the MANET provokes a severe performance drop.","PeriodicalId":32394,"journal":{"name":"Performance","volume":"60 1","pages":"205-212"},"PeriodicalIF":0.0,"publicationDate":"2004-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80268884","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}
引用次数: 29
BencHMAP: benchmark-based, hardware and model-aware partitioning for parallel and distributed network simulation BencHMAP:基于基准、硬件和模型感知的分区，用于并行和分布式网络仿真
Performance Pub Date : 2004-10-04 DOI: 10.1109/MASCOT.2004.1348301
Donghua Xu, M. Ammar
{"title":"BencHMAP: benchmark-based, hardware and model-aware partitioning for parallel and distributed network simulation","authors":"Donghua Xu, M. Ammar","doi":"10.1109/MASCOT.2004.1348301","DOIUrl":"https://doi.org/10.1109/MASCOT.2004.1348301","url":null,"abstract":"Computer simulation of large-scale and complex networks can be resource intensive. Several tools to parallelize and distribute the simulation to a number of different machines have been developed. One of the main challenges facing users of these tools is how to partition the simulation among the computing resources available. The paper focuses on the development of a framework and methodology (ultimately leading to a semi-automated tool) to partition network simulation. The main distinguishing feature of our approach is that the partitioning is performed in a manner that takes into account the specific distributed computation environment available as well as the specific details of the network model. We derive the relationships between impact factors and the simulation performance from measurements of benchmark experiments. We then apply the derived relations to the given network topology and workload model to construct a weighted graph which we then partition using a graph partitioning tool. Experiments on a 120k-node, 100k-stream network simulation show that the full application of this approach improves the performance of partitioned simulation significantly over other partitioning heuristics.","PeriodicalId":32394,"journal":{"name":"Performance","volume":"78 1","pages":"455-463"},"PeriodicalIF":0.0,"publicationDate":"2004-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85030168","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}
引用次数: 23
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
首页 上一页 下一页 尾页
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学术官方微信