1 resultado para value-based sales
em Digital Commons - Michigan Tech
Filtro por publicador
- JISC Information Environment Repository (1)
- Repository Napier (2)
- Abertay Research Collections - Abertay University’s repository (1)
- Aberystwyth University Repository - Reino Unido (2)
- Academic Archive On-line (Karlstad University; Sweden) (1)
- Academic Research Repository at Institute of Developing Economies (3)
- Aquatic Commons (6)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (1)
- Archimer: Archive de l'Institut francais de recherche pour l'exploitation de la mer (1)
- Archive of European Integration (2)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (7)
- Aston University Research Archive (23)
- Biblioteca Digital | Sistema Integrado de Documentación | UNCuyo - UNCUYO. UNIVERSIDAD NACIONAL DE CUYO. (1)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (2)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (6)
- Biblioteca Digital de la Universidad Católica Argentina (1)
- Biblioteca Digital de Teses e Dissertações Eletrônicas da UERJ (1)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (7)
- Boston University Digital Common (3)
- Brock University, Canada (5)
- Bucknell University Digital Commons - Pensilvania - USA (1)
- CaltechTHESIS (4)
- Cambridge University Engineering Department Publications Database (34)
- CentAUR: Central Archive University of Reading - UK (60)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (40)
- Cochin University of Science & Technology (CUSAT), India (13)
- CORA - Cork Open Research Archive - University College Cork - Ireland (4)
- Corvinus Research Archive - The institutional repository for the Corvinus University of Budapest (5)
- Dalarna University College Electronic Archive (6)
- Deakin Research Online - Australia (135)
- Department of Computer Science E-Repository - King's College London, Strand, London (1)
- Digital Commons - Michigan Tech (1)
- Digital Commons @ Winthrop University (1)
- Digital Commons at Florida International University (3)
- Digital Peer Publishing (1)
- Digital Repository at Iowa State University (3)
- DigitalCommons@The Texas Medical Center (1)
- Diposit Digital de la UB - Universidade de Barcelona (1)
- Doria (National Library of Finland DSpace Services) - National Library of Finland, Finland (10)
- DRUM (Digital Repository at the University of Maryland) (1)
- Duke University (9)
- eResearch Archive - Queensland Department of Agriculture; Fisheries and Forestry (11)
- Fachlicher Dokumentenserver Paedagogik/Erziehungswissenschaften (2)
- FUNDAJ - Fundação Joaquim Nabuco (1)
- Greenwich Academic Literature Archive - UK (4)
- Helda - Digital Repository of University of Helsinki (26)
- Indian Institute of Science - Bangalore - Índia (66)
- Instituto Politécnico do Porto, Portugal (22)
- Lume - Repositório Digital da Universidade Federal do Rio Grande do Sul (3)
- Massachusetts Institute of Technology (3)
- Open University Netherlands (1)
- Plymouth Marine Science Electronic Archive (PlyMSEA) (4)
- Publishing Network for Geoscientific & Environmental Data (1)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (75)
- Queensland University of Technology - ePrints Archive (170)
- ReCiL - Repositório Científico Lusófona - Grupo Lusófona, Portugal (1)
- Repositório Científico da Universidade de Évora - Portugal (1)
- Repositório Científico do Instituto Politécnico de Lisboa - Portugal (2)
- Repositório digital da Fundação Getúlio Vargas - FGV (22)
- Repositório Institucional da Universidade de Aveiro - Portugal (3)
- Repositório Institucional dos Hospitais da Universidade Coimbra (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (19)
- Repositorio Institucional Universidad de Medellín (1)
- RUN (Repositório da Universidade Nova de Lisboa) - FCT (Faculdade de Cienecias e Technologia), Universidade Nova de Lisboa (UNL), Portugal (9)
- SAPIENTIA - Universidade do Algarve - Portugal (4)
- The Scholarly Commons | School of Hotel Administration; Cornell University Research (2)
- Universidad de Alicante (2)
- Universidad del Rosario, Colombia (24)
- Universidad Politécnica de Madrid (5)
- Universidade Complutense de Madrid (1)
- Universitat de Girona, Spain (3)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (6)
- Université de Lausanne, Switzerland (4)
- Université de Montréal, Canada (11)
- University of Michigan (4)
- University of Queensland eSpace - Australia (7)
- University of Southampton, United Kingdom (1)
- University of Washington (2)
- WestminsterResearch - UK (6)
Resumo:
An optimizing compiler internal representation fundamentally affects the clarity, efficiency and feasibility of optimization algorithms employed by the compiler. Static Single Assignment (SSA) as a state-of-the-art program representation has great advantages though still can be improved. This dissertation explores the domain of single assignment beyond SSA, and presents two novel program representations: Future Gated Single Assignment (FGSA) and Recursive Future Predicated Form (RFPF). Both FGSA and RFPF embed control flow and data flow information, enabling efficient traversal program information and thus leading to better and simpler optimizations. We introduce future value concept, the designing base of both FGSA and RFPF, which permits a consumer instruction to be encountered before the producer of its source operand(s) in a control flow setting. We show that FGSA is efficiently computable by using a series T1/T2/TR transformation, yielding an expected linear time algorithm for combining together the construction of the pruned single assignment form and live analysis for both reducible and irreducible graphs. As a result, the approach results in an average reduction of 7.7%, with a maximum of 67% in the number of gating functions compared to the pruned SSA form on the SPEC2000 benchmark suite. We present a solid and near optimal framework to perform inverse transformation from single assignment programs. We demonstrate the importance of unrestricted code motion and present RFPF. We develop algorithms which enable instruction movement in acyclic, as well as cyclic regions, and show the ease to perform optimizations such as Partial Redundancy Elimination on RFPF.