Готові списки джерел за темами / Replication of computing experiment

Добірка наукової літератури з теми "Replication of computing experiment"

Автор: Grafiati
Опубліковано: 30 травня 2022
Оновлено: 31 травня 2022

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Зміст

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Replication of computing experiment".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Статті в журналах з теми "Replication of computing experiment"

1

Beermann, Thomas, Olga Chuchuk, Alessandro Di Girolamo, Maria Grigorieva, Alexei Klimentov, Mario Lassnig, Markus Schulz, Andrea Sciaba, and Eugeny Tretyakov. "Methods of Data Popularity Evaluation in the ATLAS Experiment at the LHC." EPJ Web of Conferences 251 (2021): 02013. http://dx.doi.org/10.1051/epjconf/202125102013.

Повний текст джерела
Анотація:
The ATLAS Experiment at the LHC generates petabytes of data that is distributed among 160 computing sites all over the world and is processed continuously by various central production and user analysis tasks. The popularity of data is typically measured as the number of accesses and plays an important role in resolving data management issues: deleting, replicating, moving between tapes, disks and caches. These data management procedures were still carried out in a semi-manual mode and now we have focused our efforts on automating it, making use of the historical knowledge about existing data management strategies. In this study we describe sources of information about data popularity and demonstrate their consistency. Based on the calculated popularity measurements, various distributions were obtained. Auxiliary information about replication and task processing allowed us to evaluate the correspondence between the number of tasks with popular data executed per site and the number of replicas per site. We also examine the popularity of user analysis data that is much less predictable than in the central production and requires more indicators than just the number of accesses.
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Liu, Liang, and Tian Yu Wo. "A Scalable Data Platform for Cloud Computing Systems." Applied Mechanics and Materials 577 (July 2014): 860–64. http://dx.doi.org/10.4028/www.scientific.net/amm.577.860.

Повний текст джерела
Анотація:
With cloud computing systems becoming popular, it has been a hotspot to design a scalable, highly available and cost-effective data platform. This paper proposed such a data platform using MySQL DBMS blocks. For scalability, a three-level (system, super-cluster, cluster) architecture is applied, making it scalable to thousands of applications. For availability, we use asynchronous replication across geographically dispersed super clusters to provide disaster recovery, synchronous replication within a cluster to perform failure recovery and hot standby or even process pair mechanism for controllers to enhance fault tolerance. For resource utility, we design a novel load balancing strategy by exploiting the key property that the throughput requirement of web applications is flucatuated in a time period. Experiments with NLPIR dataset indicate that the system can scale to a large number of web applications and make good use of resources provided.
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Vashisht, Priyanka, Rajesh Kumar, and Anju Sharma. "Efficient Dynamic Replication Algorithm Using Agent for Data Grid." Scientific World Journal 2014 (2014): 1–10. http://dx.doi.org/10.1155/2014/767016.

Повний текст джерела
Анотація:
In data grids scientific and business applications produce huge volume of data which needs to be transferred among the distributed and heterogeneous nodes of data grids. Data replication provides a solution for managing data files efficiently in large grids. The data replication helps in enhancing the data availability which reduces the overall access time of the file. In this paper an algorithm, namely, EDRA using agents for data grid, has been proposed and implemented. EDRA consists of dynamic replication of hierarchical structure taken into account for the selection of best replica. Decision for selecting the best replica is based on scheduling parameters. The scheduling parameters are bandwidth, load gauge, and computing capacity of the node. The scheduling in data grid helps in reducing the data access time. The distribution of the load on the nodes of data grid is done evenly by considering scheduling parameters. EDRA is implemented using data grid simulator, namely, OptorSim. European Data Grid CMS test bed topology is used in this experiment. The simulation results are obtained by comparing BHR, LRU, No Replication, and EDRA. The result shows the efficiency of EDRA algorithm in terms of mean job execution time, network usage, and storage usage of node.
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Kolokoltsev, Yevgeniy, Evgeny Ivashko, and Carlos Gershenson. "Improving “tail” computations in a BOINC-based Desktop Grid." Open Engineering 7, no. 1 (December 29, 2017): 371–78. http://dx.doi.org/10.1515/eng-2017-0044.

Повний текст джерела
Анотація:
AbstractA regular Desktop Grid bag-of-tasks project can take a lot of time to complete computations. An important part of the process is tail computations: when the number of tasks to perform becomes less than the number of computing nodes. At this stage, a dynamic replication could be used to reduce the time needed to complete computations. In this paper, we propose a mathematical model and a strategy of dynamic replication at the tail stage. The results of the numerical experiments are given.
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Fazlina, M. A., Rohaya Latip, Azizol Abdullah, Hamidah Ibrahim, and Mohamed A. Alrshah. "Crucial File Selection Strategy (CFSS) for Enhanced Download Response Time in Cloud Replication Environments." Baghdad Science Journal 18, no. 4(Suppl.) (December 20, 2021): 1356. http://dx.doi.org/10.21123/bsj.2021.18.4(suppl.).1356.

Повний текст джерела
Анотація:
Cloud Computing is a mass platform to serve high volume data from multi-devices and numerous technologies. Cloud tenants have a high demand to access their data faster without any disruptions. Therefore, cloud providers are struggling to ensure every individual data is secured and always accessible. Hence, an appropriate replication strategy capable of selecting essential data is required in cloud replication environments as the solution. This paper proposed a Crucial File Selection Strategy (CFSS) to address poor response time in a cloud replication environment. A cloud simulator called CloudSim is used to conduct the necessary experiments, and results are presented to evidence the enhancement on replication performance. The obtained analytical graphs are discussed thoroughly, and apparently, the proposed CFSS algorithm outperformed another existing algorithm with a 10.47% improvement in average response time for multiple jobs per round.
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Baldi-Boleda, Tomás, Ehsan Sadeghi, Carles Colominas, and Andrés García-Granada. "Simulation Approach for Hydrophobicity Replication via Injection Molding." Polymers 13, no. 13 (June 23, 2021): 2069. http://dx.doi.org/10.3390/polym13132069.

Повний текст джерела
Анотація:
Nanopattern replication of complex structures by plastic injection is a challenge that requires simulations to define the right processing parameters. Previous work managed to simulate replication for single cavities in 2D and 3D, showing high performance requirements of CPU to simulate periodic trenches in 2D. This paper presents two ways to approach the simulation of replication of complex 3D hydrophobic surfaces. The first approach is based on previous CFD Ansys Fluent and compared to FE based CFD Polyflow software for the analysis of laminar flows typical in polymer processing and glass forming as well as other applications. The results showed that Polyflow was able to reduce computing time from 72 h to only 5 min as desired in the project. Furthermore, simulations carried out with Polyflow showed that higher injection and mold temperature lead to better replication of hydrophobicity in agreement with the experiments. Polyflow simulations are proved to be a good tool to define process parameters such as temperature and cycle times for nanopattern replication.
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Mehner, Philipp J., Merle Allerdißen, Sebastian Haefner, Andreas Voigt, Uwe Marschner, and Andreas Richter. "Modeling the closing behavior of a smart hydrogel micro-valve." Journal of Intelligent Material Systems and Structures 30, no. 9 (December 4, 2017): 1409–18. http://dx.doi.org/10.1177/1045389x17742726.

Повний текст джерела
Анотація:
Smart hydrogel micro-valves are essential components of micro-chemo-mechanical fluid systems. These valves are based on phase-changeable polymers. They can open and close micro-fluidic channels depending on the chemical concentration or the temperature in the fluid. A concept of finite element–based modeling in combination with network methods to simulate concentration-triggered, phase-changeable hydrogels is proposed. We introduce a temperature domain as a replication domain to substitute insufficiently implemented domains. With the used simulation tools, problems are highlighted and their solutions are presented. The computed parameters of such valves are included in a circuit representation, which is capable of efficiently computing large-scale micro-fluidic systems. These methods will help predict, visualize, and understand polymeric swelling behavior as well as the performance of large-scale chip applications before any complex experiment is performed.
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Alshammari, Mohammad M., Ali A. Alwan, Azlin Nordin, and Abedallah Zaid Abualkishik. "Data Backup and Recovery With a Minimum Replica Plan in a Multi-Cloud Environment." International Journal of Grid and High Performance Computing 12, no. 2 (April 2020): 102–20. http://dx.doi.org/10.4018/ijghpc.2020040106.

Повний текст джерела
Анотація:
Cloud computing has become a desirable choice to store and share large amounts of data among several users. The two main concerns with cloud storage are data recovery and cost of storage. This article discusses the issue of data recovery in case of a disaster in a multi-cloud environment. This research proposes a preventive approach for data backup and recovery aiming at minimizing the number of replicas and ensuring high data reliability during disasters. This approach named Preventive Disaster Recovery Plan with Minimum Replica (PDRPMR) aims at reducing the number of replications in the cloud without compromising the data reliability. PDRPMR means preventive action checking of the availability of replicas and monitoring of denial of service attacks to maintain data reliability. Several experiments were conducted to evaluate the effectiveness of PDRPMR and the results demonstrated that the storage space used one-third to two-thirds compared to typical 3-replicas replication strategies.
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Blomer, Jakob, Gerardo Ganis, Simone Mosciatti, and Radu Popescu. "Towards a serverless CernVM-FS." EPJ Web of Conferences 214 (2019): 09007. http://dx.doi.org/10.1051/epjconf/201921409007.

Повний текст джерела
Анотація:
The CernVM File System (CernVM-FS) provides a scalable and reliable software distribution and—to some extent—a data distribution service. It gives POSIX access to more than a billion binary files of experiment application software stacks and operating system containers to end user devices, grids, clouds, and supercomputers. Increasingly, CernVM-FSalso provides access to certain classes of data, such as detector conditions data, genomics reference sets, or gravitational wave detector experiment data. For most of the high- energy physics experiments, an underlying HTTP content distribution infrastructure is jointly provided by universities and research institutes around the world. In this contribution, we will present recent developments and future plans. For future developments, we put a focus on evolving the content distribution infrastructure and at lowering the barrier for publishing into CernVM-FS. Through so-called serverless computing, we envision cloud hosted CernVM-FS repositories without the need to operate dedicated servers or virtual machines. An S3 compatible service in conjunction with a content delivery network takes on data provisioning, replication, and caching. A chainof time-limited and resource-limited functions (so called “lambda function” or “function-as- a-service”) operate on the repository and stage the updates. As a result, any CernVM-FS client should be able to turn intoawriter, possession of suitable keys provided. For repository owners, we aim at providing cost transparency and seamless scalability from very small to very large CernVM-FS installations.
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Panatula, Ganesh, K. Sailaja Kumar, D. Evangelin Geetha, and T. V. Suresh Kumar. "Performance evaluation of cloud service with hadoop for twitter data." Indonesian Journal of Electrical Engineering and Computer Science 13, no. 1 (January 1, 2019): 392. http://dx.doi.org/10.11591/ijeecs.v13.i1.pp392-404.

Повний текст джерела
Анотація:
<p>In the era of rapid growth of cloud computing, performance calculation of cloud service is an essential criterion to assure quality of service. Nevertheless, it is a perplexing task to effectively analyze the performance of cloud service due to the complexity of cloud resources and the diversity of Big Data applications. Hence, we propose to examine the performance of Big Data applications with Hadoop and thus to figure out the performance in cloud cluster. Hadoop is built based on MapReduce, one of the widely used programming models in Big Data. In this paper, the performance analysis of Hadoop MapReduce WordCount application for Twitter data is presented. A 4-node in-house Hadoop cluster was setup and experiment was carried out for analyzing the performance. Through this work, it was concluded that Hadoop is efficient for BigData applications with 3 or more nodes with replication factor 3. Also, it was observed that system time was relatively more compared to user time for BigData applications beyond 80GB. This experiment had also thrown certain pattern on actual data blocks used to process the WordCount application. </p>
Стилі APA, Harvard, Vancouver, ISO та ін.
Більше джерел

Дисертації з теми "Replication of computing experiment"

1

Pamplona, Rodrigo Christovam. "Data replication in mobile computing." Thesis, Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:hh:diva-16448.

Повний текст джерела
Анотація:
With the advances of technology and the popularization of mobile devices, the need of researching and discussing subjects related to mobile devices has raised. One of the subjects that needs to be further analyzed is data replication. This study investigates data replication on mobile devices focusing on power consumption. It presents four different scenarios that propose, describe, apply and evaluate data replication mechanisms, with the purpose of finding the best scenario that presents less energy consumption. In order to make the experiments, Sun SPOT was chosen as a mobile device. This device is fully programmed in a java environment. A different software was created in each scenario in order to verify the performance of the mobile devices regarding energy saving. The results found did not meet the expectations. While trying to find the best scenario a hardware limitation was found. Although software can be easily changed to fix errors, hardware cannot be changed as easily. The implications for the hardware limitation found in this study prevented the results to be optimal. The results found also imply that new hardware should be used in further experimentation. As this study proved to be limited, it suggests that additional studies should be carried out applying the new version of the hardware used in this study.
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Júnior, Lourenço Alves Pereira. "Planejamento de experimentos com várias replicações em paralelo em grades computacionais." Universidade de São Paulo, 2010. http://www.teses.usp.br/teses/disponiveis/55/55134/tde-18082010-112815/.

Повний текст джерела
Анотація:
Este trabalho de mestrado apresenta um estudo de Grades Computacionais e Simulações Distribuídas sobre a técnica MRIP. A partir deste estudo foi possível propor e implementar o protótipo de uma ferramenta para Gerenciamento de Experimento em Ambiente de Grade, denominada Grid Experiments Manager - GEM, organizada de forma modular podendo ser usada como um programa ou integrada com outro software, podendo ser expansível para vários middlewares de Grades Computacionais. Com a implementação também foi possível avaliar o desempenho de simulações sequenciais com aquelas executadas em cluster e em uma Grade Computacional de teste, sendo construído um benchmark que possibilitou repetir a mesma carga de trabalho para os sistemas sobre avaliação. Com os testes foi possível verificar um ganho alto no tempo de execução, quando comparadas as execuções sequenciais e em cluster, obteve-se eficiência em torno de 197% para simulações com tempo de execução baixo e 239% para aquelas com tempo de execução maior; na comparação das execuções em cluster e em grade, obteve-se os valores para eficiência de 98% e 105%, para simulações pequenas e grandes, respectivamente
This master\'s thesis presents a study of Grid Computing and Distributed Simulations using the MRIP approach. From this study was possible to design and implement the prototype of a tool for Management of Experiments in Grid Environment, called Grid Experiments Manager - GEM, which is organized in a modular way and can be used as a program or be integrated with another piece of software, being expansible to varius middlewares of Computational Grids. With its implementation was also possible to evaluate the performance of sequencial simulations executed in clusters and a Computational testbed Grid, also being implemented a benchmark which allowed repeat the same workload at the systems in evaluation. A high gain turnaround of the executions was infered with those results. When compared Sequential and Cluster executions, the eficiency was about of 197% for thin time of execution and 239% for those bigger in execution; when compared Cluster and Grid executions, the eficiency was about of 98% and 105% for thin and bigger simulations, repectivelly
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Wu, Huaigu 1975. "Adaptable stateful application server replication." Thesis, McGill University, 2008. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=115903.

Повний текст джерела
Анотація:
In recent years, multi-tier architectures have become the standard computing environment for web- and enterprise applications. The application server tier is often the heart of the system embedding the business logic. Adaptability, in particular the capability to adjust to the load submitted to the system and to handle the failure of individual components, are of outmost importance in order to provide 7/24 access and high performance. Replication is a common means to achieve these reliability and scalability requirements. With replication, the application server tier consists of several server replicas. Thus, if one replica fails, others can take over. Furthermore, the load can be distributed across the available replicas. Although many replication solutions have been proposed so far, most of them have been either developed for fault-tolerance or for scalability. Furthermore, only few have considered that the application server tier is only one tier in a multi-tier architecture, that this tier maintains state, and that execution in this environment can follow complex patterns. Thus, existing solutions often do not provide correctness beyond some basic application scenarios.
In this thesis we tackle the issue of replication of the application server tier from ground off and develop a unified solution that provides both fault-tolerance and scalability. We first describe a set of execution patterns that describe how requests are typically executed in multi-tier architectures. They consider the flow of execution across client tier, application server tier, and database tier. In particular, the execution patterns describe how requests are associated with transactions, the fundamental execution units at application server and database tiers. Having these execution patterns in mind, we provide a formal definition of what it means to provide a correct execution across all tiers, even in case failures occur and the application server tier is replicated. Informally, a replicated system is correct if it behaves exactly as a non-replicated that never fails. From there, we propose a set of replication algorithms for fault-tolerance that provide correctness for the execution patterns that we have identified The main principle is to let a primary AS replica to execute all client requests, and to propagate any state changes performed by a transaction to backup replicas at transaction commit time. The challenges occur as requests can be associated in different ways with transactions. Then, we extend our fault-tolerance solution and develop a unified solution that provides both fault-tolerance and load-balancing. In this extended solution, each application server replica is able to execute client requests as a primary and at the same time serves as backup for other replicas. The framework provides a transparent, truly distributed and lightweight load distribution mechanism which takes advantage of the fault-tolerance infrastructure. Our replication tool is implemented as a plug-in of JBoss application server and the performance is carefully evaluated, comparing with JBoss' own replication solutions. The evaluation shows that our protocols have very good performance and compare favorably with existing solutions.
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Di, Maria Riccardo. "Elastic computing on Cloud resources for the CMS experiment." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2015. http://amslaurea.unibo.it/8955/.

Повний текст джерела
Анотація:
Nowadays, data handling and data analysis in High Energy Physics requires a vast amount of computational power and storage. In particular, the world-wide LHC Com- puting Grid (LCG), an infrastructure and pool of services developed and deployed by a ample community of physicists and computer scientists, has demonstrated to be a game changer in the efficiency of data analyses during Run-I at the LHC, playing a crucial role in the Higgs boson discovery. Recently, the Cloud computing paradigm is emerging and reaching a considerable adoption level by many different scientific organizations and not only. Cloud allows to access and utilize not-owned large computing resources shared among many scientific communities. Considering the challenging requirements of LHC physics in Run-II and beyond, the LHC computing community is interested in exploring Clouds and see whether they can provide a complementary approach - or even a valid alternative - to the existing technological solutions based on Grid. In the LHC community, several experiments have been adopting Cloud approaches, and in particular the experience of the CMS experiment is of relevance to this thesis. The LHC Run-II has just started, and Cloud-based solutions are already in production for CMS. However, other approaches of Cloud usage are being thought of and are at the prototype level, as the work done in this thesis. This effort is of paramount importance to be able to equip CMS with the capability to elastically and flexibly access and utilize the computing resources needed to face the challenges of Run-III and Run-IV. The main purpose of this thesis is to present forefront Cloud approaches that allow the CMS experiment to extend to on-demand resources dynamically allocated as needed. Moreover, a direct access to Cloud resources is presented as suitable use case to face up with the CMS experiment needs. Chapter 1 presents an overview of High Energy Physics at the LHC and of the CMS experience in Run-I, as well as preparation for Run-II. Chapter 2 describes the current CMS Computing Model, and Chapter 3 provides Cloud approaches pursued and used within the CMS Collaboration. Chapter 4 and Chapter 5 discuss the original and forefront work done in this thesis to develop and test working prototypes of elastic extensions of CMS computing resources on Clouds, and HEP Computing “as a Service”. The impact of such work on a benchmark CMS physics use-cases is also demonstrated.
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Yang, Daiyi. "Zoolander: Modeling and managing replication for predictability." The Ohio State University, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=osu1322595127.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Gilmore, Lance Edwin. "Experimentally Evaluating Statistical Patterns of Offending Typology For Burglary: A Replication Study." Scholar Commons, 2014. https://scholarcommons.usf.edu/etd/5371.

Повний текст джерела
Анотація:
This study used a quasi-experiment in order to evaluate the effect the SPOT-burglary profile on burglary arrest rates. A single police agency split into three different districts was used for the quasi-experiment. The SPOT-burglary profile was implemented in one district, while leaving the other two as control groups. The differences between the districts were controlled for using a statistical analysis. Burglary arrest rates were collected each month for all three districts for a period of one year before the implementation, and for six months after the implementation. Results show that the district who received the SPOT-burglary profile raised their burglary arrest rates by almost 75% in only 6 months, even after controlling for all relevant variables. This shows that the experimental intervention, the burglary profile, had a significant effect on the intended outcome- burglary arrest rates. The results of this study suggest that the SPOT-burglary profile may be able to provide law enforcement agencies with another tool to help increase burglary arrest rates in the future.
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Scott, Hanna E. T. "A Balance between Testing and Inspections : An Extended Experiment Replication on Code Verification." Thesis, Blekinge Tekniska Högskola, Avdelningen för programvarusystem, 2004. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-1751.

Повний текст джерела
Анотація:
An experiment replication comparing the performance of traditional structural code testing with inspection meeting preparation using scenario based reading. Original experiment was conducted by Per Runeson and Anneliese Andrews in 2003 at Washington State University.
En experiment-replikering där traditionell strukturell kod-testning jämförs med inspektionsmötesförberedelse användandes scenario-baserad kodläsning. Det ursprungliga experimentet utfördes av Per Runeson och Anneliese Andrews på Washington State University år 2003.
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Gonçalves, André Miguel Augusto. "Estimating data divergence in cloud computing storage systems." Master's thesis, Faculdade de Ciências e Tecnologia, 2013. http://hdl.handle.net/10362/10852.

Повний текст джерела
Анотація:
Dissertação para obtenção do Grau de Mestre em Engenharia Informática
Many internet services are provided through cloud computing infrastructures that are composed of multiple data centers. To provide high availability and low latency, data is replicated in machines in different data centers, which introduces the complexity of guaranteeing that clients view data consistently. Data stores often opt for a relaxed approach to replication, guaranteeing only eventual consistency, since it improves latency of operations. However, this may lead to replicas having different values for the same data. One solution to control the divergence of data in eventually consistent systems is the usage of metrics that measure how stale data is for a replica. In the past, several algorithms have been proposed to estimate the value of these metrics in a deterministic way. An alternative solution is to rely on probabilistic metrics that estimate divergence with a certain degree of certainty. This relaxes the need to contact all replicas while still providing a relatively accurate measurement. In this work we designed and implemented a solution to estimate the divergence of data in eventually consistent data stores, that scale to many replicas by allowing clientside caching. Measuring the divergence when there is a large number of clients calls for the development of new algorithms that provide probabilistic guarantees. Additionally, unlike previous works, we intend to focus on measuring the divergence relative to a state that can lead to the violation of application invariants.
Partially funded by project PTDC/EIA EIA/108963/2008 and by an ERC Starting Grant, Agreement Number 307732
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Clay, Lenitra M. "Replication techniques for scalable content distribution in the internet." Diss., Georgia Institute of Technology, 2002. http://hdl.handle.net/1853/8491.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Karavakis, Edward. "A distributed analysis and monitoring framework for the compact Muon solenoid experiment and a pedestrian simulation." Thesis, Brunel University, 2010. http://bura.brunel.ac.uk/handle/2438/4409.

Повний текст джерела
Анотація:
The design of a parallel and distributed computing system is a very complicated task. It requires a detailed understanding of the design issues and of the theoretical and practical aspects of their solutions. Firstly, this thesis discusses in detail the major concepts and components required to make parallel and distributed computing a reality. A multithreaded and distributed framework capable of analysing the simulation data produced by a pedestrian simulation software was developed. Secondly, this thesis discusses the origins and fundamentals of Grid computing and the motivations for its use in High Energy Physics. Access to the data produced by the Large Hadron Collider (LHC) has to be provided for more than five thousand scientists all over the world. Users who run analysis jobs on the Grid do not necessarily have expertise in Grid computing. Simple, userfriendly and reliable monitoring of the analysis jobs is one of the key components of the operations of the distributed analysis; reliable monitoring is one of the crucial components of the Worldwide LHC Computing Grid for providing the functionality and performance that is required by the LHC experiments. The CMS Dashboard Task Monitoring and the CMS Dashboard Job Summary monitoring applications were developed to serve the needs of the CMS community.
Стилі APA, Harvard, Vancouver, ISO та ін.
Більше джерел

Книги з теми "Replication of computing experiment"

1

Williamson, Jill. Replication: The Jason experiment. Grand Rapids, Mich: Zondervan, 2013.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

SYBASE replication server primer. New York: McGraw-Hill, 1995.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Charron-Bost, Bernadette, Fernando Pedone, and André Schiper. Replication: Theory and practice. Berlin: Springer-Verlag, 2010.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Stolze, Joachim. Quantum computing: A short course from theory to experiment. 2nd ed. Weinheim: Wiley-VCH, 2008.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Power, Christopher. The Mobile Movie Database: An experiment in location context accuracy. London, ON: Dept. of Computer Science, University of Western Ontario, 2004.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Power, Christopher. The mobile movie database: An experiment in location context accuracy. London, Ont: Dept. of Computer Science, University of Western Ontario, 2003.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

1953-, Vidmar Thomas J., and McKean Joseph W. 1944-, eds. Drug interaction and lethality analysis. Boca Raton, Fla: CRC Press, 1988.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Kloeden, Peter E. Numerical solution of SDE through computer experiments. 2nd ed. Berlin: Springer, 1997.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Eckhard, Platen, and Schurz Henri, eds. Numerical solution of SDE through computer experiments. Berlin: Springer-Verlag, 1994.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Paul, Sujoy. Pro SQL Server 2005 Replication (Definitive Guide). Apress, 2006.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Більше джерел

Частини книг з теми "Replication of computing experiment"

1

Aizenberg, Lev. "Computing Experiment." In Carleman’s Formulas in Complex Analysis, 192–203. Dordrecht: Springer Netherlands, 1993. http://dx.doi.org/10.1007/978-94-011-1596-4_9.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Shapiro, Marc, and Yasushi Saito. "Scaling Optimistic Replication." In Future Directions in Distributed Computing, 164–68. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/3-540-37795-6_30.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Vu, Quang Hieu, Mihai Lupu, and Beng Chin Ooi. "Load Balancing and Replication." In Peer-to-Peer Computing, 127–56. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-03514-2_5.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Zhang, Jin, and Dietmar Maringer. "Index Mutual Fund Replication." In Natural Computing in Computational Finance, 109–30. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-13950-5_7.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Zhao, Dong, Ya-wei Li, and Ming-tian Zhou. "Research on Adaptable Replication Protocol." In Grid and Cooperative Computing, 174–78. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-24680-0_27.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Comer, Douglas E. "Orchestration: Automated Replication And Parallelism." In The Cloud Computing Book, 127–40. Boca Raton: Chapman and Hall/CRC, 2021. http://dx.doi.org/10.1201/9781003147503-13.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Nitta, Nao, and Akira Suyama. "Autonomous Biomolecular Computer Modeled after Retroviral Replication." In DNA Computing, 203–12. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-24628-2_20.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Kraemer-Fuhrmann, Ottmar, and Yona Raekow. "Business Experiment Ship Building." In Grid and Cloud Computing, 159–72. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-05193-7_10.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Stantchev, Vladimir, and Miroslaw Malek. "Translucent Replication for Service Level Assurance." In High Assurance Services Computing, 1–18. Boston, MA: Springer US, 2009. http://dx.doi.org/10.1007/978-0-387-87658-0_1.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Lingamaneni, Abhin S., Adarsh Mishra, and Dinkar Sitaram. "Predicting Replication Time in Cassandra." In EAI/Springer Innovations in Communication and Computing, 227–39. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-47560-4_18.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.

Тези доповідей конференцій з теми "Replication of computing experiment"

1

Kim, Junyeong, and Doo-Hyun Kim. "Experimental Analysis of Primary-Shadow Replication Scheme for Fault-Tolerant Operational Flight Program of Small Scale UAV." In 2011 IEEE 14th International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing (ISORC). IEEE, 2011. http://dx.doi.org/10.1109/isorc.2011.30.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

ONeill, Derek, Jay Aikat, and Kevin Jeffay. "Experiment Replication Using ProtoGENI nodes." In 2013 Second GENI Research and Educational Experiment Workshop. IEEE, 2013. http://dx.doi.org/10.1109/gree.2013.11.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Pedone, Fernando, and Rui Oliveira. "From Object Replication to Database Replication." In 2009 Fourth Latin-American Symposium on Dependable Computing (LADC). IEEE, 2009. http://dx.doi.org/10.1109/ladc.2009.28.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Rajagopalan, Shriram, Dan Williams, and Hani Jamjoom. "Pico replication." In SOCC '13: ACM Symposium on Cloud Computing. New York, NY, USA: ACM, 2013. http://dx.doi.org/10.1145/2523616.2523635.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Slaughter, Elliott, Wonchan Lee, Sean Treichler, Wen Zhang, Michael Bauer, Galen Shipman, Patrick McCormick, and Alex Aiken. "Control replication." In SC '17: The International Conference for High Performance Computing, Networking, Storage and Analysis. New York, NY, USA: ACM, 2017. http://dx.doi.org/10.1145/3126908.3126949.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Ahadi, Alireza, Arto Hellas, Petri Ihantola, Ari Korhonen, and Andrew Petersen. "Replication in computing education research." In Koli Calling 2016: 16th Koli Calling International Conference on Computing Education Research. New York, NY, USA: ACM, 2016. http://dx.doi.org/10.1145/2999541.2999554.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Doherty, Cormac J., and Neil J. Hurley. "Hierarchical Policy-Based Replication." In 2007 IEEE International Performance, Computing, and Communications Conference. IEEE, 2007. http://dx.doi.org/10.1109/pccc.2007.358902.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Juristo, Natalia, and Sira Vegas. "Design Patterns in Software Maintenance: An Experiment Replication at UPM - Experiences with the RESER'11 Joint Replication Project." In 2011 Second International Workshop on Replication in Empirical Software Engineering Research (RESER). IEEE, 2011. http://dx.doi.org/10.1109/reser.2011.8.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Kobus, Tadeusz, Maciej Kokocinski, and Pawel T. Wojciechowski. "Hybrid Replication: State-Machine-Based and Deferred-Update Replication Schemes Combined." In 2013 IEEE 33rd International Conference on Distributed Computing Systems (ICDCS). IEEE, 2013. http://dx.doi.org/10.1109/icdcs.2013.30.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Vegas, Sira, Natalia Juristo, Ana Moreno, Martín Solari, and Patricio Letelier. "Analysis of the influence of communication between researchers on experiment replication." In the 2006 ACM/IEEE international symposium. New York, New York, USA: ACM Press, 2006. http://dx.doi.org/10.1145/1159733.1159741.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.

Звіти організацій з теми "Replication of computing experiment"

1

Reimão, Maira Emy. Cash and change: a replication study of a cash transfer experiment in Malawi. International Initiative for Impact Evaluation (3ie), January 2019. http://dx.doi.org/10.23846/rps0021.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Quarrie, David R. The BaBar Experiment - Computing Issues for the year 2000. Office of Scientific and Technical Information (OSTI), June 2003. http://dx.doi.org/10.2172/813262.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Lhachimi, Stefan K., and Till Seuring. Thou shalt be given... but how? A replication study of a randomized experiment on food assistance in northern Ecuador. International Initiative for Impact Evaluation (3ie), November 2018. http://dx.doi.org/10.23846/rps0017.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Farbin, Amir. DoE Early Career Research Program: Final Report: Model-Independent Dark-Matter Searches at the ATLAS Experiment and Applications of Many-core Computing to High Energy Physics. Office of Scientific and Technical Information (OSTI), July 2015. http://dx.doi.org/10.2172/1193786.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Nobile, F., Q. Ayoul-Guilmard, S. Ganesh, M. Nuñez, A. Kodakkal, C. Soriano, and R. Rossi. D6.5 Report on stochastic optimisation for wind engineering. Scipedia, 2022. http://dx.doi.org/10.23967/exaqute.2022.3.04.

Повний текст джерела
Анотація:
This report presents the latest methods of optimisation under uncertainties investigated in the ExaQUte project, and their applications to problems related to civil and wind engineering. The measure of risk throughout the report is the conditional value at risk. First, the reference method is presented: the derivation of sensitivities of the risk measure; their accurate computation; and lastly, a practical optimisation algorithm with adaptive statistical estimation. Second, this method is directly applied to a nonlinear relaxation oscillator (FitzHugh–Nagumo model) with numerical experiments to demonstrate its performance. Third, the optimisation method is adapted to the shape optimisation of an airfoil and illustrated by a large-scale experiment on a computing cluster. Finally, the benchmark of the shape optimisation of a tall building under a turbulent flow is presented, followed by an adaptation of the optimisation method. All numerical experiments showcase the open-source software stack of the ExaQUte project for large-scale computing in a distributed environment.
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Shamonia, Volodymyr H., Olena V. Semenikhina, Volodymyr V. Proshkin, Olha V. Lebid, Serhii Ya Kharchenko, and Oksana S. Lytvyn. Using the Proteus virtual environment to train future IT professionals. [б. в.], February 2020. http://dx.doi.org/10.31812/123456789/3760.

Повний текст джерела
Анотація:
Based on literature review it was established that the use of augmented reality as an innovative technology of student training occurs in following directions: 3D image rendering; recognition and marking of real objects; interaction of a virtual object with a person in real time. The main advantages of using AR and VR in the educational process are highlighted: clarity, ability to simulate processes and phenomena, integration of educational disciplines, building an open education system, increasing motivation for learning, etc. It has been found that in the field of physical process modelling the Proteus Physics Laboratory is a popular example of augmented reality. Using the Proteus environment allows to visualize the functioning of the functional nodes of the computing system at the micro level. This is especially important for programming systems with limited resources, such as microcontrollers in the process of training future IT professionals. Experiment took place at Borys Grinchenko Kyiv University and Sumy State Pedagogical University named after A. S. Makarenko with students majoring in Computer Science (field of knowledge is Secondary Education (Informatics)). It was found that computer modelling has a positive effect on mastering the basics of microelectronics. The ways of further scientific researches for grounding, development and experimental verification of forms, methods and augmented reality, and can be used in the professional training of future IT specialists are outlined in the article.
Стилі APA, Harvard, Vancouver, ISO та ін.
Також вас можуть зацікавити розширені добірки на тему "Replication of computing experiment" для конкретних типів джерел:
Статті в журналах Дисертації Книги
Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!

До бібліографії