3144 Slices
Medium 9781601322586

Open Source Cloud Computing: Characteristics and an Overview

Hamid R. Arabnia, Hiroshi Ishii, Minoru Ito, Hiroaki Nishikawa, Fernando G. Tinetti, George A. Gravvanis, George Jandieri, and Ashu M. G. Solo CSREA Press PDF

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

243

Open Source Cloud Computing: Characteristics and an Overview

Naylor G. Bachiega1, Henrique P. Martins1, Roberta Spolon1, Marcos A. Cavenaghi1, Renata S.

Lobato2, Aleardo Manacero2

1

Computer Science Dept., Paulista State University – UNESP, Bauru, Brazil

2

Computer Science and Statistics Dept., Paulista State University – UNESP, São José do Rio Preto,

Brazil

Abstract - In an attempt to reduce costs by taking advantage of efficient computing resources, new developed technologies and architectures are gaining wide acceptance in the market. One of such technologies is cloud computing, which uses existing technologies, such as virtualization, trying to solve problems like energy consumption and space allocation in data centers or large companies. This paper presents a study on cloud computing, describing their main characteristics, models of deployment, services, and architectures, including an analysis over its benefits, risks and challenges. It also presents a study over some open-source cloud managers, presenting its advantages and drawbacks. All of this is presented aiming to provide a clear guide for those that are evaluating the possible adoption of cloud technology for their IT problems.

See All Chapters
Medium 9781601322586

Write Buffer Sharing Control in SMT Processors

Hamid R. Arabnia, Hiroshi Ishii, Minoru Ito, Hiroaki Nishikawa, Fernando G. Tinetti, George A. Gravvanis, George Jandieri, and Ashu M. G. Solo CSREA Press PDF

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

251

Write Buffer Sharing Control in SMT Processors

Yilin Zhang and Wei-Ming Lin

Department of Electrical and Computer Engineering

The University of Texas at San Antonio

San Antonio, TX 78249-0669, USA

Abstract— Simultaneous Multi-Threading (SMT) has been widely studied to lend modern-day CPUs a mechanism to improve resource utilization so as to lead to a higher instruction throughput by allowing concurrent execution of multiple independent threads with sharing of key datapath components. The key to a high-performance SMT is to optimize the distribution of shared resources among temporally competing threads. Allowing any of the threads to overwhelm these resources not only leads to unfair thread processing but also may severely degrade overall system throughput.

Write buffer is one of the most critical shared resources in

SMT systems due to its size constraint and potentially long occupancy latency from its data. In this paper, we show that, by limiting the number of write buffer entries each thread is allowed to occupy in the commit stage, the overall system throughput is enhanced by a substantial margin. An improvement in IPC of up to 26% and 95% is observed when the proposed technique is applied to a 4-threaded and an 8-threaded SMT system, respectively.

See All Chapters
Medium 9788131805220

ALLC10-4

Manish Goyal Laxmi Publications PDF

612

NUMERICAL METHODS AND STATISTICAL TECHNIQUES USING ‘C’

Hence for 0 ≤ x ≤ 1,

F(x) =

=

1

[(1 – x)3 M0 + (x – 0)3 M1 + (1 – x) (6f0 – M0) + (x – 0) (6f1 – M1)]

6

1 3

[x (4.8) + (1 – x) (12) + x (– 36 – 4.8)]

6

= 0.8x3 – 8.8x + 2

For 1 ≤ x ≤ 2,

1

[(2 – x)3 M1 + (x – 1)3 M2 + (2 – x) {6f1 – M1} + (x – 1) {6f2 – M2}]

6

F(x) =

=

1

[(2 – x)3 (4.8) + (x – 1)3 (16.8) + (2 – x) {– 36 – 4.8} + (x – 1) {– 48 – 16.8}]

6

= 2x3 – 3.6x2 – 5.2x + 0.8

For 2 ≤ x ≤ 3,

1

[(3 – x)3 M2 + (x – 2)3 M3 + (3 – x) {6f2 – h2M2} + (x – 2) {6f3 – h2M3}]

6

F(x) =

=

F(x) =

=

1

[(3 – x)3 (16.8) + (3 – x) {– 48 – 16.8} + (x – 2) (12)]

6

| using M3 = 0

1

[(27 – x3 – 27x + 9x2) (16.8) – 64.8 (3 – x) + 12x – 24]

6

1

[– 16.8x3 + 151.2x2 – 376.8x + 235.2]

6

= – 2.8x3 + 25.2x2 – 62.8x + 39.2

Therefore cubic splines in different intervals are tabulated as below :

Interval

Cubic spline

[0, 1]

0.8x3 – 8.8x + 2

[1, 2]

2x3 – 3.6x2 – 5.2x + 0.8

[2, 3]

– 2.8x3 + 25.2x2 – 62.8x + 39.2.

Example 2. Obtain cubic spline for every subinterval from the given data : x:

0

1

2

3

f(x) :

1

2

33

244

See All Chapters
Medium 9781601322609

Towards Cycle-Accurate Performance Predictions for Real-Time Embedded Systems

Hamid R. Arabnia, Leonidas Deligiannidis, George Jandieri, Vince Schmidt, Ashu M.G. Solo, Fernando G. Tinetti CSREA Press PDF

Int'l Conf. Software Eng. Research and Practice | SERP'13 |

435

Towards Cycle-Accurate Performance Predictions for Real-Time Embedded

Systems

Konstantinos Triantafyllidis, Egor Bondarev, Peter H.N. de With

Eindhoven University of Technology

5600 MB, Eindhoven, The Netherlands

{k.triantafyllidis, e.bondarev, p.h.n.de.with}@tue.nl

Abstract— In this paper we present a model-based performance analysis method for component-based real-time systems, featuring cycle-accurate predictions of latencies and enhanced system robustness. The method incorporates the following phases: (a) instruction-level profiling of SW components, (b) modeling the obtained performance metrics in MARTEcompatible models, (c) generation, schedulability analysis and simulation of a system model, (d) architecture improvement based on the analysis results. Our proposed method incorporates both the schedulability analysis and the simulation technique, complementing the advantages and eliminating the limitations of the individual steps. Moreover, the cycle-accurate performance metrics initiated by our method lead to accurate performance predictions for an autonomous navigation robot system, with only 6% deviation (or less) from the actual performance metrics.

See All Chapters
Medium 9781601323163

Improved Computing Performance for Algorithm finding the Shortest Path in Extended Graph

Hamid R. Arabnia, George A. Gravvanis, George Jandieri, Ashu M. G. Solo, and Fernando G. Tinetti CSREA Press PDF

14

Int'l Conf. Foundations of Computer Science | FCS'14 |

Improved computing performance for algorithm finding the shortest path in extended graph

Master. Lau Nguyen Dinh1, Assoc. Prof. Chien Tran Quoc2. Dr.of Sc, Assoc. Prof. Thanh Le Manh3. Ph.D

1

College of Transport No II, Danang, Vietnam, E-mail: launhi@gmail.com

2

University of Danang, Danang, Vietnam, Email: tqchien@dce.udn.vn

3

University of Hue, Hue, Vietnam, Email: lmthanh@hueuni.edu.vn

Abstract. The graph is a powerful mathematical tool applied in many fields such as transportation, communication, information technology, economy, …

Up to now, in ordinary graphs the weights of edges and vertexes have only been considered independently where the length of a path is simply the sum of weights of the edges and the vertexes on this path.

However, in many practical problems, weights at a vertex are not the same for all paths passing this vertex, but they depend on the coming and leaving edges. Algorithm finding the shortest path from a vertex to many vertices in the extended graph has also been studied in the paper [1, 6]. In this paper, We build parallel algorithm to find the shortest path from a vertex to many vertices in the extended graph to reduce computation time [2, 3, 4, 5, 7, 8, 9].

See All Chapters

See All Slices