The interconnection network communicates and links together the processing units of modern high-performance computing systems. In this context, network faults have an extremely high impact since most routing algorithm...
详细信息
Forest fire propagation prediction is a crucial issue when fighting these hazards as efficiently as possible. Several propagation models have been developed and integrated in computer simulators. Such models require a...
详细信息
Forest fire propagation prediction is a crucial issue when fighting these hazards as efficiently as possible. Several propagation models have been developed and integrated in computer simulators. Such models require a set of input parameters that, in some cases, are difficult to know or even estimate precisely beforehand. Therefore, a calibration technique based on genetic algorithm (GA) was introduced to reduce the uncertainty in input parameters values and improve the accuracy of the predictions. Such a technique requires the execution of a set of simulations and several iterations of the process to calibrate the values of the input parameters. To reduce the execution time of this calibration stage, an Message Passing Interface master/worker scheme was developed to distribute the simulations of one iteration among the worker processes. However, the execution time of each simulation varies drastically depending on the particular input parameters used, provoking a significant load imbalance. To overcome this imbalance and reduce execution time to operational requirements, core allocation policies have been developed. These policies are based on execution time estimation and classification of simulations according to the estimated execution time. Then, multicore capabilities of the current systems are applied to devote more resources (cores) to the longest simulations reducing the load imbalance. These simulations that are estimated as taking too long, even when many resources are devoted to them, require especial consideration. So, a generation time limit has been introduced, and three different strategies have been designed considering individuals that exceed the generation execution time limit. In the first one, the longest individuals are replaced before starting the execution with shorter individuals (Time Aware Core allocation with replacement). In the second one, these individuals are executed, but when the generation limit is reached, the individuals still ex
Every year, forest fires burn thousands of hectares of forest around the world and cause significant damage to the economy and people from the affected zone. For that reason, computational fire spread models arise as ...
详细信息
The main goal of parallel/distributed applications is to solve the considered problem as fast as possible using the available resources. In this context, the application performance becomes a crucial issue. Developers...
详细信息
The fetch target buffer (FTB) holds information on basic blocks to predict taken branches in the fetch stream and also their target addresses. We propose a variation to FTB, the self-indexed FTB, which, through an ext...
详细信息
Exploring the multi-core architecture is an important issue to obtaining high performance in parallel and distributed discrete-event simulations. However, the simulation features must fit on parallel programming model...
详细信息
Current performance analysis and tuning tools must be able to improve the performance of large-scale parallel applications. To be effective, such analysis and tuning tools must be scalable and be able to manage the dy...
详细信息
The possibility of having available massive computer resources to users opens ideas for the future of interoperability between multiple infrastructure systems. This wide system should be composed of multiple high perf...
详细信息
Distributed event simulation (DES) is a useful tool for high performance simulation. This type of simulation is recommended for complex models or when a high degree of model detail is needed. Fish School is an individ...
详细信息
作者:
Voigt, SebastianUniversity of Hannover
Faculty of Electrical Engineering and Computer Science Institute for Systems Engineering - Computer Architecture and Operating Systems Appelstr. 4 30167 Hannover Germany
Virtual rooms and common information spaces are being used more and more frequently. In addition to internet-based solutions, ad-hoc InfoSpaces have been proposed. Their security has not been sufficiently investigated...
详细信息
ISBN:
(纸本)9783885791874
Virtual rooms and common information spaces are being used more and more frequently. In addition to internet-based solutions, ad-hoc InfoSpaces have been proposed. Their security has not been sufficiently investigated. This paper proposes a new protocol for peer-to-peer data exchange with support for access control for operations in the virtual rooms. Access rights for operations are kept in access control matrices and the security layer allows only operations from clients which are marked as allowed in the access control matrix. The protocol is based on the idea of hiding the identity of all peer-to-peer participants. Thus this protocol offers anonymity and full peer-to-peer support using asymmetric cryptography to distribute the access control matrices. This works without any central authority.
暂无评论