Locality-aware task scheduling for homogeneous parallel computing systems View Full Text


Ontology type: schema:ScholarlyArticle     


Article Info

DATE

2018-06

AUTHORS

Muhammad Khurram Bhatti, Isil Oz, Sarah Amin, Maria Mushtaq, Umer Farooq, Konstantin Popov, Mats Brorsson

ABSTRACT

In systems with complex many-core cache hierarchy, exploiting data locality can significantly reduce execution time and energy consumption of parallel applications. Locality can be exploited at various hardware and software layers. For instance, by implementing private and shared caches in a multi-level fashion, recent hardware designs are already optimised for locality. However, this would all be useless if the software scheduling does not cast the execution in a manner that promotes locality available in the programs themselves. Since programs for parallel systems consist of tasks executed simultaneously, task scheduling becomes crucial for the performance in multi-level cache architectures. This paper presents a heuristic algorithm for homogeneous multi-core systems called locality-aware task scheduling (LeTS). The LeTS heuristic is a work-conserving algorithm that takes into account both locality and load balancing in order to reduce the execution time of target applications. The working principle of LeTS is based on two distinctive phases, namely; working task group formation phase (WTG-FP) and working task group ordering phase (WTG-OP). The WTG-FP forms groups of tasks in order to capture data reuse across tasks while the WTG-OP determines an optimal order of execution for task groups that minimizes the reuse distance of shared data between tasks. We have performed experiments using randomly generated task graphs by varying three major performance parameters, namely: (1) communication to computation ratio (CCR) between 0.1 and 1.0, (2) application size, i.e., task graphs comprising of 50-, 100-, and 300-tasks per graph, and (3) number of cores with 2-, 4-, 8-, and 16-cores execution scenarios. We have also performed experiments using selected real-world applications. The LeTS heuristic reduces overall execution time of applications by exploiting inter-task data locality. Results show that LeTS outperforms state-of-the-art algorithms in amortizing inter-task communication cost. More... »

PAGES

557-595

References to SciGraph publications

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/s00607-017-0581-6

DOI

http://dx.doi.org/10.1007/s00607-017-0581-6

DIMENSIONS

https://app.dimensions.ai/details/publication/pub.1092476601


Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
Incoming Citations Browse incoming citations for this publication using opencitations.net

JSON-LD is the canonical representation for SciGraph data.

TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

[
  {
    "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
    "about": [
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0803", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Computer Software", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/08", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Information and Computing Sciences", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Information Technology University", 
          "id": "https://www.grid.ac/institutes/grid.497892.9", 
          "name": [
            "Embedded Computing Lab, Information Technology University (ITU), 346-B Ferozpur Road, Lahore, Pakistan"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Bhatti", 
        "givenName": "Muhammad Khurram", 
        "id": "sg:person.015604061305.70", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015604061305.70"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Izmir Institute of Technology", 
          "id": "https://www.grid.ac/institutes/grid.419609.3", 
          "name": [
            "Computer Engineering Department, Izmir Institute of Technology, Izmir, Turkey"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Oz", 
        "givenName": "Isil", 
        "id": "sg:person.013041676036.90", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013041676036.90"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Information Technology University", 
          "id": "https://www.grid.ac/institutes/grid.497892.9", 
          "name": [
            "Embedded Computing Lab, Information Technology University (ITU), 346-B Ferozpur Road, Lahore, Pakistan"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Amin", 
        "givenName": "Sarah", 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Information Technology University", 
          "id": "https://www.grid.ac/institutes/grid.497892.9", 
          "name": [
            "Embedded Computing Lab, Information Technology University (ITU), 346-B Ferozpur Road, Lahore, Pakistan"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Mushtaq", 
        "givenName": "Maria", 
        "id": "sg:person.016560711042.19", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016560711042.19"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Dhofar University", 
          "id": "https://www.grid.ac/institutes/grid.444761.4", 
          "name": [
            "Department of Electrical and Computer Engineering, Dhofar University, 211, Salalah, Oman"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Farooq", 
        "givenName": "Umer", 
        "id": "sg:person.01323306501.42", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01323306501.42"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Swedish Institute of Computer Science", 
          "id": "https://www.grid.ac/institutes/grid.6383.e", 
          "name": [
            "SICS, Isafjordsgatan 22, 164 29, Kista, Sweden"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Popov", 
        "givenName": "Konstantin", 
        "id": "sg:person.014234147707.30", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014234147707.30"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Royal Institute of Technology", 
          "id": "https://www.grid.ac/institutes/grid.5037.1", 
          "name": [
            "KTH Royal Institute of Technology, Isafjordsgatan 22, Box 1263, 164 29, Kista, Sweden"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Brorsson", 
        "givenName": "Mats", 
        "id": "sg:person.012556045445.72", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012556045445.72"
        ], 
        "type": "Person"
      }
    ], 
    "citation": [
      {
        "id": "sg:pub.10.1007/s11241-011-9116-y", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1000206249", 
          "https://doi.org/10.1007/s11241-011-9116-y"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-3-540-27866-5_30", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1000221400", 
          "https://doi.org/10.1007/978-3-540-27866-5_30"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-3-540-27866-5_30", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1000221400", 
          "https://doi.org/10.1007/978-3-540-27866-5_30"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/j.parco.2003.09.002", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1000991694"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/j.cor.2013.09.004", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1002854217"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/s11265-008-0176-8", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1003159528", 
          "https://doi.org/10.1007/s11265-008-0176-8"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/j.sysarc.2007.01.013", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1003739800"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/j.parco.2012.01.001", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1007010700"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/s11227-010-0395-1", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1010446874", 
          "https://doi.org/10.1007/s11227-010-0395-1"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/s11227-010-0395-1", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1010446874", 
          "https://doi.org/10.1007/s11227-010-0395-1"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1145/2486159.2486175", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1016148315"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/s13369-016-2180-9", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1030685203", 
          "https://doi.org/10.1007/s13369-016-2180-9"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/s13369-016-2180-9", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1030685203", 
          "https://doi.org/10.1007/s13369-016-2180-9"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1155/2005/128026", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1045919881"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1023/a:1019076003163", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1050259985", 
          "https://doi.org/10.1023/a:1019076003163"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/71.308533", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1061217327"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/71.503776", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1061217533"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/71.722221", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1061217783"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/71.80160", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1061217906"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/71.993206", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1061218186"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/tc.1984.1676376", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1061533013"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/tcad.2008.923415", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1061537915"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/tpds.2005.64", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1061752903"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/tpds.2013.57", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1061754478"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/tpds.2016.2526682", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1061755020"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/icppw.2001.951956", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1093320354"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/ccgrid.2012.114", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1093988893"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/dsd.2014.71", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1095535733"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1002/0470121173", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1098661312"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1002/0470121173", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1098661312"
        ], 
        "type": "CreativeWork"
      }
    ], 
    "datePublished": "2018-06", 
    "datePublishedReg": "2018-06-01", 
    "description": "In systems with complex many-core cache hierarchy, exploiting data locality can significantly reduce execution time and energy consumption of parallel applications. Locality can be exploited at various hardware and software layers. For instance, by implementing private and shared caches in a multi-level fashion, recent hardware designs are already optimised for locality. However, this would all be useless if the software scheduling does not cast the execution in a manner that promotes locality available in the programs themselves. Since programs for parallel systems consist of tasks executed simultaneously, task scheduling becomes crucial for the performance in multi-level cache architectures. This paper presents a heuristic algorithm for homogeneous multi-core systems called locality-aware task scheduling (LeTS). The LeTS heuristic is a work-conserving algorithm that takes into account both locality and load balancing in order to reduce the execution time of target applications. The working principle of LeTS is based on two distinctive phases, namely; working task group formation phase (WTG-FP) and working task group ordering phase (WTG-OP). The WTG-FP forms groups of tasks in order to capture data reuse across tasks while the WTG-OP determines an optimal order of execution for task groups that minimizes the reuse distance of shared data between tasks. We have performed experiments using randomly generated task graphs by varying three major performance parameters, namely: (1) communication to computation ratio (CCR) between 0.1 and 1.0, (2) application size, i.e., task graphs comprising of 50-, 100-, and 300-tasks per graph, and (3) number of cores with 2-, 4-, 8-, and 16-cores execution scenarios. We have also performed experiments using selected real-world applications. The LeTS heuristic reduces overall execution time of applications by exploiting inter-task data locality. Results show that LeTS outperforms state-of-the-art algorithms in amortizing inter-task communication cost.", 
    "genre": "research_article", 
    "id": "sg:pub.10.1007/s00607-017-0581-6", 
    "inLanguage": [
      "en"
    ], 
    "isAccessibleForFree": false, 
    "isPartOf": [
      {
        "id": "sg:journal.1356894", 
        "issn": [
          "1521-9615", 
          "1436-5057"
        ], 
        "name": "Computing", 
        "type": "Periodical"
      }, 
      {
        "issueNumber": "6", 
        "type": "PublicationIssue"
      }, 
      {
        "type": "PublicationVolume", 
        "volumeNumber": "100"
      }
    ], 
    "name": "Locality-aware task scheduling for homogeneous parallel computing systems", 
    "pagination": "557-595", 
    "productId": [
      {
        "name": "readcube_id", 
        "type": "PropertyValue", 
        "value": [
          "417fb549ffc22f1d2289d4e11438e524d208941d47baf46b06e89d1454e4bc8a"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/s00607-017-0581-6"
        ]
      }, 
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1092476601"
        ]
      }
    ], 
    "sameAs": [
      "https://doi.org/10.1007/s00607-017-0581-6", 
      "https://app.dimensions.ai/details/publication/pub.1092476601"
    ], 
    "sdDataset": "articles", 
    "sdDatePublished": "2019-04-10T20:59", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-uberresearch-data-dimensions-target-20181106-alternative/cleanup/v134/2549eaecd7973599484d7c17b260dba0a4ecb94b/merge/v9/a6c9fde33151104705d4d7ff012ea9563521a3ce/jats-lookup/v90/0000000001_0000000264/records_8684_00000601.jsonl", 
    "type": "ScholarlyArticle", 
    "url": "https://link.springer.com/10.1007%2Fs00607-017-0581-6"
  }
]
 

Download the RDF metadata as:  json-ld nt turtle xml License info

HOW TO GET THIS DATA PROGRAMMATICALLY:

JSON-LD is a popular format for linked data which is fully compatible with JSON.

curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/s00607-017-0581-6'

N-Triples is a line-based linked data format ideal for batch operations.

curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/s00607-017-0581-6'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/s00607-017-0581-6'

RDF/XML is a standard XML format for linked data.

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/s00607-017-0581-6'


 

This table displays all metadata directly associated to this object as RDF triples.

198 TRIPLES      21 PREDICATES      53 URIs      19 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/s00607-017-0581-6 schema:about anzsrc-for:08
2 anzsrc-for:0803
3 schema:author Nac8b38438fb743e48e97cf58ce2def3e
4 schema:citation sg:pub.10.1007/978-3-540-27866-5_30
5 sg:pub.10.1007/s11227-010-0395-1
6 sg:pub.10.1007/s11241-011-9116-y
7 sg:pub.10.1007/s11265-008-0176-8
8 sg:pub.10.1007/s13369-016-2180-9
9 sg:pub.10.1023/a:1019076003163
10 https://doi.org/10.1002/0470121173
11 https://doi.org/10.1016/j.cor.2013.09.004
12 https://doi.org/10.1016/j.parco.2003.09.002
13 https://doi.org/10.1016/j.parco.2012.01.001
14 https://doi.org/10.1016/j.sysarc.2007.01.013
15 https://doi.org/10.1109/71.308533
16 https://doi.org/10.1109/71.503776
17 https://doi.org/10.1109/71.722221
18 https://doi.org/10.1109/71.80160
19 https://doi.org/10.1109/71.993206
20 https://doi.org/10.1109/ccgrid.2012.114
21 https://doi.org/10.1109/dsd.2014.71
22 https://doi.org/10.1109/icppw.2001.951956
23 https://doi.org/10.1109/tc.1984.1676376
24 https://doi.org/10.1109/tcad.2008.923415
25 https://doi.org/10.1109/tpds.2005.64
26 https://doi.org/10.1109/tpds.2013.57
27 https://doi.org/10.1109/tpds.2016.2526682
28 https://doi.org/10.1145/2486159.2486175
29 https://doi.org/10.1155/2005/128026
30 schema:datePublished 2018-06
31 schema:datePublishedReg 2018-06-01
32 schema:description In systems with complex many-core cache hierarchy, exploiting data locality can significantly reduce execution time and energy consumption of parallel applications. Locality can be exploited at various hardware and software layers. For instance, by implementing private and shared caches in a multi-level fashion, recent hardware designs are already optimised for locality. However, this would all be useless if the software scheduling does not cast the execution in a manner that promotes locality available in the programs themselves. Since programs for parallel systems consist of tasks executed simultaneously, task scheduling becomes crucial for the performance in multi-level cache architectures. This paper presents a heuristic algorithm for homogeneous multi-core systems called locality-aware task scheduling (LeTS). The LeTS heuristic is a work-conserving algorithm that takes into account both locality and load balancing in order to reduce the execution time of target applications. The working principle of LeTS is based on two distinctive phases, namely; working task group formation phase (WTG-FP) and working task group ordering phase (WTG-OP). The WTG-FP forms groups of tasks in order to capture data reuse across tasks while the WTG-OP determines an optimal order of execution for task groups that minimizes the reuse distance of shared data between tasks. We have performed experiments using randomly generated task graphs by varying three major performance parameters, namely: (1) communication to computation ratio (CCR) between 0.1 and 1.0, (2) application size, i.e., task graphs comprising of 50-, 100-, and 300-tasks per graph, and (3) number of cores with 2-, 4-, 8-, and 16-cores execution scenarios. We have also performed experiments using selected real-world applications. The LeTS heuristic reduces overall execution time of applications by exploiting inter-task data locality. Results show that LeTS outperforms state-of-the-art algorithms in amortizing inter-task communication cost.
33 schema:genre research_article
34 schema:inLanguage en
35 schema:isAccessibleForFree false
36 schema:isPartOf N2282b4fdcabe4e3cbb74da766a798ba9
37 Na012deec513a4fe99d2c0a6ae5ac6c8e
38 sg:journal.1356894
39 schema:name Locality-aware task scheduling for homogeneous parallel computing systems
40 schema:pagination 557-595
41 schema:productId N0b1d77e6d553407ab832e4f1c7e0cd35
42 N10a3adb694ce47079ccee9945fd2f6e0
43 Nc5a8e4f170c64f76b060f6b908d3a93b
44 schema:sameAs https://app.dimensions.ai/details/publication/pub.1092476601
45 https://doi.org/10.1007/s00607-017-0581-6
46 schema:sdDatePublished 2019-04-10T20:59
47 schema:sdLicense https://scigraph.springernature.com/explorer/license/
48 schema:sdPublisher N5e79285909ec4ff98700d14eabfe8630
49 schema:url https://link.springer.com/10.1007%2Fs00607-017-0581-6
50 sgo:license sg:explorer/license/
51 sgo:sdDataset articles
52 rdf:type schema:ScholarlyArticle
53 N0602ce4687ef427e82ac9eb04864da5f rdf:first sg:person.016560711042.19
54 rdf:rest Ne8d85472e5c840519396a1c6219bb4d1
55 N0b1d77e6d553407ab832e4f1c7e0cd35 schema:name doi
56 schema:value 10.1007/s00607-017-0581-6
57 rdf:type schema:PropertyValue
58 N10a3adb694ce47079ccee9945fd2f6e0 schema:name readcube_id
59 schema:value 417fb549ffc22f1d2289d4e11438e524d208941d47baf46b06e89d1454e4bc8a
60 rdf:type schema:PropertyValue
61 N2282b4fdcabe4e3cbb74da766a798ba9 schema:volumeNumber 100
62 rdf:type schema:PublicationVolume
63 N5e79285909ec4ff98700d14eabfe8630 schema:name Springer Nature - SN SciGraph project
64 rdf:type schema:Organization
65 N75b7def7e29e4247a33bf201d61f2cfb schema:affiliation https://www.grid.ac/institutes/grid.497892.9
66 schema:familyName Amin
67 schema:givenName Sarah
68 rdf:type schema:Person
69 N9eac1e49725d43d2b46118f5669de484 rdf:first sg:person.014234147707.30
70 rdf:rest Ncce1777aa0024a6a9ee9311ffa20d87f
71 Na012deec513a4fe99d2c0a6ae5ac6c8e schema:issueNumber 6
72 rdf:type schema:PublicationIssue
73 Nac8b38438fb743e48e97cf58ce2def3e rdf:first sg:person.015604061305.70
74 rdf:rest Nb276b6aea3c14797a814cb5377f267a8
75 Nb276b6aea3c14797a814cb5377f267a8 rdf:first sg:person.013041676036.90
76 rdf:rest Ne7c4ed4ccf924d3ca7ef4c93dcc17972
77 Nc5a8e4f170c64f76b060f6b908d3a93b schema:name dimensions_id
78 schema:value pub.1092476601
79 rdf:type schema:PropertyValue
80 Ncce1777aa0024a6a9ee9311ffa20d87f rdf:first sg:person.012556045445.72
81 rdf:rest rdf:nil
82 Ne7c4ed4ccf924d3ca7ef4c93dcc17972 rdf:first N75b7def7e29e4247a33bf201d61f2cfb
83 rdf:rest N0602ce4687ef427e82ac9eb04864da5f
84 Ne8d85472e5c840519396a1c6219bb4d1 rdf:first sg:person.01323306501.42
85 rdf:rest N9eac1e49725d43d2b46118f5669de484
86 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
87 schema:name Information and Computing Sciences
88 rdf:type schema:DefinedTerm
89 anzsrc-for:0803 schema:inDefinedTermSet anzsrc-for:
90 schema:name Computer Software
91 rdf:type schema:DefinedTerm
92 sg:journal.1356894 schema:issn 1436-5057
93 1521-9615
94 schema:name Computing
95 rdf:type schema:Periodical
96 sg:person.012556045445.72 schema:affiliation https://www.grid.ac/institutes/grid.5037.1
97 schema:familyName Brorsson
98 schema:givenName Mats
99 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012556045445.72
100 rdf:type schema:Person
101 sg:person.013041676036.90 schema:affiliation https://www.grid.ac/institutes/grid.419609.3
102 schema:familyName Oz
103 schema:givenName Isil
104 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013041676036.90
105 rdf:type schema:Person
106 sg:person.01323306501.42 schema:affiliation https://www.grid.ac/institutes/grid.444761.4
107 schema:familyName Farooq
108 schema:givenName Umer
109 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01323306501.42
110 rdf:type schema:Person
111 sg:person.014234147707.30 schema:affiliation https://www.grid.ac/institutes/grid.6383.e
112 schema:familyName Popov
113 schema:givenName Konstantin
114 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014234147707.30
115 rdf:type schema:Person
116 sg:person.015604061305.70 schema:affiliation https://www.grid.ac/institutes/grid.497892.9
117 schema:familyName Bhatti
118 schema:givenName Muhammad Khurram
119 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015604061305.70
120 rdf:type schema:Person
121 sg:person.016560711042.19 schema:affiliation https://www.grid.ac/institutes/grid.497892.9
122 schema:familyName Mushtaq
123 schema:givenName Maria
124 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016560711042.19
125 rdf:type schema:Person
126 sg:pub.10.1007/978-3-540-27866-5_30 schema:sameAs https://app.dimensions.ai/details/publication/pub.1000221400
127 https://doi.org/10.1007/978-3-540-27866-5_30
128 rdf:type schema:CreativeWork
129 sg:pub.10.1007/s11227-010-0395-1 schema:sameAs https://app.dimensions.ai/details/publication/pub.1010446874
130 https://doi.org/10.1007/s11227-010-0395-1
131 rdf:type schema:CreativeWork
132 sg:pub.10.1007/s11241-011-9116-y schema:sameAs https://app.dimensions.ai/details/publication/pub.1000206249
133 https://doi.org/10.1007/s11241-011-9116-y
134 rdf:type schema:CreativeWork
135 sg:pub.10.1007/s11265-008-0176-8 schema:sameAs https://app.dimensions.ai/details/publication/pub.1003159528
136 https://doi.org/10.1007/s11265-008-0176-8
137 rdf:type schema:CreativeWork
138 sg:pub.10.1007/s13369-016-2180-9 schema:sameAs https://app.dimensions.ai/details/publication/pub.1030685203
139 https://doi.org/10.1007/s13369-016-2180-9
140 rdf:type schema:CreativeWork
141 sg:pub.10.1023/a:1019076003163 schema:sameAs https://app.dimensions.ai/details/publication/pub.1050259985
142 https://doi.org/10.1023/a:1019076003163
143 rdf:type schema:CreativeWork
144 https://doi.org/10.1002/0470121173 schema:sameAs https://app.dimensions.ai/details/publication/pub.1098661312
145 rdf:type schema:CreativeWork
146 https://doi.org/10.1016/j.cor.2013.09.004 schema:sameAs https://app.dimensions.ai/details/publication/pub.1002854217
147 rdf:type schema:CreativeWork
148 https://doi.org/10.1016/j.parco.2003.09.002 schema:sameAs https://app.dimensions.ai/details/publication/pub.1000991694
149 rdf:type schema:CreativeWork
150 https://doi.org/10.1016/j.parco.2012.01.001 schema:sameAs https://app.dimensions.ai/details/publication/pub.1007010700
151 rdf:type schema:CreativeWork
152 https://doi.org/10.1016/j.sysarc.2007.01.013 schema:sameAs https://app.dimensions.ai/details/publication/pub.1003739800
153 rdf:type schema:CreativeWork
154 https://doi.org/10.1109/71.308533 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061217327
155 rdf:type schema:CreativeWork
156 https://doi.org/10.1109/71.503776 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061217533
157 rdf:type schema:CreativeWork
158 https://doi.org/10.1109/71.722221 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061217783
159 rdf:type schema:CreativeWork
160 https://doi.org/10.1109/71.80160 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061217906
161 rdf:type schema:CreativeWork
162 https://doi.org/10.1109/71.993206 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061218186
163 rdf:type schema:CreativeWork
164 https://doi.org/10.1109/ccgrid.2012.114 schema:sameAs https://app.dimensions.ai/details/publication/pub.1093988893
165 rdf:type schema:CreativeWork
166 https://doi.org/10.1109/dsd.2014.71 schema:sameAs https://app.dimensions.ai/details/publication/pub.1095535733
167 rdf:type schema:CreativeWork
168 https://doi.org/10.1109/icppw.2001.951956 schema:sameAs https://app.dimensions.ai/details/publication/pub.1093320354
169 rdf:type schema:CreativeWork
170 https://doi.org/10.1109/tc.1984.1676376 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061533013
171 rdf:type schema:CreativeWork
172 https://doi.org/10.1109/tcad.2008.923415 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061537915
173 rdf:type schema:CreativeWork
174 https://doi.org/10.1109/tpds.2005.64 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061752903
175 rdf:type schema:CreativeWork
176 https://doi.org/10.1109/tpds.2013.57 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061754478
177 rdf:type schema:CreativeWork
178 https://doi.org/10.1109/tpds.2016.2526682 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061755020
179 rdf:type schema:CreativeWork
180 https://doi.org/10.1145/2486159.2486175 schema:sameAs https://app.dimensions.ai/details/publication/pub.1016148315
181 rdf:type schema:CreativeWork
182 https://doi.org/10.1155/2005/128026 schema:sameAs https://app.dimensions.ai/details/publication/pub.1045919881
183 rdf:type schema:CreativeWork
184 https://www.grid.ac/institutes/grid.419609.3 schema:alternateName Izmir Institute of Technology
185 schema:name Computer Engineering Department, Izmir Institute of Technology, Izmir, Turkey
186 rdf:type schema:Organization
187 https://www.grid.ac/institutes/grid.444761.4 schema:alternateName Dhofar University
188 schema:name Department of Electrical and Computer Engineering, Dhofar University, 211, Salalah, Oman
189 rdf:type schema:Organization
190 https://www.grid.ac/institutes/grid.497892.9 schema:alternateName Information Technology University
191 schema:name Embedded Computing Lab, Information Technology University (ITU), 346-B Ferozpur Road, Lahore, Pakistan
192 rdf:type schema:Organization
193 https://www.grid.ac/institutes/grid.5037.1 schema:alternateName Royal Institute of Technology
194 schema:name KTH Royal Institute of Technology, Isafjordsgatan 22, Box 1263, 164 29, Kista, Sweden
195 rdf:type schema:Organization
196 https://www.grid.ac/institutes/grid.6383.e schema:alternateName Swedish Institute of Computer Science
197 schema:name SICS, Isafjordsgatan 22, 164 29, Kista, Sweden
198 rdf:type schema:Organization
 




Preview window. Press ESC to close (or click here)


...