Go to:
Logótipo
You are in:: Start > Publications > View > Scheduling OR-parallelism in YapOr and ThOr on Multi-Core Machines
Map of Premises
FC6 - Departamento de Ciência de Computadores FC5 - Edifício Central FC4 - Departamento de Biologia FC3 - Departamento de Física e Astronomia e Departamento GAOT FC2 - Departamento de Química e Bioquímica FC1 - Departamento de Matemática
Publication

Scheduling OR-parallelism in YapOr and ThOr on Multi-Core Machines

Title
Scheduling OR-parallelism in YapOr and ThOr on Multi-Core Machines
Type
Article in International Conference Proceedings Book
Year
2012
Authors
Ines Dutra
(Author)
FCUP
View Personal Page You do not have permissions to view the institutional email. Search for Participant Publications View Authenticus page View ORCID page
Ricardo Rocha
(Author)
FCUP
View Personal Page You do not have permissions to view the institutional email. Search for Participant Publications View Authenticus page View ORCID page
Vitor Santos Costa
(Author)
FCUP
View Personal Page You do not have permissions to view the institutional email. Search for Participant Publications View Authenticus page View ORCID page
Joao Santos
(Author)
Other
View Personal Page You do not have permissions to view the institutional email. Search for Participant Publications View Authenticus page Without ORCID
Conference proceedings International
Pages: 1581-1590
26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)
Shanghai, PEOPLES R CHINA, MAY 21-25, 2012
Indexing
Publicação em ISI Web of Knowledge ISI Web of Knowledge - 0 Citations
Publicação em Scopus Scopus - 0 Citations
Scientific classification
FOS: Natural sciences > Computer and information sciences
Other information
Authenticus ID: P-002-F5C
Abstract (EN): In this work we perform a detailed study of different or-scheduling strategies varying several parameters in two or-parallel systems, YapOr and ThOr, running on multi-core machines. Our results show that some kinds of applications are sensitive to the choice of scheduling strategy adopted. In particular, the choice of scheduling parameters mostly affect applications that have short execution times, which, despite having speedups, have their performance significantly affected. Our results also show that topmost dispatching can be more advantageous than bottommost dispatching, a finding that contradicts previous works in this area. One last finding is that YapOr and ThOr are affected differently by changes in scheduling with ThOr performing significantly better than YapOr in several applications.
Language: English
Type (Professor's evaluation): Scientific
Contact: ines@dcc.fc.up.pt; ricroc@dcc.fc.up.pt; vsc@dcc.fc.up.pt; fds@dcc.fc.up.pt; jsantos@dcc.fc.up.pt
No. of pages: 10
Documents
We could not find any documents associated to the publication.
Recommend this page Top
Copyright 1996-2024 © Faculdade de Ciências da Universidade do Porto  I Terms and Conditions  I Acessibility  I Index A-Z  I Guest Book
Page created on: 2024-07-21 at 09:27:11 | Acceptable Use Policy | Data Protection Policy | Complaint Portal