Thematische Bibliographien / Paraller programs testing

Inhaltsverzeichnis

Zeitschriftenartikel
Dissertationen
Bücher
Buchteile
Konferenzberichte

Auswahl der wissenschaftlichen Literatur zum Thema „Paraller programs testing“

Autor: Grafiati

Veröffentlicht am 28. Juni 2021

Zuletzt aktualisiert am 1. Februar 2022

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Paraller programs testing" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Zeitschriftenartikel zum Thema "Paraller programs testing"

Liang, Yu, Shu Li, Hui Zhang und Chengde Han. „Timing-sequence testing of parallel programs“. Journal of Computer Science and Technology 15, Nr. 1 (Januar 2000): 84–95. http://dx.doi.org/10.1007/bf02951930.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Yang, Cheer-Sun D., und Lori L. Pollock. „All-uses testing of shared memory parallel programs“. Software Testing, Verification and Reliability 13, Nr. 1 (Januar 2003): 3–24. http://dx.doi.org/10.1002/stvr.262.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Souza, S. R. S., S. R. Vergilio, P. S. L. Souza, A. S. Simão und A. C. Hausen. „Structural testing criteria for message-passing parallel programs“. Concurrency and Computation: Practice and Experience 20, Nr. 16 (November 2008): 1893–916. http://dx.doi.org/10.1002/cpe.1297.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

HINSEN, KONRAD. „HIGH-LEVEL PARALLEL SOFTWARE DEVELOPMENT WITH PYTHON AND BSP“. Parallel Processing Letters 13, Nr. 03 (September 2003): 473–84. http://dx.doi.org/10.1142/s0129626403001434.

Der volle Inhalt der Quelle

Annotation:

One of the main obstacles to a more widespread use of parallel computing in computational science is the difficulty of implementing, testing, and maintaining parallel programs. The combination of a simple parallel computation model, BSP, and a high-level programming language, Python, simplifies these tasks significantly. It allows the rapid development facilities of Python to be applied to parallel programs, providing interactive development as well as interactive debugging of parallel programs.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Kähkönen, Kari, Olli Saarikivi und Keijo Heljanko. „LCT: A Parallel Distributed Testing Tool for Multithreaded Java Programs“. Electronic Notes in Theoretical Computer Science 296 (August 2013): 253–59. http://dx.doi.org/10.1016/j.entcs.2013.09.002.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Alghamdi, Ahmed Mohammed, Fathy Elbouraey Eassa, Maher Ali Khamakhem, Abdullah Saad AL-Malaise AL-Ghamdi, Ahmed S. Alfakeeh, Abdullah S. Alshahrani und Ala A. Alarood. „Parallel Hybrid Testing Techniques for the Dual-Programming Models-Based Programs“. Symmetry 12, Nr. 9 (20.09.2020): 1555. http://dx.doi.org/10.3390/sym12091555.

Der volle Inhalt der Quelle

Annotation:

The importance of high-performance computing is increasing, and Exascale systems will be feasible in a few years. These systems can be achieved by enhancing the hardware’s ability as well as the parallelism in the application by integrating more than one programming model. One of the dual-programming model combinations is Message Passing Interface (MPI) + OpenACC, which has several features including increased system parallelism, support for different platforms with more performance, better productivity, and less programming effort. Several testing tools target parallel applications built by using programming models, but more effort is needed, especially for high-level Graphics Processing Unit (GPU)-related programming models. Owing to the integration of different programming models, errors will be more frequent and unpredictable. Testing techniques are required to detect these errors, especially runtime errors resulting from the integration of MPI and OpenACC; studying their behavior is also important, especially some OpenACC runtime errors that cannot be detected by any compiler. In this paper, we enhance the capabilities of ACC_TEST to test the programs built by using the dual-programming models MPI + OpenACC and detect their related errors. Our tool integrated both static and dynamic testing techniques to create ACC_TEST and allowed us to benefit from the advantages of both techniques reducing overheads, enhancing system execution time, and covering a wide range of errors. Finally, ACC_TEST is a parallel testing tool that creates testing threads based on the number of application threads for detecting runtime errors.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

König, Daniel, und Markus Lohrey. „Parallel identity testing for skew circuits with big powers and applications“. International Journal of Algebra and Computation 28, Nr. 06 (September 2018): 979–1004. http://dx.doi.org/10.1142/s0218196718500431.

Der volle Inhalt der Quelle

Annotation:

Powerful skew arithmetic circuits are introduced. These are skew arithmetic circuits with variables, where input gates can be labeled with powers [Formula: see text] for binary encoded numbers [Formula: see text]. It is shown that polynomial identity testing for powerful skew arithmetic circuits belongs to [Formula: see text], which generalizes a corresponding result for (standard) skew circuits. Two applications of this result are presented: (i) Equivalence of higher-dimensional straight-line programs can be tested in [Formula: see text]; this result is even new in the one-dimensional case, where the straight-line programs produce words. (ii) The compressed word problem (or circuit evaluation problem) for certain wreath products of finitely generated abelian groups belongs to [Formula: see text]. Using the Magnus embedding, it follows that the compressed word problem for a free metabelian group belongs to [Formula: see text].

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Suijlen, Wijnand. „Mock BSPlib for Testing and Debugging Bulk Synchronous Parallel Software“. Parallel Processing Letters 27, Nr. 01 (März 2017): 1740001. http://dx.doi.org/10.1142/s0129626417400011.

Der volle Inhalt der Quelle

Annotation:

Testing parallel applications on a large number of processors is often impractical. Not only does it require access to scarce compute resources, but tracking down defects with the available debugging tools can often be very time consuming. Highly parallel codes should be testable on one processor at a time, so that a developer’s workstation is sufficient for executing and debugging test cases on millions of processes. Thanks to its supersteps, Bulk Synchronous Parallel programs are well suited for this kind of testing. This paper presents a mocking library for BSPlib which enables testing of fast and complex parallel algorithms at scale.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Williams, Marc S. „Early Lessons from the Implementation of Genomic Medicine Programs“. Annual Review of Genomics and Human Genetics 20, Nr. 1 (31.08.2019): 389–411. http://dx.doi.org/10.1146/annurev-genom-083118-014924.

Der volle Inhalt der Quelle

Annotation:

Massively parallel sequencing is emerging from research settings into clinical practice, helping the vision of precision medicine to become a reality. The most successful applications are using the tools of implementation science within the framework of the learning health-care system. This article examines the application of massively parallel sequencing to four clinical scenarios: pharmacogenomics, diagnostic testing, somatic testing for molecular tumor characterization, and population screening. For each application, it highlights an exemplar program to illustrate the enablers and challenges of implementation. International examples are also presented. These early lessons will allow other programs to account for these factors, helping to accelerate the implementation of precision medicine and health.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Delamaro, Márcio E., Stevão A. Andrade, Simone R. S. de Souza und Paulo S. L. de Souza. „Parallel Execution of Programs as a Support for Mutation Testing: A Replication Study“. International Journal of Software Engineering and Knowledge Engineering 31, Nr. 03 (März 2021): 337–80. http://dx.doi.org/10.1142/s0218194021500121.

Der volle Inhalt der Quelle

Annotation:

Mutation testing is well known as one of the most effective approaches to create test cases, which can detect software faults. However, its drawback is the low scalability — if no special attention is given to improve efficiency — that directly affects its application in practice. This paper shows a replication study focused on emphasizing evidence in which the use of distributed processing structures can improve mutation testing. For this purpose, an architecture that enables mutation testing concurrent execution was designed. Five load balancing algorithms responsible for controlling the distribution and execution of data while carrying out mutation testing were evaluated. Experiments were conducted in order to evaluate the scalability and performance of the architecture considering homogeneous and heterogeneous setups. A time reduction of 50% was observed when executing mutants in parallel in relation to the conventional sequential application of mutation testing. The performance gain was above 95% when there was a higher number of nodes in the distributed architecture.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Dissertationen zum Thema "Paraller programs testing"

Ling, David. „Dynamická analýza paralelních programů na platformě .NET Framework“. Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2021. http://www.nusl.cz/ntk/nusl-445497.

Der volle Inhalt der Quelle

Annotation:

The thesis deals with a design and implementation of the dynamic analyser of parallel applications on the .NET Framework platform. The problematic of synchronization in parallel applications, the instrumentation of such an applications, testing of parallel applications and a specifics of these problems for C\# language and for the platform .NET Framework are discussed in the theoretical part. Selected algorithms for detection of deadlocks (the algorithm of Goodlock) and data-race errors (the algorithm of FastTrack and AtomRace) are described in detail in this part as well. Requirements for the dynamic analyser and the system design is made in the following part of this thesis. The thesis also contains a description of the implementation of the proposed solution, a description of the entire testing of the implemented tool. Last but not least, the thesis describes the sample of using dynamic analysers in a particular application environment.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Andrade, Stevão Alves de. „Execução paralela de programas como suporte ao teste de mutação“. Universidade de São Paulo, 2016. http://www.teses.usp.br/teses/disponiveis/55/55134/tde-21112016-103423/.

Der volle Inhalt der Quelle

Annotation:

Teste de software desempenha um papel fundamental no processo de produção de um produto de software de qualidade. Com o passar dos anos, diversas técnicas e critérios de teste de software foram desenvolvidos a fim de estabelecer meios e métricas para guiar a criação de casos de teste efetivos, capazes de evidenciar defeitos no produto avaliado. Dentre os principais critérios para teste de software está o Teste de Mutação, que foi amplamente difundido e é tido como uma das abordagens mais eficazes para guiar a criação de conjuntos de casos de teste capazes de revelar defeitos em software. Entretanto, à medida que esse critério possui uma grande efetividade para revelar defeitos, ele peca pelo baixo poder de escalabilidade, o que acaba comprometendo diretamente a sua capacidade de aplicação. Neste sentido, diversos estudos foram desenvolvidos nesta área dedicando-se a aprimorar o seu desempenho e torná-lo uma alternativa viável para aplicação durante a fase de teste de software. Este trabalho apresenta indícios de que a utilização de estruturas complexas de processamento pode apoiar a aplicação do Teste de Mutação. Para tal, foi concebida uma arquitetura que possibilite a aplicação do Teste de Mutação em paralelo. Após a implementação da arquitetura foram avaliados cinco algoritmos de balanceamento de carga responsáveis por controlar a distribuição e execução do Teste de Mutação. Durante a avaliação experimental da arquitetura e dos algoritmos, observou-se que nos piores cenários avaliados foi possível atingir um ganho de desempenho acima de 70% em relação à aplicação sequencial convencional do Teste de Mutação enquanto nos melhores cenários o ganho de desempenho foi acima 95%, contudo, necessitando utilizar-se de uma infraestrutura mais robusta para a execução da arquitetura.
Software testing plays a fundamental role in the development process of quality software systems. Over the years, many software testing techniques and criteria were developed to provide means and metrics to guide the development of effective test cases, able to find defects on the product being assessed. Among major criteria for software testing is the mutation testing, which was broadly broadcast and is likely one of the most effective approaches for creating sets of test cases able to uncover software bugs. However, although mutating testing has a great effectiveness to uncover defects in a product, it suffers from low scalability, which directly compromises its applicability. In this sense, many studies were developed in this area aiming at improving the performance of that criterion and make it a viable alternative for its application throughout the software testing process. This work presents evidence that the use of complex structures of processing can support mutation testing application. For this, it was established an architecture that enables mutation testing to be performed in parallel. After implementing the architecture, five load balance algorithms to controlling the distribution and execution of mutation testing were analyzed. During the experimental evaluation of the architecture and algorithms, it was observed that in the worst evaluated scenarios it was possible to reach a gain in performance of up to 70% in comparison to the conventional application (sequential). In the best scenarios the gain was over 95% in exchange of using a more robust infrastructure for the execution of the architecture.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Endo, André Takeshi. „Teste de composição de web services: uma estratégia baseada em um modelo de teste de programas paralelos“. Universidade de São Paulo, 2008. http://www.teses.usp.br/teses/disponiveis/55/55134/tde-21052008-111500/.

Der volle Inhalt der Quelle

Annotation:

WEb Services constituem uma tecnologia emergente utilizada para disponibilização de serviços na Web. Devido aos complexos processos de negócio existentes, esses serviços são combinados para que operem seguindo um fluxo de trabalho. Esse processo é chamado de composição de Web Services. Como no processo de desenvolvimento de um software tradicional, a atividade de teste é fundamental no processo de desenvolvimento da composição de Web Services. Neste trabalho é proposta uma estratégia de teste para a composição de Web Services, em que especificações de composições são transformadas para um modelo de teste de programas paralelos baseados em passagem de mensagens. É proposto o conceito de grupos de elementos requeridos para melhorar a cobertura dos critérios. Uma ferramenta de apoio à estratégia de teste foi desenvolvida. Alguns estudos experimentais para avaliar a aplicabilidade da estratégia proposta também são apresentados. Além disso, é proposto um método que utiliza redes de Petri para eliminar sincronizações não-executáveis no envio e recebimento de mensagens
WEb Services constitute an emerging technology for deploying services in the Web. Due to the complex business processes, these services are combined to operate, following a workflow. This process is named Web Services Composition. As in the development process of a traditional software, the testing activity is fundamental in the development process of Web Services Composition. This work proposes a test strategy for Web Services Composition, in that composition specifications are transformed into a test model of message-passing parallel programs. The concept of required elements groups is proposed to improve the criteria coverage. A tool that supports the test strategy was developed. Some experimental studies for evaluating the applicability of proposed strategy are also presented. Furthermore, it presents a method that uses Petri Nets to eliminate non-executable synchronizations in the sending and receiving of messages

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Batista, Raphael Negrisoli. „Otimizando o teste estrutural de programas concorrentes: uma abordagem determinística e paralela“. Universidade de São Paulo, 2015. http://www.teses.usp.br/teses/disponiveis/55/55134/tde-03082015-110554/.

Der volle Inhalt der Quelle

Annotation:

O teste de programas concorrentes é uma atividade custosa devido principalmente à quantidade de sequências de sincronização que devem ser testadas para validar tais programas. Uma das técnicas mais utilizadas para testar a comunicação e sincronização de programas concorrentes é a geração automática de diferentes pares de sincronização ou, em outras palavras, a geração de variantes de disputa (race variant). Nesta técnica as variantes de disputa são geradas a partir de arquivos de rastro de uma execução não-determinística e algoritmos de execução determinística são utilizados para forçar que diferentes sincronizações sejam cobertas. Este trabalho aborda de maneira abrangente este problema, cujo objetivo principal é reduzir o tempo de resposta da atividade de teste estrutural de programas concorrentes quando diferentes variantes de disputa são executadas. Há três principais contribuições neste trabalho: (1) geração de arquivos de rastro e execução determinística total/parcial, (2) geração automática de variantes e (3) paralelização da execução das variantes. Diferentemente de outros trabalhos disponíveis na literatura, os algoritmos propostos consideram programas concorrentes que interagem simultaneamente com passagem de mensagens e memória compartilhada. Foram consideradas seis primitivas com semânticas distintas: ponto-a-ponto bloqueante/não bloqueante, coletivas um-para-todos/todos-para-um/todos-para-todos e semáforos. Os algoritmos foram desenvolvidos no nível de aplicação em Java, são ortogonais à linguagem de programação utilizada e não requerem privilégios de sistema para serem executados. Estas três contribuições são descritas, detalhando seus algoritmos. Também são apresentados os resultados obtidos com os experimentos feitos durante as fases de validação e avaliação de cada contribuição. Os resultados demonstram que os objetivos propostos foram atingidos com sucesso para cada contribuição e, do ponto de vista do testador, o tempo de resposta da atividade de teste estrutural de programas concorrentes foi reduzido enquanto a cobertura de programas concorrentes com ambos os paradigmas aumentou com procedimentos automatizados e transparentes. Os experimentos mostram speedups próximos ao linear, quando comparadas as versões sequencial e paralela dos algoritmos.
The testing of concurrent programs is an expensive task, mainly because it needs to test a high number of synchronization sequences, in order to validate such programs. One of the most used techniques to test communication and synchronization of concurrent programs is the automatic generation of different synchronizations pairs (or generation of race variants). Race variants are generated from the trace files of a nondeterministic execution, and the deterministic executions force the coverage of different synchronizations. This work approaches this problem in a more general way. It reduces the response time of the structural testing of concurrent programs when different variants are required. There are three main contributions in this work: the generation of trace files and the total or partial deterministic execution, the automatic generation of race variants and the parallelization of execution of race variants. The proposed algorithms take into account concurrent programs that interact simultaneously with message passing and shared memory, including six primitives with distinct semantics: blocking and non-blocking point-to-point, all-to-all/one-to-all/all-toone collectives and shared memory. The algorithms have been implemented in Java in the application level, they are language independent and do not need system privileges to execute. Results obtained during the validation and evaluation phase are also presented and they show that the proposed objectives are reached with success. From the tester viewpoint, the response time of structural testing of concurrent programs was reduced, while the coverage of the concurrent programs with both paradigms increased with automatic and transparent procedures. The experiments showed speedups close to linear, when comparing the sequential and parallel versions.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Janoušek, Martin. „Dynamické analyzátory pro platformu SearchBestie“. Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2017. http://www.nusl.cz/ntk/nusl-363883.

Der volle Inhalt der Quelle

Annotation:

This master thesis deals with the design and implementation of dynamic analyzer of parametrized contracts . In the first part of the thesis , the problematics of testing of parallel programs are discussed and issues when dealing with parallelism are described . Further , methods how to reveal concurrency bugs via dynamic analysis are described , in particular FastTrack and Contract validator. The second part of the thesis proposes an extension for RoadRunner framework and SearchBestie platform for contract validator with parameters.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Hwan, Hwang Gwan, und 黃冠寰. „A systematic parallel testing method for concurrent program“. Thesis, 1993. http://ndltd.ncl.edu.tw/handle/22315907608667548436.

Der volle Inhalt der Quelle

Annotation:

碩士
國立交通大學
資訊工程研究所
81
The validation process of a concurrent program includes the testing and debugging phase. The testing of concurrent programs is the process of executing the concurrent program and then verifies the results to detect whether the concurrent program existing bugs or not. We suggest a systematic parallel testing method which can sutomatically test the concurrent program in parallel without repeating the same test. The scheme can even exhaust all the possible tests of a concurrent program. Also, it does not use any static analysis technique but works in run time dynamically. Thus, it can reduce the static analysis overhead. Furthermore, this scheme is suitable for the multiprocessor computer system and the distributed system. It can speed up the testing in the following ways. First, because our method can naturally work in parallel, users can spend less time doing the testing. Second, the duplicated computation of different tests can be eliminated. We describe a prototype implementation of our scheme in Sequent Symmetry S27, a shared- bus multiprocessor computer system. In addition, we also create a virual parallel processing environment to simulate an example.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Bücher zum Thema "Paraller programs testing"

Kuo-Chung, Tai, Hrsg. Modern multithreading: Implementing, testing, and debugging multithreaded Java and C++/Pthreads/Win32 programs. Hoboken, NJ: Wiley, 2006.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Carver, Richard H., und Kuo-Chung Tai. Modern Multithreading: Implementing, Testing, and Debugging Multithreaded Java and C++/Pthreads/Win32 Programs. Wiley & Sons, Incorporated, John, 2007.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Carver, Richard H., und Kuo-Chung Tai. Modern Multithreading : Implementing, Testing, and Debugging Multithreaded Java and C++/Pthreads/Win32 Programs. Wiley-Interscience, 2005.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

National Institute of Standards and Technology (U.S.), Hrsg. S-Check, by example. Gaithersburg, MD: U.S. Dept. of Commerce, Technology Administration, National Institute of Standards and Technology, 1997.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

S-Check, by example. Gaithersburg, MD: U.S. Dept. of Commerce, Technology Administration, National Institute of Standards and Technology, 1997.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Buchteile zum Thema "Paraller programs testing"

Farchi, Eitan. „Smart Interleavings for Testing Parallel Programs“. In Programming multi-core and many-core computing systems, 321–42. Hoboken, NJ, USA: John Wiley & Sons, Inc., 2017. http://dx.doi.org/10.1002/9781119332015.ch16.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Krawczyk, H., und B. Wiszniewski. „Interactive testing tool for parallel programs“. In Software Engineering for Parallel and Distributed Systems, 98–109. Boston, MA: Springer US, 1996. http://dx.doi.org/10.1007/978-0-387-34984-8_9.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Jackson, David, und Martin R. Woodward. „Parallel Firm Mutation of Java Programs“. In Mutation Testing for the New Century, 55–61. Boston, MA: Springer US, 2001. http://dx.doi.org/10.1007/978-1-4757-5939-6_10.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Kranzlmüller, Dieter, Martin Maurer, Markus Löberbauer, Christian Schaubschläger und Jens Volkert. „Ant — A Testing Environment for Nondeterministic Parallel Programs“. In Distributed and Parallel Systems, 125–32. Boston, MA: Springer US, 2002. http://dx.doi.org/10.1007/978-1-4615-1167-0_15.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Kranzlmüller, D., Ch Schaubschläger und J. Chassin de Kergommeaux. „Correction of Monitor Intrusion for Testing Nondeterministic MPI-Programs“. In Euro-Par’99 Parallel Processing, 154–58. Berlin, Heidelberg: Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-48311-x_17.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

de Souza, Paulo Lopes, Eduardo T. Sawabe, Adenilso da Silva Simão, Silvia R. Vergilio und Simone do Rocio Senger de Souza. „ValiPVM - A Graphical Tool for Structural Testing of PVM Programs“. In Recent Advances in Parallel Virtual Machine and Message Passing Interface, 257–64. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-87475-1_35.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Singh, Gurdip, und Hong Liu. „Validating Protocol Composition for Progress by Parallel Step Reachability Analysis“. In Formal Description Techniques and Protocol Specification, Testing and Verification, 239–50. Boston, MA: Springer US, 1997. http://dx.doi.org/10.1007/978-0-387-35271-8_15.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Pacheco, Hugo, Jonathan Pino, Julio Santana, Pablo Ulloa und Jorge E. Pezoa. „Classifying Execution Times in Parallel Computing Systems: A Classical Hypothesis Testing Approach“. In Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications, 709–17. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-25085-9_84.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Krimmer, Robert, Andriana Prentza, Szymon Mamrot und Carsten Schmidt. „The Once-Only Principle: A Matter of Trust“. In The Once-Only Principle, 1–8. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-79851-2_1.

Der volle Inhalt der Quelle

Annotation:

AbstractThe Single Market is one of the cornerstones of the European Union. The idea to transform it into a Digital Single Market (DSM) was outlined several years ago. The EU has started different initiatives to support this transformation process. One of them is the program Horizon 2020 to support the process from a technical point of view. In parallel to this, initiatives were started to set up a sound legal framework for the DSM. The Single Digital Gateway Regulation (SDGR) is an outcome of these initiatives. The key aspect of the SDGR is the underlying Once-Only Principle (OOP), outlining that businesses and citizens in contact with public administrations have to provide data only once. “The Once-Only Principle Project (TOOP)” is the EU-funded project initiated for research, testing, and implementation of the OOP in Europe. The authors give an overview of the research questions of the different parts of TOOP. Besides that, they introduce the other chapters of this book and what the reader can expect as the content of them.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Nozdrzykowski, Łukasz, und Magdalena Nozdrzykowska. „Testing the Significance of Parameters of Models Estimating Execution Time of Parallel Program Loops According to the Open MPI Standard“. In Advances in Dependability Engineering of Complex Systems, 331–39. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-59415-6_32.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Konferenzberichte zum Thema "Paraller programs testing"

Diaz, Silvia Diaz, Paulo Lopes Souza und Simone Souza. „A structural testing tool for MPI programs with loops“. In XX Simpósio em Sistemas Computacionais de Alto Desempenho. Sociedade Brasileira de Computação, 2019. http://dx.doi.org/10.5753/wscad.2019.8686.

Der volle Inhalt der Quelle

Annotation:

Há uma alta demanda por programas paralelos corretos, principalmente devido às arquiteturas paralelas atuais, como clusters e processadores multi/many cores. O teste estrutural permite identificar defeitos pela cobertura de estruturas internas de programas paralelos. O não determinismo em programas paralelos traz novos desafios ao teste estrutural. Ele requer ferramentas e modelos de teste especı́ficos, capazes de cobrir primitivas de comunicação e sincronização com comportamentos dinâmicos, tais como os presentes em loops. Este artigo propõe uma nova ferramenta de software para o teste estrutural, com o objetivo de auxiliar testadores na revelação de defeitos desconhecidos associados a comunicação e presentes em estruturas de repetição de programas paralelos em C/MPI. Baseando-se na cobertura obtida, testadores podem escolher casos de teste especı́ficos e avaliar o progresso da atividade de teste. A ferramenta de teste proposta é validada com a ingestão de defeitos no código de um programa, e com a análise do suporte dado pela ferramenta para a geração de elementos requeridos e seleção de casos de teste. A ferramenta proposta automatiza parte da atividade de teste, especificamente a geração de elementos requeridos e guia a execução dos testes, reduzindo o tempo para a aplicação da atividade de teste. Nossos resultados mostram que a ferramenta de teste é capaz de revelar defeitos desconhecidos em primitivas de comunicação presentes em iterações de loops. There is a growing demand for correct parallel programs, mainly due to nowadays parallel architectures, such as clusters and multi/many-core processors. Structural testing allows the identification of defects by covering internal structures of parallel programs. Nondeterminism in parallel programs brings new challenges to the structural testing. It requires specific test model and tools, capable to cover communication and synchronization primitives with dynamic behaviors, such as those present inside of loops. This paper proposes a novel software tool for the structural testing, aiming to help testers in revealing defects associated to communication present in repetition structures of C/MPI parallel programs. Based on the obtained coverage, testers can choose specific test cases and evaluate the progress of the testing activity. We validate the proposed testing software tool by injecting a defect in a program code, and analyzing the support for generation of required elements and selection of test cases. ValiMPI tool automates part of the test activity, specifically the generation of required elements to guide test case selection, reducing the application cost of the testing activity. Our results demonstrate that the testing tool is capable to reveal unknown defects from communication in different loop iterations.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Do, Canh Minh, und Kazuhiro Ogata. „Parallel stratified random testing for concurrent programs“. In 2020 IEEE 20th International Conference on Software Quality, Reliability and Security Companion (QRS-C). IEEE, 2020. http://dx.doi.org/10.1109/qrs-c51114.2020.00024.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Gong, Xufang, Yanchen Wang, Ying Zhou und Bixin Li. „On Testing Multi-threaded Java Programs“. In Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007). IEEE, 2007. http://dx.doi.org/10.1109/snpd.2007.165.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Diaz, Silvia, und Paulo Sérgio Souza. „Structural testing criteria for concurrent programs considering loop executions“. In XX Simpósio em Sistemas Computacionais de Alto Desempenho. Sociedade Brasileira de Computação - SBC, 2019. http://dx.doi.org/10.5753/wscad_estendido.2019.8711.

Der volle Inhalt der Quelle

Annotation:

Parallel programs are imperative for improving performance and problem solving, having an increasing demand on implementing efficient parallel programming techniques. This entails new challenges on software testing to ensure their quality and reliability. Structural testing is a technique that allows the identification of concurrency defects by analyzing the internal structure of the program. However, the non-determinism of concurrent programs has implications in the testing activity, requiring the use of structured methods to reveal defects. Testing criteria support the selection of test cases in a systematic form by statically analysing elements of concurrent programs. We found that there are currently gaps in the definition of testing criteria contemplating scenarios with elements that are dynamically evaluated, such as the execution of communication primitives inside loops. The objective of this project is to define structural testing criteria to guide the selection of test cases, improving the reliability of concurrent programs by revealing non-determinism related errors present in repetition structures. We developed a Concurrent Defects Taxonomy, identifying and classifying concurrency types of defects found in related literature. The analysis of such defects, paths inside loops, number of loop iterations, and nested loops allow us to model the proposed structural testing criteria. We define new sets and associations related to communication and synchronization flows for message-passing programs, establishing a model for testing criteria. We implemented the proposed test model in ValiMPI, a testing tool prototype, considering the new concepts defined in our test model, generating required elements and evaluating coverage after constructing loop paths. For the application evaluation of criteria we perform an empirical study with statistical validation, indicating the results for cost, effectiveness and strength. Our experimental evaluation demonstrated that the proposed testing criteria generates required elements that support the identification of concurrency defects occurring in different loop iterations, when having communicational events with non-deterministic behavior.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Damodaran-Kamal, Suresh K., und Joan M. Francioni. „Testing races in parallel programs with an OtOt strategy“. In the 1994 international symposium. New York, New York, USA: ACM Press, 1994. http://dx.doi.org/10.1145/186258.187242.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Endo, André Takeshi, Adenilso da Silva Simão, Simone do Rocio Senger de Souza und Paulo Sergio Lopes de Souza. „Web Services Composition Testing: A Strategy Based on Structural Testing of Parallel Programs“. In Industrial Conference - Practice and Research Techniques (TAIC PART). IEEE, 2008. http://dx.doi.org/10.1109/taic-part.2008.9.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

In Sang Chung, Hyeon Soo Kim, hyun Seop Bae, Yong Rae Kwon und Byung Sun Lee. „Testing of concurrent programs based on message sequence charts“. In Proceedings International Symposium on Software Engineering for Parallel and Distributed Systems. IEEE, 1999. http://dx.doi.org/10.1109/pdse.1999.779740.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wang, Wei, Wu Yang, Lejun Zhang und Lin Guo. „Testing Path Generation Algorithm with Network Performance Constraints for Nondeterministic Parallel Programs“. In 2006 Seventh International Conference on Web-Age Information Management Workshops. IEEE, 2006. http://dx.doi.org/10.1109/waimw.2006.29.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Gerber, Andrew G., Kevin W. Wilcox und Jian T. Zhang. „Benchmarking of a Massively Parallel Hybrid CFD Solver for Ocean Applications“. In ASME 2013 32nd International Conference on Ocean, Offshore and Arctic Engineering. American Society of Mechanical Engineers, 2013. http://dx.doi.org/10.1115/omae2013-10999.

Der volle Inhalt der Quelle

Annotation:

This paper presents progress on the development of a CFD program called EXN/Aero specifically designed to exploit performance gains from new hybrid multicore-manycore computer architectures. The hybrid multicore-manycore design is outlined along with performance and validation testing on an underwater vehicle and unsteady vortex shedding applications. It is shown that by revisiting CFD code design with a view to a number of important trends in the high performance computing industry, significant order of magnitude gains in computational power can be achieved.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Tracy, F., T. Oppe und S. Gavali. „Testing Parallel Linear Iterative Solvers for Finite Element Groundwater Flow Problems“. In 2007 DoD High Performance Computing Modernization Program Users Group Conference. IEEE, 2007. http://dx.doi.org/10.1109/hpcmp-ugc.2007.73.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!