Search results for " computing"
showing 10 items of 2075 documents
A dynamic load-balancing algorithm for molecular dynamics simulation on multi-processor systems
1991
Abstract A new algorithm for dynamic load-balancing on multi-processor systems and its application to the molecular dynamics simulation of the spinodal phase separation are presented. The load-balancer is distributed among the processors and embedded in the application itself. Tests performed on a transputer network show that the load-balancer behaves almost ideally in this application. The same approach can be easily extended to different multi-processor topologies or applications.
GPU accelerated Monte Carlo simulation of the 2D and 3D Ising model
2009
The compute unified device architecture (CUDA) is a programming approach for performing scientific calculations on a graphics processing unit (GPU) as a data-parallel computing device. The programming interface allows to implement algorithms using extensions to standard C language. With continuously increased number of cores in combination with a high memory bandwidth, a recent GPU offers incredible resources for general purpose computing. First, we apply this new technology to Monte Carlo simulations of the two dimensional ferromagnetic square lattice Ising model. By implementing a variant of the checkerboard algorithm, results are obtained up to 60 times faster on the GPU than on a curren…
UPC++ for bioinformatics: A case study using genome-wide association studies
2014
Modern genotyping technologies are able to obtain up to a few million genetic markers (such as SNPs) of an individual within a few minutes of time. Detecting epistasis, such as SNP-SNP interactions, in Genome-Wide Association Studies is an important but time-consuming operation since statistical computations have to be performed for each pair of measured markers. Therefore, a variety of HPC architectures have been used to accelerate these studies. In this work we present a parallel approach for multi-core clusters, which is implemented with UPC++ and takes advantage of the features available in the Partitioned Global Address Space and Object Oriented Programming models. Our solution is base…
Unified Parallel C++
2018
Abstract Although MPI is commonly used for parallel programming on distributed-memory systems, Partitioned Global Address Space (PGAS) approaches are gaining attention for programming modern multi-core CPU clusters. They feature a hybrid memory abstraction: distributed memory is viewed as a shared memory that is partitioned among nodes in order to simplify programming. In this chapter you will learn about Unified Parallel C++ (UPC++), a library-based extension of C++ that gathers the advantages of both PGAS and Object Oriented paradigms. The examples included in this chapter will help you to understand the main features of PGAS languages and how they can simplify the task of programming par…
A Column Generation Approach to Scheduling of Periodic Tasks
2011
We present an algorithm based on column generation for a real time scheduling problem, in which all tasks appear regularly after a given period. Furthermore, the tasks exchange messages, which have to be transferred over a bus, if the tasks involved are executed on different ECUs. Experiments show that for large instances our preliminary implementation is faster than the previous approach based on an integer linear programming formulation using a state-of-the-art solver.
Scheduling of Real-Time Networks with a Column Generation Approach
2013
We present an algorithm based on column generation for the real-time scheduling problem of allocating periodic tasks to electronic control units in multiple subsystems connected by a global bus. The allocation has to ensure that tasks can be scheduled, and messages between tasks in different subsystems can be transmitted over the global bus and meet their deadlines. Also tasks and messages occurring in a task chain must be scheduled in a way such that the sequence of execution meets their end-to-end deadline. We show that our approach computes the optimal allocation in our model and due to the column generation approach early provides lower bounds on the optimal value.
Revealing Employer’s Name in Social Networks
2017
Abstract The research investigates the question of the importance of mentioning the name of the employer in online and offline social networks. The exchange of information is an important part of social networks and social capital theory. Companies can use the networks of their employees to recruit new hires and to check habits and interests of likely new employees. To do that, the employee has to mention the name of the company in these social networks. The paper compares different real social networks used by family and friends and private and business social network sites (SNSs) as online social networks and compares the differences between men and women. The empirical research has been …
Semantics driven interaction using natural language in students tutoring
2007
The aim of this work is to introduce a semantic integration between an ontology and a chatbot in an Intelligent Tutoring Systems (ITS) to interact with students using natural language. The interaction process is driven by the use of a purposely defined ontology. In the ontology two types of conceptual relations are defined. Besides the usual relations, which are used to define the domain's structure, another type of relation is used to define the navigation schema inside the ontology according to the need of managing uncertainty. Uncertainty level is related to student knowledge level about the involved concepts. In this work we propose an ITS for the Java programming language called TutorJ…
Specialized Applications Used in the Mobile Application Security Implementation Process
2020
In the paper, authors aim to determine the extent to which open source applications can replace specialized security applications for mobile applications. In this respect, open source components are selected at which level the implemented security features are identified, based on which a completeness-determining indicator is calculated. The value of this indicator is then compared to the value obtained for the .NET CF3 framework, with a hierarchy of the components being treated according to this indicator. Based on the same selected components or components derived from them, to which other components have been added, the issue of ensuring their quality is dealt with by calculating the com…
Fourth Workshop on using Emerging Parallel Architectures
2012
AbstractThe Fourth Workshop on Using Emerging Parallel Architectures (WEPA), held in conjunction with ICCS 2012, provides a forum for exploring the capabilities of emerging parallel architectures such as GPUs, FPGAs, Cell B.E., Intel M.I.C. and multicores to accelerate computational science applications.