Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Mathias Dalheimer

dblp:94/85 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
0since 2021 · last 2010
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 4 · 3 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 67% Cloud and datacenter computing · 33%
Artificial intelligence
1 paper
Multi-agent systems · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Multi-agent systems › distributed scheduling › multi-agent scheduling
agent-based scheduling
0.112005
Calana: a general-purpose agent-based grid scheduler · HPDC 2005
Distributed systems › distributed scheduling
auction-based scheduling
0.112005
Calana: a general-purpose agent-based grid scheduler · HPDC 2005
Distributed systems
grid computing
0.112005
Calana: a general-purpose agent-based grid scheduler · HPDC 2005
Cloud and datacenter computing
resource allocation
0.112005
Calana: a general-purpose agent-based grid scheduler · HPDC 2005

Methods — techniques the papers use, named apart from their topics

bidding strategy · 0.1auctions · 0.1auction · 0.1
YearPublicationVenuePosition
2010 Service-oriented middleware for financial Monte Carlo simulations on the cell broadband engine
abstract
Abstract Financial Monte Carlo simulations are computationally intensive applications that must meet tight deadlines in terms of job completion times. The completion time might have a huge impact on the financial profits made from decisions derived from the simulation results. Naturally, there is a huge interest in being able to simulate as fast as possible. While single simulations can be done on one machine, decisions often depend on portfolios of simulations. Distributing the workload among resources is crucial to achieve low latency. In this article we present a combination of a middleware with a high‐performance implementation of an Asian options evaluation code on the Cell Broadband Engine (CBE). We handle workload distribution with our PHASTGrid middleware and provide users with a web service interface to the whole infrastructure. The CBE is particularly suitable for Monte Carlo simulations. We implemented a well‐known algorithm on both the CBE and the Intel x86 multicore architectures. Both codes are integrated in our middleware, allowing a direct comparison of the performance and scalability. In addition to the Monte Carlo simulation, we also use different applications and compare our middleware with Globus. Copyright © 2009 John Wiley & Sons, Ltd.
Tiberiu Rotaru, Mathias Dalheimer, Franz-Josef Pfreundt
Concurr. Comput. Pract. Exp.2
2009 GenLM: License Management for Grid and Cloud Computing Environments
abstract
Software license management allows independent software vendors (ISVs) to control the access of their products. It is a fundamental part of the ISVs' business strategy. A wide range of products has been developed in order to address license management. There are, however, only few ongoing works with regard to license management in grid and cloud computing environments. This paper presents our work on GenLM, a license management solution suitable for these environments. It has been built in order to provide a secure and robust solution for ISVs that want to extend their software usage to these systems. We provide ISVs a toolchain to implement arbitrary software licensing models. At the same time we ensure that licenses are mobile, i.e. they can be used on any resource the user has access to.
Mathias Dalheimer, Franz-Josef Pfreundt
CCGRID1
2008 Formal Verification of a Grid Resource Allocation Protocol
abstract
As the adoption of grid technology moves from science to industry, new requirements arise. In todays grid middlewares, the notion of paying for a job is a secondary requirement. In addition, the concept of selling computational power on a market is not established. On the other hand, the lack of billing capabilities hinders the commercial adoption. In this paper, we present our resource allocation protocol that suits the needs of commercial solution providers. We have developed an auction-based resource broker which uses a distributed agent infrastructure to communicate the user's requirements to resource providers and monetary prices back. The protocol has been formally verified and guarantees certain properties - for example, we can guarantee that the right stakeholder is billed for a job.
Mathias Dalheimer, Franz-Josef Pfreundt, Peter Merz
CCGRID1
2005 Calana: a general-purpose agent-based grid scheduler
abstract
Grid resource allocation is a complex task usually solved by systems relying on a centralized information system. In order to create a lightweight scheduling system, we investigated the potential of auctions for resource allocation. Each resource provider runs an agent bidding on the execution of software with respect to local restrictions. This way, the information system becomes obsolete. In addition, each provider can implement different bidding strategies in order to reflect his preferences.
Mathias Dalheimer, Franz-Josef Pfreundt, Peter Merz
HPDC1