Search results for: DISTRIBUTED COMPUTING
-
DISTRIBUTED COMPUTING
Journals -
Optimization issues in distributed computing systems design
PublicationIn recent years, we observe a growing interest focused on distributed computing systems. Both industry and academia require increasing computational power to process and analyze large amount of data, including significant areas like analysis of medical data, earthquake, or weather forecast. Since distributed computing systems – similar to computer networks – are vulnerable to failures, survivability mechanisms are indispensable...
-
Highly parallel distributed computing systems with optical interconnections
Publication -
Highly Parallel Distributed Computing System With Optical Interconnections
Publication -
1+1 Protection of Overlay Distributed Computing Systems: Modeling and Optimization
PublicationW niniejszym artykule przedstawiono autorską koncepcję ochrony transmisji od krańca do krańca (ang. 1+1 protection) dla systemów przetwarzania rozproszonego (ang. distributed computing systems). Artykuł prezentuje nowatorskie rozwiązanie dedykowane systemom typu ''overlay'', w których system przetwarzania rozproszonego stanowi warstwę najwyższą w warstwowej architekturze sieci, korzystającą z usług warstwy sieci transportowej....
-
Journal of Grid and Distributed Computing
Journals -
What Can Be Observed Locally? Round based models for quantum distributed computing
PublicationW pracy rozważono zagadnienie lokalności w kontekście informacji kwantowej w obliczeniach rozproszonych. Rozważono dwa kwantowe rozszerzenia modelu LOCAL Liniala, otrzymane poprzez: (1) inicjalizację systemu w kwantowym stanie splątanym, (2) zastosowanie kwantowych kanałów komunikacyjnych. Dla obydwu typów rozszerzeń zaproponowano przykłady problemów, których złożoność rundowa ulega redukcji w porównaniu do oryginalnego modelu...
-
International Journal of Grid and Distributed Computing
Journals -
International Journal of Networked and Distributed Computing
Journals -
Long Distance Geographically Distributed InfiniBand Based Computing
PublicationCollaboration between multiple computing centres, referred as federated computing is becom- ing important pillar of High Performance Computing (HPC) and will be one of its key components in the future. To test technical possibilities of future collaboration using 100 Gb optic fiber link (Connection was 900 km in length with 9 ms RTT time) we prepared two scenarios of operation. In the first one, Interdisciplinary Centre for Mathematical...
-
Crowdsourcing and Volunteer Computing as Distributed Approach for Problem Solving
PublicationIn this paper, a combination between volunteer computing and crowdsourcing is presented. Two paradigms of the web computing are described, analyzed and compared in detail: grid computing and volunteer computing. Characteristics of BOINC and its contribution to global Internet processing are shown with the stress put onto applications the system can facilitate and problems it can solve. An alternative instance of a grid computing...
-
On Configurability of Distributed Volunteer-Based Computing in the Comcute System
PublicationThe chapter proposes additional solutions that can be implemented within the Comcute system to increase its configurability. This refers to configuration of the reliability level in the W and S server layers, static or on-the-fly data partitioning and integration, configuration of the system for processing in the data streaming fashion, extending the system for selection of a project that the client wants to contribute to, ease...
-
ADCAIJ-Advances in Distributed Computing and Artificial Intelligence Journal
Journals -
Distributed Architectures for Intensive Urban Computing: A Case Study on Smart Lighting for Sustainable Cities
PublicationNew information and communication technologies have contributed to the development of the smart city concept. On a physical level, this paradigm is characterised by deploying a substantial number of different devices that can sense their surroundings and generate a large amount of data. The most typical case is image and video acquisition sensors. Recently, these types of sensors are found in abundance in urban spaces and are responsible...
-
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING
Journals -
Distributed graph searching with a sense of direction
PublicationIn this work we consider the edge searching problem for vertex-weighted graphs with arbitrarily fast and invisible fugitive. The weight function w provides for each vertex v the minimum number of searchers required to guard v, i.e., the fugitive may not pass through v without being detected only if at least w(v) searchers are present at v. This problem is a generalization of the classical edge searching problem, in which one has...
-
How to meet when you forget: log-space rendezvous in arbitrary graphs
PublicationTwo identical (anonymous) mobile agents start from arbitrary nodes in an a priori unknown graph and move synchronously from node to node with the goal of meeting. This rendezvous problem has been thoroughly studied, both for anonymous and for labeled agents, along with another basic task, that of exploring graphs by mobile agents. The rendezvous problem is known to be not easier than graph exploration. A well-known recent result...
-
Time versus space trade-offs for randezvous in trees
PublicationTwo identical (anonymous) mobile agents start from arbitrary nodes of an unknown tree and have to meet at some node. Agents move in synchronous rounds: in each round an agent can either stay at the current node or move to one of its neighbors. We consider deterministic algorithms for this rendezvous task. The main result of this paper is a tight trade-off between the optimal time of completing rendezvous and the size of memory...
-
How to meet when you forget: log-space rendezvous in arbitrary graphs
PublicationProblem rendezvous został dogłębnie zbadany, zarówno dla agendów anonimowych jak i poetykietowanych. zbadano też problem eksploracji grafu za pomocą agentów mobilnych.
-
Leader election for anonymous asynchronous agents in arbitrary networks
PublicationWe consider the problem of leader election among mobile agents operating in an arbitrary network modeled as an undirected graph. Nodes of the network are unlabeled and all agents are identical. Hence the only way to elect a leader among agents is by exploiting asymmetries in their initial positions in the graph. Agents do not know the graph or their positions in it, hence they must gain this knowledge by navigating in the graph...