This shows you the differences between two versions of the page.
Both sides previous revision Previous revision Next revision | Previous revision Last revision Both sides next revision | ||
melange:papers:spring2017 [2017/04/03 10:23] prerana |
melange:papers:spring2017 [2018/02/07 16:30] prerana |
||
---|---|---|---|
Line 1: | Line 1: | ||
+ | @inproceedings{Volkov: | ||
+ | | ||
+ | title = {Benchmarking GPUs to Tune Dense Linear Algebra}, | ||
+ | | ||
+ | | ||
+ | year = {2008}, | ||
+ | isbn = {978-1-4244-2835-9}, | ||
+ | | ||
+ | pages = {31: | ||
+ | | ||
+ | | ||
+ | url = {http:// | ||
+ | acmid = {1413402}, | ||
+ | | ||
+ | | ||
+ | } | ||
+ | |||
+ | @Article{Griebl2000, | ||
+ | author=" | ||
+ | and Feautrier, Paul | ||
+ | and Lengauer, Christian", | ||
+ | title=" | ||
+ | journal=" | ||
+ | year=" | ||
+ | month=" | ||
+ | day=" | ||
+ | volume=" | ||
+ | number=" | ||
+ | pages=" | ||
+ | abstract=" | ||
+ | issn=" | ||
+ | doi=" | ||
+ | url=" | ||
+ | } | ||
+ | |||
+ | @inproceedings{Irigoin: | ||
+ | | ||
+ | title = {Supernode Partitioning}, | ||
+ | | ||
+ | | ||
+ | year = {1988}, | ||
+ | isbn = {0-89791-252-7}, | ||
+ | | ||
+ | pages = {319--329}, | ||
+ | | ||
+ | url = {http:// | ||
+ | doi = {10.1145/ | ||
+ | acmid = {73588}, | ||
+ | | ||
+ | | ||
+ | } | ||
+ | |||
+ | @ARTICLE{7738524, | ||
+ | author={Y. H. Chen and T. Krishna and J. S. Emer and V. Sze}, | ||
+ | journal={IEEE Journal of Solid-State Circuits}, | ||
+ | title={Eyeriss: | ||
+ | year={2017}, | ||
+ | volume={52}, | ||
+ | number={1}, | ||
+ | pages={127-138}, | ||
+ | keywords={DRAM chips;data flow computing; | ||
+ | doi={10.1109/ | ||
+ | ISSN={0018-9200}, | ||
+ | month={Jan}, | ||
+ | |||
+ | @ARTICLE{88484, | ||
+ | author={J. H. Saltz and R. Mirchandaney and K. Crowley}, | ||
+ | journal={IEEE Transactions on Computers}, | ||
+ | title={Run-time parallelization and scheduling of loops}, | ||
+ | year={1991}, | ||
+ | volume={40}, | ||
+ | number={5}, | ||
+ | pages={603-612}, | ||
+ | keywords={parallel programming; | ||
+ | doi={10.1109/ | ||
+ | ISSN={0018-9340}, | ||
+ | month={May}, | ||
+ | |||
+ | BibTeX | EndNote | ACM Ref | ||
+ | @article{Feautrier: | ||
+ | | ||
+ | title = {Scalable and Structured Scheduling}, | ||
+ | | ||
+ | | ||
+ | | ||
+ | | ||
+ | month = oct, | ||
+ | year = {2006}, | ||
+ | issn = {0885-7458}, | ||
+ | pages = {459--487}, | ||
+ | | ||
+ | url = {http:// | ||
+ | doi = {10.1007/ | ||
+ | acmid = {1217447}, | ||
+ | | ||
+ | | ||
+ | | ||
+ | } | ||
+ | |||
+ | @article{Verdoolaege: | ||
+ | | ||
+ | title = {Equivalence Checking of Static Affine Programs Using Widening to Handle Recurrences}, | ||
+ | | ||
+ | | ||
+ | | ||
+ | | ||
+ | month = nov, | ||
+ | year = {2012}, | ||
+ | issn = {0164-0925}, | ||
+ | pages = {11: | ||
+ | | ||
+ | | ||
+ | url = {http:// | ||
+ | doi = {10.1145/ | ||
+ | acmid = {2362390}, | ||
+ | | ||
+ | | ||
+ | | ||
+ | } | ||
+ | |||
+ | @inproceedings{Kulkarni: | ||
+ | | ||
+ | title = {Optimistic Parallelism Requires Abstractions}, | ||
+ | | ||
+ | | ||
+ | year = {2007}, | ||
+ | isbn = {978-1-59593-633-2}, | ||
+ | | ||
+ | pages = {211--222}, | ||
+ | | ||
+ | url = {http:// | ||
+ | doi = {10.1145/ | ||
+ | acmid = {1250759}, | ||
+ | | ||
+ | | ||
+ | | ||
+ | } | ||
+ | |||
+ | @inproceedings{sanjay-fsttcs86, | ||
+ | Address = {New Delhi, India}, | ||
+ | Author = {Rajopadhye, | ||
+ | Booktitle = {Proceedings, | ||
+ | Technology and Theoretical Computer Science}, | ||
+ | Key = {Rajopadhye86b}, | ||
+ | Month = {December}, | ||
+ | Pages = {488-503}, | ||
+ | Publisher = {Springer Verlag, LNCS~241}, | ||
+ | Title = {On Synthesizing Systolic Arrays from Recurrence Equations | ||
+ | with Linear Dependencies}, | ||
+ | Year = {1986}} | ||
+ | |||
+ | @article{quinton-jvsp89, | ||
+ | Author = {Quinton, P. and {Van Dongen}, V.}, | ||
+ | Journal = {Journal of {VLSI} Signal Processing}, | ||
+ | Number = 2, | ||
+ | Pages = {95-113}, | ||
+ | Publisher = {Kluwer Academic Publishers, Boston}, | ||
+ | Title = {The Mapping of Linear Recurrence Equations on Regular Arrays}, | ||
+ | Volume = 1, | ||
+ | Year = 1989} | ||
+ | |||
+ | @Article{feautrier91, | ||
+ | author= | ||
+ | title= | ||
+ | journal= | ||
+ | year= 1991, | ||
+ | volume= | ||
+ | number= | ||
+ | pages= | ||
+ | month= | ||
+ | annote= | ||
+ | program (consisting only of assignments, | ||
+ | limits, and arrays with affine index expressions), | ||
+ | analyzed to find the flow dependencies." | ||
+ | } | ||
+ | |||
+ | @article{feautrier92a, | ||
+ | author | ||
+ | title = {Some Efficient Solutions to the Affine Scheduling Problem. | ||
+ | {Part I}. One-dimensional Time}, | ||
+ | journal | ||
+ | volume | ||
+ | number | ||
+ | year = {1992}, | ||
+ | pages = {313-347}, | ||
+ | ee = {http:// | ||
+ | } | ||
+ | |||
+ | @article{feautrier92b, | ||
+ | author | ||
+ | title = {Some Efficient Solutions to the Affine Scheduling Problem. | ||
+ | {Part II}. Multidimensional Time}, | ||
+ | journal | ||
+ | volume | ||
+ | number | ||
+ | year = {1992}, | ||
+ | pages = {389-420}, | ||
+ | ee = {http:// | ||
+ | } | ||
+ | |||
+ | @Article{collard-etal-fuzzy-jpdc-1997, | ||
+ | author = | ||
+ | title = {Fuzzy Array Data Flow Analysis}, | ||
+ | journal = {Journal of Parallel and Distributed Computing}, | ||
+ | year = 1997, | ||
+ | volume = 40, | ||
+ | number = 2, | ||
+ | pages = {210-226}, | ||
+ | month = {Feb}} | ||
+ | |||
+ | |||
+ | @InProceedings{BPCB10, | ||
+ | author = {Benabderrahmane, | ||
+ | Bastoul, C.}, | ||
+ | title = {The Polyhedral Model Is More Widely Applicable Than You | ||
+ | Think}, | ||
+ | booktitle = | ||
+ | Construction ({ETAPS CC' | ||
+ | year = 2010, | ||
+ | series = {LNCS}, | ||
+ | address = | ||
+ | pages = | ||
+ | month = Mar, | ||
+ | publisher = | ||
+ | |||
+ | |||
+ | |||
+ | @ARTICAL{123, | ||
+ | and P. Sadayappan}, | ||
+ | |||
+ | |||
+ | |||
+ | |||
@INPROCEEDINGS{6043234, | @INPROCEEDINGS{6043234, | ||
author={A. Pedram and A. Gerstlauer and R. A. v. d. Geijn}, | author={A. Pedram and A. Gerstlauer and R. A. v. d. Geijn}, |