This HTML5 document contains 45 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n23http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n16http://localhost/temp/predkladatel/
n3http://purl.org/net/nknouf/ns/bibtex#
n14http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n5http://linked.opendata.cz/resource/domain/vavai/subjekt/
n4http://linked.opendata.cz/ontology/domain/vavai/
n22https://schema.org/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
rdfshttp://www.w3.org/2000/01/rdf-schema#
n6http://linked.opendata.cz/ontology/domain/vavai/riv/
n21http://bibframe.org/vocab/
n11http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F68407700%3A21240%2F12%3A00205053%21RIV14-MSM-21240___/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n13http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n18http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n15http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n12http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n20http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n10http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n7http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F68407700%3A21240%2F12%3A00205053%21RIV14-MSM-21240___
rdf:type
n4:Vysledek skos:Concept
rdfs:seeAlso
http://www.ipdps.org/ipdps2012/index.html
dcterms:description
Source code compiling is a non-trivial task that requires many computing resources. As a software project grows, its build time increases and debugging on a single computer becomes more and more time consuming task. An obvious solution would be a dedicated cluster acting as a build farm, where developers can send their requests. But in most cases, this solution has a very low utilization of available computing resources which makes it very ineffective. Therefore, we have focused on non-dedicated clusters to perform distributed compilation, where we could use users' computers as nodes of a build farm. We compare two different approaches: distcc, which is an open-source program to distribute compilation of C/C++ code between several computers on a network and Clondike, which is a universal peer-to-peer cluster that is being developed at the Czech Technical University in Prague. A very complex task able to test deeply both systems is a compilation of a Linux Kernel with many config options. We have run this task on a cluster with up to 20 computers and have measured computing times and CPU loads. In this paper, we will present the results of this experiment that indicate the scalability and utilization of given resources in both systems. We also discuss the penalty of a generic solution over a task-specific one. Source code compiling is a non-trivial task that requires many computing resources. As a software project grows, its build time increases and debugging on a single computer becomes more and more time consuming task. An obvious solution would be a dedicated cluster acting as a build farm, where developers can send their requests. But in most cases, this solution has a very low utilization of available computing resources which makes it very ineffective. Therefore, we have focused on non-dedicated clusters to perform distributed compilation, where we could use users' computers as nodes of a build farm. We compare two different approaches: distcc, which is an open-source program to distribute compilation of C/C++ code between several computers on a network and Clondike, which is a universal peer-to-peer cluster that is being developed at the Czech Technical University in Prague. A very complex task able to test deeply both systems is a compilation of a Linux Kernel with many config options. We have run this task on a cluster with up to 20 computers and have measured computing times and CPU loads. In this paper, we will present the results of this experiment that indicate the scalability and utilization of given resources in both systems. We also discuss the penalty of a generic solution over a task-specific one.
dcterms:title
Different Approaches to Distributed Compilation Different Approaches to Distributed Compilation
skos:prefLabel
Different Approaches to Distributed Compilation Different Approaches to Distributed Compilation
skos:notation
RIV/68407700:21240/12:00205053!RIV14-MSM-21240___
n4:predkladatel
n5:orjk%3A21240
n6:aktivita
n15:S n15:I
n6:aktivity
I, S
n6:dodaniDat
n7:2014
n6:domaciTvurceVysledku
n14:9540814 n14:6774695
n6:druhVysledku
n10:D
n6:duvernostUdaju
n18:S
n6:entitaPredkladatele
n11:predkladatel
n6:idSjednocenehoVysledku
131234
n6:idVysledku
RIV/68407700:21240/12:00205053
n6:jazykVysledku
n12:eng
n6:klicovaSlova
Cluster computing; distributed compilation; scalability
n6:klicoveSlovo
n13:scalability n13:distributed%20compilation n13:Cluster%20computing
n6:kontrolniKodProRIV
[9D7B12D7AB78]
n6:mistoKonaniAkce
Shanghai
n6:mistoVydani
Los Alamitos, CA
n6:nazevZdroje
Parallel and Distributed Processing Symposium Workshops & PhD Forum (IPDPSW), 2012 IEEE 26th International
n6:obor
n20:IN
n6:pocetDomacichTvurcuVysledku
2
n6:pocetTvurcuVysledku
2
n6:rokUplatneniVysledku
n7:2012
n6:tvurceVysledku
Tvrdík, Pavel Gattermayer, Josef
n6:typAkce
n23:WRD
n6:wos
000309409400139
n6:zahajeniAkce
2012-05-21+02:00
s:numberOfPages
7
n21:doi
10.1109/IPDPSW.2012.137
n3:hasPublisher
IEEE Computer Soc.
n22:isbn
978-1-4673-0974-5
n16:organizacniJednotka
21240