References of "Journal of Supercomputing"
     in
Bookmark and Share    
Full Text
Peer Reviewed
See detailLoginson: a transform and load system for very large-scale log analysis in large IT infrastructures
Vega Moreno, Carlos Gonzalo UL; Roquero, Paula; Leira, Rafael et al

in Journal of Supercomputing (2017), 73(9), 3879-3900

Nowadays, most systems and applications produce log records that are useful for security and monitoring purposes such as debugging programming errors, checking system status, and detecting configuration ... [more ▼]

Nowadays, most systems and applications produce log records that are useful for security and monitoring purposes such as debugging programming errors, checking system status, and detecting configuration problems or even attacks. To this end, a log repository becomes necessary whereby logs can be accessed and visualized in a timely manner. This paper presents Loginson, a high-performance log centralization system for large-scale log collection and processing in large IT infrastructures. Besides log collection, Loginson provides high-level analytics through a visual interface for the purpose of troubleshooting critical incidents. We note that Loginson outperforms all of the other log centralization solutions by taking full advantage of the vertical scalability, and therefore decreasing Capital Expenditure (CAPEX) and Operating Expense (OPEX) costs for deployment scenarios with a huge volume of log data. © 2017, Springer Science+Business Media New York. [less ▲]

Detailed reference viewed: 95 (1 UL)
Full Text
Peer Reviewed
See detailScalable, Low complexity, and fast greedy scheduling heuristics for highly heterogeneous distributed computing systems
Diaz, Cesar UL; Pecero, Johnatan UL; Bouvry, Pascal UL

in Journal of Supercomputing (2013)

Forheterogeneousdistributedcomputingsystems,importantdesignissues are scalability and system optimization. Given such systems, it is crucial to develop low computational complexity algorithms to schedule ... [more ▼]

Forheterogeneousdistributedcomputingsystems,importantdesignissues are scalability and system optimization. Given such systems, it is crucial to develop low computational complexity algorithms to schedule tasks in a manner that exploits the heterogeneity of the resources and applications. In this paper, we report and evalu- ate three scalable, and fast scheduling heuristics for highly heterogeneous distributed computing systems. We conduct a comprehensive performance evaluation study us- ing simulation. The benchmarking outlines the performance of the schedulers, rep- resenting scalability, makespan, flowtime, computational complexity, and memory utilization. The set of experimental results shows that our heuristics perform as good as the traditional approaches, for makespan and flowtime, while featuring lower com- plexity, lower running time, and lower used memory. The experimental results also detail the various scenarios under which certain algorithms excel and fail. [less ▲]

Detailed reference viewed: 156 (0 UL)
Full Text
Peer Reviewed
See detailCellular genetic algorithms without additional parameters
Dorronsoro, Bernabe; Bouvry, Pascal UL

in Journal of Supercomputing (2013), 63(3), 816-835

Cellular genetic algorithms (cGAs) are a kind of genetic algorithms (GAs) with decentralized population in which interactions among individuals are restricted to close ones. The use of decentralized ... [more ▼]

Cellular genetic algorithms (cGAs) are a kind of genetic algorithms (GAs) with decentralized population in which interactions among individuals are restricted to close ones. The use of decentralized populations in GAs allows to keep the population diversity for longer, usually resulting in a better exploration of the search space and, therefore, in a better performance of the algorithm. However, it supposes the need of several new parameters that have a major impact on the behavior of the algorithm. In the case of cGAs, these parameters are the population and neighborhood shapes. We propose in this work two innovative cGAs with new adaptive techniques that allow removing the neighborhood and population shape from the algorithm’s configuration. As a result, the new adaptive cGAs are highly competitive (statistically) with all the compared cGAs in terms of the average solutions found in the continuous and combinatorial domains, while finding, in general, the best solutions for the considered problems, and with less computational effort. [less ▲]

Detailed reference viewed: 142 (1 UL)
Full Text
Peer Reviewed
See detailEditorial: special issue on parallel nature-inspired optimization
Danoy, Grégoire UL

in Journal of Supercomputing (2013), 63(3), 737-739

Detailed reference viewed: 109 (4 UL)
Full Text
Peer Reviewed
See detailOptimisation of the enhanced distance based broadcasting protocol for MANETs
Ruiz, Patricia UL; Dorronsoro, Bernabé UL; Valentini, Giorgio et al

in Journal of Supercomputing (2012), 62(3), 1213-1240

Detailed reference viewed: 219 (2 UL)
Full Text
Peer Reviewed
See detailGreenCloud: a packet-level simulator of energy-aware cloud computing data centers
Kliazovich, Dzmitry UL; Bouvry, Pascal UL; U. Khan, Samee

in Journal of Supercomputing (2012), 62(3), 1263-1283

Cloud computing data centers are becoming increasingly popular for the provisioning of computing resources. The cost and operating expenses of data centers have skyrocketed with the increase in computing ... [more ▼]

Cloud computing data centers are becoming increasingly popular for the provisioning of computing resources. The cost and operating expenses of data centers have skyrocketed with the increase in computing capacity. Several governmental, industrial, and academic surveys indicate that the energy utilized by computing and communication units within a data center contributes to a considerable slice of the data center operational costs. In this paper, we present a simulation environment for energy-aware cloud computing data centers. Along with the workload distribution, the simulator is designed to capture details of the energy consumed by data center components (servers, switches, and links) as well as packet-level communication patterns in realistic setups. The simulation results obtained for two-tier, three-tier, and three-tier high-speed data center architectures demonstrate the effectiveness of the simulator in utilizing power management schema, such as voltage scaling, frequency scaling, and dynamic shutdown that are applied to the computing and networking components. [less ▲]

Detailed reference viewed: 437 (1 UL)