by Santosh Nagarakatte and Jay Lim on Apr 28, 2022 | Tags: awards, correct math libraries, optimization, runtimes
To create a single polynomial approximation that produces correct results for multiple representations and rounding modes, we propose to generate a polynomial that generates the correctly rounded result of f(x) using the non-standard round-to-odd rounding mode with 2 additional precision bits compared to the largest floating point representation that we wish to support. We provide a proof that this method produces correctly rounded results for multiple representations and for all the standard rounding modes. More detailed explanation of our approach can be found in our POPL 2022 distinguished paper.
Read more...
by Mary Sheeran on Mar 15, 2022 | Tags: academic culture, academic observers, changing Universities, gender equality in academia, honest conversations
We all need to step up and start working to improve gender equality in computer science and engineering. This is the second of two blog posts about this fascinating and frustrating problem, in which I provide three suggestions for how to get started.
Read more...
by Mary Sheeran on Jan 27, 2022 | Tags: Academia, action, community, culture, gender equality, STEM
We all need to step up and start working to improve gender equality in computer science and engineering. In two blog posts, I give my view of this fascinating and frustrating problem. I provide three suggestions for how to get started.
Read more...
by the ASPLOS Steering Committee on Jan 18, 2022 | In late November, the ASPLOS Steering Committee published a proposal to change the paper submission process for ASPLOS by introducing three deadlines per year and the possibility of resubmitting a paper. The Steering Committee asked the ASPLOS community for its...
Read more...
by Sam Westrick, Jatin Arora, and Umut Acar on Jan 13, 2022 | Tags: functional programming, garbage collection, memory management, parallelism
You have heard your grandmother tell you many times: parallel programming is hard. In 2022, does it still have to be? Back in grandma’s heyday, they knew a cool and breezy way to do parallelism: pure functional programming. They knew that pure functions are parallel by default, being free of pesky concurrency bugs and all. But, parallel functional programming remained slow and steady, resisting practical efficiency for decades. This post shows the way towards solving the performance problems of functional programming.
Read more...
by Sara Achour on Dec 14, 2021 | Tags: compilers, hardware, optimization, unconventional computing
Modern analog computers a host of analog behaviors that affect the fidelity of the mapped computation. How can we mitigate these analog behaviors in compilation?
Read more...
by Peter Sewell on Dec 7, 2021 | Tags: Reviewing
Peer review is an essential aspect of academic research, giving a feedback loop that stimulates and rewards high-quality work – but as we all know, it doesn’t always function well. To help maintain a consensus of what constitutes good reviewing, this note spells out some bad and good reasons to reject and accept papers.
Read more...
by the ASPLOS Steering Committee on Nov 30, 2021 |
The ASPLOS Steering Committee is considering two changes to the ASPLOS submission process: 1) three submission deadlines spread over the year, and 2) the possibility for papers near acceptance to be revised and resubmitted. This proposal outlines these changes.
Read more...
by Ralf Jung on Nov 18, 2021 |
“Undefined Behavior” often has a bad reputation. But what, really, is Undefined Behavior, and is it actually that bad?
In this blog post, I will look at this topic from a PL perspective, and argue that Undefined Behavior is a valuable tool in a language designer’s toolbox.
Read more...
by Xiaolei Ren on Nov 11, 2021 | Tags: Binary Code Difference, Compiler Optimization
How does compiler optimization affect binary code differences? In this work, we perform a systematic study using search-based iterative compilation. We have built an auto-tuning framework called BinTuner that iteratively compiles to adjust the differences in binary code. Our results demonstrate the effect of modern compiler optimization on binary code difference has been swept under the carpet for a long time. We wish our study can help the research community redesign the optimization-resistance experiments and evaluate the compiler-agnostic capability.
Read more...
