Olympiads in Informatics

Total Page:16

File Type:pdf, Size:1020Kb

Olympiads in Informatics ISSN 1822-7732 INTERNATIONAL OLYMPIAD IN INFORMATICS VILNIUS UNIVERSITY INSTITUTE OF MATHEMATICS AND INFORMATICS OLYMPIADS IN INFORMATICS Volume 8 2014 Selected papers of the International Conference joint with the XXVI International Olympiad in Informatics Taipei, Taiwan, July 13-20, 2014 OLYMPIADS IN INFORMATICS Editor-in-Chief Valentina Dagienė Vilnius University, Lithuania, [email protected] Executive Editor Richard Forster British Informatics Olympiad, UK, [email protected] International Editorial Board Gerald Futschek, Vienna University of Technology, Austria, [email protected] Bruria Haberman, Holon Institute of Technology, Israel, [email protected] Mile Jovanov, Sts. Cyril and Methodius University, Skopje, Macedonia, [email protected] Marcin Kubica, Warsaw University, Poland, [email protected] Ville Leppänen, University of Turku, Finland, [email protected] Krassimir Manev, Sofia University, Bulgaria, [email protected] Rein Prank, University of Tartu, Estonia, [email protected] Seiichi Tani, Nihon University, Japan, [email protected] Peter Taylor, University of Canberra, Australia, [email protected] Troy Vasiga, University of Waterloo, Canada, [email protected] Peter Waker, International Qualification Alliance, Republic of South Africa, [email protected] Willem van der Vegt, Windesheim University for Applied Sciences, The Netherlands, [email protected] http://ioinformatics.org/oi_index.shtml http://www.mii.lt/olympiads_in_informatics ISSN 1822-7732 (Print) 2335-8955 (Online) Publisher: Vilnius University © Vilnius University, 2014 Institute of Mathematics and Informatics International Olympiad in Informatics, 2 0 1 4 Akademijos str. 4, LT-08663 Vilnius, Lithuania All rights reserved Olympiads in Informatics, 2014, Vol. 8, 1–2 1 © 2014 Vilnius University, IOI Foreword In the first years of the Olympiads in Informatics conference a specific theme was set. Since 2009 papers have been accepted on any topic that falls under our remit – along with the occasional one that falls just outside. One way of splitting these papers is into those that relate to olympiads and those that look at the wider teaching of informat- ics. Many of the conference’s earlier papers, when not discussing contest technicalities (tasks, graders, etc…) looked towards the organisational aspects of the events. We are now seeing papers that take as their foundation national strategies for teaching, of which an informatics olympiad is (if at all) a small part. We are fortunate to deal with a subject that adapts well to new technology. As an illustration consider the International Olympiad in Informatics which has moved from manual grading to automated grading; originally requiring evaluators typing in data by hand, moving to evaluators running semi-automated systems, to our current state of au- tomated grading which can – on a good day – have the results of the event ready before the students have left the contest area. What is more exciting is to see these same grad- ing systems being adapted outside of the contest environment and becoming part of the pedagogical one. We live in a world containing teachers with a mix of abilities, knowledge and moti- vations. Schools where there are limits on the amount of time to teach and the resources to teach with. Students who need to work hard on the simplest materials; those who are able to rush ahead to the complex; those who want to study the esoteric. The last few years, especially through the internet, have seen an explosion of courses that are avail- able outside of the usual teaching environment. Again – we are fortunate to deal with a subject that adapts well to new technology. One where automated systems can give accurate feedback to students. One where, without specialist equipment, students can study at their own rate. The development of grading and teaching environments within our community, and their spread to the wider teaching community, is one of our strengths. There is now a real choice of several strong environments that we have created and made available. This volume contains several papers discussing such systems; their technical aspects but also how they can be used to teach. It is not just our top students who are benefiting from the olympiads; not just those who compete in our contests. We are making a real difference out there. As always thanks are due to all those who have assisted with the current volume – authors, reviewers and editors. A lot of work goes, not only to the writing of the papers, but to an extended period of review and correction and, in several cases, translation. 2 Peer reviewing all of the papers takes a significant amount of time and work and special thanks should be given to those otherwise unsung reviewing heroes. Last, but by no means least, particular thanks are due to the organisational committee for IOI’2014 in Taiwan without whose assistance we would be unable to hold the confer- ence. Their assistance, during what is an already busy period, is gratefully received. Editors Olympiads in Informatics, 2014, Vol. 8, 3–19 3 © 2014 Vilnius University, IOI Presenting Computer Science Concepts to High School Students Tim BELL1, Caitlin DUNCAN1, Sam JARMAN1, Heidi NEWTON2 1 University of Canterbury, New Zealand 2 Victoria University of Wellington, New Zealand e-mail: [email protected], [email protected], [email protected], [email protected] Abstract. Computer science at high school often focuses on programming, but a broader view of other areas of computer science has key benefits for both writing programs that are more efficient and making more theoretical concepts more accessible to those who do not find programming in- trinsically interesting. With the introduction of computer science at high schools, a lack of coherent resources for teachers and students prompted the development of the NZ Computer Science Field Guide, an open-source, on-line textbook. This paper describes the design of the Field Guide, which has fourteen chapters about various topics of computer science. The design includes written text, videos, classroom activities and inter- active applications. The need for a broad view of computer science is discussed, and programming exercises to go with the topics are suggested. Keywords: computer science, high school, curriculum, constructivism, open source. 1. Introduction Computer science at high school level often focuses on programming, but new ap- proaches, including new curricula in the UK (Furber, 2012), Australia (Falkner et al., 2014) and New Zealand (Bell et al., 2010), are being developed that offer a broader view of the subject, allowing students to delve into topics such as algorithm efficiency, encryption, human computer interaction and computer vision. This broader view has two key benefits: first, it shows programmers how to write programs that are more effective, and second, for those who don’t find programming intrinsically interesting, it shows the kinds of things that are done with programming, providing the motivation to learn programming. For example, in programming competitions students are tasked with problems to solve that must run within a time limit. Writing a program to solve a problem may not be so difficult, but to do it efficiently and effectively can involve bringing to bear ideas from computer science (such as algorithmic complexity and tractability), and a good un- derstanding of computer science principles can enable students to improve their compe- tition code, allowing it to execute faster and fit under time limits set by the judges. Con- versely, ideas from computer science (such as data compression or formal languages) 4 T. Bell et al. can provide rich domains for programming exercises, and give students more experience thinking about the richness of approaches available to the computer scientist, such as hashing (an idea which can be applied to areas as diverse as searching algorithms, error detection by hash totals, and password encryption by secure hashing). Although there are literally thousands of resources available that touch on areas of computer science that might be relevant to high school level students (Murugesh et al., 2010), these resources vary greatly in suitability, and tend to occur as one-off examples that can’t be used as a coherent body. To address this, we have developed the “NZ Com- puter Science Field Guide” (referred to here as the NZ CSFG, available at http:// csfieldguide.org.nz), an open-source, interactive, online “textbook” that intro- duces a wide range of topics in computer science, without necessarily expecting students to be competent programmers before tackling the range of topics covered. It is a pilot for a wider range of computer science field guides intended for international use in a variety of contexts. The index of the NZ CSFG is shown in Fig. 1, showing the range of topics covered. The NZ CSFG has initially been developed to support the new computer science stan- dards that became available in New Zealand high schools in 2011 (Bell et al., 2010), but it is intended to be flexible enough to support curricula for other countries, and other initiatives aimed at high school aged students, such as computing clubs and programming competitions. Because it is open source, in principle educators can adapt it to suit their situation. Because it is online it can be accessed by interested students as long as they have internet access, and an offline version is planned so that it can be delivered through other media as well. For example, while the NZ CSFG was initially prepared to support teaching computer science in New Zealand high schools, it was also being used in parallel to sup- port a pilot for a Computer Science Club (http://computerscienceclub.org) for students aged around 10 to 15 years old. The club is based on a badge system where students can attain different levels of badges in topics in computer science, with many of the badge topics being associated with topics in the CSFG.
Recommended publications
  • 16 Inspiring Women Engineers to Watch
    Hackbright Academy Hackbright Academy is the leading software engineering school for women founded in San Francisco in 2012. The academy graduates more female engineers than UC Berkeley and Stanford each year. https://hackbrightacademy.com 16 Inspiring Women Engineers To Watch Women's engineering school Hackbright Academy is excited to share some updates from graduates of the software engineering fellowship. Check out what these 16 women are doing now at their companies - and what languages, frameworks, databases and other technologies these engineers use on the job! Software Engineer, Aclima Tiffany Williams is a software engineer at Aclima, where she builds software tools to ingest, process and manage city-scale environmental data sets enabled by Aclima’s sensor networks. Follow her on Twitter at @twilliamsphd. Technologies: Python, SQL, Cassandra, MariaDB, Docker, Kubernetes, Google Cloud Software Engineer, Eventbrite 1 / 16 Hackbright Academy Hackbright Academy is the leading software engineering school for women founded in San Francisco in 2012. The academy graduates more female engineers than UC Berkeley and Stanford each year. https://hackbrightacademy.com Maggie Shine works on backend and frontend application development to make buying a ticket on Eventbrite a great experience. In 2014, she helped build a WiFi-enabled basal body temperature fertility tracking device at a hardware hackathon. Follow her on Twitter at @magksh. Technologies: Python, Django, Celery, MySQL, Redis, Backbone, Marionette, React, Sass User Experience Engineer, GoDaddy 2 / 16 Hackbright Academy Hackbright Academy is the leading software engineering school for women founded in San Francisco in 2012. The academy graduates more female engineers than UC Berkeley and Stanford each year.
    [Show full text]
  • Magento on HHVM Speeding up Your Webshop with a Drop-In PHP Replacement
    Magento on HHVM Speeding up your webshop with a drop-in PHP replacement. Daniel Sloof [email protected] What is HHVM? ● HipHop Virtual Machine ● Created by engineers at Facebook ● Essentially a reimplementation of PHP ● Originally translated PHP to C++, now translates PHP to bytecode ● Just-in-time compiler, turning generated bytecode into machine code ● In some cases 5 to 10 times faster than regular PHP So what’s the problem? ● HHVM not entirely compatible with PHP ● Magento’s PHP triggering many of these incompatibilities ● Choosing between ○ Forking Magento to work around HHVM ○ Fixing issues within the extensive HHVM C++ codebase Resulted in... fixing HHVM ● Already over 100 commits fixing Magento related HHVM bugs; ○ SimpleXML (majority of bugfixes) ○ sessions ○ number_format ○ __get and __set ○ many more... ● Most of these fixes already merged back into the official (github) repository ● Community Edition running (relatively) stable! Benchmarks Before we go to the results... ● Magento 1.8 with sample data ● Standard Apache2 / php-fpm / MySQL stack (with APC opcode cache). ● Standard HHVM configuration (repo-authoritative mode disabled, JIT enabled) ● Repo-authoritative mode has potential to increase performance by a large margin ● Tool of choice: siege Benchmarks: Response time Average across 50 requests Benchmarks: Transaction rate While increasing siege concurrency until avg. response time ~2 seconds What about <insert caching mechanism here>? ● HHVM does not get in the way ● Dynamic content still needs to be generated ● Replaces PHP - not Varnish, Redis, FPC, Block Cache, etc. ● As long as you are burning CPU cycles (always), you will benefit from HHVM ● Think about speeding up indexing, order placement, routing, etc.
    [Show full text]
  • Automated Program Transformation for Improving Software Quality
    Automated Program Transformation for Improving Software Quality Rijnard van Tonder CMU-ISR-19-101 October 2019 Institute for Software Research School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 Thesis Committee: Claire Le Goues, Chair Christian Kästner Jan Hoffmann Manuel Fähndrich, Facebook, Inc. Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Software Engineering. Copyright 2019 Rijnard van Tonder This work is partially supported under National Science Foundation grant numbers CCF-1750116 and CCF-1563797, and a Facebook Testing and Verification research award. The views and conclusions contained in this document are those of the author and should not be interpreted as representing the official policies, either expressed or implied, of any sponsoring corporation, institution, the U.S. government, or any other entity. Keywords: syntax, transformation, parsers, rewriting, crash bucketing, fuzzing, bug triage, program transformation, automated bug fixing, automated program repair, separation logic, static analysis, program analysis Abstract Software bugs are not going away. Millions of dollars and thousands of developer-hours are spent finding bugs, debugging the root cause, writing a patch, and reviewing fixes. Automated techniques like static analysis and dynamic fuzz testing have a proven track record for cutting costs and improving software quality. More recently, advances in automated program repair have matured and see nascent adoption in industry. Despite the value of these approaches, automated techniques do not come for free: they must approximate, both theoretically and in the interest of practicality. For example, static analyzers suffer false positives, and automatically produced patches may be insufficiently precise to fix a bug.
    [Show full text]
  • Nástroje Pro Sjednocení Datových Zdrojů Projektu Gloffer Tools for Unification of Data Sources Project Gloffer
    VŠB – Technická univerzita Ostrava Fakulta elektrotechniky a informatiky Katedra informatiky Nástroje pro sjednocení datových zdrojů projektu Gloffer Tools for unification of data sources project Gloffer 2018 Bc. Jakub Malchárek Rád bych poděkoval panu Ing. Radoslavu Fasugovi, Ph.D. za odbornou pomoc a konzultaci při zpracování této diplomové práce a cenné rady v průběhu implementace. Abstrakt V této diplomové práci se zabývám analýzou dostupných technologií pro implementaci webo- vého portálu Gloffer. Jsou zde popsány databáze (MySQL, Redis, MongoDB, Aerospike, Apache HBase, Apache Cassandra, Google Bigtable, Memcached), vyhledávače (Solr, Lucene, Elastic Search), webové servery (Apache HTTP server, Apache Tomcat), zprostředkovatelé zpráv (Rab- bit MQ), distribuované výpočetní technologie (Apache Hadoop) a vývojové technologie (PHP 7, Nette Framework, Java, Spring Framework). Cílem je nejen popis těchto technologií, ale také ná- vrh a implementace rozhraní pro sjednocení datových zdrojů projektu Gloffer v programovacím jazyce Java s využitím Spring Frameworku. Výstupem práce je inteligentní nástroj zpřístupňující data z více datových zdrojů. Závěr práce obsahuje výkonové testování vyvinutého nástroje. Klíčová slova: Aerospike, Apache Cassandra, Apache Hadoop, Apache HBase, Apache HTTP server, Apache Tomcat, aplikační rozhraní, datové zdroje, Elastic Search, fulltext, Google Bi- gtable, index, Java, Lucene, Memcached, MongoDB, MySQL, Nette Framework, PHP, Rabbit MQ, Redis, REST, Solr, Spring Framework Abstract In this diploma thesis I deal with analysis of the available technologies for implementation of the Gloffer web portal. There are described databases (MySQL, Redis, MongoDB, Aerospike, Apache HBase, Apache Cassandra, Google Bigtable, Memcached), search engines (Solr, Lucene, Elastic Search), web servers (Apache HTTP server, Apache Tomcat), message brokers (Rabbit MQ), distributed computing technologies (Apache Hadoop) and develop technologies (PHP 7, Nette Framework, Java, Spring Framework).
    [Show full text]
  • Artificial Intelligence for Understanding Large and Complex
    Artificial Intelligence for Understanding Large and Complex Datacenters by Pengfei Zheng Department of Computer Science Duke University Date: Approved: Benjamin C. Lee, Advisor Bruce M. Maggs Jeffrey S. Chase Jun Yang Dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in the Department of Computer Science in the Graduate School of Duke University 2020 Abstract Artificial Intelligence for Understanding Large and Complex Datacenters by Pengfei Zheng Department of Computer Science Duke University Date: Approved: Benjamin C. Lee, Advisor Bruce M. Maggs Jeffrey S. Chase Jun Yang An abstract of a dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in the Department of Computer Science in the Graduate School of Duke University 2020 Copyright © 2020 by Pengfei Zheng All rights reserved except the rights granted by the Creative Commons Attribution-Noncommercial Licence Abstract As the democratization of global-scale web applications and cloud computing, under- standing the performance of a live production datacenter becomes a prerequisite for making strategic decisions related to datacenter design and optimization. Advances in monitoring, tracing, and profiling large, complex systems provide rich datasets and establish a rigorous foundation for performance understanding and reasoning. But the sheer volume and complexity of collected data challenges existing techniques, which rely heavily on human intervention, expert knowledge, and simple statistics. In this dissertation, we address this challenge using artificial intelligence and make the case for two important problems, datacenter performance diagnosis and datacenter workload characterization. The first thrust of this dissertation is the use of statistical causal inference and Bayesian probabilistic model for datacenter straggler diagnosis.
    [Show full text]
  • Facebook Messenger Engineering
    SED 1037 Transcript EPISODE 1037 [INTRODUCTION] [00:00:00] JM: Facebook Messenger is a chat application that millions of people use every day to talk to each other. Over time, Messenger has grown to include group chats, video chats, animations, facial filters, stories and many more features. Messenger is a tool for utility as well as for entertainment. Messengers used on both mobile and desktop, but the size of the mobile application is particularly important. There are many users who are on devices that do not have much storage space. As Messenger has accumulated features, the iOS codebase has grown larger and larger. Several generations of Facebook engineers have rotated through the company with responsibility of working on Facebook Messenger, and that has led to different ways of managing information within the same codebase. The iOS codebase had room for improvement and Project LightSpeed was a project within Facebook that had the goal of making Messenger on iOS much smaller. Mohsen Agsen and is an engineer with Facebook and he joins the show to talk about the process of rewriting the Messenger app. This is a great deep dive into how to rewrite a mission- critical iOS application, and this team became very large at a certain point within Facebook. It's a great story and I hope you enjoy it as well. [SPONSOR MESSAGE] [00:01:27] JM: When I’m building a new product, G2i is the company that I call on to help me find a developer who can build the first version of my product. G2i is a hiring platform run by engineers that matches you with React, React Native, GraphQL and mobile engineers who you can trust.
    [Show full text]
  • Unicorn: a System for Searching the Social Graph
    Unicorn: A System for Searching the Social Graph Michael Curtiss, Iain Becker, Tudor Bosman, Sergey Doroshenko, Lucian Grijincu, Tom Jackson, Sandhya Kunnatur, Soren Lassen, Philip Pronin, Sriram Sankar, Guanghao Shen, Gintaras Woss, Chao Yang, Ning Zhang Facebook, Inc. ABSTRACT rative of the evolution of Unicorn's architecture, as well as Unicorn is an online, in-memory social graph-aware index- documentation for the major features and components of ing system designed to search trillions of edges between tens the system. of billions of users and entities on thousands of commodity To the best of our knowledge, no other online graph re- servers. Unicorn is based on standard concepts in informa- trieval system has ever been built with the scale of Unicorn tion retrieval, but it includes features to promote results in terms of both data volume and query volume. The sys- with good social proximity. It also supports queries that re- tem serves tens of billions of nodes and trillions of edges quire multiple round-trips to leaves in order to retrieve ob- at scale while accounting for per-edge privacy, and it must jects that are more than one edge away from source nodes. also support realtime updates for all edges and nodes while Unicorn is designed to answer billions of queries per day at serving billions of daily queries at low latencies. latencies in the hundreds of milliseconds, and it serves as an This paper includes three main contributions: infrastructural building block for Facebook's Graph Search • We describe how we applied common information re- product. In this paper, we describe the data model and trieval architectural concepts to the domain of the so- query language supported by Unicorn.
    [Show full text]
  • Ting-Yuan Hsia (408) 707-2897 | [email protected]| HPs:// HPs:// Education Santa Clara Univeristy, Santa Clara, CA, USA Sep
    Ting-Yuan Hsia (408) 707-2897 | [email protected]| hps://www.linkedin.com/in/ly2314| hps://www.ly2314.cc Education Santa Clara Univeristy, Santa Clara, CA, USA Sep. 2017 - Jun. 2019 Master of Science in Computer Science and Engineering GPA: 3.63 / 4 • Related Courses: Algorithm, Operating Systems, Data Mining, Cryptology, Computer Networks, Distributed Systems National Taiwan University, Taipei, Taiwan Sep. 2014 - Jun. 2016 Master of Science, Department of Electrical Engineering • Master thesis: “Scheduling-Aware Data Prefetching Based on Spark Framework”. • Related Courses: Machine Learning, Artificial Intelligence, Fault Tolerant Computing, Network and Computer Security National Taiwan University, Taipei, Taiwan Sep. 2010 - Jun. 2014 Bachelor of Science in Engineering, Department of Electrical Engineering • Related Courses: Data Structure and Programming Experience Software Development Engineer Jul. 2019 - Present NetApp, Inc. Sunnyvale, CA, USA • Develop and maintain ONTAP data protection technology including SnapMirror, SnapDiff, Volume Move. Software Engineer Intern Jun. 2018 - Sep. 2018 Facebook, Inc. Menlo Park, CA, USA • Developed a cache service from scratch for an internal system and it reduced page loading time by 60%. • The cache service was implemented in C++ and contains a Thrift interface which can be queried from PHP, C++ and Python clients. • Modified both back-end service and frontend user interface for pagination capability. Software Engineer Jan. 2013 - Jul. 2016 Zuvio Inc. Taipei, Taiwan • Developed and maintained client-side products including PowerPoint Add-ins and desktop applications from scratch using C#, XAML, WPF and VSTO. Teaching Assistant Feb. 2016 - Jul. 2016 National Taiwan University, Department of Electrical Engineering Taipei, Taiwan • Graded and assisted students in EE 4052, Computer Programming.
    [Show full text]
  • Dmon: Efficient Detection and Correction of Data Locality
    DMon: Efficient Detection and Correction of Data Locality Problems Using Selective Profiling Tanvir Ahmed Khan and Ian Neal, University of Michigan; Gilles Pokam, Intel Corporation; Barzan Mozafari and Baris Kasikci, University of Michigan https://www.usenix.org/conference/osdi21/presentation/khan This paper is included in the Proceedings of the 15th USENIX Symposium on Operating Systems Design and Implementation. July 14–16, 2021 978-1-939133-22-9 Open access to the Proceedings of the 15th USENIX Symposium on Operating Systems Design and Implementation is sponsored by USENIX. DMon: Efficient Detection and Correction of Data Locality Problems Using Selective Profiling Tanvir Ahmed Khan Ian Neal Gilles Pokam Barzan Mozafari University of Michigan University of Michigan Intel Corporation University of Michigan Baris Kasikci University of Michigan Abstract cally at run time. In fact, as we (§6.2) and others [2,15,20,27] Poor data locality hurts an application’s performance. While demonstrate, compiler-based techniques can sometimes even compiler-based techniques have been proposed to improve hurt performance when the assumptions made by those heuris- data locality, they depend on heuristics, which can sometimes tics do not hold in practice. hurt performance. Therefore, developers typically find data To overcome the limitations of static optimizations, the locality issues via dynamic profiling and repair them manually. systems community has invested substantial effort in devel- Alas, existing profiling techniques incur high overhead when oping dynamic profiling tools [28,38, 57,97, 102]. Dynamic used to identify data locality problems and cannot be deployed profilers are capable of gathering detailed and more accurate in production, where programs may exhibit previously-unseen execution information, which a developer can use to identify performance problems.
    [Show full text]
  • Places to Ride in the Northwest 8Places to Ride in the Northwest
    PlacesPlaces toto RideRide 88 Chris Gilbert inin thethe NorthwestNorthwest Photo Christian Pondella HOW December 2004 TO Launch from a Boat 12 Plus: Florida Hurricanes, USA $5.95 Oregon Snowkiting & Exploring Mauritius 0 7447004392 8 2 3 On a whole other level. Guillaume Chastagnol. Photo Bertrand Boone Contents December 2004 Features 38 Northern Exposure Brian Wheeler takes us to eight of his favorite places to ride in the Northwest. 48 Exposed A photo essay of the kiteboarding lifestyle. 46 The Legend of Jim Bones Adam Koch explores the life of veteran waterman Jim Bones. 58 Journey into the Indian Ocean: The Island of Mauritius Felix Pivec, Julian Sudrat and José Luengo travel to the island just off Africa. DepartmentsDepartments 14 Launch Ten of the world’s best riders get together in Cape Hatteras to build the world’s biggest kiteboarding rail. 34 Close-up Bertrand Fleury and Bri Chmel 70 Analyze This Up close and personal with some of the latestlatest gear.gear. 72 Academy 10 Skim Board Tips to Help you Rip Cover Shot Tweak McCore Chris Gilbert launches off the USS Lexington in Corpus Christie, Texas. 81 Tweak McCore Photo Christian Pondella Contents Shot California’s C-street local Corky Cullen stretching out a Japan air. Photo Jason Wolcott Photo Tracy Kraft Double Check My phone rang the other day and it was my best friend telling me the wind was cranking at our local spot. Running around like a chicken with its head cut off, I threw my 15-meter kite and gear into the truck and made the quick rush down to the beach through 30 minutes of traffic.
    [Show full text]
  • PHP Optimization Using Hip Hop Virtual Machine Chaitali Tambe, Pramod Pawar, Dashrath Mane Vivekanand Education Society Institute of Technology, Chembur
    International Journal of Advanced Research in Computer Engineering & Technology (IJARCET) Volume 4 Issue 6, June 2015 PHP Optimization Using Hip Hop Virtual Machine Chaitali Tambe, Pramod Pawar, Dashrath Mane Vivekanand education society institute of technology, Chembur Abstract— HipHop compiler is PHP based compiler created facebook.com. PHP applications that were developed by facebook in order to optimize the php code and save using HipHop terminology resulted in increased speed of resources on the facebook server. HPHPc translates the php application. Several drawbacks of standalone php code into executable c++ code. Later facebook realized that applications were eliminated by using HPHPc, one of HPHPc had some snags which included resource consumption and parallel maintenance of HPHP and which was performance. HPHPi. In order to overcome the drawbacks of HPHPc A. Limitation of HPHPc: HipHop virtual machine was developed in 2011 which is a process virtual machine based on just-in-time (JIT) HPHPc did not fully support the PHP language, compilation, serving as an execution engine for PHP and including the create_function() and eval() Hack programming languages. HHVM provides complete constructs. support for the entire PHP language. This paper shows how HHVM is superior to other compilers like PHP, PHP 7 It involved a specific time and resource consuming and how various framework uses HHVM to optimize deployment process that required a bigger than php. In addition the lock-down approach shows the 1 GB binary to be compiled and distributed to behavior of each framework with hhvm and show how many servers in short orders. performance optimization can be obtained for heavy In addition, maintaining HPHPc and HPHPi in websites.
    [Show full text]
  • HHVM @Richardtape
    HHVM @richardtape “It was a high-risk, high-reward bet. We now operate at such an enormous scale, we have to take enormous risks in order to survive” Jay Parikh, Facebook engineer $ HipHop for PHP (HPHPc) • A PHP transpiler (a PHP whatnow?) • Transpiles/Translates PHP into C++ • Then compiled into a binary • Then run as an executable • Regularly increased the speed of PHP Applications by 6 times Wait. Binary? Executable? What? • Caveat: IANAG (it’s a bit like I am not a lawyer) • Normal PHP • <?php your_code(); ?> -> opcodes -> interpreted (i.e. non-compiled, slow) • HPHPc • your_code(); -> Transpiled (fast!) into C++ -> binary -> executed YOU SAID COMPILE!! A new challenger approaches Hip Hop Virtual Machine Seriously. That’s actually what HHVM stands for. HHVM is a “process virtual machine” using just-in-time compilation YOU SAID COMPILE!! Don’t panic! • The ‘just-in-time’ before the word-we- no-longer say is key • It means you don’t have to do it yourself • And you just write your PHP as you normally would Process Virtual Machine? AKA an Application Virtual Machine. (Oh that’s much better.) Or a Managed Runtime Environment (Who makes these things up?) In real words it means that your code is completely abstracted away from the underlying platform which in turn means the same code will give the same results, regardless of platform. Hip Hop Byte Code I promise you I’m not just making up words. Again, that’s actually it’s name. PHP (and ‘Hack’) are converted into Hip Hop Byte Code (HHBC) which is then converted into machine code and then executed.
    [Show full text]