Atenção: Todas as denúncias são sigilosas e sua identidade será preservada.
Os campos nome e e-mail são de preenchimento opcional
Metadados | Descrição | Idioma |
---|---|---|
Autor(es): dc.contributor | Universidade Estadual de Campinas (UNICAMP) | - |
Autor(es): dc.contributor | Universidade Estadual Paulista (Unesp) | - |
Autor(es): dc.creator | Pereira, Marcio M. | - |
Autor(es): dc.creator | Baldassin, Alexandro [UNESP] | - |
Autor(es): dc.creator | Araujo, Guido | - |
Autor(es): dc.creator | Buzato, Luiz Eduardo | - |
Autor(es): dc.creator | IEEE | - |
Data de aceite: dc.date.accessioned | 2022-02-22T00:03:58Z | - |
Data de disponibilização: dc.date.available | 2022-02-22T00:03:58Z | - |
Data de envio: dc.date.issued | 2020-12-09 | - |
Data de envio: dc.date.issued | 2020-12-09 | - |
Data de envio: dc.date.issued | 2013-01-01 | - |
Fonte completa do material: dc.identifier | http://hdl.handle.net/11449/194805 | - |
Fonte: dc.identifier.uri | http://educapes.capes.gov.br/handle/11449/194805 | - |
Descrição: dc.description | In the last few years, Transactional Memories (TMs) have been shown to be a parallel programming model that can effectively combine performance improvement with ease of programming. Moreover, the recent introduction of TM-based ISA extensions, by major microprocessor manufacturers, also seems to endorse TM as a programming model for today's parallel applications. One of the central issues in designing Software TM (STM) systems is to identify mechanisms/heuristics that can minimize contention arising from conflicting transactions. Although a number of mechanisms have been proposed to tackle contention, such techniques have a limited scope, as conflict is avoided by either interrupting or serializing transaction execution, thus considerably impacting performance. To deal with this limitation, we have proposed a new effective transaction scheduler, along with a conflict-avoidance heuristic, that implements a fully cooperative scheduler that switches a conflicting transaction by another with a lower conflicting probability. This paper extends such framework and introduces a new heuristic, built from the combination of our previous conflict avoidance technique with the Contention Intensity heuristic proposed by Yoo and Lee. Experimental results, obtained using the STMBench7 and STAMP benchmarks atop tinySTM, show that the proposed heuristic produces significant speedups when compared to other four solutions. | - |
Descrição: dc.description | Univ Estadual Campinas, Inst Comp, Campinas, SP, Brazil | - |
Descrição: dc.description | UNESP Univ Estadual Paulista, Rio Claro, SP, Brazil | - |
Descrição: dc.description | UNESP Univ Estadual Paulista, Rio Claro, SP, Brazil | - |
Formato: dc.format | 236-245 | - |
Idioma: dc.language | en | - |
Publicador: dc.publisher | Ieee | - |
Relação: dc.relation | 2013 20th International Conference On High Performance Computing (hipc) | - |
???dc.source???: dc.source | Web of Science | - |
Título: dc.title | Transaction Scheduling using Conflict Avoidance and Contention Intensity | - |
Aparece nas coleções: | Repositório Institucional - Unesp |
O Portal eduCAPES é oferecido ao usuário, condicionado à aceitação dos termos, condições e avisos contidos aqui e sem modificações. A CAPES poderá modificar o conteúdo ou formato deste site ou acabar com a sua operação ou suas ferramentas a seu critério único e sem aviso prévio. Ao acessar este portal, você, usuário pessoa física ou jurídica, se declara compreender e aceitar as condições aqui estabelecidas, da seguinte forma: