116 Slices
Medium 9781601323262

Session - Parallel Programming and Novel Frameworks + Parallel Architectures and Systems

Hamid R. Arabnia, Lou D'Alotto, Hiroshi Ishii, Minoru Ito, Kazuki Joe, Hiroaki Nishikawa, Georgios Sirakoulis, William Spataro, Giuseppe A. Trunfio, George A. Gravvanis, George Jandieri, Ashu M. G. Solo, Fernando G. Tinetti CSREA Press PDF
Medium 9781601323262

Session - Sixth Complex Systems, Theory and Applications Workshop, CSTAW 2014

Hamid R. Arabnia, Lou D'Alotto, Hiroshi Ishii, Minoru Ito, Kazuki Joe, Hiroaki Nishikawa, Georgios Sirakoulis, William Spataro, Giuseppe A. Trunfio, George A. Gravvanis, George Jandieri, Ashu M. G. Solo, Fernando G. Tinetti CSREA Press PDF
Medium 9781601323262

Three Dimensional Free Space Optical Network Reconfiguration Heuristics Using Active Link Removal

Hamid R. Arabnia, Lou D'Alotto, Hiroshi Ishii, Minoru Ito, Kazuki Joe, Hiroaki Nishikawa, Georgios Sirakoulis, William Spataro, Giuseppe A. Trunfio, George A. Gravvanis, George Jandieri, Ashu M. G. Solo, Fernando G. Tinetti CSREA Press PDF

156

Int'l Conf. Par. and Dist. Proc. Tech. and Appl. | PDPTA'14 |

Three Dimensional Free Space Optical Network

Reconfiguration Heuristics Using Active Link Removal

Xuemei Sun, Danny Luong, and G. Young

Computer Science Department, California State Polytechnic University, Pomona, CA 91768

Abstract

Free Space Optical (FSO) communication is a type of optical communication that relying on beams of light to transmit data over long distances wirelessly. With recent increase in popularity of the technology in commercial applications as well as military and scientific applications, it is important to study new models and algorithms to improve the performance of this technology. One of the most important aspects of FSO network is the line-of-sight (LOS) requirement to sustain an uninterrupted data flow. In order to ensure a steady connection, auto-aligning transceivers can be implemented to overcome the LOS issue. In this paper, we propose several re-alignment algorithms to reconfigure a FSO network when there is a loss of line of sight. The main idea of our experiment is to expand up on the three dimensional FSO network model proposed by Kosumo et al. in 2013, addressing cases that have not been considered.

See All Chapters
Medium 9781601323262

A Novel Method to Minimize Side Effects by Cache Contention on the Inclusive Multi-Core Shared Cache

Hamid R. Arabnia, Lou D'Alotto, Hiroshi Ishii, Minoru Ito, Kazuki Joe, Hiroaki Nishikawa, Georgios Sirakoulis, William Spataro, Giuseppe A. Trunfio, George A. Gravvanis, George Jandieri, Ashu M. G. Solo, Fernando G. Tinetti CSREA Press PDF

A Novel Method to Minimize Side Effects by Cache

Contention on the Inclusive Multi-Core Shared Cache

Hyo-Joong Suh1

School of Computer Science and Information Engineering,

The Catholic University of Korea, Bucheon-si, Gyeonggi-do, Korea

1

Abstract - Cache contention is annoying issue of the multicore processors with private L1 cache and inclusive shared L2 cache. If core P1 runs with small working set which fits in its

L1 cache while core P2 runs cache consuming process, loaded blocks in the shared L2 cache by P1 are extinguished by frequent access from P2. Furthermore, it incurs an inevitable invalidate to the L1 cache of the core P1 by the multi-level cache inclusion property. This study focused on this problem, and solves by access grouping with extension of cache status. Simulation results show the proposed method minimizes the side effects by the cache contention on the inclusive shared cache.

workloads are dispatched on the each core with shared L2 cache, lightweight core is disturbed by invalidation requests to maintain the inclusion property between caches. Fig. 2 shows the cache contention [2] and invalidation by inclusion which this study addressed to resolve.

See All Chapters
Medium 9781601323262

Simulation of a Centralized Reputation System for VANETS

Hamid R. Arabnia, Lou D'Alotto, Hiroshi Ishii, Minoru Ito, Kazuki Joe, Hiroaki Nishikawa, Georgios Sirakoulis, William Spataro, Giuseppe A. Trunfio, George A. Gravvanis, George Jandieri, Ashu M. G. Solo, Fernando G. Tinetti CSREA Press PDF

142

Int'l Conf. Par. and Dist. Proc. Tech. and Appl. | PDPTA'14 |

SIMULATION OF A CENTRALIZED REPUTATION

SYSTEM FOR VANETS

Mário Cleber Bidóia1, Marcos Antônio1 Cavenaghi, Roberta Spolon1, Renata Spolon2, Aleardo

Manacero Jr.2, Daniel Correa Lobato3

1

Department of Computing, Univ. EstadualPaulista - UNESP, Bauru, SP, Brazil

2

Computer Science and Statistics Dept, Univ. EstadualPaulista - UNESP, São José do Rio Preto, SP, Brazil

3

Instituto Federal de Educação, Ciência e Tecnologia de São Paulo – IFSP, Catanduva, SP, Brazil

Abstract:A new network paradigm Ad HoC has been widely studied and developed; these are the vehicular ad hoc networks (VANETs - Vehicular Ad hoc Networks).

Assuming that cars are increasingly "smart", the VANETs emerged with the proposal to provide communication among vehicles of highways. This communication aims to ensure greater security for members involved in transit.

Seeking to ensure this security it is necessary that the data exchanged among vehicles are reliable. One of the techniques discussed in this proposal is the use of reputation systems. In this technique, the confidence in the vehicles is based on votes from its neighbors. In other words, the more vehicles have positive reviews, the more reliable they are and vice versa. In this work, the proposal was to model and simulate a centralized reputation system, where a central unit is responsible for managing reputations. With this centralized system, the reputations of vehicles that have been evaluated are stored indefinitely and can be accessed anytime and anywhere. With the implementation and simulation, we were able to demonstrate that a vehicle, after being evaluated, has its reputation available at any time and place, preventing this malicious vehicle to succeed in later attacks.

See All Chapters

See All Slices