Search results for: distributed computing

• DISTRIBUTED COMPUTING

  Journals

  ISSN: 0178-2770 , eISSN: 1432-0452

• Optimization issues in distributed computing systems design

  Publication

  • K. Walkowiak
  • J. Rak

  - Year 2014

  In 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

  • J. Just
  • R. Romaniuk
  • R. S. Romaniuk

  - Microprocessing and Microprogramming - Year 1989

  Full text to download in external service

• Highly Parallel Distributed Computing System With Optical Interconnections

  Publication

  • J. Just
  • R. Romaniuk
  • R. S. Romaniuk

  - Year 1990

  Full text to download in external service

• 1+1 Protection of Overlay Distributed Computing Systems: Modeling and Optimization

  Publication

  • K. Walkowiak
  • J. Rak

  - Year 2012

  W 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....

  Full text to download in external service

• Journal of Grid and Distributed Computing

  Journals

  ISSN: 2249-7056

• What Can Be Observed Locally? Round based models for quantum distributed computing

  Publication

  • C. Gavoille
  • A. Kosowski
  • M. Markiewicz

  - Year 2009

  W 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...

  Full text to download in external service

• International Journal of Grid and Distributed Computing

  Journals

  ISSN: 2005-4262

• International Journal of Networked and Distributed Computing

  Journals

  ISSN: 2211-7938 , eISSN: 2211-7946

• Long Distance Geographically Distributed InfiniBand Based Computing

  Publication

  • K. Niedzielewski
  • M. Semeniuk
  • J. Skomiał
  • J. Proficz
  • P. Sumionka
  • B. Pliszka
  • M. Michalewicz

  - Supercomputing Frontiers and Innovations - Year 2020

  Collaboration 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...

  Full text available to download

• Crowdsourcing and Volunteer Computing as Distributed Approach for Problem Solving

  Publication

  • J. Balicki
  • P. Brudło
  • P. Szpryngier

  - Year 2014

  In 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...

  Full text to download in external service

• On Configurability of Distributed Volunteer-Based Computing in the Comcute System

  Publication

  • P. Czarnul

  - Year 2012

  The 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

  ISSN: 2255-2863

• Distributed Architectures for Intensive Urban Computing: A Case Study on Smart Lighting for Sustainable Cities

  Publication

  • H. Mora
  • J. Peral
  • A. Ferrandez
  • D. Gil
  • J. Szymański

  - IEEE Access - Year 2019

  New 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...

  Full text available to download

• JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING

  Journals

  ISSN: 0743-7315 , eISSN: 1096-0848

• Distributed graph searching with a sense of direction

  Publication

  • P. Borowiecki
  • D. Dereniowski
  • Ł. Kuszner

  - DISTRIBUTED COMPUTING - Year 2015

  In 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...

  Full text available to download

• Time versus space trade-offs for randezvous in trees

  Publication

  • J. Czyzowicz
  • A. Kosowski
  • A. Pelc

  - DISTRIBUTED COMPUTING - Year 2014

  Two 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...

  Full text to download in external service

• How to meet when you forget: log-space rendezvous in arbitrary graphs

  Publication

  • J. Czyzowicz
  • A. Kosowski
  • A. Pelc

  - DISTRIBUTED COMPUTING - Year 2012

  Problem rendezvous został dogłębnie zbadany, zarówno dla agendów anonimowych jak i poetykietowanych. zbadano też problem eksploracji grafu za pomocą agentów mobilnych.

  Full text to download in external service

• How to meet when you forget: log-space rendezvous in arbitrary graphs

  Publication

  • J. Czyzowicz
  • A. Kosowski
  • A. Pelc

  - DISTRIBUTED COMPUTING - Year 2011

  Two 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...

  Full text to download in external service

• Leader election for anonymous asynchronous agents in arbitrary networks

  Publication

  • D. Dereniowski
  • A. Pelc

  - DISTRIBUTED COMPUTING - Year 2014

  We 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...

  Full text available to download

• Intelligent Distributed Computing

  Conferences

• Drawing maps with advice

  Publication

  • D. Dereniowski
  • A. Pelc

  - JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING - Year 2012

  Rozważamy następujący problem obliczeniowy. Agent zostaje umieszczony w wierzchołku nieznanego mu grafu. Wierzchołki grafu są nierozróżnialne, natomiast krawędzie posiadają numery portów. Zadaniem agenta jest wyznaczenie mapy, tzn. obliczenie izomorficznej kopii grafu, lub obliczenie dowolnego drzewa spinającego grafu. Bez dodatkowej informacji zadań tych nie można wykonać. W artykule wyznaczamy oszacowania na minimalną liczbę...

  Full text to download in external service

• Workshop on Nature Inspired Distributed Computing

  Conferences

• International Conference on Distributed Computing and Networking

  Conferences

• ACM Symposium on Principles of Distributed Computing

  Conferences

• International Conference on Distributed Computing Systems

  Conferences

• International Symposium on Distributed Computing (was WDAG)

  Conferences

• International Symposium on Parallel and Distributed Computing

  Conferences

• International European Conference on Parallel and Distributed Computing

  Conferences

• International Conference on Distributed Computing and Artificial Intelligence

  Conferences

• International Conference on Distributed Computing and Internet Technologies

  Conferences

• Australasian Symposium on Parallel and Distributed Computing (was AusGrid)

  Conferences

• IEEE International Conference on Distributed Computing in Sensor Systems

  Conferences

• International Conference on Parallel and Distributed Computing, Applications and Technologies

  Conferences

• ACM International Symposium on High Performance Distributed Computing

  Conferences

• IEEE International Symposium on Real-Time Distributed Computing (IEEE International Symposium on Object-Oriented Real-Time Distributed Computing)

  Conferences

• IEEE International Workshop on Future Trends of Distributed Computing Systems

  Conferences

• Euro-Par: International European Conference on Parallel and Distributed Computing

  Conferences

• International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing

  Conferences

• IEEE International Enterprise Distributed Object Computing Conference

  Conferences

• International Conference on Grid computing, high-performance and Distributed Applications

  Conferences

• Paweł Czarnul dr hab. inż.

  People

  Department of Computer Architecture, Faculty of Electronics, Telecommunications and Informatics

  Paweł Czarnul obtained a D.Sc. degree in computer science in 2015, a Ph.D. in computer science granted by a council at the Faculty of Electronics, Telecommunications and Informatics, Gdansk University of Technology in 2003. His research interests include:parallel and distributed processing including clusters, accelerators, coprocessors; distributed information systems; architectures of distributed systems; programming mobile devices....

• Jerzy Konorski dr hab. inż.

  People

  Department of Computer Communications

  Jerzy Konorski received his M. Sc. degree in telecommunications from Gdansk University of Technology, Poland, and his Ph. D. degree in computer science from the Polish Academy of Sciences, Warsaw, Poland. In 2007, he defended his D. Sc. thesis at the Faculty of Electronics, Telecommunications and Informatics, Gdansk University of Technology. He has authored over 150 papers, led scientific projects funded by the European Union,...

• Metaheuristic algorithms for optimization of resilient overlay computing systems

  Publication

  • K. Walkowiak
  • W. Charewicz
  • M. Donajski
  • J. Rak

  - Logic journal of the IGPL - Year 2014

  The idea of distributed computing systems has been gaining much interest in recent years owing to the growing amount of data to be processed for both industrial and academic purposes. However, similar to other systems, also distributed computing systems are vulnerable to failures. Due to strict QoS requirements, survivability guarantees are necessary for provisioning of uninterrupted service. In this article, we focus on reliability...

  Full text to download in external service

• A Human Behaviour Model Agent for Testing of Voluntary Computing Systems

  Publication

  • M. Matuszek

  - Year 2014

  Paper presents a design and performance of a voluntary-based distributed computing system testing agent, implementing a human behaviour model. The agent, nicknamed iRobot, was designed and implemented to enable controlled, large scale testing of core algorithms of Comcute - a new voluntary distributed computing platform complementary to BOINC. The main agent design goals were: emulation of human behaviour when browsing web pages,...

  Full text to download in external service

• Waldemar Korłub dr inż.

  People

  Waldemar Korłub obtained an Eng. degree in 2011, MSc.Eng. degree in 2012 and PhD in Computer Science in 2017 granted by the Faculty of Electronics, Telecommunications and Informatics at Gdansk University of Technology. His research interests include: distributed systems mainly grid and cloud computing platforms, autonomous systems capable of self-optimization, self-management, self-healing and self-protection, artificial intelligence...

• Distributed representation of information on cyclic events

  Publication

  • A. Opaliński

  - STUDIA INFORMATICA. SYSTEMS AND INFORMATION TECHNOLOGY. SYSTEMY I TECHNOLOGIE INFORMACYJNE - Year 2011

  A representation of information on cyclic events has been proposed which is advantageous for computing environments where a distributed set of Receivers reacts to cyclic events generated by distributed sources. In such scenario no immanent central information repository exist on event timing or volume. Receivers are able to learn the event cycles without communicating with each other, merely on the basis of the fact that an event...

  Full text available to download

• Integration of cloud-based services into distributed workflow systems: challenges and solutions

  Publication

  • P. Czarnul

  - Scalable Computing: Practice and Experience - Year 2012

  The paper introduces the challenges in modern workflow management in distributed environments spanning multiplecluster, grid and cloud systems. Recent developments in cloud computing infrastructures are presented and are referring howclouds can be incorporated into distributed workflow management, aside from local and grid systems considered so far. Severalchallenges concerning workflow definition, optimisation and execution are...

  Full text available to download

• Multi-criterion decision making in distributed systems by quantum evolutionary algorithms

  Publication

  • J. Balicki
  • H. Balicka
  • J. Masiejczyk
  • A. Zacniewski

  - Year 2010

  Decision making by the AQMEA (Adaptive Quantum-based Multi-criterion Evolutionary Algorithm) has been considered for distributed computer systems. AQMEA has been extended by a chromosome representation with the registry of the smallest units of quantum information. Evolutionary computing with Q-bit chromosomes has been proofed to characterize by the enhanced population diversity than other representations, since individuals represent...

• Krzysztof Gierłowski dr inż.

  People

  Department of Computer Communications

  Krzysztof Gierłowski received his Ph.D. degree in telecommunications from the Faculty of Electronics, Gdańsk University of Technology (GUT), Poland, in 2018. He is author or co-author of more than 80 scientific papers and reviewer for a number of conferences and journals. Krzysztof Gierłowski took part in major IT-oriented projects, including: EU-funded Polish Future Internet Engineering initiative, PL-LAB2020 Infrastructural...