Oct 16, 2019 walter bright is the creator and first implementer of the d programming language and has implemented compilers for several other languages. Aug 18, 2010 part 2 of this interview about the d programming language finds eric niebler and andrei alexandrescu deep in discussion about structs versus classes, the difficulties of copy semantics, rvalue references, the intricacies of garbage collection, and andrei s occasional failure in serving as the standardbearer for policybased design. Interview with andrei alexandrescu part 2 of 3 informit. Andrei s upcoming book and focus of this talk will be on optimization techniques rooted in perennial truths and trends of siliconbased computing. Genericandrei and dave take a break from the smart pointers reloaded miniseries and discuss how to analyze the exception safety of functions. Andrei holds a phd in computer science from the university of washington and a bs in. If one or more works are by a distinct, homonymous authors, go ahead and split the author. A alexandrescu, hj boehm, k henney, b hutchings, d lea, b pugh. A read is counted each time someone views a publication summary such as the title, abstract, and list of authors, clicks on a figure, or views or downloads the fulltext. He is an expert in all areas of compiler technology, including front ends, optimizers, code generation, interpreter engines and runtime libraries.
The optimization software will deliver input values in a, the software module realizing f will deliver the computed value f x and, in some cases, additional. Part 2 of this interview about the d programming language finds eric niebler and andrei alexandrescu deep in discussion about structs versus classes, the difficulties of copy semantics, rvalue references, the intricacies of garbage collection, and andreis occasional failure in serving as the standardbearer for policybased design. Romanianborn computer scientist andrei alexandrescu is an expert in a broad range of topics including software systems design and implementation. Publication date 20121204 usage attributionno derivative works 3. An optimization guide for windows, linux and mac platforms. Andrei alexandrescu s amazing 150 minutes course on optimization part 2 in comments close.
Andrei holds a phd in computer science from the university of washington and a bsc in electrical engineering from university politehnica bucharest. It is based on andreis careerlong experience with tuning performance of various software. Boost libraries are intended to be widely useful, and usable across a broad spectrum of applications. Alexandrescu, meyers, and sutter ask us anything 58.
Know when and how to code for scalability summary beware of explosive data growth. View andrei alexandrescus profile on linkedin, the worlds largest professional community. You can find a free pdf of that book with an internet search. For me one very interesting point came up on slide 7 where he states that the assumption fewer instructions faster code is not true and more instructions will not necessarily mean slower code here comes my problem. Without optimizing prematurely, keep an eye on asymptotic complexity. Im not a d developer, just someone whos interested in the language. Andrei alexandrescu are 3 joburi enumerate in profilul sau. If you want to see how truly bizarre this can get, check out andrei alexandrescu s talk from cppcon this past year. Buse r and weimer w a metric for software readability proceedings of the 2008 international symposium on software testing and analysis, 121 li x and prasad c effectively teaching coding standards in programming proceedings of the 6th conference on information technology education, 239244. Andrei alexandrescus amazing 150 minutes course on.
Oct 26, 2009 wikipedia double checked locking optimization. Variadic templates are funadic by andrei alexandrescu. Vizualizati profilul andrei alexandrescu pe linkedin, cea mai mare comunitate profesionala din lume. The most recent time this happened was about six months ago. Im curious how this will affect the d standard library since it seems that its heavily based on generic programming. Browse the list of issues and latest articles from optimization methods and software. For me one very interesting point came up on slide 7 where he states that the assumption fewer instructions faster code is not true and more instructions will not necessarily mean slower code. His interest lies primarily in computer graphics, software optimization, concurrency, security and agile methodologies. In fact, if you are already using one of these solvers with their standard algebraic, try with analytica for a more visual and flexible way to define and run optimization problems. Debug print in variadic template style codeproject. It uses a dense and somewhat obsolete jargon defined elsewhere in the book, that can be a little hard to read.
To some extent, optimization is to our industry what sexual intercourse is to teenagers. Andrei alexandrescus amazing 150 minutes course on optimization part 2 in comments close. Sep 23, 2016 it is notable for providing languageindependent descriptions of designtime optimization techniques. This talk will explore the move fast side of facebooks software engineering culture.
Andrei alexandrescu joined the design and development effort in 2007. This cited by count includes citations to the following articles in scholar. How to start with software optimization, from flexible particle experiments series. Can someone post a link to the video where andrei falls off the stage. Andrei alexandrescu wikimili, the free encyclopedia.
For your friday viewing pleasure, from the alwaysengaging master, andrei alexandrescu. Oct 16, 2014 andrei holds a phd in computer science from the university of washington and a bsc in electrical engineering from university politehnica bucharest. Generic programming and design patterns applied is a book written by andrei alexandrescu, published in 2001 by addisonwesley. Andrei alexandrescu java software developer siveco. Andrei alexandrescu a fost consultant pe wall street. Andreis upcoming book and focus of this talk will be on optimization techniques rooted in perennial truths and trends of siliconbased computing. Andrei alexandrescu is a researcher, software engineer, and author. The doublechecked locking optimization pattern dclp is clarified in a multithreaded environment in combination with the singleton pattern gof and the volatile keyword. I saw your presentation generic programming must go from dconf. Andrei alexandrescu is currently considered a single author. While alexandrescu didnt invent the technique, he has popularized it among. Each item explained with title, summary, discussion, example and reference.
Compiler optimizations produce code that violates common assumptions about data structure performance all the time. He also implemented the move constructors concept in his mojo library. This class introduces attendees to a thorough approach to optimization. The use of optimization software requires that the function f is defined in a suitable programming language and connected at compile or run time to the optimization software. Join facebook to connect with andrei alexandrescu and others you may know. Research scientist, facebook slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. Unification of text and binary file apis by the author.
Given how good voice recognition software is these days, i wish there was an app. Volume 35 2020 volume 34 2019 volume 33 2018 volume 32 2017 volume 31 2016 volume 30 2015 volume 29 2014 volume 28 20 volume 27 2012 volume 26 2011 volume 25 2010. Apr 28, 2017 to some extent, optimization is to our industry what sexual intercourse is to teenagers. Andrei alexandrescu radio frequency planning optimization.
Andrei alexandrescu phd university of connecticut, ct. He is particularly known for his pioneering work on policybased design implemented via template metaprogramming. Andrei alexandrescus amazing 150 minutes course on optimization part 2 in comments. Generic programming holds great promise ultimate reuse, unprecedented flexibility, and never a need to reimplement an algorithm from scratch due to abstraction penalties. In his talk a few days ago at facebook slides, video, andrei alexandrescu talks about common intuitions that might prove us wrong.
1151 448 810 417 1241 521 505 727 1538 1253 449 776 971 860 267 681 721 939 921 68 1266 592 1300 1029 1116 126 957 84 1068 240 86 751 1437 321 468 1292 1440 135 1075 714 247 503 990 408