A Simple Methodology for Computing Families of Algorithms

A Simple Methodology for Computing Families of Algorithms

Discovering "good" algorithms for an operation is often considered an art best left to experts. What if there is a simple methodology, an algorithm, for systematically deriving a family of algorithms as well as their cost analyses, so that the best algorithm can be chosen? We discuss such...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Parikh, Devangi N, Myers, Margaret E, Vuduc, Richard, van de Geijn, Robert A
Format: Artikel
Sprache:eng
Schlagworte:
Computer Science - Logic in Computer Science
Computer Science - Mathematical Software
Computer Science - Programming Languages
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Parikh, Devangi N
Myers, Margaret E
Vuduc, Richard
van de Geijn, Robert A
description Discovering "good" algorithms for an operation is often considered an art best left to experts. What if there is a simple methodology, an algorithm, for systematically deriving a family of algorithms as well as their cost analyses, so that the best algorithm can be chosen? We discuss such an approach for deriving loop-based algorithms. The example used to illustrate this methodology, evaluation of a polynomial, is itself simple yet the best algorithm that results is surprising to a non-expert: Horner's rule. We finish by discussing recent advances that make this approach highly practical for the domain of high-performance linear algebra software libraries.
doi_str_mv 10.48550/arxiv.1808.07832
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_1808_07832</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1808_07832</sourcerecordid><originalsourceid>FETCH-LOGICAL-a672-1f7074b945bb6362e15383be9bccc6f95ce30e28968c535dcc42da39953eb2ed3</originalsourceid><addsrcrecordid>eNotj8FOxCAUALl4MKsf4El-oJXyCoVj07hqssaDe2-AProkIA2txv174-ppbpMZQu4aVrdKCPZgynf4qhvFVM06Bfya6J6-h7REpK-4nfKUY57P1OdCh5yWzy18zHRvUogBV5o97eOcS9hOab0hV97EFW__uSPH_eNxeK4Ob08vQ3-ojOx41fiOda3VrbBWguTYCFBgUVvnnPRaOASGXGmpnAAxOdfyyYDWAtBynGBH7v-0l_ZxKSGZch5_H8bLA_wAuWlBNw</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>A Simple Methodology for Computing Families of Algorithms</title><source>arXiv.org</source><creator>Parikh, Devangi N ; Myers, Margaret E ; Vuduc, Richard ; van de Geijn, Robert A</creator><creatorcontrib>Parikh, Devangi N ; Myers, Margaret E ; Vuduc, Richard ; van de Geijn, Robert A</creatorcontrib><description>Discovering "good" algorithms for an operation is often considered an art best left to experts. What if there is a simple methodology, an algorithm, for systematically deriving a family of algorithms as well as their cost analyses, so that the best algorithm can be chosen? We discuss such an approach for deriving loop-based algorithms. The example used to illustrate this methodology, evaluation of a polynomial, is itself simple yet the best algorithm that results is surprising to a non-expert: Horner's rule. We finish by discussing recent advances that make this approach highly practical for the domain of high-performance linear algebra software libraries.</description><identifier>DOI: 10.48550/arxiv.1808.07832</identifier><language>eng</language><subject>Computer Science - Logic in Computer Science ; Computer Science - Mathematical Software ; Computer Science - Programming Languages</subject><creationdate>2018-08</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/1808.07832$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.1808.07832$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Parikh, Devangi N</creatorcontrib><creatorcontrib>Myers, Margaret E</creatorcontrib><creatorcontrib>Vuduc, Richard</creatorcontrib><creatorcontrib>van de Geijn, Robert A</creatorcontrib><title>A Simple Methodology for Computing Families of Algorithms</title><description>Discovering "good" algorithms for an operation is often considered an art best left to experts. What if there is a simple methodology, an algorithm, for systematically deriving a family of algorithms as well as their cost analyses, so that the best algorithm can be chosen? We discuss such an approach for deriving loop-based algorithms. The example used to illustrate this methodology, evaluation of a polynomial, is itself simple yet the best algorithm that results is surprising to a non-expert: Horner's rule. We finish by discussing recent advances that make this approach highly practical for the domain of high-performance linear algebra software libraries.</description><subject>Computer Science - Logic in Computer Science</subject><subject>Computer Science - Mathematical Software</subject><subject>Computer Science - Programming Languages</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2018</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotj8FOxCAUALl4MKsf4El-oJXyCoVj07hqssaDe2-AProkIA2txv174-ppbpMZQu4aVrdKCPZgynf4qhvFVM06Bfya6J6-h7REpK-4nfKUY57P1OdCh5yWzy18zHRvUogBV5o97eOcS9hOab0hV97EFW__uSPH_eNxeK4Ob08vQ3-ojOx41fiOda3VrbBWguTYCFBgUVvnnPRaOASGXGmpnAAxOdfyyYDWAtBynGBH7v-0l_ZxKSGZch5_H8bLA_wAuWlBNw</recordid><startdate>20180820</startdate><enddate>20180820</enddate><creator>Parikh, Devangi N</creator><creator>Myers, Margaret E</creator><creator>Vuduc, Richard</creator><creator>van de Geijn, Robert A</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20180820</creationdate><title>A Simple Methodology for Computing Families of Algorithms</title><author>Parikh, Devangi N ; Myers, Margaret E ; Vuduc, Richard ; van de Geijn, Robert A</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a672-1f7074b945bb6362e15383be9bccc6f95ce30e28968c535dcc42da39953eb2ed3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2018</creationdate><topic>Computer Science - Logic in Computer Science</topic><topic>Computer Science - Mathematical Software</topic><topic>Computer Science - Programming Languages</topic><toplevel>online_resources</toplevel><creatorcontrib>Parikh, Devangi N</creatorcontrib><creatorcontrib>Myers, Margaret E</creatorcontrib><creatorcontrib>Vuduc, Richard</creatorcontrib><creatorcontrib>van de Geijn, Robert A</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Parikh, Devangi N</au><au>Myers, Margaret E</au><au>Vuduc, Richard</au><au>van de Geijn, Robert A</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A Simple Methodology for Computing Families of Algorithms</atitle><date>2018-08-20</date><risdate>2018</risdate><abstract>Discovering "good" algorithms for an operation is often considered an art best left to experts. What if there is a simple methodology, an algorithm, for systematically deriving a family of algorithms as well as their cost analyses, so that the best algorithm can be chosen? We discuss such an approach for deriving loop-based algorithms. The example used to illustrate this methodology, evaluation of a polynomial, is itself simple yet the best algorithm that results is surprising to a non-expert: Horner's rule. We finish by discussing recent advances that make this approach highly practical for the domain of high-performance linear algebra software libraries.</abstract><doi>10.48550/arxiv.1808.07832</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.1808.07832
ispartof
issn
language eng
recordid cdi_arxiv_primary_1808_07832
source arXiv.org
subjects Computer Science - Logic in Computer Science
Computer Science - Mathematical Software
Computer Science - Programming Languages
title A Simple Methodology for Computing Families of Algorithms
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-03T08%3A16%3A24IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20Simple%20Methodology%20for%20Computing%20Families%20of%20Algorithms&rft.au=Parikh,%20Devangi%20N&rft.date=2018-08-20&rft_id=info:doi/10.48550/arxiv.1808.07832&rft_dat=%3Carxiv_GOX%3E1808_07832%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true