NDLI: Effcient programming techniques for the SACLIB computer algebra library

Content Provider	ACM Digital Library
Author	Richardson, David
Abstract	This dissertation describes three contributions to the SACLIB computer algebra library. Using generic programming we specify the Recursively Fixed Iterator and the Structure Protecting Iterator concepts. We prove that models of these concepts cannot leak or double delete resources. Through template metaprogramming, we implement models of these concepts that provide this memory safety at compile-time and without any run-time overhead. Using aspect oriented programming, we allow unit and regression tests to be automatically obtained from an executing SACLIB program. This program instrumentation is transparent both to SACLIB maintainers and clients. This mechanism allows the automated creation of regression test suites during the execution of normal SACLIB programs. Using code generation and auto-tuning, we allow high performance implementations of the Taylor shift, de Casteljau's algorithm, and the Descartes Method for polynomial root isolation to be automatically tuned for different architectures. This allows a speedup of 10-20 over existing methods to be obtained on modern CPU architectures. The key to this speedup is the creation of a tiling scheme that allows the irregular structure of the computation to be tiled using a small number of tiles that are easy for a code generator to produce code for. The implementation of the Recursively Fixed Iterator and the Structure Protecting Iterator provide memory safety by using C++ template metaprograms that selectively disable certain classes of side effects in programs using the iterators. Other safety properties can be achieved using similar disabling of side effects. We believe that the most important continuation of the work presented here is the development of programming language techniques to allow programmers to control where their code should sit along the spectrum of the absence of side effects in pure functional languages and the unrestricted side effects of imperative language.
Starting Page	120
Ending Page	120
Page Count	1
File Format	PDF
ISSN	19322240
DOI	10.1145/1823931.1823955
Journal	ACM Communications in Computer Algebra (ACCA)
Volume Number	43
Issue Number	3/4
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2015-02-05
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Content Type	Text
Resource Type	Article
Subject	Computational Theory and Mathematics Computational Mathematics

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Compiler-enforced memory semantics in the SACLIB computer algebra library (2005)

SINGULAR:a computer algebra system for polynomial computations

The conference "computer algebra" in Moscow

Collaborative computer algebra systems

Computer algebra challenges for constructing skew cyclic codes

Open source computer algebra systems:Axiom

Open source computer algebra systems:SymPy

AXIOM:open source computer algebra system

Open source computer algebra systems:GAP

Effcient programming techniques for the SACLIB computer algebra library

Similar Documents

Compiler-enforced memory semantics in the SACLIB computer algebra library (2005)

SINGULAR:a computer algebra system for polynomial computations

The conference "computer algebra" in Moscow

Collaborative computer algebra systems

Computer algebra challenges for constructing skew cyclic codes

Open source computer algebra systems:Axiom

Open source computer algebra systems:SymPy

AXIOM:open source computer algebra system

Open source computer algebra systems:GAP

Effcient programming techniques for the SACLIB computer algebra library