Back to Results
First PageMeta Content
Concurrency control / Parallel computing / Application programming interfaces / Scheduling / Fortran / OpenMP / Monitor / Thread / Lock / Computing / Computer programming / Concurrent computing


A Comparison of Task Pool Variants in OpenMP and a Proposal for a Solution to the Busy Waiting Problem Alexander Wirz, Michael S¨ uß, and Claudia Leopold University of Kassel, Research Group Programming Languages / Met
Add to Reading List

Document Date: 2014-03-25 15:40:00


Open Document

File Size: 303,68 KB

Share Result on Facebook

City

Kassel / /

Company

AMD / Intel / /

Country

Germany / /

/

Facility

Claudia Leopold University of Kassel / /

IndustryTerm

benchmark applications / loaded systems / possible solution / Irregular algorithms / Irregular applications / yield solution / dual-core processors / parallel algorithm / adequate solution / desktop systems / breadth-first search algorithm / test applications / /

OperatingSystem

POSIX / /

Organization

S¨ uß / and Claudia Leopold University of Kassel / /

Position

system and operating system scheduler / scheduler / programmer / /

ProgrammingLanguage

C++ / /

Technology

eight processors / one processor / four processors / load balancing / search algorithm / Java / 8 processors / API / parallel algorithm / Labyrinth-Search algorithm / operating system / /

SocialTag