• Keine Ergebnisse gefunden

Exercise Sheet 2

N/A
N/A
Protected

Academic year: 2021

Aktie "Exercise Sheet 2"

Copied!
1
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

Prof. Dr. Christian Baun

Cloud Computing (WS1314) Faculty of Computer Science and Engineering Fachhochschule Frankfurt am Main

Exercise Sheet 2

Common assumptions about data: It is easy to store, transmit and transport data today. In this exercise sheet, we verify the correctness of these assumptions.

Exercise 1 (Amounts of Data Storing Data)

In the LHC Computing Grid, 15 PB data are created per year. These data need to be stored. What is the height of a stack of storage media, if for storing the data. . .

• CDs (capacity: 600 MB, thickness: 1.2 mm) are used?

• DVDs (capacity: 4.3 GB, thickness: 1.2 mm) are used?

• Blu-ray discs (capacity: 25 GB, thickness: 1.2 mm) are used?

• HDDs (capacity: 2 TB, thickness: 2.5 mm) are used?

Exercise 2 (Amounts of Data Transmitting Data)

The data in the LHC Computing Grid is transmitted via networks that use ber- optic cables and provide a bandwidth of 40 Gbit/s.

• How long does it take to transfer the 15 PB via a 40 Gbit/s network?

• How long does it take to transfer the 15 PB via a 100 Mbps Ethernet?

Exercise 3 (Amounts of Data Transporting Data)

Calculate for each one of these three HDDs, the time which is required to ll the drive completely with data:

• Western Digital AC-2700 3,5 HDD (IDE) from 1994 Capacity: 730 MB

Transfer rate: 5 MB/s

• 3,5 HDD (SATA-2) from 2009/2010 Capacity: 2 TB

Transfer rate: 100 MB/s

• 3,5 HDD (USB 2.0) from 2009/2010 Capacity: 2 TB

Transfer rate: 25 MB/s

Content: General knowledge 1 Discussion: October 24th 2013

Referenzen

ÄHNLICHE DOKUMENTE

Which is the maximal number of rounds k ∈ N such that the Duplicator has a winning strategy for G k ((ab) 2n+1 , (ba) 2n+1 ).. Hint: first see what happens when n=1

Applied Automata Theory (WS 2014/2015) Technische Universit¨ at Kaiserslautern. Exercise

Notice that, as a consequence of your translation, one can interpret assembler programs as above in terms of

[r]

The following problems are about sanitization of input. Note that the automaton A det is completely deterministic since for every pair of states Q and every input symbol a, there is

Faculty of Computer Science and Engineering Fachhochschule Frankfurt am Main.. Exercise