Paper Info
Title
Performance driven cooperation between kernel and auto-tuning multi-threaded interval b&b applications
Abstract
Dynamically determining the appropriate number of threads for a multi-threaded application may lead to a higher efficiency than predetermining the number of threads beforehand. Interval branch-and-bound (B&B) global optimization algorithms are typically irregular algorithms that may benefit from the use of a dynamic number of threads. The question is how to obtain the necessary on line information to decide on the number of threads. We experiment with a scheme following a SPMD (Single Program, Multiple Data) and AMP (Asynchronous Multiple Pool) model. This means that all threads execute the same code and they are consequently affected by the same types of blocked time. There exist several methods to measure the blocked time of an application. The basis for the data to be obtained is the information provided by the Linux Operating System (O.S.) for tasks: task_interruptible and task_uninterruptible block time. We elaborate on this, to determine new metrics allowing kernel and applications to collaborate through system calls in order to decide on the number of threads for an application.
Year
DOI
Venue
2012
10.1007/978-3-642-31125-3_5
ICCSA (1)
Keywords
Field
DocType
appropriate number,asynchronous multiple pool,global optimization algorithm,single program,task_uninterruptible block time,line information,dynamic number,linux operating system,multiple data,multi-threaded application,multi-threaded interval
Kernel (linear algebra),Asynchronous communication,SPMD,Global optimization,Task parallelism,Computer science,Thread (computing),Process (computing),Green threads,Distributed computing
Conference
Volume
ISSN
Citations 
7333
0302-9743
2
PageRank 
References 
Authors
0.41
14
4
Name
Order
Citations
PageRank
Juan Francisco Sanjuan-Estrada120.41
Leocadio Gonzalez Casado251.66
Immaculada García320.41
Eligius M. T. Hendrix413926.97