Libero Nigro

Prof. Libero Nigro

University of Calabria, Rende, Italy
orcid

Research Focus & Metrics

Academic Career Length

30Years (1997-Present)

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

Representative Publications

View All Publications
1 June 1997 in Computer Standards & Interfaces
Verified
Journal Article
Closed access
Pasquale DapontePasquale Daponte
Pasquale Daponte
DGDomenico Grimaldi
Domenico Grimaldi
LNLibero Nigro
Libero Nigro
FPFrancesco Pupo
Francesco Pupo

1 April 2018 in Simulation Modelling Practice and Theory
Verified
Journal Article
Closed access
FCFranco Cicirelli
Franco Cicirelli
LNLibero Nigro
Libero Nigro
PSPaolo F. Sciammarella
Paolo F. Sciammarella

1 September 2018 in Simulation Modelling Practice and Theory
Verified
Journal Article
Closed access
LNLibero Nigro
Libero Nigro
PSPaolo F. Sciammarella
Paolo F. Sciammarella

24 February 2016 in Concurrency and Computation: Practice and Experience
Verified
Journal Article
Closed access
PDF file
Franco CicirelliFranco Cicirelli
Franco Cicirelli
LNLibero Nigro
Libero Nigro

21 December 2022 in Simulation Modelling Practice and Theory
Verified
Journal Article
Closed access
LNLibero Nigro
Libero Nigro
Franco CicirelliFranco Cicirelli
Franco Cicirelli
PFPasi Fränti
Pasi Fränti

29 March 2022 in Algorithms
Verified
Journal Article
Open access
PDF file
LNLibero Nigro
Libero Nigro
K-means is a well-known clustering algorithm often used for its simplicity and potential efficiency. Its properties and limitations have been investigated by many works reported in the literature. K-means, though, suffers from computational problems when dealing with large datasets with many dimensions and great number of clusters. Therefore, many authors have proposed and experimented different techniques for the parallel execution of K-means. This paper describes a novel approach to parallel K-means which, today, is based on commodity multicore machines with shared memory. Two reference implementations in Java are developed and their performances are compared. The first one is structured according to a map/reduce schema that leverages the built-in multi-threaded concurrency automatically provided by Java to parallel streams. The second one, allocated on the available cores, exploits the parallel programming model of the Theatre actor system, which is control-based, totally lock-free, and purposely relies on threads as coarse-grain “programming-in-the-large” units. The experimental results confirm that some good execution performance can be achieved through the implicit and intuitive use of Java concurrency in parallel streams. However, better execution performance can be guaranteed by the modular Theatre implementation which proves more adequate for an exploitation of the computational resources.