@INPROCEEDINGS{andrzejak2006a, AUTHOR = {Andrzejak, Artur and Domingues, Patricio and Silva, Luis}, TITLE = {{Predicting Machine Availabilities in Desktop Pools (short paper)}}, BOOKTITLE = {10th IEEE/IFIP Network Operations and Management Symposium (NOMS'2006)}, YEAR = {2006}, PAGES = {1-4}, ADDRESS = {Vancouver, Canada}, MONTH = {April}, ABSTRACT = {This paper describes a study of predicting machine availabilities and user presence in a pool of desktop computers. The study is based on historical traces collected from 32 machines, and shows that robust prediction accuracy can be achieved even in this highly volatile environment. The employed methods include a multitude of classification methods known from data mining, such as Bayesian methods and Support Vector Machines. Further contribution is a time series framework used in the study which automates correlations search and attribute selection, and allows for easy reconfiguration and efficient prediction. The results illustrate the utility of prediction techniques in highly dynamic computing environments. Potential applications for proactive management of desktop pools are discussed.}, ANNOTE = {DATE-ADDED : 2006-09-06 13:39:57 +0200}, DOI = {10.1109/NOMS.2006.1687632}, FILE = {200604_NOMS.pdf:PUBLICATIONS_PDF/PDF_web/200604_NOMS.pdf:PDF}, TYPE_PUBLI = {icolcomlec}, URL = {http://dx.doi.org/10.1109/NOMS.2006.1687632}, PDF = {PUBLICATIONS_PDF/PDF_web/200604_NOMS.pdf} }
@TECHREPORT{coregrid:tr0026, AUTHOR = {Andrzejak, Artur and Domingues, Patricio and Silva, Luis}, TITLE = {{Classifier-based Capacity Prediction for Desktop Grids}}, INSTITUTION = {Institute on System Architecture, CoreGRID - Network of Excellence}, YEAR = {2006}, NUMBER = {TR-0026}, MONTH = {January}, TYPE_PUBLI = {rapport}, URL = {http://www.coregrid.net/mambo/images/stories/TechnicalReports/tr-0026.pdf} }
@INPROCEEDINGS{andrzejak2005, AUTHOR = {Andrzejak, Artur and Domingues, Patricio and Silva, Luis}, TITLE = {{Classifier-Based Capacity Prediction for Desktop Grids}}, BOOKTITLE = {Integrated Research in Grid Computing - CoreGRID Workshop}, YEAR = {2005}, ADDRESS = {Pisa, Italy}, ABSTRACT = {This paper describes a study of predicting machine availabilities and user presence in a pool of desktop computers. The study is based on historical traces collected from 32 machines, and shows that robust prediction accuracy can be achieved even in this highly volatile environment. The employed methods include a multitude of classification methods known from data mining, such as Bayesian methods and Support Vector Machines. Further contribution is a time series framework used in the study which automates correlations search and attribute selection, and allows for easy reconfiguration and efficient prediction. The results illustrate the utility of prediction techniques in highly dynamic computing environments. Potential applications for proactive management of desktop pools are discussed.}, ANNOTE = {DATE-ADDED : 2006-09-06 13:37:52 +0200}, FILE = {200511_coreGRID_Classifier-Based_Capacity_Prediction_for_DG.pdf:PUBLICATIONS_PDF/PDF_web/200511_coreGRID_Classifier-Based_Capacity_Prediction_for_DG.pdf:PDF}, PDF = {PUBLICATIONS_PDF/PDF_web/200511_coreGRID_Classifier-Based_Capacity_Prediction_for_DG.pdf}, TYPE_PUBLI = {icolcomlec} }
@INPROCEEDINGS{araujo2006vdg, AUTHOR = {Filipe Araujo and Patricio Domingues and Derrick Kondo and Luis Silva}, TITLE = {{Validating Desktop Grid Results by Comparing Intermediate Checkpoints}}, BOOKTITLE = {3th Integration Workshop, CoreGRID - Network of Excellence}, YEAR = {2006}, ADDRESS = {Krakow, Poland}, MONTH = {October}, ABSTRACT = { We present a scheme based on the comparison of intermediate checkpoints that accelerates the detection of computing errors of bag-of-tasks executed on volunteer desktop grids. Currently, in the state-of-the-art, replicated task execution is used for result validation. Our method also uses replication, but instead of only comparing results at the end of the replicated computations, we validate ongoing executions by comparing checkpoints of their intermediate execution points. This scheme significantly reduces the time to detect a computational error, which we show with both theoretical analysis and simulation results. In particular, we develop a model that gives the benefit of intermediate checkpointing as a function of checkpoint frequency and error rate, and we confirm this model with simulation experiments. We find that with an error rate of 5\% and checkpoint frequency of 20 times per task, the gain is as high as 35\% compared to the case where error detection is done only at the end of task execution; for higher checkpoint frequencies or high error rates, the benefits are even greater. In addition, when an erroneous computation is detected at an intermediate execution point, we propose the immediate replacement of that computation with a correct replica from another worker. In this way, useful execution and further validation can continue from that point onward instead of being delayed.}, FILE = {200610_ValidatingDGResults_Krakow.pdf:PUBLICATIONS_PDF/PDF_web/200610_ValidatingDGResults_Krakow.pdf:PDF}, TYPE_PUBLI = {icolcomlec}, PDF = {PUBLICATIONS_PDF/PDF_web/200905_EdgesMon_PCGRID.pdf} }
@ARTICLE{araujo2011jpdc, AUTHOR = {Filipe Araujo and Jorge Farinha and Patricio Domingues and Gheorghe Cosmin Silaghi and Derrick Kondo}, TITLE = {A maximum independent set approach for collusion detection in voting pools}, JOURNAL = {Journal of Parallel and Distributed Computing}, YEAR = {2011}, VOLUME = {71}, PAGES = {1356 - 1366}, NUMBER = {10}, EID = {Springer}, ABSTRACT = {From agreement problems to replicated software execution, we frequently find scenarios with voting pools. Unfortunately, Byzantine adversaries can join and collude to distort the results of an election. We address the problem of detecting these colluders, in scenarios where they repeatedly participate in voting decisions. We investigate different malicious strategies, such as naïve or colluding attacks, with fixed identifiers or in whitewashing attacks. Using a graph-theoretic approach, we frame collusion detection as a problem of identifying maximum independent sets. We then propose several new graph-based methods and show, via analysis and simulations, their effectiveness and practical applicability for collusion detection.}, DOI = {DOI: 10.1016/j.jpdc.2011.06.004}, ISSN = {0743-7315}, KEYWORDS = {Collusion detection}, TYPE_PUBLI = {irevcomlec}, URL = {http://mescal.imag.fr/membres/derrick.kondo/pubs/araujo_jpdc11.pdf} }
@INPROCEEDINGS{araujo2009mep, AUTHOR = {Araujo, F. and Santiago, D. and Ferreira, D. and Farinha, J. and Silva, L. M. and Domingues, P. and Urbah, E. and Lodygensky, O. and Marosi, A. and Gombás, G. and Balaton, Z. and Farkas, Z. and Kacsuk, P.}, TITLE = {{Monitoring the EDGeS Project Infrastructure}}, BOOKTITLE = {3rd Workshop on Desktop Grids and Volunteer Computing Systems (PCGrid 2009)}, YEAR = {2009}, ADDRESS = {Rome, Italy}, MONTH = {May}, PUBLISHER = {IEEE Computer Society}, FILE = {200905_EdgesMon_PCGRID.pdf:PUBLICATIONS_PDF/PDF_web/200905_EdgesMon_PCGRID.pdf:PDF}, KEYWORDS = {Monitoring, BOINC, EGEE, Xtremweb, desktop grid, service grid}, OWNER = {Owner}, TIMESTAMP = {2009.05.17}, TYPE_PUBLI = {icolcomlec}, PDF = {PUBLICATIONS_PDF/PDF_web/200905_EdgesMon_PCGRID.pdf} }
@PHDTHESIS{patricio2008phdthesis, AUTHOR = {Patricio Domingues}, TITLE = {{Dependability Mechanisms for Desktop Grids}}, SCHOOL = {University of Coimbra}, YEAR = {2008}, MONTH = {December}, ABSTRACT = {It is a well-known fact that most of the computing power spread over the Internet simply goes unused, with CPU and other resources sitting idle most of the time: on average less than 5\% of the CPU time is effectively used. Desktop grids are software infrastructures that aim to exploit the otherwise idle processing power, making it available to users that require computational resources to solve long-running applications. The outcome of some efforts to harness idle machines can be seen in public projects such as SETI@home and Folding@home that boost impressive performance figures, in the order of several hundreds of TFLOPS each. At the same time, many institutions, both academic and corporate, run their own desktop grid platforms. However, while desktop grids provide free computing power, they need to face important issues like fault tolerance and security, two of the main problems that harden the widespread use of desktop grid computing. In this thesis, we aim to exploit a set of fault tolerance techniques, such as checkpointing and redundant executions, to promote faster turnaround times. We start with an experimental study, where we analyze the availability of the computing resources of an academic institution. We then focus on the benefits of sharing checkpoints in both institutional and wide-scale environments. We also explore hybrid schemes, where the traditional centralized desktop grid organization is complemented with peer-to-peer resources. Another major issue regarding desktop grids is related with the level of trust that can be achieved relatively to the volunteered hosts that carry out the executions. We propose and explore several mechanisms aimed at reducing the waste of computational resources needed to detect incorrect computations. For this purpose, we detail a checkpoint-based scheme for early detection of errors. We also propose and analyze an invitation-based strategy coupled to a credit rewarding scheme, to allow the enrollment and filtering of more trustworthy and more motivated resource donors. To summarize, we propose and study several fault tolerance methodologies oriented toward a more efficient usage of resources, resorting to techniques such as checkpointing, replication and sabotage tolerance to fasten and to make more reliable executions that are carried over desktop grid resources. The usage of techniques like these ones will be of ultimate importance for the wider deployment of applications over desktop grids.}, FILE = {PatricioDomingues_PhD_thesis---WEB.pdf:PUBLICATIONS_PDF/PDF_web/PatricioDomingues_PhD_thesis---WEB.pdf:PDF}, KEYWORDS = {Desktop grid, fault tolerance, dependability, BOINC, volunteer computing, checkpoint, scheduling}, OWNER = {Owner}, TIMESTAMP = {2009.05.05}, TYPE_PUBLI = {these}, PDF = {PUBLICATIONS_PDF/PDF_web/PatricioDomingues_PhD_thesis---WEB.pdf} }
@MASTERSTHESIS{domingues1999msc, AUTHOR = {Patricio Domingues}, TITLE = {Balanceamento de Carga para Aplicações Paralelas com Distribuição Regular de Dados Executadas em Sistemas Distribuídos}, SCHOOL = {University of Coimbra}, YEAR = {1999}, MONTH = {May}, NOTE = {(in Portuguese)}, COMMENT = {(in Portuguese)}, OWNER = {Owner}, TIMESTAMP = {2007.08.13}, TYPE_PUBLI = {these} }
@TECHREPORT{domingues1995epcc, AUTHOR = {Patricio Domingues}, TITLE = {{Application Engineering Tool for MPI and PUL}}, INSTITUTION = {Edinburgh Parallel Computing Centre, EPCC}, YEAR = {1995}, NUMBER = {EPCC-SS95-12}, MONTH = {September}, FILE = {1995_epcc_patricio.pdf:PUBLICATIONS_PDF/PDF_web/1995_epcc_patricio.pdf:PDF}, TYPE_PUBLI = {rapport}, PDF = {PUBLICATIONS_PDF/PDF_web/1995_epcc_patricio.pdf} }
@TECHREPORT{coregrid:tr0027, AUTHOR = {Domingues, Patricio and Andrzejak, Artur and Silva, Luis}, TITLE = {{Scheduling for Fast Turnaround Time on Institutional Desktop Grid}}, INSTITUTION = {Institute on System Architecture, CoreGRID - Network of Excellence}, YEAR = {2006}, NUMBER = {TR-0027}, MONTH = {January}, TYPE_PUBLI = {rapport}, URL = {http://www.coregrid.net/mambo/images/stories/TechnicalReports/tr-0027.pdf} }
@INPROCEEDINGS{domingues2006sft, AUTHOR = {Patricio Domingues and Artur Andrzejak and Luis Silva }, TITLE = {{Scheduling for Fast Turnaround Time on Institutional Desktop Grid}}, BOOKTITLE = {Second CoreGRID Workshop on Grid and Peer to Peer Systems Architecture}, YEAR = {2006}, ADDRESS = {Paris, France}, MONTH = {January}, ABSTRACT = {Institutional desktop grids, that is, grids comprised by the desktop machines of an institution (academic or corporate) can act as an important source of computing power for local user, if the high volatility of such resources is properly harnessed. In this paper, we focus on scheduling techniques that can improve turnaround time of bag-of-tasks applications. For that purpose, we combine shared-checkpoint management with several scheduling methods like FCFS, adaptive timeout, simple replication and short-term availability predictions. The main goal is to minimize turnaround time by reducing negative effects of resources volatility on the executions of bag-of-tasks applications. We present and assess several scheduling policies oriented toward fast turnaround times, and assess them through trace-based simulations over the resources of 32 machines of two classrooms of an academic environment.}, FILE = {200601_Coregrid_Paris_Scheduling.pdf:PUBLICATIONS_PDF/PDF_web/200601_Coregrid_Paris_Scheduling.pdf:PDF}, TYPE_PUBLI = {icolcomlec}, PDF = {PUBLICATIONS_PDF/PDF_web/200601_Coregrid_Paris_Scheduling.pdf} }
@INPROCEEDINGS{Domingues2006, AUTHOR = {Domingues, Patricio and Andrzejak, Artur and Silva, Luis Moura}, TITLE = {{Using Checkpointing to Enhance Turnaround Time on Institutional Desktop Grids}}, BOOKTITLE = {e-Science'06: Proceedings of the Second IEEE International Conference on e-Science and Grid Computing}, YEAR = {2006}, PAGES = {73-81}, ADDRESS = {Amsterdam, Netherlands}, MONTH = {December}, PUBLISHER = {IEEE Computer Society}, ABSTRACT = {In this paper, we present a checkpoint-based scheme to improve the turnaround time of bag-of-tasks applications executed on institutional desktop grids. We propose to share checkpoints among desktop machines in order to reduce the negative impact of resource volatility. Several scheduling policies are evaluated in our study: FCFS, adaptive timeouts, simple replication, replication with checkpoint on demand, and prediction-based checkpointing combined with replication. We used a set of real traces collected from an academic desktop grid environment to perform trace-driven simulations of the proposed scheduling algorithms. The results show that using a shared checkpoint approach may considerably reduce the turnaround time of the applications when compared to the private checkpoints methodology.}, ANNOTE = {OWNER : artur}, DOI = {10.1109/E-SCIENCE.2006.148}, FILE = {200612_eScience2006_Scheduling_with_checkpointing.pdf:PUBLICATIONS_PDF/PDF_web/200612_eScience2006_Scheduling_with_checkpointing.pdf:PDF}, ISBN = {0-7695-2734-5}, KEY = {WP4}, TYPE_PUBLI = {icolcomlec}, PDF = {PUBLICATIONS_PDF/PDF_web/200612_eScience2006_Scheduling_with_checkpointing.pdf} }
@INPROCEEDINGS{domingues2009epi, AUTHOR = {Patricio Domingues and Filipe Araujo and L.M. Silva}, TITLE = {{Evaluating the Performance and Intrusiveness of Virtual Machines for Desktop Grid Computing}}, BOOKTITLE = {3rd Workshop on Desktop Grids and Volunteer Computing Systems (PCGrid 2009)}, YEAR = {2009}, ADDRESS = {Rome, Italy}, MONTH = {May}, PUBLISHER = {IEEE Computer Society}, ABSTRACT = {We experimentally evaluate the performance overhead of the virtual environments VMware Player, QEMU, VirtualPC and VirtualBox on a dual-core machine. Firstly, we assess the performance of a Linux guest OS running on a virtual machine by separately benchmarking the CPU, file I/O and the network bandwidth. These values are compared to the performance achieved when applications are run on a Linux OS directly over the physical machine. Secondly, we measure the impact that a virtual machine running a volunteer @home project worker causes on a host OS. Results show that performance attainable on virtual machines depends simultaneously on the virtual machine software and on the application type, with CPU-bound applications much less impacted than IO-bound ones. Additionally, the performance impact on the host OS caused by a virtual machine using all the virtual CPU, ranges from 10\% to 35\%, depending on the virtual environment.}, FILE = {200905_PCGRID.pdf:PUBLICATIONS_PDF/PDF_web/200905_PCGRID.pdf:PDF}, KEYWORDS = {virtualization, virtual machines, desktop grids, performance}, OWNER = {Owner}, TIMESTAMP = {2009.05.17}, TYPE_PUBLI = {icolcomlec}, PDF = {PUBLICATIONS_PDF/PDF_web/200905_PCGRID.pdf} }
@INPROCEEDINGS{domingues2006dht, AUTHOR = {Patricio Domingues and Filipe Araujo and Luis Moura Silva}, TITLE = {{A DHT-Based Infrastructure for Sharing Checkpoints in Desktop Grid Computing}}, BOOKTITLE = {e-Science'06: Proceedings of the Second IEEE International Conference on e-Science and Grid Computing}, YEAR = {2006}, PAGES = {126-133}, ADDRESS = {Amsterdam, Netherlands}, MONTH = {December}, PUBLISHER = {IEEE Computer Society}, ABSTRACT = {In this paper we present Chkpt2Chkpt, a desktop grid system that aims to reduce turnaround times of applications by replicating checkpoints. We target desktop computing projects with applications that are comprised of long running independent tasks, executed in hundreds or thousands of computers spread over the Internet. While these applications typically do local checkpointing to deal with failures, we propose to replicate those checkpoints in remote places to make them available to other worker nodes. The main idea is to organize the worker nodes of a desktop grid into a peer-to-peer Distributed Hash Table. Worker nodes can take advantage of this P2P network to keep track, share, manage and reclaim the space of the checkpoint files. We used simulation to validate our system and we show that remotely storing replicas of checkpoints can considerably reduce the turnaround times of the tasks, when compared to the traditional approaches where nodes manage their own checkpoints locally. These results make us conclude that the application of P2P techniques seems to be quite helpful in wide-scale desktop grid environments.}, DOI = {http://dx.doi.org/10.1109/E-SCIENCE.2006.2}, FILE = {200612_eScience2006_DHTbased.pdf:PUBLICATIONS_PDF/PDF_web/200612_eScience2006_DHTbased.pdf:PDF}, ISBN = {0-7695-2734-5}, TYPE_PUBLI = {icolcomlec}, PDF = {PUBLICATIONS_PDF/PDF_web/200612_eScience2006_DHTbased.pdf} }
@INPROCEEDINGS{domingues2006dtd, AUTHOR = {Patricio Domingues and Paulo Marques and Luis Silva}, TITLE = {{DGSchedSim: A Trace-Driven Simulator to Evaluate Scheduling Algorithms for Desktop Grid Environments}}, BOOKTITLE = {PDP '06: Proceedings of the 14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP'06)}, YEAR = {2006}, PAGES = {83--90}, ADDRESS = {Montbéliard, France}, PUBLISHER = {IEEE Computer Society}, ABSTRACT = {This paper describes DGSchedSim, a trace driven simulator to evaluate scheduling algorithms focused on minimising turnaround time of applications executed in heterogeneous desktop grid systems. The simulator can be used to model task farming applications comprised of a set of independent and equal sized tasks similarly to numerous @Home public computing projects like the popular SETI@Home. DGSchedSim permits to assess scheduling policies under several scenarios allowing to control parameters such as the application’s requirements (number of tasks, individual requirements of tasks like needed CPU time), the properties of the environment (machines computing capabilities and availabilities) and the characteristics of the execution (frequency and storage location of checkpoints, etc.). The simulations are driven by traces collected from real desktop grid systems. Besides DGSchedSim, the paper presents the Cluster Ideal Execution Time (CIET) algorithm that computes the ideal wall-clock time required by a fully dedicated and totally reliable cluster of M heterogeneous machines to process the T tasks of an application. As a test to the simulator capabilities, the paper analyses the suitability of two scheduling algorithms, FCFS and MinMax, for delivering fast turnaround time in desktop grids. Both algorithms, when combined with a centrally stored checkpoint policy, achieve efficiency close to 50\% of CIET for certain scenarios.}, DOI = {10.1109/PDP.2006.28}, FILE = {200602_PDP_DGSchedSim.pdf:PUBLICATIONS_PDF/PDF_web/200602_PDP_DGSchedSim.pdf:PDF}, ISBN = {0-7695-2513-X}, TYPE_PUBLI = {icolcomlec}, URL = {http://dx.doi.org/10.1109/PDP.2006.28}, PDF = {PUBLICATIONS_PDF/PDF_web/200602_PDP_DGSchedSim.pdf} }
@INPROCEEDINGS{domingues2005ddc, AUTHOR = {Patricio Domingues and Paulo Marques and Luis Silva}, TITLE = {{Distributed Data Collection through Remote Probing in Windows Environments}}, BOOKTITLE = {PDP'05: Proceedings of the 13th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP'05)}, YEAR = {2005}, PAGES = {59--65}, ADDRESS = {Lugano, Switzerland}, MONTH = {February}, PUBLISHER = {IEEE Computer Society}, ABSTRACT = {Distributed data collector (DDC) is a framework to ease and automate repetitive executions of console applications (probes) over a set of LAN networked Windows personal computers. The framework allows for the remote execution of probes, providing support for collecting the execution output of probes (standard output and standard error). Additionally, right after a probe execution, the output can be parsed and processed by user-defined code (post collecting code) that can act accordingly to user's needs. The framework can be useful to perform repetitive large-scale monitoring and administrative tasks over machines with transient availability, that is, machines that present no guarantees of being available at a given time. A major strength of DDC lies in the fact that it does not require installation of software in remote nodes, avoiding administrative burdens that remote daemons and alike normally provoke. Besides presenting the data collection framework, the paper discusses the results of a 30-day monitoring experiment conducted with DDC. The experiment collected resource usage metrics over 169 Windows machines from classroom laboratories of an academic institution.}, DOI = {dx.doi.org/10.1109/EMPDP.2005.18}, FILE = {200502_PDP_DDC.pdf:PUBLICATIONS_PDF/PDF_web/200502_PDP_DDC.pdf:PDF}, ISBN = {0-7695-2280-7}, OWNER = {Owner}, TIMESTAMP = {2007.08.13}, TYPE_PUBLI = {icolcomlec}, URL = {http://dx.doi.org/10.1109/EMPDP.2005.18}, PDF = {PUBLICATIONS_PDF/PDF_web/200502_PDP_DDC.pdf} }
@INPROCEEDINGS{domingues2005ruw, AUTHOR = {Patricio Domingues and Paulo Marques and Luís Moura Silva}, TITLE = {{Resource Usage of Windows Computer Laboratories}}, BOOKTITLE = {34th International Conference On Parallel Processing (ICPP'05)}, YEAR = {2005}, PAGES = {469-476}, ADDRESS = {Oslo, Norway}, MONTH = {June}, PUBLISHER = {IEEE Computer Society}, ABSTRACT = {Studies focusing on Unix have shown that the vast majority of workstations and desktop computers remain idle for most of the time. In this paper we quantify the usage of main resources (CPU, main memory, disk space and network bandwidth) of Windows 2000 machines from classroom laboratories. For that purpose, 169 machines of 11 classroom laboratories were monitored over 77 consecutive days. Samples were collected from all machines every 15 minutes for a total of 583653 samples. Besides evaluating availability of machines (uptime and downtime) and usage habits of users, the paper assesses usage of main resources, focusing on the impact of interactive login sessions over resource consumptions. Also, resorting to Self Monitoring Analysis and Reporting Technology (SMART) parameters of hard disks, the study estimates the average uptime per hard drive power cycle for the whole life of monitored computers. Our results show that resources idleness in classroom computers is very high, with an average CPU idleness of 97.9\%, unused memory averaging 42.1\% and unused disk space of the order of gigabytes per machine. Moreover, this study confirms the 2:1 equivalence rule found out by similar works, with N non-dedicated resources delivering an average CPU computing power roughly similar to N/2 dedicated machines. These results confirm the potentiality of these systems for resource harvesting, especially for grid desktop computing schemes.}, BIBURL = {http://www.bibsonomy.org/bibtex/211f11e2839eb8b46724eee9eb2af351b/dblp}, DATE = {2005-08-03}, DESCRIPTION = {dblp}, DOI = {10.1109/ICPPW.2005.77}, EE = {http://dx.doi.org/10.1109/ICPPW.2005.77}, FILE = {200506_ICCP_Workshop.pdf:PUBLICATIONS_PDF/PDF_web/200506_ICCP_Workshop.pdf:PDF}, ISBN = {0-7695-2381-1}, TYPE_PUBLI = {icolcomlec}, URL = {http://dblp.uni-trier.de/db/conf/icppw/icppw2005.html#DominguesMS05}, PDF = {PUBLICATIONS_PDF/PDF_web/200506_ICCP_Workshop.pdf} }
@INPROCEEDINGS{conf/aina/DominguesSS06, AUTHOR = {Patrício Domingues and João Gabriel Silva and Luis Silva}, TITLE = {{Sharing Checkpoints to Improve Turnaround Time in Desktop Grid.}}, BOOKTITLE = {{20th IEEE International Conference on Advanced Information Networking and Applications (AINA 2006)}}, YEAR = {2006}, PAGES = {301-306}, ADDRESS = {Vienna, Austria}, MONTH = {April}, PUBLISHER = {IEEE Computer Society}, ABSTRACT = { In this paper, we present a checkpoint sharing methodology to improve turnaround time of applications run over desktop grid environments. In fact, volatility of desktop grid nodes reduces the efficiency of such environments when a fast turnaround time is sought, since a task might get stalled if its assigned machine remains unavailable for a somewhat long period of time (long at the scale of the computation). The rationale behind our approach is to permit checkpoint reuse, so that when a computation is forced to move from one node to another, it can be restarted from an intermediary point provided by the last saved checkpoint. We study the effects of sharing checkpoints in application turnaround time simulating three scheduling algorithms based on first come first served: FCFS, FCFS-AT and FCFS-TR. The targeted environment consists of institutional desktop grids. Our results show that sharing checkpoints is particularly effective in volatile environments, yielding performance improvement up to three times relatively to schemes based on private checkpoints. Furthermore, for non-volatile environments, a simple timeout strategy produces good results.}, DATE = {2006-05-22}, DESCRIPTION = {dblp}, DOI = {10.1109/AINA.2006.309}, EE = {http://doi.ieeecomputersociety.org/10.1109/AINA.2006.309}, FILE = {200604_AINA.pdf:PUBLICATIONS_PDF/PDF_web/200604_AINA.pdf:PDF}, ISBN = {0-7695-2466-4}, TYPE_PUBLI = {icolcomlec}, URL = {http://dblp.uni-trier.de/db/conf/aina/aina2006.html#DominguesSS06}, PDF = {PUBLICATIONS_PDF/PDF_web/200604_AINA.pdf} }
@INPROCEEDINGS{domingues2003drm, AUTHOR = {Patricio Domingues and Luis Moura Silva and João Gabriel Silva}, TITLE = {{DRMonitor - A Distributed Resource Monitoring System}}, BOOKTITLE = {PDP'03: Proceedings of the 11th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP'03)}, YEAR = {2003}, PAGES = {127-133}, ADDRESS = {Genova, Italy}, MONTH = {February}, PUBLISHER = {IEEE Computer Society}, ABSTRACT = {DRMonitor is a system for monitoring usage of computing resources of networked heterogeneous (Linux and Windows NT's derived) personal computers. DRMonitor is aimed to serve resource-monitoring applications and to assist load-balancing policies by providing performance and load data about each monitored machine included in the system. Through a reduced set of primitives, applications can periodically receive updated information about system usage. The paper describes available primitives, discusses some internal aspects of the monitoring system, and presents monitoring results of a classroom with 10 personal computers.}, BIBURL = {http://www.bibsonomy.org/bibtex/220acff5fd9daae9fe2b6257471e7a686/dblp}, DATE = {2006-01-24}, DESCRIPTION = {dblp}, DOI = {10.1109/EMPDP.2003.1183577}, EE = {http://doi.ieeecomputersociety.org/10.1109/EMPDP.2003.1183577}, FILE = {200302_PDP_DRM-LIB.pdf:PUBLICATIONS_PDF/PDF_web/200302_PDP_DRM-LIB.pdf:PDF}, ISBN = {0-7695-1875-3}, TYPE_PUBLI = {icolcomlec}, URL = {http://dblp.uni-trier.de/db/conf/pdp/pdp2003.html#DominguesSS03}, PDF = {PUBLICATIONS_PDF/PDF_web/200302_PDP_DRM-LIB.pdf} }
@ARTICLE{domingues2007stt, AUTHOR = {Patricio Domingues and Bruno Sousa and Luis Moura Silva}, TITLE = {{Sabotage-Tolerance and Trust Management in Desktop Grid Computing}}, JOURNAL = {Future Generation Computation Systems}, YEAR = {2007}, VOLUME = {23}, PAGES = {904--912}, NUMBER = {7}, MONTH = {August}, ABSTRACT = {The success of grid computing in open environments like the Internet is highly dependent on the adoption of mechanisms to detect failures and malicious sabotage attempts. It is also required to maintain a trust management system that permits one to distinguish the trustable from the non-trustable participants in a global computation. Without these mechanisms, users with data-critical applications will never rely on desktop grids, and will rather prefer to support higher costs to run their computations in closed and secure computing systems. This paper discusses the topics of sabotage-tolerance and trust management. After reviewing the state-of-the-art, we present two novel techniques: a mechanism for sabotage detection and a protocol for distributed trust management. The proposed techniques are targeted at the paradigm of volunteer-based computing commonly used on desktop grids.}, ADDRESS = {Amsterdam, The Netherlands, The Netherlands}, DOI = {http://dx.doi.org/10.1016/j.future.2006.12.001}, ISSN = {0167-739X}, PUBLISHER = {Elsevier Science Publishers}, TYPE_PUBLI = {irevcomlec}, URL = {http://dx.doi.org/10.1016/j.future.2006.12.001} }
@INPROCEEDINGS{felisberto2011iec, AUTHOR = {Felisberto, Filipe and Felgueiras, Miguel and Domingues, Patricio and Fdez-Riverola, Florentino and Pereira, Antonio}, TITLE = {Improving the Elder Care Wireless Sensor Network Fall Detection System Using Logistic Regression}, BOOKTITLE = {ENTERprise Information Systems}, YEAR = {2011}, PAGES = {317-326}, ABSTRACT = {The world's population is aging; we are already facing many socioeconomic challenges directly related to this problem. These challenges will only tend to grow as time passes. If viable solutions are not found in time, these challenges will become unbearable as the elderly population surpasses the younger population. One of the more serious health problems faced by the elderly are falls that are not succored fast enough. In this paper we discuss the motivations behind our work and specially our focus on fall detection. We will also present the new Elder Care's fall detection system, resultant of our research in the area of statistical regression.}, DOI = {10.1007/978-3-642-24352-3_34}, OWNER = {user}, TIMESTAMP = {2012.08.02}, TYPE_PUBLI = {icolcomlec}, URL = {http://dx.doi.org/10.1007/978-3-642-24352-3_34} }
@INPROCEEDINGS{felisberto2010pap, AUTHOR = {Filipe Felisberto and Ricardo Silva and Patricio Domingues and Ricardo Vardasca and Antonio Pereira}, TITLE = {A Performance-based Approach for Processing Large XML Files in Multicore Machines}, BOOKTITLE = {XATA 2010 XML : associated technologies and applications}, YEAR = {2010}, EDITOR = {Alberto Simões and Daniela Cruz and José Carlos Ramalho}, PAGES = {89-99}, ADDRESS = {Vila do Conde, Portugal}, MONTH = {May}, ABSTRACT = {Due to its ubiquity, XML is used in many areas of computing, contributing to partially solve the problem of universal data representation across platforms. Although the parsing of XML files is a relatively well studied subject, processing large XML files with more than hundreds of megabytes pose many challenges. In this paper, we tackle several approaches focusing on how the performance can be improved when parsing very large XML files (hundreds of megabytes or even some gigabytes). We present a multithreaded block strategy that yields a roughly 2.19 relative speedup in a quad core machine when processing a 2.6 GB XML file.}, FILE = {201005_xata2010_XMLpeformances.pdf:PUBLICATIONS_PDF/PDF_web/201005_xata2010_XMLpeformances.pdf:PDF}, OWNER = {Owner}, TIMESTAMP = {2010.08.05}, TYPE_PUBLI = {icolcomlec}, URL = {http://hdl.handle.net/1822/10637}, PDF = {PUBLICATIONS_PDF/PDF_web/201005_xata2010_XMLpeformances.pdf} }
@INPROCEEDINGS{Ferreira2011pcgrid, AUTHOR = {Diogo Ferreira and Filipe Araujo and Patricio Domingues}, TITLE = {libboincexec: A generic virtualization approach for the BOINC middleware}, BOOKTITLE = {5th Workshop on Desktop Grids and Volunteer Computing Systems (PCGrid 2011)}, YEAR = {2011}, ADDRESS = {Anchorage, Alaska, USA}, MONTH = {May}, ABSTRACT = {BOINC is a client-server desktop grid middleware that has grown to power very large computational projects. BOINC clients request computing jobs to a central server and run them alongside other regular applications. Unfortunately, this kind of execution causes two kinds of problems. Firstly, developers must port their application to every single operating system target, which usually means maintaining several different versions of the same application. Secondly, any application running natively on desktop grid hardware is a potential security threat to the volunteer client. During the course of this research we sought an efficient and generic method for alternative execution of jobs in BOINC clients. Our approach is strongly guided by the principles of non-intrusiveness and contains two main components. The first is a library, libboincexec, which is able to control several virtual machines monitors. The second is a modified BOINC wrapper that provides the glue between libboincexec and the middleware. Through the use of this solution we are able to effectively use virtual machines to perform computation on desktop grids. This computation is inherently safe because virtual machines provide sandboxing. Additionally, by targeting the same virtual operating system, the problem of maintaining different versions of an application does not exist, thereby solving the heterogeneity problem of desktop grid nodes.}, DOI = {10.1109/IPDPS.2011.349}, FILE = {201105_pcgrid2011v2:PUBLICATIONS_PDF/PDF_web/201105_pcgrid2011v2:PDF}, TYPE_PUBLI = {icolcomlec}, URL = {http://hpcolsi.dei.uc.pt/hpcolsi/publications/libboincexec-pcgrid2011.pdf}, PDF = {PUBLICATIONS_PDF/PDF_web/201105_pcgrid2011v2.pdf} }
@INPROCEEDINGS{ferreira2010cee, AUTHOR = {Diogo Ferreira and Filipe Araujo and Patricio Domingues}, TITLE = {Custom execution environments in the BOINC middleware}, BOOKTITLE = {IberGrid 2010, Iberian Grid Infrastructure Conference}, YEAR = {2010}, MONTH = {May}, FILE = {201005_Ibergrid2010_libboincexec.pdf:PUBLICATIONS_PDF/PDF_web/201005_Ibergrid2010_libboincexec.pdf:PDF}, OWNER = {Owner}, TIMESTAMP = {2010.08.05}, TYPE_PUBLI = {icolcomlec}, PDF = {PUBLICATIONS_PDF/PDF_web/201005_Ibergrid2010_libboincexec.pdf} }
@TECHREPORT{coregrid:tr0059, AUTHOR = {Kondo, Derrick and Araujo, Filipe and Domingues, Patricio and Silva, Luis Moura}, TITLE = {{Validating Desktop Grid Results By Comparing IntermediateCheckpoints}}, INSTITUTION = {Institute on System Architecture, CoreGRID - Network of Excellence}, YEAR = {2006}, NUMBER = {TR-0059}, MONTH = {October}, TYPE_PUBLI = {rapport}, URL = {http://www.coregrid.net/mambo/images/stories/TechnicalReports/tr-0059.pdf} }
@INPROCEEDINGS{kondo2007cre, AUTHOR = {Derrick Kondo and Filipe Araujo and Paul Malecot and Patricio Domingues and Luis Silva and Gilles Fedak and Franck Cappello}, TITLE = {{Characterizing Results Errors in Internet Desktop Grids (Best Paper Award)}}, BOOKTITLE = {Euro-Par}, YEAR = {2007}, PAGES = {361-371}, ADDRESS = {Rennes, Frances}, MONTH = {August}, ABSTRACT = {Desktop grids use the free resources in Intranet and Internet environments for large-scale computation and storage. While desktop grids offer a high return on investment, one critical issue is the validation of results returned by participating hosts. Several mechanisms for result validation have been previously proposed. However, the characterization of errors is poorly understood. To study error rates, we implemented and deployed a desktop grid application across several thousand hosts distributed over the Internet. We then analyzed the results to give quantitative and empirical characterization of errors stemming from input or output (I/O) failures.We find that in practice, error rates are widespread across hosts but occur relatively infrequently. Moreover, we find that error rates tend to not be stationary over time nor correlated between hosts. In light of these characterization results, we evaluated state-of-the-art error detection mechanisms and describe the trade-offs for using each mechanism.}, COMMENT = {(Best Paper Award) -- 333 submitted/89 accepted (26.7\%)}, FILE = {200708_Europar.pdf:PUBLICATIONS_PDF/PDF_web/200708_Europar.pdf:PDF}, OWNER = {Owner}, TIMESTAMP = {2007.08.11}, TYPE_PUBLI = {icolcomlec}, URL = {http://europar2007.irisa.fr/program.php}, PDF = {PUBLICATIONS_PDF/PDF_web/200708_Europar.pdf} }
@TECHREPORT{coregrid:tr0040, AUTHOR = {Kondo, Derrick and Malecot, Paul and Fedak, Gilles and Cappello, Franck and Araujo, Filipe and Silva, Luis Moura and Domingues, Patricio}, TITLE = {{Characterizing Result Errors in Internet Desktop Grids}}, INSTITUTION = {Institute on System Architecture, CoreGRID - Network of Excellence}, YEAR = {2006}, NUMBER = {TR-0040}, MONTH = {October}, TYPE_PUBLI = {rapport}, URL = {http://www.coregrid.net/mambo/images/stories/TechnicalReports/tr-0040.pdf} }
@INPROCEEDINGS{mendes2007odr, AUTHOR = {Silvio Mendes and Patricio Domingues and David Pereira and Renato Vale and J. Gomez-Pulido and Luis Silva and M.A. Vega-Rodríguez and J. Sánchez-Pérez}, TITLE = {{Omni-directional RND Optimisation using Differential Evolution: In-depth Analysis via High Throughput Computing}}, BOOKTITLE = {Workshop on Artificial Life and Evolutionary Algorithms (ALEA) - 13th Portuguese Conference on Artificial Intelligence}, YEAR = {2007}, ADDRESS = {Guimarães, Portugal}, MONTH = {December}, ABSTRACT = {The Radio Network Design (RND) constitutes an important class of problems, particularly in the planning of wireless communication networks. RND problems are challenging to tackle since they fall in the NP-hard class of optimisation problems. In this paper, we assess the viability of adapting the Differential Evolution (DE) algorithm to a wide-scale real world RND problem. To fulfil the high computational demands of the DE approach, we resort to a pool of more than 150 non-dedicated machines, whose CPU cycles are scavenged through a high throughput system. Our results show that DE is a viable approach for RND problems if proper computing power is available.}, FILE = {200712_RND_EPIA2007.pdf:PUBLICATIONS_PDF/PDF_web/200712_RND_EPIA2007.pdf:PDF}, KEYWORDS = {RND, Differential Evolution, high throughput computing, mathematical techniques in telecommunications, Bio-inspired optimisation}, OWNER = {Owner}, TIMESTAMP = {2007.08.11}, TYPE_PUBLI = {icolcomlec}, PDF = {PUBLICATIONS_PDF/PDF_web/200712_RND_EPIA2007.pdf} }
@ARTICLE{silaghiDCN2009, AUTHOR = {Silaghi, G. and Araujo, F. and Silva, L. M. and Domingues, P. and Arenas, A.}, TITLE = {Defeating colluding nodes in desktop grid computing platforms}, JOURNAL = {Journal of Grid Computing}, YEAR = {2009}, VOLUME = {7}, PAGES = {555-573}, NUMBER = {4}, MONTH = {December}, EID = {Springer}, ABSTRACT = {Desktop Grid systems reached a preeminent place among the most powerful computing platforms in the planet. Unfortunately, they are extremely vulnerable to mischief, because computing projects exert no administrative or technical control on volunteers. These can very easily output bad results, due to software or hardware glitches (resulting from over-clocking for instance), to get unfair computational credit, or simply to ruin the project. To mitigate this problem, Desktop Grid servers replicate work units and apply majority voting, typically on 2 or 3 results. In this paper, we observe that simple majority voting is powerless against malicious volunteers that collude to attack the project. We argue that to identify this type of attack and to spot colluding nodes, each work unit needs \emph{at least} 3 voters. In addition, we propose to post-process the voting pools in two steps. $i$) In the first step, we use a statistical approach to identify nodes that were not colluding, but submitted bad results; $ii$) then, we use a rather simple principle to go after malicious nodes which acted together: they might have won conflicting voting pools against nodes that were not identified in step $i$. We use simulation to show that our heuristic can be quite effective against colluding nodes, in scenarios where honest nodes form a majority.}, FILE = {200912_JournalGrid_defeating_coluding_nodes.pdf:PUBLICATIONS_PDF/PDF_web/200912_JournalGrid_defeating_coluding_nodes.pdf:PDF}, OWNER = {Owner}, TIMESTAMP = {2010.08.05}, TYPE_PUBLI = {irevcomlec}, PDF = {PUBLICATIONS_PDF/PDF_web/200912_JournalGrid_defeating_coluding_nodes.pdf} }
@INPROCEEDINGS{silaghi2008dcn, AUTHOR = {Gheorghe Cosmin Silaghi and Filipe Araujo and Luis M. Silva and Patricio Domingues and Alvaro E. Arenas}, TITLE = {{Defeating Colluding Nodes in Desktop Grid Computing Platforms}}, BOOKTITLE = {2nd Workshop on Desktop Grids and Volunteer Computing Systems (PCGrid 2008). IPDPS'08.}, YEAR = {2008}, ADDRESS = {Miami, Florida, USA}, MONTH = {April}, ABSTRACT = {Desktop Grid systems reached a preeminent place among the most powerful computing platforms in the planet. Unfortunately, they are extremely vulnerable to mischief, because volunteers can output bad results, for reasons ranging from faulty hardware (like over-clocked CPUs) to intentional sabotage. To mitigate this problem, Desktop Grid projects replicate work units and apply majority voting, typically on 2 or 3 results. In this paper, we observe that this form of replication is powerless against malicious volunteers that have the intention and the (simple) means to ruin the project using some form of collusion. We argue that each work unit needs at least 3 voters and that voting pools with conflicts enable the master to spot colluding malicious nodes. Hence, we postprocess the voting pools in two steps: i) we use a statistical approach to identify nodes that were not colluding, but submitted bad results; ii) we use a rather simple principle to go after malicious nodes which acted together: they might have won conflicting voting pools against nodes that were not identified in step i. We use simulation to show that our heuristic can be quite effective against colluding nodes, in scenarios where honest nodes form a majority.}, FILE = {200804_PCGrid_IPDPS2008.pdf:PUBLICATIONS_PDF/PDF_web/200804_PCGrid_IPDPS2008.pdf:PDF}, OWNER = {Owner}, TIMESTAMP = {2008.03.27}, TYPE_PUBLI = {icolcomlec}, PDF = {PUBLICATIONS_PDF/PDF_web/200804_PCGrid_IPDPS2008.pdf} }
@INPROCEEDINGS{silaghi2007tct, AUTHOR = {Gheorghe Cosmin Silaghi and Luis M. Silva and Patricio Domingues and Alvaro E. Arenas}, TITLE = {{Tackling the Collusion Threat in P2P-Enhanced Internet Desktop Grids}}, BOOKTITLE = {4th Integration Workshop, CoreGRID - Network of Excellence}, YEAR = {2007}, ADDRESS = {Hellas Heraklion - Crete, Greece}, MONTH = {June}, ABSTRACT = {As Internet Desktop Grids become more and more popular in the success story of @Home projects it is important to provide support for other more demanding applications that make use of large amounts of data to be computed. We have been investigating P2P techniques to facilitate the distribution of large chunks of shared data among an increasing set of workers. When we start using P2P techniques the workers will connect among them and, having a mean of communication, they can develop malicious coalitions. Classical sabotage tolerance techniques adopted by Internet Desktop Grid platforms assumes the isolation of workers and does not tackle the collusion threat. In this paper we propose some sabotage tolerance techniques that can be used by a middleware like BOINC if enhanced with a P2P infrastructure for data distribution. The master will build the reputation of all the workers, by observing its trustworthiness from its previous results and its compliance with the P2P data delivery protocols. Reputation information can be incorporated in the result-validation process by using a weighted voting algorithm.}, FILE = {200706_Tackling_Collusion_4th_coregrid_WP4_workshop_P2P.pdf:PUBLICATIONS_PDF/PDF_web/200706_Tackling_Collusion_4th_coregrid_WP4_workshop_P2P.pdf:PDF}, OWNER = {Owner}, TIMESTAMP = {2007.08.13}, TYPE_PUBLI = {icolcomlec}, PDF = {PUBLICATIONS_PDF/PDF_web/200706_Tackling_Collusion_4th_coregrid_WP4_workshop_P2P.pdf} }
@INCOLLECTION{araujo2008ucn, YEAR = {2008}, ISBN = {978-0-387-09456-4}, BOOKTITLE = {Grid Computing}, EDITOR = {Gorlatch, Sergei and Fragopoulou, Paraskevi and Priol, Thierry}, DOI = {10.1007/978-0-387-09457-1_3}, TITLE = {Using Cliques Of Nodes To Store Desktop Grid Checkpoints}, URL = {http://dx.doi.org/10.1007/978-0-387-09457-1_3}, PUBLISHER = {Springer US}, KEYWORDS = {Desktop grid; checkpointing; clique}, AUTHOR = {Araujo, Filipe and Domingues, Patricio and Kondo, Derrick and Silva, LuisMoura}, PAGES = {25-36}, OWNER = {Owner}, TIMESTAMP = {2012.08.03}, TYPE_PUBLI = {icolcomlec}, PDF = {PUBLICATIONS_PDF/PDF_web/2008_araujo_coregrid08.pdf} }
@INBOOK{chap10src2012, CHAPTER = {10: Security and Result Certification}, PAGES = {211--235}, TITLE = {Desktop Grid Computing}, PUBLISHER = {Chapman and Hall/CRC}, YEAR = {2012}, AUTHOR = {Filipe Araujo and Patricio Domingues}, DOI = {10.1201/b12206-13}, OWNER = {user}, TIMESTAMP = {2012.07.27}, TYPE_PUBLI = {chapitre}, URL = {http://www.crcnetbase.com/doi/abs/10.1201/b12206-13} }
@ARTICLE{domingues2012cuda, AUTHOR = {Domingues, P.}, TITLE = {{Introdu\c{c}ão \`{a} Programa\c{c}ão em CUDA}}, JOURNAL = {Revista Programar}, NOTE = {(in Portuguese)}, YEAR = {2012}, VOLUME = {}, PAGES = {7-11}, NUMBER = {38}, MONTH = {December}, ABSTRACT = {Nos últimos anos, as placas gráficas (GPU – Graphical Processing Unit) ganharam relevância no âmbito da computação paralela. De facto, os mais recentes modelos da NVIDIA e da AMD/ATI –- dois dos maiores construtores de placas gráficas -- têm na ordem do milhar de núcleos de processamento, “core” na designação anglo-saxónica. Exemplo disso é a GPU NVIDIA GTX 680 que tem 1536 núcleos, estando creditada com um desempenho máximo (teórico) de 3.1 TFLOPS em cálculo de vírgula flutuante com precisão simples, sendo que um TFLOPS corresponde a 10^12 operações de vírgula flutuante por segundo. Contudo, do ponto de vista de computação paralela, de pouco serve a existência de milhares de cores se o seu uso estiver limitado somente à produção e tratamento de gráficos. Foi pois a pensar na comunidade de computação paralela e no potencial mercado que essa representa, que a NVIDIA lançou em Novembro de 2006, a versão 1.0 da plataforma Compute Unified Device Architecture (CUDA). Embora limitado às GPU da NVIDIA, as sucessivas versões de CUDA tornaram possível o uso de GPU para o desenvolvimento e execução de computação paralela de larga escala. Em alguns cenários de computação – tratamento de imagens e video, processamento de dados, aplicações bioinformáticas, etc. – as GPU proporcionam velocidades de execução muito mais rápidas do que as alcançadas pelos processadores (CPU). Neste artigo introduzem-se os conceitos básicos de programação paralela para a plataforma CUDA.}, FILE = {201212_Revista_PROGRAMAR_38---Programacao.CUDA+capa.pdf:PUBLICATIONS_PDF/PDF_web/201212_Revista_PROGRAMAR_38---Programacao.CUDA+capa.pdf:PDF}, OWNER = {Owner}, TIMESTAMP = {2013.08.02}, TYPE_PUBLI = {autre}, PDF = {PUBLICATIONS_PDF/PDF_web/201212_Revista_PROGRAMAR_38---Programacao.CUDA+capa.pdf} }
@ARTICLE{domingues2013opencl, AUTHOR = {Domingues, P.}, TITLE = {{Programa\c{c}ão em OpenCL}}, JOURNAL = {Revista Programar}, NOTE = {(in Portuguese)}, YEAR = {2013}, PAGES = {21-31}, NUMBER = {39}, MONTH = {February}, ABSTRACT = {A norma OpenCL foi adotada por um vasto conjunto de grandes empresas da área da informática (AMD/ATI, NVIDIA, Intel, IBM, Samsung, Google, entre outras). Deste modo, ao contrário da plataforma CUDA que é uma plataforma proprietária que está apenas disponível para GPUs da NVIDIA, a norma OpenCL é suportada numa vasta gama de dispositivos desde as GPUs da AMD/ATI e da NVIDIA, ao processador Cell e ainda nas mais recentes placas gráficas do tipo HD e CPUs multicoreda Intel. Contudo, o suporte varia, sendo ainda poucos os dispositivos que disponibilizam a versão 1.2 da norma OpenCL publicada em Novembro de 2011 (Khronos Group OpenCL Working Group, 2012). Neste artigo introduzem-se os conceitos básicos de programação paralela na norma OpenCL, focando somente o OpenCL na perspetiva de dispositivos GPUs, dado ser esse o cenário mais comum. }, FILE = {201302_Revista_PROGRAMAR_39---Programacao.OpenCL+capa.pdf:PUBLICATIONS_PDF/PDF_web/201302_Revista_PROGRAMAR_39---Programacao.OpenCL+capa.pdf:PDF}, OWNER = {Owner}, TIMESTAMP = {2013.08.02}, TYPE_PUBLI = {autre}, PDF = {PUBLICATIONS_PDF/PDF_web/201302_Revista_PROGRAMAR_39---Programacao.OpenCL+capa.pdf} }
This file has been generated by bibtex2html 1.79
Last update: Sat Aug 3 19:44:48 HVGMT 2013