DOCSLIB.ORG

Performance Testing Topics

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Performance Testing Topics CIT 668: System Architecture Performance Testing Topics 1. What is performance testing? 2. Performance-testing activities 3. UNIX monitoring tools What is performance testing? Performance testing is a type of testing intended to determine the responsiveness, throughput, reliability, and/or scalability of a system under a given workload. - http://perftestingguide.codeplex.com/ Performance testing goals: – Assess production readiness – Evaluate against performance criteria – Compare performance characteristics of multiple systems or system configurations – Find the source of performance problems – Support system tuning – Find throughput levels Performance Testing Activities http://perftestingguide.codeplex.com/ Testing Types Performance testing: determining performance, scalability, or stability characteristics of system; a superset of the other testing types. Load testing: determining performance characteristics of system when subjected to work load expected during production. Stress testing: determining performance characteristics of system when subjected to work loads beyond those expected during production to determine under what conditions system will fail. Baselines A baseline is a set of data used for comparison. In performance testing, baselines are used to evaluate the effectiveness of subsequent performance-improving changes to the system. Once the system has been changed, a new baseline must be measured. Benchmarking Benchmarking is the process of measuring system performance using standard tests and comparing it against a well known system. SPEC CPU2006 (SPECint, SPECfp) SPEC power2008 (power usage) BogoMips SPEC sfs2008 (NFS, CIFS) Dhrystone SPEC virt2010 (virtualization) Whetstone SPEC web2005 (PHP or JSP) Weighted TeraFLOPS NAS Parallel Benchmarks Experimenter Effect Monitoring the system affects performance. Monitoring tools use system resources. If you’ve consistently monitored system, then monitoring won’t alter system performance. Identify Bottlenecks Identify which aspect of performance Latency: delay until initial access. Throughput: rate of transfer/processing. Identify which system component CPU Memory Disk Network Performance Problem Solutions 1. Get more of needed resource. Ex: Upgrade processor, use striped disk array. 2. Reduce system requirements. Ex: Kill processes, move services to other hosts. 3. Eliminate inefficiency and waste. Ex: Produce a static home page every 15 minutes instead of regenerating each access. 4. Ration resource usage. Ex: Set process priorities with renice. Ex: Limit process resource usage with limit. Performance Testing Services • Gomez • Keynote • Pingdom • SiteUptime • Alertra Performance Testing Activities Activities Activity Input Output Identify test environment Production system Comparison of test and architecture production environments Test system architecture Environment concerns Available tools Are other tools needed? ID acceptance criteria Client expectations Success criteria Risks to be mitigated Performance goals and requirements Plan and design tests Available system features Test data to implement and components tests Use cases Use models to be simulated Success criteria Resources required Configure test environment Tools Configured load generation and resource monitoring tools Tests Environment ready for tests Activities Activity Input Output Implement test design Configured tools Validated, executable tests Prepared environment Validated resource monitoring Available tools Validated data collection Execute tests Test execution plan Test results Configured tools Executable tests Analyze Results, Report, Test results Results analysis and Retest Acceptance criteria Recommendations Risks, concerns, and issues Reports Web Load Tools • ab (Apache Bench) • httperf • autobench (httperf multihost wrapper) • JMeter • openload • SIEGE Metric Collection and Notification Tools • Ganglia • Cacti • Nagios • Zabbix • Hyperic HQ • Munin • ZenOSS • OpenNMS • GroundWork • Monit UNIX Monitoring Tools Monitoring Processes uptime Provides aggregate data about system load. ps Shows running processes with CPU, mem usage. top Updated list of running processes + summaries. vmstat Summary data about processes and CPU usage. Uptime Uptime provides the following data How long system has been running. Number of users logged in. Average number of runnable processes. In last 1, 5, 15 minutes. Want a load average under 3. Uptime example > uptime 17:40 up 126 days, 8:03, 6 users, load average: 1.40, 1.03, 0.55 vmstat • Number of Runnable and Blocked processes. • Memory (virtual, free, buffered, cached) • Blocks/second transferred in (bi) and out (bo) • Interrupts/sec (in) and context switches/sec (cs) • CPU usage by user, system, idle, and waiting. > vmstat 5 4 procs -----------memory---------- ---swap-- -----io---- --system-- ----cpu---- r b swpd free buff cache si so bi bo in cs us sy id wa 0 0 395716 45176 211284 88480 0 0 1 2 1 2 9 3 88 0 0 0 395716 45168 211300 88480 0 0 0 50 1035 1677 0 0 100 0 0 0 395716 45168 211300 88480 0 0 0 0 1040 1670 0 0 99 0 0 0 395716 45168 211300 88480 0 0 0 0 1033 1660 0 0 100 0 Identifying CPU Shortages 1. Short-term CPU spikes are normal. 2. Consistently high number of runnable processes (r) in vmstat. 3. Consistent high total CPU usage (sy+us). 4. High system time compared to user time and high context switches indicates system is thrashing between processes instead of doing user work. Changing Process Priorities Nice values Positive values lower priorities. Negative values increase priorities. If you know a process will be a CPU hog, nice +5 command_name If you detect a CPU hog after it’s started, renice 5 PID Managing Processes with kill TERM (default) Terminates process execution (Ctrl-c). Processes can catch or ignore signal. KILL (9) Terminates process execution. Processes cannot catch or ignore. Processes waiting on I/O will not die. STOP Suspends process execution until SIGCONT (Ctrl-z). Useful for moving CPU hog out of way temporarily. Imposing Limits on Processes CPU time ulimit –t secs Maximum file size ulimit –f KB Maximum data segment ulimit –d KB Maximum stack size ulimit –s KB Maximum physical mem ulimit –m KB Maximum core size ulimit –c KB Maximum number procs ulimit –u n Maximum virtual mem ulimit –v KB Monitoring Memory Use free to see how memory is used. System will use most free memory for caching. System will swap out inactive processes. Don’t worry until free < 5% of total memory. Use vmstat to detect paging activity. Page out (so) rate greater than 0 consistently. High page in (si) rate, as system uses the paging facility to load programs into memory. Managing Memory 1. Improving paging capacity. Add new swapfiles with swapon. Add new swap partitions. 2. Improving paging performance. Use swap partitions instead of swap files. Distribute swap resources across disks. 3. Migrate memory hogs to another host. 4. Add more memory. Monitoring Disk I/O Use iostat to get per disk statistics. Transactions per second (tps). Blocks read/written per second. Managing disk performance problems. Distribute heavily used data across disks/ctrlers. Get more or faster disks. Use RAID or LVM striping. iostat > iostat 2 Linux 2.6.15-23-386 (zim) 03/26/2007 avg-cpu: %user %nice %system %iowait %steal %idle 8.55 0.18 3.22 0.09 0.00 87.96 Device: tps Blk_read/s Blk_wrtn/s Blk_read Blk_wrtn hde 0.69 8.18 9.43 89783416 103565744 hdh 0.15 1.33 3.37 14590831 36969599 hdc 0.00 0.00 0.00 9548 0 avg-cpu: %user %nice %system %iowait %steal %idle 0.17 0.00 0.17 0.00 0.00 99.67 Device: tps Blk_read/s Blk_wrtn/s Blk_read Blk_wrtn hde 0.33 0.00 21.33 0 128 hdh 0.00 0.00 0.00 0 0 hdc 0.00 0.00 0.00 0 0 Managing Disk Capacity Detecting disk resource usage. List all partition usage with df –h Identify high usage directories with du Summary data: du –s Highest usage directories: du -k /|sort –rn Use find to detect disk hogs. Use find –size to search for big files. Use –atime +X to identify files that haven’t been used in X days. Managing Disk Shortages 1. Add more disks. 2. Move files to remote fileservers. 3. Eliminate unnecessary files. 4. Compress large infrequently used files. 5. Impose disk quotas on users. Soft limit: can be violated temporarily. Hard limit: cannot be violated. Monitoring Network Connections List listening network ports lsof -i List firewall rules (which ports are accessible) iptables -L List network connections and listening ports netstat -anp IPTraf CIT 470: Advanced Network and System Administration Slide #32 Managing Network Capacity 1. Move applications onto separate servers. 2. Add more NICs and bond them. 3. Upgrade from 1Gbps to 10Gbps Ethernet if supported by server hardware. Key Points Performance testing terms – Load testing and stress testing – Latency and throughput – Baselines and benchmarks Performance testing activities 1. Identify test environment 2. Identify performance criteria 3. Plan and design tests 4. Configure test environment 5. Implement test design 6. Execute tests 7. Analyze results, report, and retest References 1. Mark Burgess, Principles of System and Network Administration, Wiley, 2000. 2. Aeleen Frisch, Essential System Administration, 3rd edition, O’Reilly, 2002. 3. Mike Loukides and Gian-Paolo D. Musumeci, System Performance Tuning, 2nd edition, O’Reilly, 2003. 4. Evi Nemeth et al, UNIX System Administration Handbook, 3rd edition, Prentice Hall, 2001. 5. patterns & practices, Performance Testing Guidance for Web Applications, http://perftestingguide.codeplex.com/ .
Load more

Recommended publications
  • Overview of the SPEC Benchmarks
    9 Overview of the SPEC Benchmarks Kaivalya M. Dixit IBM Corporation “The reputation of current benchmarketing claims regarding system performance is on par with the promises made by politicians during elections.” Standard Performance Evaluation Corporation (SPEC) was founded in October, 1988, by Apollo, Hewlett-Packard,MIPS Computer Systems and SUN Microsystems in cooperation with E. E. Times. SPEC is a nonprofit consortium of 22 major computer vendors whose common goals are “to provide the industry with a realistic yardstick to measure the performance of advanced computer systems” and to educate consumers about the performance of vendors’ products. SPEC creates, maintains, distributes, and endorses a standardized set of application-oriented programs to be used as benchmarks. 489 490 CHAPTER 9 Overview of the SPEC Benchmarks 9.1 Historical Perspective Traditional benchmarks have failed to characterize the system performance of modern computer systems. Some of those benchmarks measure component-level performance, and some of the measurements are routinely published as system performance. Historically, vendors have characterized the performances of their systems in a variety of confusing metrics. In part, the confusion is due to a lack of credible performance information, agreement, and leadership among competing vendors. Many vendors characterize system performance in millions of instructions per second (MIPS) and millions of floating-point operations per second (MFLOPS). All instructions, however, are not equal. Since CISC machine instructions usually accomplish a lot more than those of RISC machines, comparing the instructions of a CISC machine and a RISC machine is similar to comparing Latin and Greek. 9.1.1 Simple CPU Benchmarks Truth in benchmarking is an oxymoron because vendors use benchmarks for marketing purposes.
    [Show full text]
  • Model Driven Scheduling for Virtualized Workloads
    Model Driven Scheduling for Virtualized Workloads Proefschrift voorgelegd op 28 juni 2013 tot het behalen van de graad van Doctor in de Wetenschappen – Informatica, bij de faculteit Wetenschappen, aan de Universiteit Antwerpen. PROMOTOREN: prof. dr. Jan Broeckhove dr. Kurt Vanmechelen Sam Verboven RESEARCH GROUP COMPUTATIONAL MODELINGAND PROGRAMMING Dankwoord Het behalen van een doctoraat is een opdracht die zonder hulp onmogelijk tot een goed einde kan gebracht worden. Gelukkig heb ik de voorbije jaren de kans gekregen om samen te werken met talrijke stimulerende collega’s. Stuk voor stuk hebben zij bijgedragen tot mijn professionele en persoonlijke ontwikkeling. Hun geduldige hulp en steun was essentieel bij het overwinnen van de vele uitdagingen die met een doctoraat gepaard gaan. Graag zou ik hier dan ook enkele woorden van dank neerschrijven. Allereerst zou ik graag prof. dr. Jan Broeckhove en em. prof. dr. Frans Arickx bedanken om mij de kans te geven een gevarieerde en boeiend academisch traject te starten. Bij het beginnen van mijn doctoraat heeft Frans mij niet alleen geholpen om een capabel onderzoeker te worden, ook bij het lesgeven heeft hij mij steeds met raad en daad bijgestaan. Na het emiraat van Frans heeft Jan deze begeleiding overgenomen en er voor gezorgd dat ik het begonnen traject ook succesvol kon beeïndigen. Beiden hebben ze mij steeds grote vrijheid gegeven in mijn zoektocht om interessante onderzoeksvragen te identificeren en beantwoorden. Vervolgens zou ik graag dr. Peter Hellinckx en dr. Kurt Vanmechelen bedanken voor hun persoonlijke en vaak intensieve begeleiding. Zelfs voor de start van mijn academische carrière, bij het schrijven van mijn Master thesis, heeft Peter mij klaar- gestoomd voor een vlotte start als onderzoeker.
    [Show full text]
  • Towards Better Performance Per Watt in Virtual Environments on Asymmetric Single-ISA Multi-Core Systems
    Towards Better Performance Per Watt in Virtual Environments on Asymmetric Single-ISA Multi-core Systems Viren Kumar Alexandra Fedorova Simon Fraser University Simon Fraser University 8888 University Dr 8888 University Dr Vancouver, Canada Vancouver, Canada [email protected] [email protected] ABSTRACT performance per watt than homogeneous multicore proces- Single-ISA heterogeneous multicore architectures promise to sors. As power consumption in data centers becomes a grow- deliver plenty of cores with varying complexity, speed and ing concern [3], deploying ASISA multicore systems is an performance in the near future. Virtualization enables mul- increasingly attractive opportunity. These systems perform tiple operating systems to run concurrently as distinct, in- at their best if application workloads are assigned to het- dependent guest domains, thereby reducing core idle time erogeneous cores in consideration of their runtime proper- and maximizing throughput. This paper seeks to identify a ties [4][13][12][18][24][21]. Therefore, understanding how to heuristic that can aid in intelligently scheduling these vir- schedule data-center workloads on ASISA systems is an im- tualized workloads to maximize performance while reducing portant problem. This paper takes the first step towards power consumption. understanding the properties of data center workloads that determine how they should be scheduled on ASISA multi- We propose that the controlling domain in a Virtual Ma- core processors. Since virtual machine technology is a de chine Monitor or hypervisor is relatively insensitive to changes facto standard for data centers, we study virtual machine in core frequency, and thus scheduling it on a slower core (VM) workloads. saves power while only slightly affecting guest domain per- formance.
    [Show full text]
  • Big Data Benchmarking Workshop Publications
    Benchmarking Datacenter and Big Data Systems Wanling Gao, Zhen Jia, Lei Wang, Yuqing Zhu, Chunjie Luo, Yingjie Shi, Yongqiang He, Shiming Gong, Xiaona Li, Shujie Zhang, Bizhu Qiu, Lixin Zhang, Jianfeng Zhan INSTITUTE OFTECHNOLOGY COMPUTING http://prof.ict.ac.cn/ICTBench 1 Acknowledgements This work is supported by the Chinese 973 project (Grant No.2011CB302502), the Hi- Tech Research and Development (863) Program of China (Grant No.2011AA01A203, No.2013AA01A213), the NSFC project (Grant No.60933003, No.61202075) , the BNSFproject (Grant No.4133081), and Huawei funding. 2/ Big Data Benchmarking Workshop Publications BigDataBench: a Big Data Benchmark Suite from Web Search Engines. Wanling Gao, et al. The Third Workshop on Architectures and Systems for Big Data (ASBD 2013) in conjunction with ISCA 2013. Characterizing Data Analysis Workloads in Data Centers. Zhen Jia, et al. 2013 IEEE International Symposium on Workload Characterization （IISWC-2013) Characterizing OS behavior of Scale-out Data Center Workloads. Chen Zheng et al. Seventh Annual Workshop on the Interaction amongst Virtualization, Operating Systems and Computer Architecture (WIVOSCA 2013). In Conjunction with ISCA 2013.[ Characterization of Real Workloads of Web Search Engines. Huafeng Xi et al. 2011 IEEE International Symposium on Workload Characterization （IISWC-2011). The Implications of Diverse Applications and Scalable Data Sets in Benchmarking Big Data Systems. Zhen Jia et al. Second workshop of big data benchmarking (WBDB 2012 India) & Lecture Note in Computer
    [Show full text]
  • An Experimental Evaluation of Datacenter Workloads on Low-Power Embedded Micro Servers
    An Experimental Evaluation of Datacenter Workloads On Low-Power Embedded Micro Servers Yiran Zhao, Shen Li, Shaohan Hu, Hongwei Wang Shuochao Yao, Huajie Shao, Tarek Abdelzaher Department of Computer Science University of Illinois at Urbana-Champaign fzhao97, shenli3, shu17, hwang172, syao9, hshao5, [email protected] ABSTRACT To reduce datacenter energy cost, power proportional- This paper presents a comprehensive evaluation of an ultra- ity [47] is one major solution studied and pursued by both low power cluster, built upon the Intel Edison based micro academia and industry. Ideally, it allows datacenter power servers. The improved performance and high energy effi- draw to proportionally follow the fluctuating amount of work- ciency of micro servers have driven both academia and in- load, thus saving energy during non-peak hours. However, dustry to explore the possibility of replacing conventional current high-end servers are not energy-proportional and brawny servers with a larger swarm of embedded micro ser- have narrow power spectrum between idling and full uti- vers. Existing attempts mostly focus on mobile-class mi- lization [43], which is far from ideal. Therefore, researchers cro servers, whose capacities are similar to mobile phones. try to improve energy-proportionality using solutions such We, on the other hand, target on sensor-class micro servers, as dynamic provisioning and CPU power scaling. The for- which are originally intended for uses in wearable technolo- mer relies on techniques such as Wake-On-LAN [36] and gies, sensor networks, and Internet-of-Things. Although VM migration [24] to power on/off servers remotely and dy- sensor-class micro servers have much less capacity, they are namically.
    [Show full text]
  • Adaptive Control of Apache Web Server
    Adaptive Control of Apache Web Server Erik Reed Abe Ishihara Ole J. Mengshoel Carnegie Mellon University Carnegie Mellon University Carnegie Mellon University Moffett Field, CA 94035 Moffett Field, CA 94035 Moffett Field, CA 94035 [email protected] [email protected] [email protected] Abstract least load. Typical implementations of load balancing deal with round robin balancing for domain name service Traffic to a Web site can vary dramatically. At the same (DNS) [7]. Much of existing frameworks and previous time it is highly desirable that a Web site is reactive. To research deal with inter-server connections and balanc- provide crisp interaction on thin clients, 150 milliseconds ing, with little or no focus on dynamic parameter adjust- has been suggested as an upper bound on response time. ment of individual servers. Unfortunately, the popular Apache Web server is lim- Focusing on an individual Web server rather than a ited in its capabilities to be reactive under varying traf- cluster of machines, we investigate in this paper an alter- fic. To address this problem, we design in this paper an native approach to ensuring quick and predictable user adaptive controller for the Apache Web server. A modi- response, namely feedback control and specifically Min- fied recursive least squares algorithm is used to identify imum Degree Pole Placement control [5]. This can be in system dynamics and a minimum degree pole placement an environment where inter-server load balancing is al- controller is implemented to adjust the maximum num- ready in place, or when a single server is handling Web ber of concurrent connections.
    [Show full text]
  • Energy Efficiency of Server Virtualization
    Energy Efficiency of Server Virtualization Jukka Kommeri Tapio Niemi Olli Helin Helsinki Institute of Physics, Helsinki Institute of Physics, Helsinki Institute of Physics, Technology program, CERN, Technology program, CERN, Technology program, CERN, CH-1211 Geneva 23, Switzerland CH-1211Geneva 23, Switzerland CH-1211 Geneva 23, Switzerland [email protected] [email protected] [email protected] Abstract—The need for computing power keeps on growing. combine several services into one physical server. In this The rising energy expenses of data centers have made server way, these technologies make it possible to take better consolidation and virtualization important research areas. advantage of hardware resources. Virtualization and its performance have received a lot of attention and several studies can be found on performance. In this study, we focus on energy efficiency of different So far researches have not studied the overall performance virtualization technologies. Our aim is to help the system and energy efficiency of server consolidation. In this paper we administrator to decide how services should be consolidated study the effect of server consolidation on energy efficiency with to minimize energy consumption without violating quality an emphasis on quality of service. We have studied this with of service agreements. several synthetic benchmarks and with realistic server load by performing a large set of measurements. We found out that We studied energy consumption of virtualized servers with energy-efficiency depends on the load of the virtualized service two open source virtualization solutions; KVM and Xen. and the number of virtualized servers. Idle virtual servers do They were tested both under load and idle.
    [Show full text]
  • Remote Profiling of Resource Constraints of Web Servers Using
    Remote Profiling of Resource Constraints of Web Servers Using Mini-Flash Crowds Pratap Ramamurthy Vyas Sekar Aditya Akella Balachander Krishnamurthy UW-Madison CMU UW-Madison AT&T–Labs Research Anees Shaikh IBM Research Abstract often limited, this can be difficult. Hence, large providers Unexpected surges in Web request traffic can exercise who can afford it typically resort to over-provisioning, or server-side resources (e.g., access bandwidth, process- employ techniques such as distributed content delivery or ing, storage etc.) in undesirable ways. Administra- dynamic server provisioning, to minimize the impact of tors today do not have requisite tools to understand the unexpected surges in request traffic. Smaller application impact of such “flash crowds” on their servers. Most providers may trade-off robustness to large variations in Web servers either rely on over-provisioning and admis- workload for a less expensive infrastructure that is provi- sion control, or use potentially expensive solutions like sioned for the expected common case. CDNs, to ensure high availability in the face of flash This approach still leaves operators without a sense crowds. A more fine-grained understanding of the per- of how their application infrastructure will handle large formance of individual server resources under emulated increases in traffic, due to planned events such as annual but realistic and controlled flash crowd-like conditions sales or Web casts, or unexpected flash crowds. While can aid administrators to make more efficient resource these events may not occur frequently, the inability of the management decisions. In this paper, we present mini- infrastructure to maintain reasonably good service, or at flash crowds (MFC) – a light-weight profiling service least degrade gracefully, can lead to significant loss of that reveals resource bottlenecks in a Web server infras- revenue and dissatisfied users.
    [Show full text]
  • Optimal Power Allocation in Server Farms
    Optimal Power Allocation in Server Farms Anshul Gandhi∗ Mor Harchol-Balter∗ Rajarshi Das† Charles Lefurgy†† March 2009 CMU-CS-09-113 School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 ∗School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, USA †IBM T.J. Watson Research Center, Hawthorne, NY, USA ††IBM Research, Austin, TX, USA Research supported by NSF SMA/PDOS Grant CCR-0615262 and a 2009 IBM Faculty Award. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of NSF or IBM. Keywords: Power Management, Server Farm, Response Time, Power-to-Frequency, Data Center Abstract Server farms today consume more than 1.5% of the total electricity in the U.S. at a cost of nearly $4.5 billion. Given the rising cost of energy, many industries are now looking for solutions on how to best make use of their available power. An important question which arises in this context is how to distribute available power among servers in a server farm so as to get maximum perfor- mance. By giving more power to a server, one can get higher server frequency (speed). Hence it is commonly believed that for a given power budget, performance can be maximized by oper- ating servers at their highest power levels. However, it is also conceivable that one might prefer to run servers at their lowest power levels, which allows more servers for a given power budget. To fully understand the effect of power allocation on performance in a server farm with a fixed power budget, we introduce a queueing theoretic model, which also allows us to predict the opti- mal power allocation in a variety of scenarios.
    [Show full text]
  • Xilinx Running the Dhrystone 2.1 Benchmark on a Virtex-II Pro
    Product Not Recommended for New Designs Application Note: Virtex-II Pro Device R Running the Dhrystone 2.1 Benchmark on a Virtex-II Pro PowerPC Processor XAPP507 (v1.0) July 11, 2005 Author: Paul Glover Summary This application note describes a working Virtex™-II Pro PowerPC™ system that uses the Dhrystone benchmark and the reference design on which the system runs. The Dhrystone benchmark is commonly used to measure CPU performance. Introduction The Dhrystone benchmark is a general-performance benchmark used to evaluate processor execution time. This benchmark tests the integer performance of a CPU and the optimization capabilities of the compiler used to generate the code. The output from the benchmark is the number of Dhrystones per second (that is, the number of iterations of the main code loop per second). This application note describes a PowerPC design created with Embedded Development Kit (EDK) 7.1 that runs the Dhrystone benchmark, producing 600+ DMIPS (Dhrystone Millions of Instructions Per Second) at 400 MHz. Prerequisites Required Software • Xilinx ISE 7.1i SP1 • Xilinx EDK 7.1i SP1 • WindRiver Diab DCC 5.2.1.0 or later Note: The Diab compiler for the PowerPC processor must be installed and included in the path. • HyperTerminal Required Hardware • Xilinx ML310 Demonstration Platform • Serial Cable • Xilinx Parallel-4 Configuration Cable Dhrystone Developed in 1984 by Reinhold P. Wecker, the Dhrystone benchmark (written in C) was Description originally developed to benchmark computer systems, a short benchmark that was representative of integer programming. The program is CPU-bound, performing no I/O functions or operating system calls.
    [Show full text]
  • Benchmarking Models and Tools for Distributed Web-Server Systems
    Benchmarking Models and Tools for Distributed Web-Server Systems Mauro Andreolini1, Valeria Cardellini1, and Michele Colajanni2 1 Dept. of Computer, Systems and Production University of Roma “Tor Vergata” Roma I-00133, Italy andreolini,cardellini @ing.uniroma2.it, { } 2 Dept. of Information Engineering University of Modena Modena I-41100, Italy [email protected] Abstract. This tutorial reviews benchmarking tools and techniques that can be used to evaluate the performance and scalability of highly accessed Web-server systems. The focus is on design and testing of lo- cally and geographically distributed architectures where the performance evaluation is obtained through workload generators and analyzers in a laboratory environment. The tutorial identifies the qualities and issues of existing tools with respect to the main features that characterize a benchmarking tool (workload representation, load generation, data col- lection, output analysis and report) and their applicability to the analysis of distributed Web-server systems. 1 Introduction The explosive growth in size and usage of the Web is causing enormous strain on users, network service, and content providers.Sophisticated software components have been implemented for the provision of critical services through the Web. Consequently, many research efforts have been directed toward improving the performance of Web-based services through caching and replication solutions.A large variety of novel content delivery architectures, such as distributed Web- server systems, cooperative proxy
    [Show full text]
  • NCA’04) 0-7695-2242-4/04 $ 20.00 IEEE Interesting Proposals
    WALTy: A User Behavior Tailored Tool for Evaluating Web Application Performance G. Ruffo, R. Schifanella, and M. Sereno R. Politi Dipartimento di Informatica CSP Sc.a.r.l. c/o Villa Gualino Universita` degli Studi di Torino Viale Settimio Severo, 65 - 10133 Torino (ITALY) Corso Svizzera, 185 - 10149 Torino (ITALY) Abstract ticular, stressing tools make what-if analysis practical in real systems, because workload intensity can be scaled to In this paper we present WALTy (Web Application Load- analyst hypothesis, i.e., a workload emulating the activity based Testing tool), a set of tools that allows the perfor- of N users with pre-defined behaviors can be replicated, mance analysis of web applications by means of a scalable in order to monitor a set of performance parameters dur- what-if analysis on the test bed. The proposed approach is ing test. Such workload is based on sequences of object- based on a workload characterization generated from infor- requests and/or analytical characterization, but sometimes mation extracted from log files. The workload is generated they are poorly scalable by the analyst; in fact, in many by using of Customer Behavior Model Graphs (CBMG), stressing framework, we can just replicate a (set of) man- that are derived by extracting information from the web ap- ually or randomly generated sessions, losing in objectivity plication log files. In this manner the synthetic workload and representativeness. used to evaluate the web application under test is repre- The main scope of this paper is to present a methodol- sentative of the real traffic that the web application has to ogy based on the generation of a representative traffic.
    [Show full text]