The paper proposes a new approach to multicriteria optimization of the structure of secure information interaction in distributed computing systems. A distinguishing feature of the approach is the use of the sequentia...
详细信息
ISBN:
(纸本)9781728165820
The paper proposes a new approach to multicriteria optimization of the structure of secure information interaction in distributed computing systems. A distinguishing feature of the approach is the use of the sequential concessions method. This approach provides the acceptable flexibility in comparing the system construction variants by taking into account not only the priority of the system according to efficiency indicators, but also the relationships of the indicators. The mathematical basis of the proposed method is considered. The procedure of implementation of the proposed method for ensuring security of information interaction in a distributed hierarchical automated control system is demonstrated, and its experimental assessment is given.
parallel programmers mandate high-level parallel programming tools allowing to reduce the effort of the efficient parallelization of their applications. parallel programming leveraging parallel patterns has recently r...
详细信息
ISBN:
(纸本)9781728116440
parallel programmers mandate high-level parallel programming tools allowing to reduce the effort of the efficient parallelization of their applications. parallel programming leveraging parallel patterns has recently received renovated attention thanks to their clear functional and parallel semantics. In this work, we propose a synergy between the well-known Actors-based programming model and the pattern-basedparallelization methodology. We present our preliminary results in that direction, discussing and assessing the implementation of the Map parallel pattern by using an Actor-based software accelerator abstraction that seamlessly integrates within the C++ Actor Framework (ICAF). The results obtained on the Intel Xeon Phi KNL platform demonstrate good performance figures achieved with negligible programming efforts.
In this paper, we propose a mapping scheme of IP cores into irregular network on Chips using an example module dedicated to features extraction for automatic speech recognition system. We estimated the core sizes for ...
详细信息
ISBN:
(纸本)9780769549392;9781467353212
In this paper, we propose a mapping scheme of IP cores into irregular network on Chips using an example module dedicated to features extraction for automatic speech recognition system. We estimated the core sizes for various frame sizes and overlappings, and then tried to place cores communicating heavily close to each other, we test a number of widths in the 2D Rectangular Strip Packing problem. The obtained result range allows us to pick a solution that is beneficial both in terms of area and transfers between the system cores.
In this paper we use the Adapteva Epiphany manycore chip to demonstrate how the throughput and the latency of a baseband signal processing chain, typically found in LTE or WiFi, can be optimized by a combination of ta...
详细信息
ISBN:
(纸本)9781467387767
In this paper we use the Adapteva Epiphany manycore chip to demonstrate how the throughput and the latency of a baseband signal processing chain, typically found in LTE or WiFi, can be optimized by a combination of task- and data parallelization, and data pipelining. The parallelization and data pipelining are facilitated by the shared memory architecture of the Epiphany, and the fact that a processor on one core can write directly into the memory of any other core on the chip.
distributed publish/subscribe middleware insures the necessary decoupling, expressiveness, and scalability for modern distributed applications. Unfortunately, the performance of this middleware is usually degraded in ...
详细信息
ISBN:
(纸本)9781509060580
distributed publish/subscribe middleware insures the necessary decoupling, expressiveness, and scalability for modern distributed applications. Unfortunately, the performance of this middleware is usually degraded in the presence of highly mobile scenarios. In this paper, we tackle the problem of mobility in publish/subscribe by exploiting a predictive scheme. We investigate the adequacy of our approach using a prototype implementation with respect to different scenarios. The experimental results show that our approach reduces the caching cost, the propagation cost and the network load. It also achieves better results in terms of overhead.
Pervasive Grid Computing Platforms include centralized computing nodes (e.g. parallel servers) as well as decentralized and mobile devices. Pervasive Grid applications include data-and computing-intensive components w...
详细信息
ISBN:
(纸本)9780769539393
Pervasive Grid Computing Platforms include centralized computing nodes (e.g. parallel servers) as well as decentralized and mobile devices. Pervasive Grid applications include data-and computing-intensive components which can be mapped also onto decentralized and mobile nodes. The effective and practical success of this mapping resides also in deriving proper configurations of applications which consider the limited memory capabilities of those resources. In this paper we target this issue by showing how we can study and configure the memory requirements of an Emergency Management application. We present our solutions by using the ASSISTANT programming model for Pervasive Grid applications.
Asynchronous iterations can be used to implement fixed-point methods such as Jacobi and Gauss-Seidel on parallel computers with high synchronization costs. However, they are rarely considered in practice due to the lo...
详细信息
ISBN:
(纸本)9781509060580
Asynchronous iterations can be used to implement fixed-point methods such as Jacobi and Gauss-Seidel on parallel computers with high synchronization costs. However, they are rarely considered in practice due to the low convergence rate. This paper describes an implementation on GPUs of a novel Power Flow analysis model using asynchronous iterations. We present our model for the solution of the Power Flow analysis problem, prove its convergence and evaluate its performance for a GPU execution.
We introduce a new distributed eigensolver (dOI) for square matrices based on orthogonal iteration. In contrast to standard parallel eigensolvers, our approach performs only nearest neighbor communication and provides...
详细信息
ISBN:
(纸本)9780769549392;9781467353212
We introduce a new distributed eigensolver (dOI) for square matrices based on orthogonal iteration. In contrast to standard parallel eigensolvers, our approach performs only nearest neighbor communication and provides much more flexibility with respect to the properties of the hardware infrastructure on which the computation is performed. This is achieved by utilizing distributed summation methods with randomized communication schedules which do not require global synchronization across the nodes. Our algorithm is particularly attractive for loosely coupled distributednetworks with arbitrary network topologies and potentially unreliable components. Our distributed eigensolver dOI is based on a novel distributed matrix-matrix multiplication algorithm and on an extension of a distributed QR factorization algorithm proposed earlier. We illustrate the advantages of dOI in terms of higher flexibility with respect to the underlying network and lower communication cost compared to a related distributed eigensolver by Kempe and McSherry. Moreover, we experimentally illustrate how the overall communication cost of dOI is further reduced by adapting the accuracy of each distributed summation during the orthogonal iteration process.
The proposed work demonstrates a novel flow control mechanism that brings the flexibility to route every flit of a packet independently, alleviating the network congestion more efficiently in Virtual Channel (VC) base...
详细信息
ISBN:
(数字)9781728165820
ISBN:
(纸本)9781728165820
The proposed work demonstrates a novel flow control mechanism that brings the flexibility to route every flit of a packet independently, alleviating the network congestion more efficiently in Virtual Channel (VC) based NoC routing. A 100% buffer utilization is achieved by putting an end to the overhead of VC arbitration. The modified router design comes with a 20% area and 4.73% energy saving on the generic one. Packet Latency improvement of 35 78%, 27 68%, and 45 62% is observed over the mesh, torus, and flattened butterfly topologies respectively under uniform random traffic. The average packet drop rate is reduced by a minimum of 28% across the above topologies.
In the paper a resource-constrained project scheduling problem (RCPSP) aiming at project cost minimization is investigated. RCPSP is a well-known NP-hard optimization problem. A metaheuristic algorithm was adopted to ...
详细信息
ISBN:
(纸本)9780769549392
In the paper a resource-constrained project scheduling problem (RCPSP) aiming at project cost minimization is investigated. RCPSP is a well-known NP-hard optimization problem. A metaheuristic algorithm was adopted to solve the problem when applied to Critical Chain Project Management (CCPM). It starts with the initial schedule and searches for the cheapest solution satisfying given time constraints. A distributed version of the algorithm is proposed to reduce computation time. Independent processes on remote computers (workers) calculate different schedule modifications in the same time and send results back to a server. The server uses multithreading to distribute project data and search parameters to the workers. The number of workers used to achieve the best performance was estimated. The computational results of distributedprocessing showed high reduction of time needed to obtain the results, in comparison with centralized processing.
暂无评论