Thesis Outline

Total Page:16

File Type:pdf, Size:1020Kb

Thesis Outline ENERGY AND RUN-TIME PERFORMANCE PRACTICES IN SOFTWARE ENGINEERING DISSERTATION FOR THE AWARD OF THE DOCTORAL DIPLOMA ATHENS UNIVERSITY OF ECONOMICS AND BUSINESS 2021 Stefanos Georgiou Department of Management Science and Technology Athens University of Economics and Business ii Department of Management Science and Technology Athens University of Economics and Business Email: sgeorgiou@aueb.gr Copyright 2021 Stefanos Georgiou This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License. iii Supervised by Professor Diomidis Spinellis iv In loving memory of my grandma Contents 1 Introduction 1 1.1 Context ..................................... 1 1.2 Problem Statement ............................... 2 1.3 Proposed Solutions and Contributions ..................... 3 1.4 Thesis Outline .................................. 4 1.5 How to Read this Thesis ............................. 5 2 Related Work 6 2.1 Background ................................... 6 2.1.1 Methodology .............................. 7 2.1.2 Energy Efficiency in the Context of SDLC ................ 8 2.2 Requirements .................................. 9 2.2.1 Survey Studies ............................. 9 2.2.2 Empirical Evaluation Studies ...................... 10 2.3 Design ...................................... 11 2.3.1 Empirical Evaluation of Design Patterns ................ 11 2.3.2 Energy Optimisation of Design Patterns ................ 12 2.4 Implementation ................................. 13 2.4.1 Parallel Programming .......................... 13 2.4.1.1 Experimental Studies .................... 13 2.4.1.2 Algorithms .......................... 14 2.4.2 Approximate Computing ........................ 15 2.4.2.1 Programming Frameworks .................. 15 2.4.2.2 Annotation-Based Extensions ................ 16 2.4.2.3 Directive-Based Extensions ................. 17 2.4.2.4 Memoisation ......................... 17 2.4.3 Source Code Analysis .......................... 17 2.4.3.1 System Calls ......................... 18 2.4.3.2 Optimisation Tools ...................... 19 2.4.3.3 Tests Generation Framework ................ 19 2.4.3.4 Line-by-Line ......................... 19 2.4.4 Programming Languages ........................ 19 2.4.4.1 Different Programming Languages ............. 20 2.4.4.2 Compiler Optimizations ................... 22 2.4.5 Data Structures ............................. 23 2.4.5.1 Experimental Studies .................... 23 v vi 2.4.5.2 Tooling Support ....................... 24 2.4.6 Coding Practices ............................ 25 2.4.7 IPC Technologies ............................ 27 2.5 Verification ................................... 28 2.5.1 Benchmarks ............................... 28 2.5.2 Monitoring Tools ............................ 29 2.5.2.1 Software Energy Monitoring Tools .............. 30 Workstations and Servers .................... 30 Virtual Machines ........................ 32 SmartPhones .......................... 32 2.5.2.2 Hardware Energy Monitoring Tools ............. 33 Workstation and Server Monitoring Tools ........... 34 Smartphone Monitoring Tools ................. 34 2.6 Maintenance .................................. 34 2.6.1 Empirical Evaluation of Code Refactoring ............... 35 2.6.2 Tools for Refactoring .......................... 36 2.7 Research Opportunities ............................. 37 3 Methodology 39 3.1 Research Objectives ............................... 39 3.1.1 Programming Languages Research Questions ............. 39 3.1.2 IPC Research Questions ......................... 40 3.1.3 Safeguards Research Questions .................... 41 3.2 Software Systems and Tools ........................... 42 3.2.1 Programming Languages Subject Systems ............... 42 3.2.2 IPC Subject Systems ........................... 46 3.2.3 Safeguards Subject Systems ...................... 49 3.3 Research Method ................................ 51 3.3.1 Programming Languages Measurements Collection .......... 51 3.3.2 IPC Measurements Collection ..................... 52 3.3.3 Accuracy of obtained Results ...................... 52 3.3.4 Safeguards Measurements Collection ................. 54 3.4 Threats to Validity ................................ 55 3.4.1 Programming Languages Limitations .................. 55 3.4.2 IPC Limitations ............................. 56 3.4.3 Safeguards Limitations ......................... 56 4 Results 57 4.1 Programming Languages Results ........................ 57 4.1.1 PL-RQ1. Which programming languages are the most EDP-efficient and inefficient for particular tasks? ................... 57 4.1.1.1 Embedded System Results .................. 59 4.1.1.2 Laptop System Results .................... 61 4.1.1.3 Server System Results .................... 61 4.1.1.4 Range of results ....................... 62 4.1.2 PL-RQ2. Which types of programming languages are, on average, more EDP-efficient and inefficient for each of the platforms? ..... 64 vii 4.1.3 PL-RQ3. How much does the EDP of each programming language differ among the selected platforms? ................. 65 4.2 IPC Results .................................... 66 4.2.1 IPC-RQ1. Which IPC technology implementation offers the most energy- and run-time performance-efficient results? ......... 66 4.2.1.1 Intel platforms ........................ 67 4.2.1.2 ARM platforms ........................ 67 4.2.1.3 Range of results ....................... 68 4.2.2 IPC-RQ2. What are the reasons that make certain IPC technologies more energy and run-time performance-efficient? .......... 69 4.2.2.1 Platforms’ System Calls ................... 71 4.2.2.2 Identifying the Facts ..................... 71 4.2.3 IPC-RQ3. Is the energy consumption of the IPC technologies propor- tional to their run-time performance or resource usage? ....... 72 4.2.3.1 Energy consumption and run-time performance ...... 73 4.2.3.2 Energy consumption and resource usage .......... 73 4.3 Safeguards Results Analysis ........................... 75 4.3.1 SG-RQ1. What are the energy and run-time performance implica- tions of the security mechanisms on a computer system? ....... 75 4.3.1.1 CPU Vulnerability Patches .................. 76 4.3.1.2 Communication-related Security .............. 86 4.3.1.3 Memory-related Protection ................. 87 4.3.1.4 Compiler-related Safeguards ................ 87 4.3.2 SG-RQ2. Is the energy consumption of the examined security mech- anisms proportional to their run-time performance? ......... 90 4.3.2.1 CPU-related Vulnerability Patches .............. 90 4.3.2.2 Communication-related Security .............. 91 4.3.2.3 Memory-related Protection ................. 91 4.3.2.4 Compiler-related Safeguards ................ 91 4.3.3 SG-RQ3. How do security mechanisms affect the energy consump- tion and the run-time performance of different applications andutil- ities? .................................. 92 4.3.3.1 CPU-related Vulnerability Patches .............. 92 4.3.3.2 Compiler-related Safeguards ................ 93 5 Discussion 94 5.1 Programming Languages Findings ....................... 94 5.1.1 Champions ............................... 94 5.1.2 Impact ................................. 95 5.2 IPC Findings ................................... 96 5.2.1 Interpreting the Findings ........................ 96 5.2.2 Lessons learned ............................. 96 5.3 Safeguards Findings ............................... 97 5.3.1 CPU Vulnerability Patches and GCC Safeguards ............ 97 viii 6 Conclusions and Future Work 98 6.1 Contributions of the Thesis ........................... 98 6.2 Future Work ................................... 99 A Appendix I: Heatmaps from Programming Languages Study 102 Bibliography 112 B List of Publications 130 B.1 Accepted publications based on this thesis ................... 130 B.2 Submitted articles based on this thesis ..................... 130 B.3 Relevant accepted publications not part of the thesis ............. 130 List of Figures 2.1 Software Development Life Cycle for Energy Efficiency Taxonomy ....... 8 3.1 Experiment setup for Intel and ARM systems .................. 47 3.2 Client (top) and server (bottom) waveforms of gRPC task implemented in JavaScript running on ARM platforms ...................... 53 4.1 Server’s EDP with Weighted Function 2 ..................... 58 4.2 EDP box plots. The points show outliers. The vertical scale is the logarithmic ratio log10(p=pmin) where p is the measurement and pmin is the minimum of the measurements for that task, corresponding to the most EDP-friendly language. .................................... 63 4.3 Intel and ARM computer platforms results ................... 69 4.4 Computer Platforms System Calls ........................ 70 4.5 The first figure (left) illustrates the energy consumption and the run-time per- formance of the Intel platform. The second figure (right) presents the energy consumption and the run-time perfomrance of the ARM platform. ...... 73 4.6 The first figure (left) illustrates the energy consumption and the maximum resident set size results of the Intel platform. The second figure (right) presents the energy consumption and the maximum resident set size results of the ARM platform. .............................. 74 4.7 The figures illustrate the energy consumption and the major page faultsre- sults of the Intel (left) and the ARM (right) platforms. ............. 74 4.8 The first figure (left) illustrates the energy consumption and the majorpage faults results of the Intel platform, while the second figure
Recommended publications
  • How Is Video Game Development Different from Software Development in Open Source?
    Delft University of Technology How Is Video Game Development Different from Software Development in Open Source? Pascarella, Luca; Palomba, Fabio; Di Penta, Massimiliano; Bacchelli, Alberto DOI 10.1145/3196398.3196418 Publication date 2018 Document Version Accepted author manuscript Published in Proceedings of the 15th International Conference on Mining Software Repositories, MSR. ACM, New York, NY Citation (APA) Pascarella, L., Palomba, F., Di Penta, M., & Bacchelli, A. (2018). How Is Video Game Development Different from Software Development in Open Source? In Proceedings of the 15th International Conference on Mining Software Repositories, MSR. ACM, New York, NY (pp. 392-402) https://doi.org/10.1145/3196398.3196418 Important note To cite this publication, please use the final published version (if applicable). Please check the document version above. Copyright Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons. Takedown policy Please contact us and provide details if you believe this document breaches copyrights. We will remove access to the work immediately and investigate your claim. This work is downloaded from Delft University of Technology. For technical reasons the number of authors shown on this cover page is limited to a maximum of 10. How Is Video Game Development Different from Software Development in Open Source? Luca Pascarella1,
    [Show full text]
  • Gscale: Scaling up GPU Virtualization with Dynamic Sharing of Graphics
    gScale: Scaling up GPU Virtualization with Dynamic Sharing of Graphics Memory Space Mochi Xue, Shanghai Jiao Tong University and Intel Corporation; Kun Tian, Intel Corporation; Yaozu Dong, Shanghai Jiao Tong University and Intel Corporation; Jiacheng Ma, Jiajun Wang, and Zhengwei Qi, Shanghai Jiao Tong University; Bingsheng He, National University of Singapore; Haibing Guan, Shanghai Jiao Tong University https://www.usenix.org/conference/atc16/technical-sessions/presentation/xue This paper is included in the Proceedings of the 2016 USENIX Annual Technical Conference (USENIX ATC ’16). June 22–24, 2016 • Denver, CO, USA 978-1-931971-30-0 Open access to the Proceedings of the 2016 USENIX Annual Technical Conference (USENIX ATC ’16) is sponsored by USENIX. gScale: Scaling up GPU Virtualization with Dynamic Sharing of Graphics Memory Space Mochi Xue1,2, Kun Tian2, Yaozu Dong1,2, Jiacheng Ma1, Jiajun Wang1, Zhengwei Qi1, Bingsheng He3, Haibing Guan1 {xuemochi, mjc0608, jiajunwang, qizhenwei, hbguan}@sjtu.edu.cn {kevin.tian, eddie.dong}@intel.com he.bingsheng@gmail.com 1Shanghai Jiao Tong University, 2Intel Corporation, 3National University of Singapore Abstract As one of the key enabling technologies of GPU cloud, GPU virtualization is intended to provide flexible and With increasing GPU-intensive workloads deployed on scalable GPU resources for multiple instances with high cloud, the cloud service providers are seeking for practi- performance. To achieve such a challenging goal, sev- cal and efficient GPU virtualization solutions. However, eral GPU virtualization solutions were introduced, i.e., the cutting-edge GPU virtualization techniques such as GPUvm [28] and gVirt [30]. gVirt, also known as GVT- gVirt still suffer from the restriction of scalability, which g, is a full virtualization solution with mediated pass- constrains the number of guest virtual GPU instances.
    [Show full text]
  • A Full GPU Virtualization Solution with Mediated Pass-Through
    A Full GPU Virtualization Solution with Mediated Pass-Through Kun Tian, Yaozu Dong, David Cowperthwaite Intel Corporation Abstract shows the spectrum of GPU virtualization solutions Graphics Processing Unit (GPU) virtualization is an (with hardware acceleration increasing from left to enabling technology in emerging virtualization right). Device emulation [7] has great complexity and scenarios. Unfortunately, existing GPU virtualization extremely low performance, so it does not meet today’s approaches are still suboptimal in performance and full needs. API forwarding [3][9][22][31] employs a feature support. frontend driver, to forward the high level API calls inside a VM, to the host for acceleration. However, API This paper introduces gVirt, a product level GPU forwarding faces the challenge of supporting full virtualization implementation with: 1) full GPU features, due to the complexity of intrusive virtualization running native graphics driver in guest, modification in the guest graphics software stack, and and 2) mediated pass-through that achieves both good incompatibility between the guest and host graphics performance and scalability, and also secure isolation software stacks. Direct pass-through [5][37] dedicates among guests. gVirt presents a virtual full-fledged GPU the GPU to a single VM, providing full features and the to each VM. VMs can directly access best performance, but at the cost of device sharing performance-critical resources, without intervention capability among VMs. Mediated pass-through [19], from the hypervisor in most cases, while privileged passes through performance-critical resources, while operations from guest are trap-and-emulated at minimal mediating privileged operations on the device, with cost. Experiments demonstrate that gVirt can achieve good performance, full features, and sharing capability.
    [Show full text]
  • Download Original Super Mario for Windows 10 Download Mario Forever for Windows 10 and Windows 7
    download original super mario for windows 10 Download Mario Forever for Windows 10 and Windows 7. Download failed. Sorry for the inconvenience, we will fix the error as soon as possible. Thank you for your confidence. Success to download. Wait a few seconds until the download begins. Versión : Mario Forever 7.02 File Name : super-mario-forever-v702e.exe File Size : 29.87 MiB. You're downloading Mario Forever . File super-mario-forever-v702e.exe is compatible with: Windows 10 Windows 8.1 Windows 8 Windows 7. Mario Forever is one re lecture of the classic Nintendo game, Super Mario Bros 3 in which the main theme relates of a plumber that should rescue the princess of the "claws" of Koopa, a malicious dragon that will try. View More. Windows 10 was released on July 2015, and it's an evolution of Windows 8 operating system. Windows 10 fix many of the problems of the previous operating system developed by Miscrosoft. And now, it return the desktop as a fundamental element of this brand new Windows version. Windows 10 received many good reviews and critics. Thank you for downloading Mario Forever. Your download will start immediately. If the download did not start please click here: Download Mario Forever for Windows 10 and Windows 7. Clean File 0/54 Virus Total Report. Other programs in Games. Pioneers. Pioneers is a free board game based on The Settlers of Catan board game. Pioneers can be played online against other players, or locally, directly against the computer. In Pioneers settlers will find themselves in virgin places that man has.
    [Show full text]
  • 0 A.D. the Battle for Wesnoth
    GAMING ON LINUX GAMING ONLINUX The tastiest brain candy to relax those tired neurons LINUX FOR THE WIN! 0 A.D. Battle in real time strategy like an Egyptian. ike an overdue Christmas present the Lteam at Wildfire Games has released the fifteenth alpha version of the epic open-source real time strategy game 0 A.D. The latest alpha version Liam Dawes is the brains behind www.gamingonlinux.com, the home added some really essential of Linux gaming on the interweb. features that were previously missing, including a multi- A new army is inux has long been a viable player lobby, so it should now readying for battle! platform for gaming, but it is be a total cinch to find people only now that mainstream L to play online. gamers are starting to sit up and take notice. Despite what many people In addition to being easy to 0 A.D. aims to be of AAA this strategy has paid off. They may think, the thanks for this play online there is yet another production quality, which have run several successful shouldn’t solely go to Valve for using playable civilisation – the shows in abundance. It was crowdfunding, and are now Linux as the basis of its Steam OS: Ptolemaic Egyptians – with originally closed source, but the using it to fund programmers there’s a long history of gaming on unique units and gameplay team opened it up with the aim to make 0 A.D. even better! the Linux platform. Id Software was one of the first features included for them.
    [Show full text]
  • Modified Fast Inverse Square Root and Square Root Approximation
    computation Article Modified Fast Inverse Square Root and Square Root Approximation Algorithms: The Method of Switching Magic Constants Leonid V. Moroz 1, Volodymyr V. Samotyy 2,3,* and Oleh Y. Horyachyy 1 1 Information Technologies Security Department, Lviv Polytechnic National University, 79013 Lviv, Ukraine; moroz_lv@lp.edu.ua (L.V.M.); oleh.y.horiachyi@lpnu.ua (O.Y.H.) 2 Automation and Information Technologies Department, Cracow University of Technology, 31155 Cracow, Poland 3 Information Security Management Department, Lviv State University of Life Safety, 79007 Lviv, Ukraine * Correspondence: vsamotyy@pk.edu.pl Abstract: Many low-cost platforms that support floating-point arithmetic, such as microcontrollers and field-programmable gate arrays, do not include fast hardware or software methods for calculating the square root and/or reciprocal square root. Typically, such functions are implemented using direct lookup tables or polynomial approximations, with a subsequent application of the Newton– Raphson method. Other, more complex solutions include high-radix digit-recurrence and bipartite or multipartite table-based methods. In contrast, this article proposes a simple modification of the fast inverse square root method that has high accuracy and relatively low latency. Algorithms are given in C/C++ for single- and double-precision numbers in the IEEE 754 format for both square root and reciprocal square root functions. These are based on the switching of magic constants in the Citation: Moroz, L.V.; Samotyy, V.V.; initial approximation, depending on the input interval of the normalized floating-point numbers, in Horyachyy, O.Y. Modified Fast order to minimize the maximum relative error on each subinterval after the first iteration—giving Inverse Square Root and Square Root 13 correct bits of the result.
    [Show full text]
  • An Updated Maximum Likelihood Approach to Open Cluster Distance Determination M
    Astronomy & Astrophysics manuscript no. OCdistanceDeterminationAstroPh c ESO 2018 October 25, 2018 An updated maximum likelihood approach to open cluster distance determination M. Palmer1, F. Arenou2, X. Luri1, and E. Masana1 1 Dept. d’Astronomia i Meteorologia, Institut de Ciencies` del Cosmos, Universitat de Barcelona (IEEC-UB), Mart´ı Franques` 1, E08028 Barcelona, Spain. 2 GEPI, Observatoire de Paris, CNRS, Universite´ Paris Diderot, 5 place Jules Janssen, 92190, Meudon, France Preprint online version: October 25, 2018 ABSTRACT Aims. An improved method for estimating distances to open clusters is presented and applied to Hipparcos data for the Pleiades and the Hyades. The method is applied in the context of the historic Pleiades distance problem, with a discussion of previous criticisms of Hipparcos parallaxes. This is followed by an outlook for Gaia, where the improved method could be especially useful. Methods. Based on maximum likelihood estimation, the method combines parallax, position, apparent magnitude, colour, proper motion, and radial velocity information to estimate the parameters describing an open cluster precisely and without bias. Results. We find the distance to the Pleiades to be 120:3±1:5 pc, in accordance with previously published work using the same dataset. We find that error correlations cannot be responsible for the still present discrepancy between Hipparcos and photometric methods. Additionally, the three-dimensional space velocity and physical structure of Pleiades is parametrised, where we find strong evidence of mass segregation. The distance to the Hyades is found to be 46:35 ± 0:35 pc, also in accordance with previous results. Through the use of simulations, we confirm that the method is unbiased, so will be useful for accurate open cluster parameter estimation with Gaia at distances up to several thousand parsec.
    [Show full text]
  • Etir Code Lists
    eTIR Code Lists Code lists CL01 Equipment size and type description code (UN/EDIFACT 8155) Code specifying the size and type of equipment. 1 Dime coated tank A tank coated with dime. 2 Epoxy coated tank A tank coated with epoxy. 6 Pressurized tank A tank capable of holding pressurized goods. 7 Refrigerated tank A tank capable of keeping goods refrigerated. 9 Stainless steel tank A tank made of stainless steel. 10 Nonworking reefer container 40 ft A 40 foot refrigerated container that is not actively controlling temperature of the product. 12 Europallet 80 x 120 cm. 13 Scandinavian pallet 100 x 120 cm. 14 Trailer Non self-propelled vehicle designed for the carriage of cargo so that it can be towed by a motor vehicle. 15 Nonworking reefer container 20 ft A 20 foot refrigerated container that is not actively controlling temperature of the product. 16 Exchangeable pallet Standard pallet exchangeable following international convention. 17 Semi-trailer Non self propelled vehicle without front wheels designed for the carriage of cargo and provided with a kingpin. 18 Tank container 20 feet A tank container with a length of 20 feet. 19 Tank container 30 feet A tank container with a length of 30 feet. 20 Tank container 40 feet A tank container with a length of 40 feet. 21 Container IC 20 feet A container owned by InterContainer, a European railway subsidiary, with a length of 20 feet. 22 Container IC 30 feet A container owned by InterContainer, a European railway subsidiary, with a length of 30 feet. 23 Container IC 40 feet A container owned by InterContainer, a European railway subsidiary, with a length of 40 feet.
    [Show full text]
  • 06523078 Galih Hendro Martono.Pdf (8.658Mb)
    PANDUAN MIGRASI DARI WINDOWS KE UBUNTU TUGAS AKHIR Diajukan Sebagai Salah Satu Syarat Untuk Memperoleh Geiar Sarjana Teknik Informatika ^\\\N<£V\V >> ^. ^v- Vi-Ol3V< Disusun Oleh : Nama : Galih Hendro Martono No. Mahasiswa : 06523078 JURUSAN TEKNIK INFORMATIKA FAKULTAS TEKNOLOGI INDUSTRl UNIVERSITAS ISLAM INDONESIA 2010 LEMBAR PENGESAHAN PEMBIMBING PANDUAN MIGRASI DARI WINDOWS KE UBUNTU LAPORAN TUGAS AKHIR Disusun Oleh : Nama : Galih Hendro Martono No. Mahasiswa : 06523078 Yogyakarta, 12 April 2010 Telah DitejHha Dan Disctujui Dengan Baik Oleh Dosen Pembimbing -0 (Zainudki Zukhri, ST., M.I.T.) ^y( LEMBAR PERNYATAAN KEASLIAN TUGAS AKIilR Sa\a sane bertanda langan di bawah ini, Nama : Galih Hendro Martono No- Mahasiswa : 06523078 Menyatakan bahwu seluruh komponen dan isi dalam laporan 7'ugas Akhir ini adalah hasi! karya sendiri. Apahiia dikemudian hari terbukti bahwa ada beberapa bagian dari karya ini adalah bukan hassl karya saya sendiri, maka sava siap menanggung resiko dan konsckuensi apapun. Demikian pennalaan ini sa\a buaL semoga dapa! dipergunakan sebauaimana mesthna. Yogvakarta, 12 April 2010 ((ialih Hendro Martono) LEMBAR PENGESAHAN PENGUJI PANDUAN MIGRASI DARI WINDOWS KE UBUNTU TUGASAKHIR Disusun Oleh : Nama Galih Hendro Martono No. MahaMSwa 0f>52.'iU78 Telah Dipertahankan di Depan Sidang Penguji Sebagai Salah Satti Syarat t'nUik Memperoleh r>ekii Sarjana leknik 'nlormaUka Fakutlss Teknologi fiuiii3iri Universitas Islam Indonesia- Yogvakai .'/ April 2010 Tim Penguji Zainuditi Zukhri. ST., M.i.T Ketua Yudi Prayudi S.SUM.Kom Anggota Irving Vitra Paputungan,JO^ M.Sc Anggota lengelahui, "" ,&'$5fcysan Teknik liInformatika 'Islam Indonesia i*YGGYA^F' +\ ^^AlKfevudi. S-Si.. M. Kom, IV CO iU 'T 'P ''• H- rt 2 r1 > -z o •v PI c^ --(- -^ ,: »••* £ ii fc JV t 03 L—* ** r^ > ' ^ (T a- !—• "J — ., U > ~J- i-J- T-,' * -" iv U> MOTTO "liada 1'ufian sefainflffaft dan Jiabi 'Muhamadadafafi Vtusan-Tiya" "(BerdoaCzfi ^epada%u niscaya a^anjl^u ^a6u0ian (QS.
    [Show full text]
  • December 2010 VOLUME 35 NUMBER 6
    December 2010 VOLUME 35 NUMBER 6 OPINION Musings 2 RikR FaR ow SECURITY Introducing Capsicum: Practical Capabilities for UNIX 7 Robe Rt N.M. watsoN, JoNathaN THE USENIX MAGAZINE aNdeRsoN, beN LauRie, aNd kRis keNNaway The Nocebo Effect on the Web: An Analysis of Fake Anti-Virus Distribution 18 Moheeb abu Ra Jab, Lucas baLLaRd, PaNayiotis MavRoMMatis, NieLs PRovos, aNd XiN Zhao Vulnerable Compliance 26 d aN GeeR Overcoming an Untrusted Computing Base: Detecting and Removing Malicious Hardware Automatically 31 Matthew hicks, MuRPh FiNNicuM, saMueL t. kiNG, MiLo M.k. MaRtiN, aNd JoNathaN M. sMith C OLUMNS Practical Perl Tools: Family Man 42 d avid N. bLaNk-edeLMaN Pete’s All Things Sun: Comparing Solaris to RedHat Enterprise and AIX 48 Petee R ba R GaLviN iVoyeur: Ganglia on the Brain 54 d ave JosePhseN /dev/random 58 Robe Rt G. Fe RReLL BOEO K reVI WS Book Reviews 60 El iZabeth Zwicky et a L. useni X NOTES Thankso t Our Volunteers 64 Ell u ie yo ng CN O FERENCES 19th USENIX Security Symposium Reports 67 Report on the 5th USENIX Workshop on Hot Topics in Security 97 Report on the 1st USENIX Workshop on Health Security and Privacy 103 Report on the 4th USENIX Workshop on Offensive Technologies 112 Report on the New Security Paradigms Workshop 117 The Advanced Computing Systems Association dec10covers.indd 1 11.17.10 1:28 PM Upcoming Events 9th USENIX CoNfErence oN fIlE aNd StoragE 2011 USENIX fEdEratEd CoNfErences Week techNologies (FASt ’11) j une 12–17, 2011, portland, OR, uSa Sponsored by USENIX in cooperation with ACM SIGOPS EventS inclUdE:
    [Show full text]
  • Kosminio Žingsninio Strateginio Žaidimo Kūrimas. Duomenų Bazės Projektavimas Ir Realizavimas Šiaulių Universitetas 2010
    ŠIAULIŲ UNIVERSITETAS MATEMATIKOS IR INFORMATIKOS FAKULTETAS INFORMATIKOS KATEDRA Remigijus Valčiukas Informatikos specialybės IV kurso dieninio skyriaus studentas Kosminio žingsninio strateginio žaidimo kūrimas. Duomenų bazės projektavimas ir realizavimas Development of Space Turn-Based Strategy Game: Database Design and Implementation BAKALAURO DARBAS Darbo vadovas: Lekt. G. Lūža Recenzentas: Lekt. V.Giedrimas Šiauliai, 2010 Turinys Įvadas ............................................................................................................................................................................. 3 1. Analitinė dalis ....................................................................................................................................................... 4 1.1 Programos be apribojimų .............................................................................................................. 4 1.2 Kompiuteriniai žaidimai ............................................................................................................... 4 1.3 Analogai ........................................................................................................................................ 5 1.4 Kosminis žingsninis strateginis žaidimas...................................................................................... 8 2. Projektinė dalis ..................................................................................................................................................... 9 2.1. Įrankių ir priemonių
    [Show full text]
  • Agents for Games and Simulations
    First International Workshop on Agents for Games and Simulations Budapest May 11, 2009 i Table of Contents Preface iii Avi Rosenfeld and Sarit Kraus. Modeling Agents through Bounded Rationality Theories 1 Jean-Pierre Briot, Alessandro Sordoni, Eurico Vasconcelos, Gustavo Melo, Marta de Azevedo Irving and Isabelle Alvarez. Design of a Decision Maker Agent for a Distributed Role Playing Game - Experience of the SimParc Project 16 Michael Köster, Peter Novák, David Mainzer and Bernd Fuhrmann. Two Case Studies for Jazzyk BSM 31 Joost Westra, Hado van Hasselt, Frank Dignum and Virginia Dignum. Adaptive serious games using agent organizations 46 D.W.F. van Krevelen. Intelligent Agent Modeling as Serious Game 61 Gustavo Aranda, Vicent Botti and Carlos Carrascosa. The MMOG Layer: MMOG based on MAS 75 Ivan M. Monteiro and Luis O. Alvares. A Teamwork Infrastructure for Computer Games with Real-Time Requirements 90 Barry Silverman, Deepthi Chandrasekaran, Nathan Weyer, David Pietrocola, Robert Might and Ransom Weaver. NonKin Village: A Training Game for Learning Cultural Terrain and Sustainable Counter-Insurgent Operations 106 Mei Yii Lim, Joao Dias, Ruth Aylett and Ana Paiva. Intelligent NPCs for Education Role Play Game 117 Derek J. Sollenberger and Munindar P. Singh. Architecture for Affective Social Games 129 Jakub Gemrot, Rudolf Kadlec, Michal Bída, Ondřej Burkert, Radek Píbil, Jan Havlíček, Juraj Šimlovič, Radim Vansa, Michal Štolba, Lukáš Zemčák and Cyril Brom. Pogamut 3 Can Assist Developers in Building AI for Their Videogame Agents 144 Daniel Castro Silva, Ricardo Silva, Luís Paulo Reis and Eugénio Oliveira. Agent-Based Aircraft Control Strategies in a Simulated Environment 149 ii Preface Multi Agent System research offers a promising technology to implement cognitive intelligent Non Playing Characters.
    [Show full text]