Collective Knowledge Aggregator beta
Home CK AI Interactive articles Graphs Programs Datasets Models Browse Get CK About

Files:
doc.bib    (1KB)
doc.pdf    (161KB)

Cross-linking (dependencies):

Meta:
{
  "authors": [
    {
      "name": "0728a400aa1c86fe"
    }, 
    {
      "name": "cc58cd93d4412b9b"
    }, 
    {
      "name": "785a4f3eee3f609d"
    }, 
    {
      "name": "c0b343f7a51cacdb"
    }
  ], 
  "bib": "@inproceedings{29db2248aba45e59:ce29b57b4b628317,\n\n  author =    {Grigori Fursin and Michael O'Boyle and Olivier Temam and Gregory Watts},\n  title =     {Fast and Accurate Evaluation of Memory Performance Upper-Bound},\n  booktitle = {Proceedings of the 9th Workshop on Compilers for Parallel Computers (CPC'2001)},\n  pages =     {163-172},\n  year =      {2001}\n }\n\n", 
  "bib_parsed": {
    "_code": "Fursin2001p163", 
    "_type": "inproceedings", 
    "author": [
      [
        "", 
        "Fursin", 
        "Grigori", 
        ""
      ], 
      [
        "", 
        "O'Boyle", 
        "Michael", 
        ""
      ], 
      [
        "", 
        "Temam", 
        "Olivier", 
        ""
      ], 
      [
        "", 
        "Watts", 
        "Gregory", 
        ""
      ]
    ], 
    "booktitle": "Proceedings of the 9th Workshop on Compilers for Parallel Computers (CPC'2001)", 
    "firstpage": "163", 
    "lastpage": "172", 
    "title": "Fast and Accurate Evaluation of Memory Performance Upper-Bound", 
    "year": "2001"
  }, 
  "bib_ref": "cm:29db2248aba45e59:91c6126884641b59", 
  "local_bib": "doc.bib", 
  "local_doc": "doc.pdf", 
  "notes": [
    {
      "italic": "yes", 
      "note": "In this paper $#cm_cv_i2#$ introduced a novel, simple and fast approach to detect program performance anomalies or CPU/memory bounds via semantically non-equivalent assembler patching [$#cm_e84a25bcb528c798_b953dacc9bc49fa8#$]. We add or remove various assembler instructions to convert array accesses to scalars in various ways without preserving the semantics of the code while avoiding code crashing to be able to directly compare original and transformed programs. This technique does not need any slow simulation and proved to be realistic particularly on out-of-order processors where hardware counters can be totally misleading. This technique also advise how to optimize code, i.e. if code is CPU bound, we should focus on ILP optimizations; while if the code is memory bound, we should focus on polyhedral transformations or reduce processor frequency to save power."
    }, 
    {
      "italic": "yes", 
      "note": "Associated public software [$#cm_d76ac3bb9a3f744c_9f143f5b31500137#$]"
    }, 
    {
      "italic": "yes", 
      "note": "Extended in journal version [$#cm_29db2248aba45e59_b254c18c8794ba29#$], PhD thesis [$#cm_29db2248aba45e59_976aac68c6834af6#$] and DECAN framework [$#cm_29db2248aba45e59_2a45819c829656cc#$]"
    }
  ], 
  "pages": "163-172", 
  "place": "Edinburgh, UK", 
  "publish_iso_date": "2001-05-01", 
  "reproducible": "yes", 
  "title": "Fast and Accurate Evaluation of Memory Performance Upper-Bound", 
  "type": {
    "name": "workshop", 
    "peer_reviewed": "yes", 
    "scope": "international"
  }, 
  "when": "2001", 
  "where": "Proceedings of the 9th Workshop on Compilers for Parallel Computers (CPC)"
}

API desc:
{}

If you notice copyrighted, inappropriate or illegal content that should not be here, please report us as soon as possible and we will try to remove it within 48hours!

Developed by dividiti,
cTuning foundation,
and the community
          
Implemented as a CK workflow
                     
   
   
                      Hosted at