Petar Radojković

Petar Radojković

Auto-generated profile, based on publicly available information

Petar Radojković

Barcelona Supercomputing Center, Barcelona, Spain

Research Focus & Metrics

Academic Career Length

31Years (1996-Present)

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

Representative Publications

View All Publications
26 January 2012 in ACM Transactions on Architecture and Code Optimization
Verified
Journal Article
Open access
PRPetar Radojković
Petar Radojković
SGSylvain Girbal
Sylvain Girbal
AGArnaud Grasset
Arnaud Grasset
EQEduardo Quiñones
Eduardo Quiñones
SYSami Yehia
Sami Yehia
FCFrancisco J. Cazorla
Francisco J. Cazorla
Commercial Off-The-Shelf (COTS) processors are now commonly used in real-time embedded systems. The characteristics of these processors fulfill system requirements in terms of time-to-market, low cost, and high performance-per-watt ratio. However, multithreaded (MT) processors are still not widely used in real-time systems because the timing analysis is too complex. In MT processors, simultaneously-running tasks share and compete for processor resources, so the timing analysis has to estimate the possible impact that the inter-task interferences have on the execution time of the applications. In this paper, we propose a method that quantifies the slowdown that simultaneously-running tasks may experience due to collision in shared processor resources. To that end, we designed benchmarks that stress specific processor resources and we used them to (1) estimate the upper limit of a slowdown that simultaneously-running tasks may experience because of collision in different shared processor resources, and (2) quantify the sensitivity of time-critical applications to collision in these resources. We used the presented method to determine if a given MT processor is a good candidate for systems with timing requirements. We also present a case study in which the method is used to analyze three multithreaded architectures exhibiting different configurations of resource sharing. Finally, we show that measuring the slowdown that real applications experience when simultaneously-running with resource-stressing benchmarks is an important step in measurement-based timing analysis. This information is a base for incremental verification of MT COTS architectures.

1 May 2014
Verified
Conference Paper
Closed access
IGIvan Grasso
Ivan Grasso
PRPetar Radojkovic
Petar Radojkovic
NRNikola Rajovic
Nikola Rajovic
IGIsaac Gelado
Isaac Gelado
ARAlex Ramirez
Alex Ramirez
A lot of effort from academia and industry has been invested in exploring the suitability of low-power embedded technologies for HPC. Although state-of-the-art embedded systems-on-chip (SoCs) inherently contain GPUs that could be used for HPC, their performance and energy capabilities have never been evaluated. Two reasons contribute to the above. Primarily, embedded GPUs until now, have not supported 64-bit floating point arithmetic - a requirement for HPC. Secondly, embedded GPUs did not provide support for parallel programming languages such as OpenCL and CUDA. However, the situation is changing, and the latest GPUs integrated in embedded SoCs do support 64-bit floating point precision and parallel programming models. In this paper, we analyze performance and energy advantages of embedded GPUs for HPC. In particular, we analyze ARM Mali-T604 GPU - the first embedded GPUs with OpenCL Full Profile support. We identify, implement and evaluate software optimization techniques for efficient utilization of the ARM Mali GPU Compute Architecture. Our results show that, HPC benchmarks running on the ARM Mali-T604 GPU integrated into Exynos 5250 SoC, on average, achieve speed-up of 8.7X over a single Cortex-A15 core, while consuming only 32% of the energy. Overall results show that embedded GPUs have performance and energy qualities that make them candidates for future HPC systems.

3 March 2012
Verified
Conference Paper
Open access
PDF file
PRPetar Radojković
Petar Radojković
VČVladimir Čakarević
Vladimir Čakarević
MMMiquel Moretó
Miquel Moretó
JVJavier Verdú
Javier Verdú
APAlex Pajuelo
Alex Pajuelo
MVMateo Valero
Mateo Valero

23 October 2012 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
PRPetar Radojkovic
Petar Radojkovic
VCVladimir Cakarevic
Vladimir Cakarevic
JVJavier Verdu
Javier Verdu
APAlex Pajuelo
Alex Pajuelo
FCFrancisco J. Cazorla
Francisco J. Cazorla
MVMateo Valero
Mateo Valero
The introduction of multithreaded processors comprised of a large number of cores with many shared resources makes thread scheduling, and in particular optimal assignment of running threads to processor hardware contexts to become one of the most promising ways to improve the system performance. However, finding optimal thread assignments for workloads running in state-of-the-art multicore/multithreaded processors is an NP-complete problem. In this paper, we propose BlackBox scheduler, a systematic method for thread assignment of multithreaded network applications running on multicore/multithreaded processors. The method requires minimum information about the target processor architecture and no data about the hardware requirements of the applications under study. The proposed method is evaluated with an industrial case study for a set of multithreaded network applications running on the UltraSPARC T2 processor. In most of the experiments, the proposed thread assignment method detected the best actual thread assignment in the evaluation sample. The method improved the system performance from 5 to 48 percent with respect to load balancing algorithms used in state-of-the-art OSs, and up to 60 percent with respect to a naive thread assignment.

12 December 2009
Verified
Conference Paper
Open access
PDF file
VČVladimir Čakarević
Vladimir Čakarević
PRPetar Radojković
Petar Radojković
JVJavier Verdú
Javier Verdú
APAlex Pajuelo
Alex Pajuelo
FCFrancisco J. Cazorla
Francisco J. Cazorla
MVMateo Valero
Mateo Valero
Thread level parallelism (TLP) has become a popular trend to improve processor performance, overcoming the limitations of extracting instruction level parallelism. Each TLP paradigm, such as Simultaneous Multithreading or Chip-Multiprocessors, provides di erent bene ts, which has motivated processor vendors to combine several TLP paradigms in each chip design. Even if most of these combined-TLP designs are homogeneous, they present di erent levels of hardware resource sharing, which introduces complexities on the operating system scheduling and load balancing.\ud Commonly, processor designs provide two levels of resource sharing: Inter-core in which only the highest levels of the cache hierarchy are shared, and Intracore in which\ud most of the hardware resources of the core are shared . Recently, Sun Microsystems has released the UltraSPARC T2, a processor with three levels of hardware resource sharing:\ud InterCore, IntraCore, and IntraPipe. In this work, we provide the rst characterization of a three-level resource sharing processor, the UltraSPARC T2, and we show how\ud multi-level resource sharing a ects the operating system design. We further identify the most critical hardware resources in the T2 and the characteristics of applications that are not sensitive to resource sharing. Finally, we present a case study in which we run a real multithreaded network application, showing that a resource sharing aware scheduler can improve the system throughput up to 55%.Peer ReviewedPostprint (published version

1 October 2008
Verified
Conference Paper
Closed access
PRPetar Radojkovic
Petar Radojkovic
VCVladimir Cakarevic
Vladimir Cakarevic
JVJavier Verdú
Javier Verdú
APAlejandro Pajuelo
Alejandro Pajuelo
RGRoberto Gioiosa
Roberto Gioiosa
MVMateo Valero
Mateo Valero
Numerous studies have shown that operating system (OS)noise is one of the reasons for significant performance degradation in clustered architectures. Although many studies examine the OS noise for high performance computing (HPC),especially in multi-processor/core systems, most of them focus on 2- or 4-core systems. In this paper, we analyze the major sources of OS noise on a massive multithreading processor, the Sun UltraSPARC T1,running Linux and Solaris. Since a real system is too complex to analyze, we compare those results with a low-overhead runtime environment: the Netra Data Plane Software Suite (Netra DPS). Our results show that the overhead introduced by the OStimer interrupt in Linux and Solaris depends on the particular core and hardware context in which the application is running. This overhead is up to 30% when the application is executed on the same hardware context of the timer interrupt handler and up to 10% when the application and the timer interrupt handler run on different contexts but on the same core.We detect no overhead when the benchmark and the timer interrupt handler run on different cores of the processor.