Relevant bibliographies by topics / Application Distribuée Parallèle

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers

Academic literature on the topic 'Application Distribuée Parallèle'

Author: Grafiati
Published: 28 September 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Application Distribuée Parallèle.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Application Distribuée Parallèle"

1

Spahi, Enis, and D. Altilar. "ITU-PRP: Parallel and Distributed Computing Middleware for Java Developers." International Journal of Business & Technology 3, no. 1 (2014): 2–13. http://dx.doi.org/10.33107/ijbte.2014.3.1.01.

Full text
Abstract:
ITU-PRP provides a Parallel Programming Framework for Java Developers on which they can adapt their sequential application code to operate on a distributed multi-host parallel environment. Developers would implement parallel models, such as Loop Parallelism, Divide and Conquer, Master-Slave and Fork-Join by the help of an API Library provided under framework. Produced parallel applications would be submitted to a middleware called Parallel Running Platform (PRP), on which parallel resources for parallel processing are being organized and performed. The middleware creates Task Plans (TP) accord
APA, Harvard, Vancouver, ISO, and other styles
2

César, Eduardo, Anna Morajko, Tomàs Margalef, Joan Sorribes, Antonio Espinosa, and Emilio Luque. "Dynamic Performance Tuning Supported by Program Specification." Scientific Programming 10, no. 1 (2002): 35–44. http://dx.doi.org/10.1155/2002/549617.

Full text
Abstract:
Performance analysis and tuning of parallel/distributed applications are very difficult tasks for non-expert programmers. It is necessary to provide tools that automatically carry out these tasks. These can be static tools that carry out the analysis on a post-mortem phase or can tune the application on the fly. Both kind of tools have their target applications. Static automatic analysis tools are suitable for stable application while dynamic tuning tools are more appropriate to applications with dynamic behaviour. In this paper, we describe KappaPi as an example of a static automatic performa
APA, Harvard, Vancouver, ISO, and other styles
3

VADHIYAR, SATHISH S., and JACK J. DONGARRA. "SRS: A FRAMEWORK FOR DEVELOPING MALLEABLE AND MIGRATABLE PARALLEL APPLICATIONS FOR DISTRIBUTED SYSTEMS." Parallel Processing Letters 13, no. 02 (2003): 291–312. http://dx.doi.org/10.1142/s0129626403001288.

Full text
Abstract:
The ability to produce malleable parallel applications that can be stopped and reconfigured during the execution can offer attractive benefits for both the system and the applications. The reconfiguration can be in terms of varying the parallelism for the applications, changing the data distributions during the executions or dynamically changing the software components involved in the application execution. In distributed and Grid computing systems, migration and reconfiguration of such malleable applications across distributed heterogeneous sites which do not share common file systems provide
APA, Harvard, Vancouver, ISO, and other styles
4

MORAJKO, ANNA, OLEG MORAJKO, JOSEP JORBA, TOMÀS MARGALEF, and EMILIO LUQUE. "AUTOMATIC PERFORMANCE ANALYSIS AND DYNAMIC TUNING OF DISTRIBUTED APPLICATIONS." Parallel Processing Letters 13, no. 02 (2003): 169–87. http://dx.doi.org/10.1142/s0129626403001227.

Full text
Abstract:
The classical way of tuning parallel/distributed applications is based on the analysis of the monitoring information obtained from an execution of the application. However, this "measure and modify" approach is not feasible when the applications have a dynamic behavior. In this case, another approach is required to accomplish performance expectations. This paper presents a solution based on the dynamic tuning approach that addresses these issues. In this approach, an application is monitored, its performance bottlenecks are detected and the application is modified automatically during the exec
APA, Harvard, Vancouver, ISO, and other styles
5

Sikora, Andrzej, and Ewa Niewiadomska-Szynkiewicz. "Parallel and Distributed Simulation of Ad Hoc Networks." Journal of Telecommunications and Information Technology, no. 3 (June 26, 2023): 76–84. http://dx.doi.org/10.26636/jtit.2009.3.943.

Full text
Abstract:
Modeling and simulation are traditional methods used to evaluate wireless network design. This paper addresses issues associated with the application of parallel discrete event simulation to mobile ad hoc networks design and analysis. The basic characteristics and major issues pertaining to ad hoc networks modeling and simulation are introduced. The focus is on wireless transmission and mobility models. Particular attention is paid to the MobASim system, a Javabased software environment for parallel and distributed simulation of mobile ad hoc networks. We describe the design, performance and p
APA, Harvard, Vancouver, ISO, and other styles
6

Baude, Francoise, Denis Caromel, and David Sagnol. "Distributed Objects for Parallel Numerical Applications." ESAIM: Mathematical Modelling and Numerical Analysis 36, no. 5 (2002): 837–61. http://dx.doi.org/10.1051/m2an:2002039.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Ioannidis, Sotiris, Umit Rencuzogullari, Robert Stets, and Sandhya Dwarkadas. "CRAUL: Compiler and Run-Time Integration for Adaptation under Load." Scientific Programming 7, no. 3-4 (1999): 261–73. http://dx.doi.org/10.1155/1999/603478.

Full text
Abstract:
Clusters of workstations provide a cost‐effective, high performance parallel computing environment. These environments, however, are often shared by multiple users, or may consist of heterogeneous machines. As a result, parallel applications executing in these environments must operate despite unequal computational resources. For maximum performance, applications should automatically adapt execution to maximize use of the available resources. Ideally, this adaptation should be transparent to the application programmer. In this paper, we present CRAUL (Compiler and Run‐Time Integration for Adap
APA, Harvard, Vancouver, ISO, and other styles
8

Chen, Wenjie, Qiliang Yang, Ziyan Jiang, et al. "SwarmL: A Language for Programming Fully Distributed Intelligent Building Systems." Buildings 13, no. 2 (2023): 499. http://dx.doi.org/10.3390/buildings13020499.

Full text
Abstract:
Fully distributed intelligent building systems can be used to effectively reduce the complexity of building automation systems and improve the efficiency of the operation and maintenance management because of its self-organization, flexibility, and robustness. However, the parallel computing mode, dynamic network topology, and complex node interaction logic make application development complex, time-consuming, and challenging. To address the development difficulties of fully distributed intelligent building system applications, this paper proposes a user-friendly programming language called Sw
APA, Harvard, Vancouver, ISO, and other styles
9

Collins, C., and M. Duffy. "Distributed (parallel) inductor design for VRM applications." IEEE Transactions on Magnetics 41, no. 10 (2005): 4000–4002. http://dx.doi.org/10.1109/tmag.2005.855163.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Alléon, G., S. Champagneux, G. Chevalier, L. Giraud, and G. Sylvand. "Parallel distributed numerical simulations in aeronautic applications." Applied Mathematical Modelling 30, no. 8 (2006): 714–30. http://dx.doi.org/10.1016/j.apm.2005.06.014.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Application Distribuée Parallèle"

1

Lavallée, Ivan. "Contribution à l'algoritmique parallèle et distribuée : application à l'optimisation combinatoire." Paris 11, 1986. http://www.theses.fr/1986PA112275.

Full text
Abstract:
Cette thèse est divisée en trois parties : la première partie, précédée d'un chapitre 0 qui précise et justifie vocabulaire et notations, est composée de deux chapitres I et II, qui traitent du problème de la terminaison distribuée, apprentissage et détection, l'idée maîtresse étant celle de "mot circulant" qui généralise le concept de jeton circulant. Le mot circulant permettant un apprentissage de propriétés de l'algorithme distribué étudié. Le chapitre II fournit de plus un algorithme distribué d'identification des circuits élémentaires d'un graphe. La deuxième partie est consacrée à l'étud
APA, Harvard, Vancouver, ISO, and other styles
2

Tourancheau, Bernard. "Algorithmique parallèle pour les machines à mémoire distribuée : application aux algorithmes matriciels." Grenoble INPG, 1989. http://tel.archives-ouvertes.fr/tel-00332663/.

Full text
Abstract:
Différents résultats de complexité sont présentés pour les communications et le calcul sur des machines à mémoire distribuée. Les topologies concernées sont le réseau linéaire, l'anneau, la grille, l'hypercube et le réseau complet. Un réseau systolique est présenté pour l'algorithme de diagonalisation de Jordan. Une étude sur l'accélération et une étude de l'allocation des données sont formulées dans le contexte des mémoires distribuées
APA, Harvard, Vancouver, ISO, and other styles
3

Gamom, Ngounou Ewo Roland Christian. "Déploiement d'applications parallèles sur une architecture distribuée matériellement reconfigurable." Thesis, Cergy-Pontoise, 2015. http://www.theses.fr/2015CERG0773/document.

Full text
Abstract:
Parmi les cibles architecturales susceptibles d'être utilisées pour réaliser un système de traitement sur puce (SoC), les architectures reconfigurables dynamiquement (ARD) offrent un potentiel de flexibilité et de dynamicité intéressant. Cependant ce potentiel est encore difficile à exploiter pour réaliser des applications massivement parallèles sur puce. Dans nos travaux nous avons recensé et analysé les solutions actuellement proposées pour utiliser les ARD et nous avons constaté leurs limites parmi lesquelles : l'utilisation d'une technologie particulière ou d'architecture propriétaire, l'a
APA, Harvard, Vancouver, ISO, and other styles
4

Philippe, Jean-Laurent. "Programmation de calculateurs massivement parallèles : application à la factorisation d'entiers." Grenoble INPG, 1990. http://tel.archives-ouvertes.fr/tel-00338193.

Full text
Abstract:
Cette thèse est composée de deux parties: les développements lies à la génération des nombres premiers et l'implantation du crible quadratique. Dans la première partie, nous analysons les stratégies d'allocation des données aux processeurs pour le crible d'Eratosthène dans un environnement à mémoire partagée en vue d'améliorer l'équilibrage de la charge de travail. Puis, nous proposons des implantations sur l'hypercube FPS T40 a mémoire distribuée. Comme le caractère centralise du crible d'Eratosthène (de type maitre/esclaves) s'accommode mal des exigences de l'architecture distribuée, nous ét
APA, Harvard, Vancouver, ISO, and other styles
5

Desprez, Frédéric. "Procédures de base pour le calcul scientifique sur machines parallèles à mémoire distribuée." Phd thesis, Grenoble INPG, 1994. http://tel.archives-ouvertes.fr/tel-00344993.

Full text
Abstract:
Le but de cette thèse est l'étude et l'implémentation de routines de base pour aider l'utilisateur de machines parallèles à mémoire distribuée à obtenir les meilleures performances avec un coût de développement moindre. Trois ensembles de routines sont étudiés. Le premier concerne des routines de communication sur réseau réconfigurable. La seconde bibliothèque fournit à l'utilisateur des routines portables de recouvrements calculs/communications transparents. Enfin, le dernier ensemble concerne des routines de calcul comme le produit de matrices, la factorisation LU et la transformée de Fourie
APA, Harvard, Vancouver, ISO, and other styles
6

Jeatsa, Toulepi Armel. "Optimisation de l'allocation de la mémoire cache CPU pour les fonctions cloud et les applications haute performance." Electronic Thesis or Diss., Université de Toulouse (2023-....), 2024. http://www.theses.fr/2024TLSEP089.

Full text
Abstract:
Les services informatiques contemporains reposent principalement sur deux paradigmes majeurs : le cluster computing et le cloud computing. Le premier implique la répartition des tâches de calcul entre différents nœuds qui fonctionnent ensemble comme un seul système, tandis que le second se fonde sur la virtualisation de l'infrastructure informatique qui permet sa fourniture à la demande. Dans le cadre de cette thèse, notre attention se porte sur l'allocation du cache de dernier niveau (LLC) dans le contexte de ces deux paradigmes, en se concentrant spécifiquement sur les applications distribué
APA, Harvard, Vancouver, ISO, and other styles
7

Bougé, Luc. "Modularité et symétrie pour les systèmes répartis; application au langage CSP." Phd thesis, Université Paris-Diderot - Paris VII, 1987. http://tel.archives-ouvertes.fr/tel-00416184.

Full text
Abstract:
L'évaluation des systèmes répartis est habituellement fondée sur des critères numériques relatifs à la quantité d'information échangée au cours des calculs. Nous montrons que ces critères ne sont pas suffisants pour évaluer le degré de répartition des algorithmes répartis usuels. Des critères qualitatifs, spécifiques de la répartition, sont nécessaires.<br /><br />La modularité exprime que les processeurs du système n'ont initialement aucune connaissance concernant globalement le réseau dans lequel ils sont plongés. La symétrie exprime que les processeurs avec des positions topologiquement équ
APA, Harvard, Vancouver, ISO, and other styles
8

Dad, Cherifa. "Méthodologie et algorithmes pour la distribution large échelle de co-simulations de systèmes complexes : application aux réseaux électriques intelligents (Smart Grids)." Electronic Thesis or Diss., CentraleSupélec, 2018. http://www.theses.fr/2018CSUP0004.

Full text
Abstract:
L’apparition des réseaux électriques intelligents, ou « Smart Grids », engendre de profonds changements dans le métier de la distribution d’électricité. En effet, ces réseaux voient apparaître de nouveaux usages (véhicules électriques, climatisation) et de nouveaux producteurs décentralisés (photovoltaïque, éolien), ce qui rend plus difficile le besoin d’équilibre entre l’offre et la demande en électricité et qui impose d’introduire une forme d’intelligence répartie entre leurs différents composants. Au vu de la complexité et de l’ampleur de la mise en oeuvre des Smart Grids, il convient tout
APA, Harvard, Vancouver, ISO, and other styles
9

Mosli, Bouksiaa Mohamed Said. "Performance variation considered helpful." Thesis, Université Paris-Saclay (ComUE), 2018. http://www.theses.fr/2018SACLL001/document.

Full text
Abstract:
Comprendre les performances d'une application multi-thread est difficile. Les threads interfèrent quand ils accèdent à la même ressource, ce qui ralentit leur exécution. Malheureusement, les outils de profiling existants se focalisent sur l'identification des causes de l'interférence, et non pas sur ses effets.Le développeur ne peut donc pas conclure si l'optimisation d'une interférence identifiée par un outil de profiling peut mener à une meilleure performance. Dans cette thèse, on propose de compléter les outils existants par un outil orienté-effet capable de quantifier l'impact de l'interfé
APA, Harvard, Vancouver, ISO, and other styles
10

Bounaim, Aïcha. "Méthodes de décomposition de domaine : application à la résolution de problèmes de contrôle optimal." Phd thesis, Université Joseph Fourier (Grenoble), 1999. http://tel.archives-ouvertes.fr/tel-00004809.

Full text
Abstract:
Ce travail porte sur l'étude des méthodes de décomposition de domaine et leur application pour résoudre des problèmes de contrôle optimal régis par des équations aux dérivées partielles. Le principe de ces méthodes consiste à ramener des problèmes de grande taille sur des géométries complexes en une suite de sous-problèmes de taille plus petite sur des géométries plus simples. En considérant une décomposition sans recouvrement, l'intérêt de ces méthodes pour les problèmes de contrôle optimal réside au niveau de l'intégration de l'équation d'état, puisqu'il est possible de partitionner le probl
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Application Distribuée Parallèle"

1

Stojmenovic, Ivan, Ruppa K. Thulasiram, Laurence T. Yang, Weijia Jia, Minyi Guo, and Rodrigo Fernandes de Mello, eds. Parallel and Distributed Processing and Applications. Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/978-3-540-74742-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Guo, Minyi, and Laurence Tianruo Yang, eds. Parallel and Distributed Processing and Applications. Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/3-540-37619-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Guo, Minyi, Laurence T. Yang, Beniamino Di Martino, Hans P. Zima, Jack Dongarra, and Feilong Tang, eds. Parallel and Distributed Processing and Applications. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11946441.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Pan, Yi, Daoxu Chen, Minyi Guo, Jiannong Cao, and Jack Dongarra, eds. Parallel and Distributed Processing and Applications. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11576235.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Cao, Jiannong, Laurence T. Yang, Minyi Guo, and Francis Lau, eds. Parallel and Distributed Processing and Applications. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/b104574.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Institute Of Electrical and Electronics Engineers. IEEE parallel & distributed technology: Systems & applications. IEEE Computer Society, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Shen, Hong, Yingpeng Sang, Yong Zhang, et al., eds. Parallel and Distributed Computing, Applications and Technologies. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-96772-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Xie, Guoqi, Gang Zeng, Renfa Li, and Keqin Li. Scheduling Parallel Applications on Heterogeneous Distributed Systems. Springer Singapore, 2019. http://dx.doi.org/10.1007/978-981-13-6557-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Park, Jong Hyuk, Hong Shen, Yunsick Sung, and Hui Tian, eds. Parallel and Distributed Computing, Applications and Technologies. Springer Singapore, 2019. http://dx.doi.org/10.1007/978-981-13-5907-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Liew, Kim-Meow, Hong Shen, Simon See, Wentong Cai, Pingzhi Fan, and Susumu Horiguchi, eds. Parallel and Distributed Computing: Applications and Technologies. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/b103538.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Application Distribuée Parallèle"

1

Chung, Minh Thanh, Josef Weidendorfer, Karl Fürlinger, and Dieter Kranzlmüller. "Proactive Task Offloading for Load Balancing in Iterative Applications." In Parallel Processing and Applied Mathematics. Springer International Publishing, 2023. http://dx.doi.org/10.1007/978-3-031-30442-2_20.

Full text
Abstract:
AbstractLoad imbalance is often a challenge for applications in parallel systems. Static cost models and pre-partitioning algorithms distribute the load at the beginning. Nevertheless, dynamic changes during execution or inaccurate cost indicators may lead to imbalance at runtime. Reactive work-stealing strategies can help monitor the execution and perform task migration to balance the load. However, the benefits depend on migration overhead and assumption about future execution.Our proactive approach further improves existing solutions by applying machine learning to online load prediction. Following that, we propose a fully distributed algorithm for adapting the prediction result to guide task offloading. The experiments are performed with an artificial test case and a realistic application named Sam(oa)$$^2$$ 2 on three systems with different communication overhead. Our results confirm improvements for important use cases compared to previous solutions. Furthermore, this approach can support co-scheduling tasks across multiple applications.
APA, Harvard, Vancouver, ISO, and other styles
2

Krawczyk, Henryk, and Bogdan Wiszniewski. "Quality of Distributed Applications." In Distributed and Parallel Systems. Springer US, 2000. http://dx.doi.org/10.1007/978-1-4615-4489-0_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Dvořák, Václav, and Rudolf Čejka. "Prototyping Cluster-Based Distributed Applications." In Distributed and Parallel Systems. Springer US, 2000. http://dx.doi.org/10.1007/978-1-4615-4489-0_28.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Kovacs, Jozsef, and Peter Kacsuk. "Server Based Migration of Parallel Applications." In Distributed and Parallel Systems. Springer US, 2002. http://dx.doi.org/10.1007/978-1-4615-1167-0_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Lovas, Róbert, Péter Kacsuk, Ákos Horváth, and Ándrás Horányi. "Application of P-Grade Development Environment in Meteorology." In Distributed and Parallel Systems. Springer US, 2002. http://dx.doi.org/10.1007/978-1-4615-1167-0_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Lee, DongWoo, and R. S. Ramakrishna. "Inter-round Scheduling for Divisible Workload Applications." In Distributed and Parallel Computing. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11564621_25.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Xu, Shiming, Wenguang Chen, Weimin Zheng, Tao Wang, and Yimin Zhang. "Hierarchical Parallel Simulated Annealing and Its Applications." In Distributed and Parallel Computing. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11564621_33.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Farkas, Zoltán, Zoltán Balaton, and Péter Kacsuk. "Supporting MPI applications in P-GRADE Portal." In Distributed and Parallel Systems. Springer US, 2007. http://dx.doi.org/10.1007/978-0-387-69858-8_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Tóth, Márton László, Norbert Podhorszki, and Peter Kacsuk. "Load Balancing for P-Grade Parallel Applications." In Distributed and Parallel Systems. Springer US, 2002. http://dx.doi.org/10.1007/978-1-4615-1167-0_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Yu, Shui, and Wanlei Zhou. "An Efficient Reliable Architecture for Application Layer Anycast Service." In Distributed and Parallel Computing. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11564621_44.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Application Distribuée Parallèle"

1

Li, Yusen, Wentong Cai, and Xueyan Tang. "Application Layer Multicast in P2P Distributed Interactive Applications." In 2013 International Conference on Parallel and Distributed Systems (ICPADS). IEEE, 2013. http://dx.doi.org/10.1109/icpads.2013.62.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Faber, Clayton J., and Roger D. Chamberlain. "Application of Network Calculus Models to Heterogeneous Streaming Applications." In 2024 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW). IEEE, 2024. http://dx.doi.org/10.1109/ipdpsw63119.2024.00057.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Popescu, Diana Andreea, Eliana-Dina Tirsa, Mugurel Ionut Andreica, and Valentin Cristea. "An Application-Assisted Checkpoint-Restart Mechanism for Java Applications." In 2013 IEEE 12th International Symposium on Parallel and Distributed Computing (ISPDC). IEEE, 2013. http://dx.doi.org/10.1109/ispdc.2013.33.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Sudarsan, R., and C. J. Ribbens. "Scheduling resizable parallel applications." In amp; Distributed Processing (IPDPS). IEEE, 2009. http://dx.doi.org/10.1109/ipdps.2009.5161077.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Fricke, Florian, Andre Werner, Keyvan Shahin, Florian Werner, and Michael Hubner. "Automatic Tool-Flow for Mapping Applications to an Application-Specific CGRA Architecture." In 2019 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW). IEEE, 2019. http://dx.doi.org/10.1109/ipdpsw.2019.00033.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Gankevich, I., I. Petriakov, A. Gavrikov, D. Tereshchenko, and G. Mozhaiskii. "VERIFIABLE APPLICATION-LEVEL CHECKPOINT AND RESTART FRAMEWORK FOR PARALLEL COMPUTING." In 9th International Conference "Distributed Computing and Grid Technologies in Science and Education". Crossref, 2021. http://dx.doi.org/10.54546/mlit.2021.45.84.001.

Full text
Abstract:
Fault tolerance of parallel and distributed applications is one of the concerns that becomes topical for large computer clusters and large distributed systems. For a long time the common solution to this problem was checkpoint and restart mechanisms implemented on operating system level, however, they are inefficient for large systems and now application-level checkpoint and restart is considered as a more efficient alternative. In this paper we implement application-level checkpoint and restart manually for the well-known parallel computing benchmarks to evaluate this alternative approach. We
APA, Harvard, Vancouver, ISO, and other styles
7

Xie, Jing, Wenxue Cheng, Tong Zhang, et al. "Active and Adaptive Application-Level Flow Control for Latency Sensitive RPC Applications." In 2019 IEEE 25th International Conference on Parallel and Distributed Systems (ICPADS). IEEE, 2019. http://dx.doi.org/10.1109/icpads47876.2019.00056.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Freire de Souza, Jaime, Hermes Senger, and Fabricio A. B. Silva. "Escalabilidade de Aplicações Bag-of-Tasks em Plataformas Heterogêneas." In XXXVII Simpósio Brasileiro de Redes de Computadores e Sistemas Distribuídos. Sociedade Brasileira de Computação - SBC, 2019. http://dx.doi.org/10.5753/sbrc.2019.7394.

Full text
Abstract:
Bag-of-Tasks (BoT) applications are parallel applications composed of independent (i.e., embarrassingly parallel) tasks, which do not communicate with each other, may depend upon one or more input files, and can be executed in any order. BoT applications are very frequent in several scientific areas, and it is the ideal application class for execution on large distributed computing systems composed of hundreds to many thousands of computational resources. This paper focusses on the scalability of BoT applications running on large heterogeneous distributed computing systems organized as a maste
APA, Harvard, Vancouver, ISO, and other styles
9

Fernando, Milinda, Dmitry Duplyakin, and Hari Sundar. "Machine and Application Aware Partitioning for Adaptive Mesh Refinement Applications." In HPDC '17: The 26th International Symposium on High-Performance Parallel and Distributed Computing. ACM, 2017. http://dx.doi.org/10.1145/3078597.3078610.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Khan, Gulista, and Zabeeulla Zabeeulla. "The Smart Application Development in Real Time Parallel Applications with Industrial Automation." In 2023 International Conference on Distributed Computing and Electrical Circuits and Electronics (ICDCECE). IEEE, 2023. http://dx.doi.org/10.1109/icdcece57866.2023.10150756.

Full text
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography