Results 21 to 30 of about 26,832 (297)

Mobile Cloud for Parallel and Distributed Green Computing

open access: yesJournal of Telecommunications and Information Technology, 2017
Mobile Computing and Mobile Cloud Computing are the areas where intensive research is observed. The “mobility” landscape (devices, technologies, apps, etc.) evolves so fast that definitions and taxonomies do not catch up with so dynamic changes and there
Leszek Siwik   +5 more
doaj   +1 more source

Partition decoupling model and method in power distribution network, part II: A novel partitioning optimisation operation method

open access: yesIET Cyber-Physical Systems, 2023
In this study, a partition optimisation method for distribution network is proposed to realise decoupling coordination, which provides a research basis for optimising power flow and operation regulation. Firstly, a partition model of distribution network
Wanxing Sheng
doaj   +1 more source

Causal Graph Dynamics and Kan Extensions [PDF]

open access: yesLogical Methods in Computer Science
On the one side, the formalism of Global Transformations comes with the claim of capturing any transformation of space that is local, synchronous and deterministic.
Luidnel Maignan, Antoine Spicher
doaj   +1 more source

Using the methods of formal synthesis and verification of parallel time-parameterized models for solving the system of linear equations by Gaussian elimination

open access: yesВісник Харківського національного університету імені В.Н. Каразіна. Серія: Математичне моделювання, інформаційні технології, автоматизовані системи управління, 2021
The main solution to the problem of improving the efficiency of parallel computing systems is the methods of formal synthesis of efficient time-parameterized multiparallel models. The article is devoted to investigating the efficiency of using the formal
Ольга Мороз   +1 more
doaj   +1 more source

State-of-the-Art in Parallel Computing with R [PDF]

open access: yes, 2009
R is a mature open-source programming language for statistical computing and graphics. Many areas of statistical research are experiencing rapid growth in the size of data sets. Methodological advances drive increased use of simulations.
Hao Yu   +11 more
core   +1 more source

Automated Synthesis of Distributed Self-Stabilizing Protocols [PDF]

open access: yesLogical Methods in Computer Science, 2018
In this paper, we introduce an SMT-based method that automatically synthesizes a distributed self-stabilizing protocol from a given high-level specification and network topology. Unlike existing approaches, where synthesis algorithms require the explicit
Fathiyeh Faghih   +3 more
doaj   +1 more source

Synchronizability of Communicating Finite State Machines is not Decidable [PDF]

open access: yesLogical Methods in Computer Science, 2023
A system of communicating finite state machines is synchronizable if its send trace semantics, i.e.the set of sequences of sendings it can perform, is the same when its communications are FIFO asynchronous and when they are just rendez-vous ...
Alain Finkel, Etienne Lozes
doaj   +1 more source

Load balancing of irregular parallel applications on heterogeneous computing environments [PDF]

open access: yes, 2012
Large-scale heterogeneous distributed computing environments (such as Computational Grids and Clouds) offer the promise of access to a vast amount of computing resources at a relatively low cost.
Janjic, Vladimir
core   +1 more source

A Hybrid CPU/GPU Cluster for Encryption and Decryption of Large Amounts of Data

open access: yesJournal of Telecommunications and Information Technology, 2012
The main advantage of a distributed computing system over standalone computer is an ability to share the workload between cores, processors and computers.
Ewa Niewiadomska-Szynkiewicz   +3 more
doaj   +1 more source

Impure Simplicial Complexes: Complete Axiomatization [PDF]

open access: yesLogical Methods in Computer Science, 2023
Combinatorial topology is used in distributed computing to model concurrency and asynchrony. The basic structure in combinatorial topology is the simplicial complex, a collection of subsets called simplices of a set of vertices, closed under containment.
Rojo Randrianomentsoa   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy