#### Filter Results:

#### Publication Year

1995

2014

#### Publication Type

#### Co-author

#### Publication Venue

Learn More

- Gavin Turner, Heiko Schrr Oder
- 1996

We propose an algorithm to solve the Token Distribution problem, a static variant of the load balancing problem, on d-dimensional, reconngurable meshes with toroidal connections and side length n. No other algorithms have been proposed under this model of computation. We show that for token size T, the discrepancy between the maximum and minimum number of… (More)

- Gavin Turner, Heiko Schrr, Uk
- 1995

The token distribution problem is an important data distribution problem akin to the problems of sorting and routing, in which data elements, or tokens-must be evenly distributed amongst the processors of a parallel network. To date, all algorithms to solve this problem on the mesh and reconngurable mesh architectures have lagged (in terms of the time… (More)

— This paper describes an actionable engineering framework for security engineering of a system of systems (SoS). The framework is envisioned as a tool for assessing security risks to critical missions based on the contributing systems and SoS supporting them. An SoS security risk framework is needed to manage the problem of identifying the key elements of… (More)

- Martin Middendorf, Hartmut Schmeck, Heiko Schrr, Gavin Turner
- 2007

Algorithms for multiplying several types of sparse n n-matrices on dynamically reconngurable n n-arrays are presented. For some classes of sparse matrices constant time algorithms are given, e.g. when the rst matrix has at most kn elements in each column or in each row and the second matrix has at most kn nonzero elements in each row, where k is a constant.… (More)

- Heiko Schrr, Gavin Turner, Uk
- 1996

A solution to the token distribution problem is presented for the 2-dimensional re-conngurable mesh with restricted bus length. The algorithm is shown to be asymp-totically worst-case optimal in reducing the discrepancy between maximum and minimum processor loads to in optimal (((?) n) time steps. The algorithm meets the time complexity of current… (More)

- ‹
- 1
- ›