Developing parallel programs: A design-oriented perspective

Ebnenasir, Ali; Beik, Rasoul

doi:10.1109/iwmse.2009.5071377

Cited by 5 publications

(2 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There are various parallel programming models from which an application developer can choose [3,4,1]. [9] identified seven evaluation criteria for parallel programming models and evaluated six models against these criteria.…”

Section: Parallelization Paradigmsmentioning

confidence: 99%

Parallelizing LIMES for large-scale link discovery

Hillner¹,

Ngomo

2011

Proceedings of the 7th International Conference on Semantic Systems

View full text Add to dashboard Cite

The Linked Open Data cloud consists of more than 26 billion triples, of which less than 3% are links between knowledge bases. However, such links play a central role in key tasks such as cross-ontology question answering, large-scale inferencing and link-based traversal query execution models. The mere size of the Linked Data Cloud makes manual linking impossible. Consequently, Link Discovery Frameworks have been developed over the last years with the aim of providing means to detect links between knowledge bases automatically. Yet, even the current runtime-optimized frameworks for linking lead to unacceptable runtimes when presented with very large datasets. This paper addresses the time complexity of Link Discovery on very large datasets by presenting and evaluating the parallelization of the time-optimized LIMES framework by means of the MapReduce paradigm.

show abstract

Section: Parallelization Paradigmsmentioning

confidence: 99%

Parallelizing LIMES for large-scale link discovery

Hillner¹,

Ngomo

2011

Proceedings of the 7th International Conference on Semantic Systems

View full text Add to dashboard Cite

show abstract

“…Indeed, even some mobile phones are now dual core. In order to take full advantage of these capabilities it is necessary to design the software specifically to do so [2,3]. Furthermore, all computers are linked together, whether it is via the internet, local networks or wireless computing.…”

Section: Literature Reviewmentioning

confidence: 99%

Using WCF and TPL in Distributed and Parallel Finite Element Analysis

Mackie¹

Proceedings of the Eighth International Conference on Engineering Computational Technology

View full text Add to dashboard Cite

This paper examines the use of .NET's Task Parallel Library (TPL) and Windows Communication Foundation (WCF) in finite element analysis. TPL is studied in terms of equation solvers. It is shown that there is no significant difference in execution speed compared with non-TPL code, though it does offer advantages in terms of software engineering. WCF based equation solvers are also examined, and a WCF approach to designing finite element software. Using WCF based solvers involves no loss of execution speed. WCF is an example of Service Oriented Architecture (SOA) and the possibilities for using this to increase flexibility of finite element based applications is discussed.

show abstract