Julita Corbalan

Julita Corbalan

Auto-generated profile, based on publicly available information

Julita Corbalan

Polytechnic University of Catalonia, Barcelona, Spain

Research Focus & Metrics

Academic Career Length

28Years (1999-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 April 2012 in Journal of Parallel and Distributed Computing
Verified
Journal Article
Closed access
MEM. Etinski
M. Etinski
JCJ. Corbalan
J. Corbalan
JLJ. Labarta
J. Labarta
MVM. Valero
M. Valero

1 December 2012 in Parallel Computing
Verified
Journal Article
Closed access
MEM. Etinski
M. Etinski
JCJ. Corbalan
J. Corbalan
JLJ. Labarta
J. Labarta
MVM. Valero
M. Valero

1 November 2008
Verified
Conference Paper
Closed access
ADAlejandro Duran
Alejandro Duran
JCJulita Corbalan
Julita Corbalan
EAEduard Ayguadé
Eduard Ayguadé
In task parallel languages, an important factor for achieving a good performance is the use of a cut-off technique to reduce the number of tasks created. Using a cut-off to avoid an excessive number of tasks helps the runtime system to reduce the total overhead associated with task creation, particularlt if the tasks are fine grain. Unfortunately, the best cut-off technique its usually dependent on the application structure or even the input data of the application. We propose a new cut-off technique that, using information from the application collected at runtime, decides which tasks should be pruned to improve the performance of the application. This technique does not rely on the programmer to determine the cut-off technique that is best suited for the application. We have implemented this cut-off in the context of the new OpenMP tasking model. Our evaluation, with a variety of applications, shows that our adaptive cut-off is able to make good decisions and most of the time matches the optimal cut-off that could be set by hand by a programmer.

1 January 2008 in Lecture Notes in Computer Science
Verified
Book Chapter
Closed access
PDF file
ADAlejandro Duran
Alejandro Duran
JCJulita Corbalán
Julita Corbalán
EAEduard Ayguadé
Eduard Ayguadé

1 August 2010
Verified
Conference Paper
Closed access
MEMaja Etinski
Maja Etinski
JCJulita Corbalan
Julita Corbalan
JLJesus Labarta
Jesus Labarta
MVMateo Valero
Mateo Valero
Never-ending striving for performance has resulted in a tremendous increase in power consumption of HPC centers. Power budgeting has become very important from several reasons such as reliability, operating costs and limited power draw due to the existing infrastructure. In this paper we propose a power budget guided job scheduling policy that maximize overall job performance for a given power budget. We have shown that using DVFS under a power constraint performance can be significantly improved as it allows more jobs to run simultaneously leading to shorter wait times. Aggressiveness of frequency scaling applied to a job depends on instantaneous power consumption and on the job's predicted performance. Our policy has been evaluated for four workload traces from systems in production use with up to 4 008 processors. The results show that our policy achieves up to two times better performance compared to power budgeting without DVFS. Moreover it leads to 23% lower CPU energy consumption on average. Furthermore, we have investigated how much job performance and energy efficiency can be improved under our policy and same power budget by an increase in the number of DVFS enabled processors.

1 May 1999
Verified
Conference Paper
Open access
PDF file
XMXavier Martorell
Xavier Martorell
EAEduard Ayguadé
Eduard Ayguadé
NNNacho Navarro
Nacho Navarro
JCJulita Corbalán
Julita Corbalán
MGMarc González
Marc González
JLJesús Labarta
Jesús Labarta
This paper presents some techniques for efficient t hread forking and joining in parallel execution environments, taking into consideration the physical structure of NUMA machines and the support for multi-level parallelization and p rocessor grouping. T wo work g eneration schemes and one join mechanism are designed, implemented, evaluated and compared with the ones used in the IRIX MP library, an efficient implementation which supports a single level of parallelism. Supporting multiple levels of parallelism is a current research goal, both in shared and distributed memory machines. Our proposals include a first work generation scheme (GWD, or global work descriptor) which supports multiple levels of parallelism, but not processor grouping. The second work generation scheme (LWD, or local work descriptor) has been designed to support multiple levels of parallelism and p rocessor grouping. Processor grouping is needed to d istribute processors among d ifferent parts of the computation and maintain the working set of each processor across different parallel constructs. The mechanisms are e valuated using synthetic benchmarks, two SPEC95fp applications and one NAS application. The performance e valuation concludes that: i ) the overhead o f the proposed mechanisms is similar to the overhead o f the e xisting ones when exploiting a single level of parallelism, and ii) a remarkable improvement in performance is obtained for applications that have multiple levels of parallelism. The comparison with the traditional single-level parallelism exploitation gives an improvement i n the range of 30-65% for these applications.