#### Filter Results:

- Full text PDF available (13)

#### Publication Year

2004

2016

- This year (0)
- Last 5 years (11)
- Last 10 years (14)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Andreas Noack, Randolf Rotta
- SEA
- 2009

Modularity is one of the most widely used quality measures for graph clusterings. Maximizing modularity is NP-hard, and the runtime of exact algorithms is prohibitive for large graphs. A simple and effective class of heuristics coarsens the graph by iteratively merging clusters (starting from singletons), and optionally refines the resulting clustering by… (More)

- Randolf Rotta, Andreas Noack
- ACM Journal of Experimental Algorithmics
- 2011

Modularity is a widely used quality measure for graph clusterings. Its exact maximization is NP-hard and prohibitively expensive for large graphs. Popular heuristics first perform a coarsening phase, where local search starting from singleton clusters is used to compute a preliminary clustering, and then optionally a refinement phase, where this clustering… (More)

- Randolf Rotta
- MARC Symposium
- 2011

The Single-Chip Cloud Computer (SCC) is an experimental processor created by Intel Labs. Instead of the usual shared memory programming, its design favors message passing over a special shared on-chip memory. However, the design of efficient message passing is still an ongoing research work, because the system differs quite much from traditional hardware.… (More)

- Randolf Rotta, Thomas Prescher, Jörg Nolte, Jana Traue
- MARC Symposium
- 2012

- Randolf Rotta
- 2005

Highly resolved solutions of partial differential equations are important in many areas of science and technology nowadays. Only adaptive mesh refinement methods reduce the necessary work sufficiently allowing the calculation of realistic problems. Blockstructured SAMR methods are well-suited for the time-explicit computation of large-scale dynamical… (More)

- Randolf Rotta, Jörg Nolte, Vladimir Nikolov, Lutz Schubert, Stefan Bonfert, Stefan Wesner
- 2016 Intl IEEE Conferences on Ubiquitous…
- 2016

Many-core architectures trade single-thread performance for a larger number of cores. Scalable throughput can be attained only by a high degree of parallelism, minimized synchronization. Whilst this is achievable for many applications, the operating system still introduces bottlenecks through non-local sharing, synchronization,, message passing. A… (More)

- Stefan Nürnberger, Gabor Drescher, Randolf Rotta, Jörg Nolte, Wolfgang Schröder-Preikschat
- Euro-Par Workshops
- 2014

With the evolution toward fast networks of many-core processors, the design assumptions at the basis of software-level distributed shared memory (DSM) systems change considerably. But efficient DSMs are needed because they can significantly simplify the implementation of complex distributed algorithms. This paper discusses implications of the many-core… (More)