Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 4 of 4
Full-Text Articles in Engineering
A P2p Computing System For Overlay Networks, Grzegorz Chmaj, Krzysztof Walkowiak
A P2p Computing System For Overlay Networks, Grzegorz Chmaj, Krzysztof Walkowiak
Electrical & Computer Engineering Faculty Research
A distributed computing system is able to perform data computation and distribution of results at the same time. The input task is divided into blocks, which are then sent to system participants that offer their resources in order to perform calculations. Next, a partial result is sent back by the participants to the task manager (usually one central node). In the case when system participants want to get the final result, the central node may become overloaded, especially if many nodes request the result at the same time. In this paper we propose a novel distributed computation system, which does …
Decision Strategies For A P2p Computing System, Grzegorz Chmaj, Krzysztof Walkowiak
Decision Strategies For A P2p Computing System, Grzegorz Chmaj, Krzysztof Walkowiak
Electrical & Computer Engineering Faculty Research
Peer-to-Peer (P2P) computing (also called ‘public-resource computing’) is an effective approach to perform computation of large tasks. Currently used P2P computing systems (e.g., BOINC) are most often centrally managed, i.e., the final result of computations is created at a central node using partial results – what may be not efficient in the case when numerous participants are willing to download the final result. In this paper, we propose a novel approach to P2P computing systems. We assume that results can be delivered to all peers in a distributed way using three types of network flows: unicast, Peer-to-Peer and anycast. We …
Software Development Approach For Discrete Simulators, Grzegorz Chmaj, Dawid Maksymilian Zydek
Software Development Approach For Discrete Simulators, Grzegorz Chmaj, Dawid Maksymilian Zydek
Electrical & Computer Engineering Faculty Research
Simulation is the most common approach to perform the problem research. Among several types of simulation, the most common way is the discrete simulation, which assumes the division of the time scale into fixed length time slots. Depending on investigated problem, simulation packages may be used or it could be necessary to design and create own simulation system. In this paper, we propose the complete pre-study scheme and the most commonly appearing implementation problems with suggested solutions. We also describe how to implement the exemplary simulator in C++.
Quantization With Knowledge Base Applied To Geometrical Nesting Problem, Grzegorz Chmaj, Leszek Koszalka
Quantization With Knowledge Base Applied To Geometrical Nesting Problem, Grzegorz Chmaj, Leszek Koszalka
Electrical & Computer Engineering Faculty Research
Nesting algorithms deal with placing two-dimensional shapes on the given canvas. In this paper a binary way of solving the nesting problem is proposed. Geometric shapes are quantized into binary form, which is used to operate on them. After finishing nesting they are converted back into original geometrical form. Investigations showed, that there is a big influence of quantization accuracy for the nesting effect. However, greater accuracy results with longer time of computation. The proposed knowledge base system is able to strongly reduce the computational time.