May 2020 - Gambit-list - mailman.iro.umontreal.ca

Gambit versus Python+GMP: Timing for Chudnovskys' algorithm for pi
by Bradley Lucier 08 Apr '22

08 Apr '22

Bakul Shah wrote a particularly elegant Scheme program for Chudnovskys' algorithm for pi based on the Common Lisp program here: https://bitbucket.org/tarballs_are_good/numericl/src/5fe8fe7089f48ab1c8a388… Nick Craig-Wood wrote a Python program using the GMP multiprecision library that appears to use exactly the same algorithm here: http://www.craig-wood.com/nick/articles/pi-chudnovsky/ I modified both programs a bit and include them here. They time the calculation of $10^n$ digits of pi for $n=1,2,3,4,5,6,7$. The results are heine:~/programs/gambiteer/gambit> !py python pi_chudnovsky_bs_gmpy.py 31415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679 ('chudnovsky_gmpy_mpz_bs: digits', 10, 'time', 1.0967254638671875e-05) ('chudnovsky_gmpy_mpz_bs: digits', 100, 'time', 3.0040740966796875e-05) Last 5 digits 70679 OK ('chudnovsky_gmpy_mpz_bs: digits', 1000, 'time', 0.00025582313537597656) Last 5 digits 01989 OK ('chudnovsky_gmpy_mpz_bs: digits', 10000, 'time', 0.00386810302734375) Last 5 digits 75678 OK ('chudnovsky_gmpy_mpz_bs: digits', 100000, 'time', 0.0834801197052002) Last 5 digits 24646 OK ('chudnovsky_gmpy_mpz_bs: digits', 1000000, 'time', 1.655979871749878) Last 5 digits 58151 OK ('chudnovsky_gmpy_mpz_bs: digits', 10000000, 'time', 30.67442488670349) Last 5 digits 55897 OK heine:~/programs/gambiteer/gambit> gsi chud1.scm Chudnovsky's algorithm using binary splitting in Gambit Scheme: digits 10, CPU time: 0.. Last 5 digits 26535. Chudnovsky's algorithm using binary splitting in Gambit Scheme: digits 100, CPU time: 0.. Last 5 digits 70679. Chudnovsky's algorithm using binary splitting in Gambit Scheme: digits 1000, CPU time: .004. Last 5 digits 1989. Chudnovsky's algorithm using binary splitting in Gambit Scheme: digits 10000, CPU time: .028. Last 5 digits 75678. Chudnovsky's algorithm using binary splitting in Gambit Scheme: digits 100000, CPU time: .472. Last 5 digits 24646. Chudnovsky's algorithm using binary splitting in Gambit Scheme: digits 1000000, CPU time: 6.448. Last 5 digits 58151. Chudnovsky's algorithm using binary splitting in Gambit Scheme: digits 10000000, CPU time: 98.612. Last 5 digits 55897. So it appears that for this algorithm applied to large integers, GMP's bignum routines are about 3-4 times as fast as Gambit's bignum routines. Not so bad. For smaller bignums, GMP has a bigger advantage. The C program gmp-chudnovsky.c includes certain optimizations to this basic algorithm: http://gmplib.org/pi-with-gmp.html ftp://ftp.gmplib.org/pub/misc/gmp-chudnovsky.c On my machine, compiled with gcc -O3 -march=native -o gmp-chudnovsky gmp-chudnovsky.c -lgmp -lm the CPU times for 1,000,000 and 10,000,000 digits are 1.064 and 18.200 seconds, respectively. This is with a somewhat older machine model name : Intel(R) Core(TM)2 Quad CPU Q8200 @ 2.33GHz running Ubuntu 13.04 with heine:~/programs/gambiteer/gambit> gcc -v Using built-in specs. COLLECT_GCC=gcc COLLECT_LTO_WRAPPER=/usr/lib/gcc/x86_64-linux-gnu/4.7/lto-wrapper Target: x86_64-linux-gnu Configured with: ../src/configure -v --with-pkgversion='Ubuntu/Linaro 4.7.3-1ubuntu1' --with-bugurl=file:///usr/share/doc/gcc-4.7/README.Bugs --enable-languages=c,c++,go,fortran,objc,obj-c++ --prefix=/usr --program-suffix=-4.7 --enable-shared --enable-linker-build-id --libexecdir=/usr/lib --without-included-gettext --enable-threads=posix --with-gxx-include-dir=/usr/include/c++/4.7 --libdir=/usr/lib --enable-nls --with-sysroot=/ --enable-clocale=gnu --enable-libstdcxx-debug --enable-libstdcxx-time=yes --enable-gnu-unique-object --enable-plugin --with-system-zlib --enable-objc-gc --with-cloog --enable-cloog-backend=ppl --disable-cloog-version-check --disable-ppl-version-check --enable-multiarch --disable-werror --with-arch-32=i686 --with-abi=m64 --with-multilib-list=m32,m64,mx32 --with-tune=generic --enable-checking=release --build=x86_64-linux-gnu --host=x86_64-linux-gnu --target=x86_64-linux-gnu Thread model: posix gcc version 4.7.3 (Ubuntu/Linaro 4.7.3-1ubuntu1) heine:~/programs/gambiteer/gambit> gsi -v v4.6.9 20130607151908 x86_64-unknown-linux-gnu "./configure '--enable-single-host' '--enable-multiple-versions' '--enable-shared'" and the Ubuntu-provided GMP 5.0.5. (I'm sure the GMP folks have a better way to build GMP on my machine than the "generic" 64-bit version provided by Ubuntu.) Brad

7 18

Comparing a 2020 iPhone SE to a 7-year-old Linux box
by Bradley Lucier 24 May '20

24 May '20

The Linux box is running Ubuntu 18.04 with model name : Intel(R) Core(TM) i7-4770 CPU @ 3.40GHz and Gambit was compiled with v4.9.3-1111-g05060cf0 20200521224855 x86_64-pc-linux-gnu "./configure 'CC=/usr/local/gcc-10.1.0/bin/gcc -march=native -D___CAN_IMPORT_CLIB_DYNAMICALLY' '--enable-strict-aliasing' '--enable-single-host' '--enable-shared' '--enable-multiple-versions'" The iPhone SE is running the Gambit REPL app, based on Gambit 4.7.4. The comparison is very simple, I run gsi -e '(define a (time (expt 3 100000000)))(pp (time (integer-length (* a a))))' (time (expt 3 100000000)) 2.663234 secs real time 2.633248 secs cpu time (2.434250 user, 0.198998 system) 8 collections accounting for 0.020154 secs real time (0.006686 user, 0.012848 system) 1210688 bytes allocated 272088 minor faults no major faults (time (integer-length (* a a))) 2.877121 secs real time 2.869723 secs cpu time (2.665860 user, 0.203863 system) 1 collection accounting for 0.019379 secs real time (0.000000 user, 0.018940 system) 85536 bytes allocated 272140 minor faults no major faults 316992501 on the Linux box, the times on the iPhone SE are 2.759 seconds for the first computation and 2.990 seconds for the second. If I look at an older build of Gambit on the Linux box, with v4.9.1 20180930122740 x86_64-unknown-linux-gnu "./configure 'CC=gcc -march=native -D___CAN_IMPORT_CLIB_DYNAMICALLY' '--enable-single-host' '--enable-shared' '--enable-multiple-versions'" i.e., with an older compiler and without --enable-strict-aliasing, then I see gsi -e '(define a (time (expt 3 100000000)))(pp (time (integer-length (* a a))))' (time (expt 3 100000000)) 3.328249 secs real time 3.327808 secs cpu time (3.103869 user, 0.223939 system) 8 collections accounting for 0.019851 secs real time (0.004052 user, 0.015809 system) 1213248 bytes allocated 272088 minor faults no major faults (time (integer-length (* a a))) 3.572195 secs real time 3.571591 secs cpu time (3.335618 user, 0.235973 system) 1 collection accounting for 0.020848 secs real time (0.000757 user, 0.020061 system) 85536 bytes allocated 272140 minor faults no major faults 316992501 i.e., the iPhone is undeniably faster. I heard a rumor that Apple will start shipping Arm-based Macbook laptops with CPUs of its own design, maybe not the Macbook Pros, just the Macbook Airs. That certainly doesn't look unreasonable. Brad

2 1

[CfP] DLS 2020 - Dynamic Languages Symposium, submission deadline July 9th
by Matthew Flatt 18 May '20

18 May '20

The 16th Dynamic Languages Symposium (DLS) at SPLASH 2020 is the premier forum for researchers and practitioners to share research and experience on all aspects on dynamic languages. DLS 2020 invites high quality papers reporting original research and experience related to the design, implementation, and applications of dynamic languages. Areas of interest include, but are not limited to, - innovative language features - innovative implementation techniques - innovative applications - development environments and tools - experience reports and case studies - domain-oriented programming - late binding, dynamic composition, and run-time adaptation - reflection and metaprogramming - software evolution - language symbiosis and multi-paradigm languages - dynamic optimization - interpretation - just-in-time and ahead-of-time compilation - soft/optional/gradual typing - hardware support - educational approaches and perspectives - semantics of dynamic languages - frameworks and languages for the Cloud and the IoT Submission Details ------------------ Submissions must neither be previously published nor under review at other events. DLS 2020 uses a lightweight double-blind, two-phase reviewing process. Papers are assumed to be in one of the following categories: **Research Papers:** describe work that advances the current state of the art **Experience Papers:** describe insights gained from substantive practical applications that should be of a broad interest **Dynamic Pearls:** describe a known idea in an appealing way to remind the community and capture a reader’s interest The program committee will evaluate each paper based on its relevance, significance, clarity, and originality. The paper category needs to be indicated during submission, and papers are judged accordingly. Papers are to be [submitted electronically](https://dls20.hotcrp.com/) in PDF format. Submissions must be in the ACM SIGPLAN conference acmart format, 10 point font, and should not exceed 12 pages. Please see full details in the instructions for authors available at: https://conf.researchr.org/home/dls-2020#Instructions-for-Authors DLS 2020 will run a two-phase reviewing process to help authors make their final papers the best that they can be. Accepted papers will be published in the ACM Digital Library and will be freely available for one month, starting two weeks before the event. ## Important Deadlines Abstract Submission (optional): July 2, 2020 Paper Submission: July 9, 2020 First Phase Notification: August 7, 2020 Revisions Due: September 4, 2020 Final Notifications: Septemberr 18, 2020 All deadlines are 23:59 AoE (UTC-12h). **AUTHORS TAKE NOTE:** The official publication date is the date the proceedings are made available in the ACM Digital Library. This date may be up to two weeks prior to the first day of your conference. The official publication date affects the deadline for any patent filings related to published work. Program Committee ----------------- Alexandre Bergel, U Chile Shigeru Chiba, U Tokyo Stéphane Ducasse, Inria Tim Felgentreff, HPI Matthew Flatt, U Utah (chair) Elisa Gonzalez Boix, VUB Michael Homer, Victoria U Wellington Mark Marron, Microsoft Research Anders Møller, Aarhus Manuel Rigger, ETH Sukyoung Ryu, KAIST Jeremy G. Siek, Indiana U Francesco Zappa Nardelli, Facebook

1 0

newbie: bitwise and arithmetic runtime speed for u64
by Paolo Montrasi 17 May '20

17 May '20

Hi all, As a learning exercise, I am experimenting in chess/alpha-beta search/bitboards. In this domain lot of bitwise operations are required. My goal is to keep learning scheme and Gambit, therefore I will be happy to stay with what I have right now if the only option is to switch to C et similia. I am asking here for an advice in improving runtime speed crunching bitwise operations on u64 integers since I have no experience using scheme and Gambit. Looking at the documentation I see that fixnum is providing some help but I apparently u64 integers are not "compatible" with fixnum operations > (fixnum? 18446744073709551615) #f Can you share suggestions for my next exercise? Thank you in advance Paolo

6 9

Gerbil v0.16 is out!
by Dimitris Vyzovitis 17 May '20

17 May '20

Hi all, I am happy to announce the release of Gerbil v0.16. Release Highlights: - R7RS Tangerine, Polydactyl Gerbil, Class Sealing and more. - Overhauled std/make library and parallelized builds. - Configure and install scripts. - Overhauled documentation, with a beautiful new logo! - A new Gitter chat room at https://gitter.im/gerbil-scheme/community As usual, for sources and downloads: https://github.com/vyzo/gerbil https://github.com/vyzo/gerbil/releases Full release changelog: https://github.com/vyzo/gerbil/blob/master/CHANGELOG.md For questions and support, come say hi on Gitter or irc at #gerbil-scheme in irc.freenode.net. Happy Hacking! -- vyzo

1 0

[CfP] 2nd Call - 2020 Scheme and Functional Programming Workshop
by Jason Hemann 17 May '20

17 May '20

Hello, Thank you for your attention, and my apologies for any duplication you receive. Please find below the Call for Papers for the *2020 Scheme and Functional Programming Workshop*. The deadline has been extended to *May 31*. Please also note that the workshop is now to be held *virtual*ly; hopefully the silver lining is more and wider participation. We look forward to your submissions. *Call for Papers*The 2020 Scheme and Functional Programming Workshop is calling for submissions. We invite high-quality papers about novel research results, lessons learned from practical experience in industrial or educational setting, and even new insights on old ideas. We welcome and encourage submissions that apply to any language that can be considered Scheme: from strict subsets of RnRS to other “Scheme” implementations, to Racket, to Lisp dialects including Clojure, Emacs Lisp, Common Lisp, to functional languages with continuations and/or macros (or extended to have them) such as Dylan, ECMAScript, Hop, Lua, Scala, Rust, etc. The elegance of the paper and the relevance of its topic to the interests of Schemers will matter more than the surface syntax of the examples used. Topics of interest include (but are not limited to): Interaction: program-development environments, debugging, testing, refactoring Implementation: interpreters, compilers, tools, garbage collectors, benchmarks Extension: macros, hygiene, domain-specific languages, reflection, and how such extension affects interaction. Expression: control, modularity, ad hoc and parametric polymorphism, types, aspects, ownership models, concurrency, distribution, parallelism, non-determinism, probabilism, and other programming paradigms Integration: build tools, deployment, interoperation with other languages and systems Formal semantics: Theory, analyses and transformations, partial evaluation Human Factors: Past, present and future history, evolution and sociology of the language Scheme, its standard and its dialects Education: approaches, experiences, curricula Applications: industrial uses of Scheme Scheme pearls: elegant, instructive uses of Scheme *Important dates*Submission deadline is 31 May 2020. Authors will be notified by 12 June 2020. Camera-ready versions are due 30 June 2020. All deadlines are (23:59 UTC-12), “Anywhere on Earth”. Submission Information Paper submissions must use the format acmart and its sub-format acmlarge. They must be in PDF, printable in black and white on US Letter size. Microsoft Word and LaTeX templates for this format are available at: http://www.sigplan.org/Resources/Author/ <https://jason-hemann-dot-yamm-track.appspot.com/Redirect?ukey=1hySDOusaj9Sw…> This format is in line with ACM conferences (such as ICFP with which we are colocated). It is recommended to use the review option when submitting a paper; this option enables line numbers for easy reference in reviews. We want to encourage all kinds of submissions, including full papers, experience reports and lightning talks. Papers and experience reports are limited to 14 pages, but we encourage submitting smaller papers. Lightning talks are limited to 192 words. Each accepted paper and report will be presented by its authors in a 25 minute slot including Q&A. Each accepted lightning talk will be presented by its authors in a 5 minute slot, followed by 5 minutes of Q&A. The size limits above exclude references and any optional appendices. There are no size limits on appendices, but the papers should stand without the need to read them, and reviewers are not required to read them. Authors are encouraged to publish any code associated to their papers under an open source license, so that reviewers may try the code and verify the claims. Proceedings will be printed as a Technical Report at the University of Michigan and uploaded to arXiv.org <https://jason-hemann-dot-yamm-track.appspot.com/Redirect?ukey=1hySDOusaj9Sw…> . Publication of a paper at this workshop is not intended to replace conference or journal publication, and does not preclude re-publication of a more complete or finished version of the paper at some later conference or in a journal. Sincerely, Jason Hemann, Northeastern University *Organizing Committee*Michael D. Adams (Program Co-Chair), University of Michigan Baptiste Saleil (Program Co-Chair), IBM Canada Jason Hemann (Publicity Chair), Northeastern University *Program Committee*Michael D. Adams (Program Co-Chair), University of Michigan Baptiste Saleil (Program Co-Chair), IBM Canada Maxime Chevalier-Boisvert, Université de Montréal Ryan Culpepper, Czech Technical University Kimball Germane, University of Utah Yukiyoshi Kameyama, University of Tsukuba Andy Keep, Cisco Systems, Inc Julien Pagès, Université de Montréal Alexey Radul *Steering Committee*Will Byrd, University of Alabama at Birmingham Will Clinger, The Larceny Project Marc Feeley, Université de Montréal Dan Friedman, Indiana University Olin Shivers, Northeastern University [image: beacon]

1 0

CFP: GPCE 2020 − 19th International Conference on Generative Programming: Concepts & Experiences
by Erwan BOUSSE 13 May '20

13 May '20

----------------------------------------------------------------------- GPCE 2020: 19th International Conference on Generative Programming: Concepts & Experiences November 16-17, 2020 Chicago, IL (USA) (a part of the SPLASH series of conferences) https://conf.researchr.org/home/gpce-2020 ----------------------------------------------------------------------- --------------------------- CALL FOR PAPERS --------------------------- The ACM SIGPLAN International Conference on Generative Programming: Concepts & Experiences is a programming languages conference focusing on techniques and tools for code generation, language implementation, and product-line development. GPCE seeks conceptual, theoretical, empirical, and technical contributions to its topics of interest, which include but are not limited to: program transformation, staging, macro systems, preprocessors, program synthesis, and code-recommendation systems, domain-specific languages, language embedding, language design, and language workbenches, feature-oriented programming, domain engineering, and feature interactions, applications and properties of code generation, language implementation, and product-line development. Authors are welcome to check with the PC chair whether their planned papers are in scope. --------------------------- IMPORTANT DATES --------------------------- - Abstract submission: July 20, 2020 (Monday), AoE - Paper submission: July 27, 2020 (Monday), AoE - Author notification: September 9, 2020 (Wednesday) - Conference: November 16-17, 2020 --------------------------- PAPER SELECTION --------------------------- The GPCE program committee will evaluate each submission according to the following selection criteria: - Novelty. Papers must present new ideas or evidence and place them appropriately within the context established by previous research in the field. - Significance. The results in the paper must have the potential to add to the state of the art or practice in significant ways. - Evidence. The paper must present evidence supporting its claims. Examples of evidence include formalizations and proofs, implemented systems, experimental results, statistical analyses, and case studies. - Clarity. The paper must present its contributions and results clearly. --------------------------- PAPER CATEGORIES --------------------------- GPCE solicits three kinds of submissions: - Full Papers reporting original and unpublished results of research that contribute to scientific knowledge in any GPCE topic listed above. Full paper submissions must not exceed 12 pages excluding bibliography. - Short Papers presenting unconventional ideas or visions about any GPCE topic listed above. Short papers do not always require complete results as in the case of a full paper. In this way, authors can introduce new ideas to the community and get early feedback. Please note that short papers are not intended to be position statements. Short papers are included in the proceedings and will be presented at the conference. Short paper submissions must not exceed 6 pages excluding bibliography. Short papers must have the text “(Short Paper)” appended to their title, though any papers of 6 or fewer pages that are not tool demonstration papers will be considered as short papers. - Tool Demonstrations presenting tools for any GPCE topic listed above. Tools must be available for use and must not be purely commercial. Submissions must provide a tool description not exceeding 6 pages excluding bibliography and a separate demonstration outline including screenshots also not exceeding 6 pages. Tool demonstrations must have the keywords “Tool Demo” or “Tool Demonstration” appended in their title. If the submission is accepted, the tool description will be published in the proceedings. The demonstration outline will only be used by the program committee for evaluating the submission. --------------------------- PAPER SUBMISSION --------------------------- All submissions must use the ACM SIGPLAN Conference Format “acmart” (http://sigplan.org/Resources/Author/#acmart-format) Please be sure to use the latest LaTeX templates and class files. the SIGPLAN sub-format, and 10 point font. Consult the sample-sigplan.tex template and use the document-class \documentclass[sigplan,anonymous,review]{acmart}. Please do not make any changes to this format! To increase fairness in reviewing, a double-blind review process has become standard across SIGPLAN conferences. GPCE will follow a very lightweight model, where author identities are revealed to reviewers after submitting their initial reviews. Hence, the purpose is not to conceal author identities at all cost, but merely to provide reviewers with an unbiased first look at a submission. Author names and institutions should be omitted from submitted papers, and references to the authors’ own related work should be in the third person. No other changes are necessary, and authors will not be penalized if reviewers are able to infer their identities in implicit ways. Papers must be submitted using HotCRP: https://gpce2020.hotcrp.com/ The official publication date is the date the proceedings are made available in the ACM Digital Library. Papers must describe work not currently submitted for publication elsewhere as described by the SIGPLAN Republication Policy (http://www.sigplan.org/Resources/Policies/Republication/) --------------------------- ORGANIZATION --------------------------- - Steering Committee Chair: Ulrik Pagh Schultz (Denmark) - General Chair: Martin Erwig (USA) - Program Chair: Jeff Gray (USA) - Publicity Chair: Erwan Bousse (France) For additional information, clarification, or answers to questions please contact the program chair at gray(a)cs.ua.edu --------------------------- PROGRAM COMMITTEE --------------------------- - Juliana Alves Pereira (Brazil) - Ira Baxter (USA) - Don Batory (USA) - Sandrine Blazy (France) - Sheng Chen (USA) - Shigeru Chiba (Japan) - Thomas Degueule (France) - Robert Glück (Denmark) - Aniruddha Gokhale (USA) - Elisa Gonzalez Boix (Belgium) - Julia Lawall (France) - Geoffrey Mainland (USA) - Marjan Mernik (Slovenia) - Bruno Oliveira (Hong Kong) - Alex Potanin (New Zealand) - Suman Roychoudhury (India) - Christoph Seidl (Denmark) - Michel Steuwer (UK) - Eli Tilevich (USA) - Naoyasu Ubayashi (Japan) - Tijs van der Storm (Netherlands) - Vadim Zaytsev (Netherlands)

1 0

callbacks and threads -- can we deduce the root cause from this cure
by Jörg F. Wittenberger 06 May '20

06 May '20

Hi all, these days spent endless hours trying to pin down the root cause of all sorts of breakage I encountered. I'm afraid the manual section 19.7 hints somewhat towards it. How is the threading system actually implemented in gambit? Would a thread switch within a C-to-Scheme call originating from a Scheme-to-C count as an escape using first-clall continuations? If so, how would I best protect against this? (Note: I'd like to _not_ loose the ability to call interpreted code from these callbacks.) In my situation there are two third party C-libraries both calling back that way. Once one of them needs a mutex the other one holds the hell breaks loose. Attached some code declaring a c-safe-lambda macro, which takes a supposed-to-gambit-global lock and a replacement for thread-start! to be used from within those callbacks. (This will delay the actual start of the thread until the c-safe-lambda has returned to Scheme.) This appears to cure the issue. So far at least. But I'm afraid it might be a red herring and just mitigate the effect for the hell to come back under more load. To my surprise even starting a new thread from within such a callback appears to still beg for trouble. Even after being sure that there are no overlapping callbacks. I interpret this as a sign that the root cause might be something else. Thanks for your comments. /Jörg

1 0

ICFP 2020 will be held ONLINE Aug 23-28
by Sam Tobin-Hochstadt 01 May '20

01 May '20

The ICFP 2020 organizers would like to announce that the conference and co-located events, originally scheduled for August 23-28, in Jersey City, New Jersey, will now be held online during the same dates. Further information for presenters, authors, attendees, sponsors, and the ICFP community will be provided as it becomes available. The ICFP Organizing Committee

1 0