--- _id: '19531' author: - first_name: Norbert Otto full_name: Eke, Norbert Otto id: '104' last_name: Eke citation: ama: 'Eke NO. „Gesucht die Lücke im Ablauf“ – nicht gerichtete Utopiekonzepte. (zu: Corinna Mieth: Das Utopische in Literatur und Philosophie. Zur Ästhetik Heiner Müllers und Alexander Kluges. Tübingen: A. Francke 2003). IASLonline. 2005.' apa: 'Eke, N. O. (2005). „Gesucht die Lücke im Ablauf“ – nicht gerichtete Utopiekonzepte. (zu: Corinna Mieth: Das Utopische in Literatur und Philosophie. Zur Ästhetik Heiner Müllers und Alexander Kluges. Tübingen: A. Francke 2003). IASLonline.' bibtex: '@article{Eke_2005, title={„Gesucht die Lücke im Ablauf“ – nicht gerichtete Utopiekonzepte. (zu: Corinna Mieth: Das Utopische in Literatur und Philosophie. Zur Ästhetik Heiner Müllers und Alexander Kluges. Tübingen: A. Francke 2003)}, journal={IASLonline}, author={Eke, Norbert Otto}, year={2005} }' chicago: 'Eke, Norbert Otto. “„Gesucht die Lücke im Ablauf“ – nicht gerichtete Utopiekonzepte. (zu: Corinna Mieth: Das Utopische in Literatur und Philosophie. Zur Ästhetik Heiner Müllers und Alexander Kluges. Tübingen: A. Francke 2003).” IASLonline, 2005.' ieee: 'N. O. Eke, “„Gesucht die Lücke im Ablauf“ – nicht gerichtete Utopiekonzepte. (zu: Corinna Mieth: Das Utopische in Literatur und Philosophie. Zur Ästhetik Heiner Müllers und Alexander Kluges. Tübingen: A. Francke 2003),” IASLonline. 2005.' mla: 'Eke, Norbert Otto. “„Gesucht die Lücke im Ablauf“ – nicht gerichtete Utopiekonzepte. (zu: Corinna Mieth: Das Utopische in Literatur und Philosophie. Zur Ästhetik Heiner Müllers und Alexander Kluges. Tübingen: A. Francke 2003).” IASLonline, 2005.' short: N.O. Eke, IASLonline (2005). date_created: 2020-09-17T11:54:00Z date_updated: 2022-01-06T06:54:06Z department: - _id: '465' extern: '1' language: - iso: ger main_file_link: - open_access: '1' url: http://www.iaslonline.de/index.php?vorgang_id=712 oa: '1' publication: IASLonline publication_date: 2005.10.01 status: public title: '„Gesucht die Lücke im Ablauf“ – nicht gerichtete Utopiekonzepte. (zu: Corinna Mieth: Das Utopische in Literatur und Philosophie. Zur Ästhetik Heiner Müllers und Alexander Kluges. Tübingen: A. Francke 2003)' type: review user_id: '14932' year: '2005' ... --- _id: '1961' author: - first_name: Dieter full_name: Krimphove, Dieter id: '282' last_name: Krimphove citation: ama: 'Krimphove D. The „Weimar Triangle“ and its multinational Role in Conflict-Management and Reconciliation – An erconomical approach. In: Kukliński A, Pawłowski K, eds. REUPUS Recifer Eurofutures Publication Series. Vol II, Europe – the Strategic Choices. Nowy Sącz: Wyżsaza Szkoła Biznesu; 2005:337 – 349.' apa: 'Krimphove, D. (2005). The „Weimar Triangle“ and its multinational Role in Conflict-Management and Reconciliation – An erconomical approach. In A. Kukliński & K. Pawłowski (Eds.), REUPUS Recifer Eurofutures Publication Series (Vol. II, Europe – the Strategic Choices, pp. 337 – 349). Nowy Sącz: Wyżsaza Szkoła Biznesu.' bibtex: '@inbook{Krimphove_2005, place={Nowy Sącz}, title={The „Weimar Triangle“ and its multinational Role in Conflict-Management and Reconciliation – An erconomical approach}, volume={II, Europe – the Strategic Choices}, booktitle={REUPUS Recifer Eurofutures Publication Series}, publisher={Wyżsaza Szkoła Biznesu}, author={Krimphove, Dieter}, editor={Kukliński, Antoni and Pawłowski, Krzysztof Editors}, year={2005}, pages={337 – 349} }' chicago: 'Krimphove, Dieter. “The „Weimar Triangle“ and Its Multinational Role in Conflict-Management and Reconciliation – An Erconomical Approach.” In REUPUS Recifer Eurofutures Publication Series, edited by Antoni Kukliński and Krzysztof Pawłowski, II, Europe – the Strategic Choices:337 – 349. Nowy Sącz: Wyżsaza Szkoła Biznesu, 2005.' ieee: 'D. Krimphove, “The „Weimar Triangle“ and its multinational Role in Conflict-Management and Reconciliation – An erconomical approach,” in REUPUS Recifer Eurofutures Publication Series, vol. II, Europe – the Strategic Choices, A. Kukliński and K. Pawłowski, Eds. Nowy Sącz: Wyżsaza Szkoła Biznesu, 2005, pp. 337 – 349.' mla: Krimphove, Dieter. “The „Weimar Triangle“ and Its Multinational Role in Conflict-Management and Reconciliation – An Erconomical Approach.” REUPUS Recifer Eurofutures Publication Series, edited by Antoni Kukliński and Krzysztof Pawłowski, vol. II, Europe – the Strategic Choices, Wyżsaza Szkoła Biznesu, 2005, pp. 337 – 349. short: 'D. Krimphove, in: A. Kukliński, K. Pawłowski (Eds.), REUPUS Recifer Eurofutures Publication Series, Wyżsaza Szkoła Biznesu, Nowy Sącz, 2005, pp. 337 – 349.' date_created: 2018-03-29T11:10:20Z date_updated: 2022-01-06T06:54:08Z editor: - first_name: Antoni full_name: Kukliński, Antoni last_name: Kukliński - first_name: 'Krzysztof ' full_name: 'Pawłowski, Krzysztof ' last_name: Pawłowski page: 337 – 349 place: Nowy Sącz publication: REUPUS Recifer Eurofutures Publication Series publisher: Wyżsaza Szkoła Biznesu status: public title: The „Weimar Triangle“ and its multinational Role in Conflict-Management and Reconciliation – An erconomical approach type: book_chapter user_id: '282' volume: II, Europe – the Strategic Choices year: '2005' ... --- _id: '19611' author: - first_name: Klaus full_name: Volbert, Klaus last_name: Volbert citation: ama: Volbert K. Geometric Spanners for Topology Control in Wireless Networks. Vol 168. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2005. apa: Volbert, K. (2005). Geometric Spanners for Topology Control in Wireless Networks (Vol. 168). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. bibtex: '@book{Volbert_2005, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Geometric Spanners for Topology Control in Wireless Networks}, volume={168}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Volbert, Klaus}, year={2005}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }' chicago: Volbert, Klaus. Geometric Spanners for Topology Control in Wireless Networks. Vol. 168. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005. ieee: K. Volbert, Geometric Spanners for Topology Control in Wireless Networks, vol. 168. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005. mla: Volbert, Klaus. Geometric Spanners for Topology Control in Wireless Networks. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005. short: K. Volbert, Geometric Spanners for Topology Control in Wireless Networks, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005. date_created: 2020-09-22T07:40:37Z date_updated: 2022-01-06T06:54:08Z department: - _id: '63' - _id: '26' intvolume: ' 168' language: - iso: eng publication_identifier: isbn: - 3-935433-77-8 publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn related_material: link: - relation: confirmation url: http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20050101556 series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn status: public supervisor: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide title: Geometric Spanners for Topology Control in Wireless Networks type: dissertation user_id: '5786' volume: 168 year: '2005' ... --- _id: '1962' author: - first_name: Dieter full_name: Krimphove, Dieter id: '282' last_name: Krimphove citation: ama: 'Krimphove D. Bestandsaufnahme und Ausblick auf ein neu zu schaffendes Ratingrecht. In: Achleitner A-K, Everling O, eds. Rechtsfragen Im Rating. Wiesbaden: Gabler-Verlag; 2005:65 – 88.' apa: 'Krimphove, D. (2005). Bestandsaufnahme und Ausblick auf ein neu zu schaffendes Ratingrecht. In A.-K. Achleitner & O. Everling (Eds.), Rechtsfragen im Rating (pp. 65 – 88). Wiesbaden: Gabler-Verlag.' bibtex: '@inbook{Krimphove_2005, place={Wiesbaden}, title={Bestandsaufnahme und Ausblick auf ein neu zu schaffendes Ratingrecht}, booktitle={Rechtsfragen im Rating}, publisher={Gabler-Verlag}, author={Krimphove, Dieter}, editor={Achleitner, Ann-Kristin and Everling, OliverEditors}, year={2005}, pages={65 – 88} }' chicago: 'Krimphove, Dieter. “Bestandsaufnahme Und Ausblick Auf Ein Neu Zu Schaffendes Ratingrecht.” In Rechtsfragen Im Rating, edited by Ann-Kristin Achleitner and Oliver Everling, 65 – 88. Wiesbaden: Gabler-Verlag, 2005.' ieee: 'D. Krimphove, “Bestandsaufnahme und Ausblick auf ein neu zu schaffendes Ratingrecht,” in Rechtsfragen im Rating, A.-K. Achleitner and O. Everling, Eds. Wiesbaden: Gabler-Verlag, 2005, pp. 65 – 88.' mla: Krimphove, Dieter. “Bestandsaufnahme Und Ausblick Auf Ein Neu Zu Schaffendes Ratingrecht.” Rechtsfragen Im Rating, edited by Ann-Kristin Achleitner and Oliver Everling, Gabler-Verlag, 2005, pp. 65 – 88. short: 'D. Krimphove, in: A.-K. Achleitner, O. Everling (Eds.), Rechtsfragen Im Rating, Gabler-Verlag, Wiesbaden, 2005, pp. 65 – 88.' date_created: 2018-03-29T11:13:21Z date_updated: 2022-01-06T06:54:08Z editor: - first_name: Ann-Kristin full_name: Achleitner, Ann-Kristin last_name: Achleitner - first_name: Oliver full_name: Everling, Oliver last_name: Everling page: 65 – 88 place: Wiesbaden publication: Rechtsfragen im Rating publisher: Gabler-Verlag status: public title: Bestandsaufnahme und Ausblick auf ein neu zu schaffendes Ratingrecht type: book_chapter user_id: '282' year: '2005' ... --- _id: '1963' author: - first_name: Dieter full_name: Krimphove, Dieter id: '282' last_name: Krimphove citation: ama: Krimphove D. Der Sündenfall – Humanethologische Betrachtung über die Würde des Menschen. Rechtstheorie. 2005;(Jg. 36, Heft 2):289 – 300. apa: Krimphove, D. (2005). Der Sündenfall – Humanethologische Betrachtung über die Würde des Menschen. Rechtstheorie, (Jg. 36, Heft 2), 289 – 300. bibtex: '@article{Krimphove_2005, title={Der Sündenfall – Humanethologische Betrachtung über die Würde des Menschen}, number={Jg. 36, Heft 2}, journal={Rechtstheorie}, publisher={Dunker und Humblot}, author={Krimphove, Dieter}, year={2005}, pages={289 – 300} }' chicago: 'Krimphove, Dieter. “Der Sündenfall – Humanethologische Betrachtung Über Die Würde Des Menschen.” Rechtstheorie, no. Jg. 36, Heft 2 (2005): 289 – 300.' ieee: D. Krimphove, “Der Sündenfall – Humanethologische Betrachtung über die Würde des Menschen,” Rechtstheorie, no. Jg. 36, Heft 2, pp. 289 – 300, 2005. mla: Krimphove, Dieter. “Der Sündenfall – Humanethologische Betrachtung Über Die Würde Des Menschen.” Rechtstheorie, no. Jg. 36, Heft 2, Dunker und Humblot, 2005, pp. 289 – 300. short: D. Krimphove, Rechtstheorie (2005) 289 – 300. date_created: 2018-03-29T11:14:39Z date_updated: 2022-01-06T06:54:09Z issue: Jg. 36, Heft 2 page: 289 – 300 publication: Rechtstheorie publisher: Dunker und Humblot status: public title: Der Sündenfall – Humanethologische Betrachtung über die Würde des Menschen type: journal_article user_id: '282' year: '2005' ... --- _id: '19827' abstract: - lang: eng text: "We present k-Flipper, a graph transformation algorithm that transforms regular undirected graphs. Given a path of k+2 edges it interchanges the end vertices of the path. By definition this operation preserves regularity and connectivity. We show that every regular connected graph can be reached by a series of these operations for all k ¡Ý 1. We use a randomized version, called Random k-Flipper, in order to create random regular connected undirected graphs that may serve as a backbone for peer-to-peer networks. We prove for degree d¡Ê ¦¸(log n) that a series of O(dn) Random k-Flipper operations with k ∈ ¦¨(d2n2 log 1/¦Å) transforms any graph into an expander graph with high probability, i.e. 1-n-¦¨(1).\r\n\r\nThe Random 1-Flipper is symmetric, i.e. the transformation probability from any labeled d-regular graph G to G' is equal to those from G' to G. From this and the reachability property we conclude that in the limit a series of Random 1-Flipper operations converges against an uniform probability distribution over all connected labeled d-regular graphs. For degree d ∈ ω(1) growing with the graph size this implies that iteratively applying Random 1-Flipper transforms any given graph into an expander asymptotically almost surely.\r\n\r\nWe use these operations as a maintenance operation for a peer-to-peer network based on random regular connected graphs that provides high robustness and recovers from degenerate network structures by continuously applying these random graph transformations. For this, we describe how network operations for joining and leaving the network can be designed and how the concurrency of the graph transformations can be handled." author: - first_name: Peter full_name: Mahlmann, Peter last_name: Mahlmann - first_name: Christian full_name: Schindelhauer, Christian last_name: Schindelhauer citation: ama: 'Mahlmann P, Schindelhauer C. Peer-to-peer networks based on random transformations of connected regular undirected graphs. In: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures  - SPAA’05. ; 2005. doi:10.1145/1073970.1073992' apa: Mahlmann, P., & Schindelhauer, C. (2005). Peer-to-peer networks based on random transformations of connected regular undirected graphs. In Proceedings of the 17th annual ACM symposium on Parallelism in algorithms and architectures  - SPAA’05. https://doi.org/10.1145/1073970.1073992 bibtex: '@inproceedings{Mahlmann_Schindelhauer_2005, title={Peer-to-peer networks based on random transformations of connected regular undirected graphs}, DOI={10.1145/1073970.1073992}, booktitle={Proceedings of the 17th annual ACM symposium on Parallelism in algorithms and architectures  - SPAA’05}, author={Mahlmann, Peter and Schindelhauer, Christian}, year={2005} }' chicago: Mahlmann, Peter, and Christian Schindelhauer. “Peer-to-Peer Networks Based on Random Transformations of Connected Regular Undirected Graphs.” In Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures  - SPAA’05, 2005. https://doi.org/10.1145/1073970.1073992. ieee: P. Mahlmann and C. Schindelhauer, “Peer-to-peer networks based on random transformations of connected regular undirected graphs,” in Proceedings of the 17th annual ACM symposium on Parallelism in algorithms and architectures  - SPAA’05, 2005. mla: Mahlmann, Peter, and Christian Schindelhauer. “Peer-to-Peer Networks Based on Random Transformations of Connected Regular Undirected Graphs.” Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures  - SPAA’05, 2005, doi:10.1145/1073970.1073992. short: 'P. Mahlmann, C. Schindelhauer, in: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures  - SPAA’05, 2005.' date_created: 2020-10-01T09:50:59Z date_updated: 2022-01-06T06:54:13Z department: - _id: '63' doi: 10.1145/1073970.1073992 language: - iso: eng publication: Proceedings of the 17th annual ACM symposium on Parallelism in algorithms and architectures - SPAA'05 publication_identifier: isbn: - '1581139861' publication_status: published status: public title: Peer-to-peer networks based on random transformations of connected regular undirected graphs type: conference user_id: '15415' year: '2005' ... --- _id: '19834' abstract: - lang: eng text: 'We present a strategy for organizing the communication in wireless ad hoc networks based on a cell structure. We use the unit disk graph model and assume positioning capabilities for all nodes. The cell structure is an abstract view on the network and represents regions where nodes reside (node cells), regions that can be used for the communication flow (link cells) and regions that cannot be bridged due to the restricted transmission range (barrier cells). Each node can establish a cell classification of its neighborhood based on the position data which is announced by all nodes.
The cell structure has two advantages for applying position-based routing: It helps to determine local minima for greedy forwarding and improves recovery from such minima, because for recovery all edges can be used in contrast to other topology-based rules that can be appliedonly on a planar subgraph.
For the analysis of position-based routing algorithms the measures time and traffic are based on the cell structure. The difficulty of exploring the network is expressed by the size of the barriers (i.e. the number of cells in the perimeters). Exploration can be done in parallel, but with increasing traffic. We propose a comparative measure to assess both time and traffic, the combined comparative ratio, which is the maximum of the ratio of routing time and optimal time and the ratio of the traffic and the minimum exploration costs.
While flooding and common single-path strategies have a linear ratio, we present a simple algorithm that has a sub-linear
combined comparative ratio of O(sqrt(h)), where h is the minimal hop distance between source and target.' author: - first_name: Stefan full_name: Rührup, Stefan last_name: Rührup - first_name: Christian full_name: Schindelhauer, Christian last_name: Schindelhauer citation: ama: 'Rührup S, Schindelhauer C. Competitive Time and Traffic Analysis of Position-Based Routing using a Cell Structure. In: 19th IEEE International Parallel and Distributed Processing Symposium. ; 2005:248. doi:10.1109/ipdps.2005.147' apa: Rührup, S., & Schindelhauer, C. (2005). Competitive Time and Traffic Analysis of Position-Based Routing using a Cell Structure. 19th IEEE International Parallel and Distributed Processing Symposium, 248. https://doi.org/10.1109/ipdps.2005.147 bibtex: '@inproceedings{Rührup_Schindelhauer_2005, title={Competitive Time and Traffic Analysis of Position-Based Routing using a Cell Structure}, DOI={10.1109/ipdps.2005.147}, booktitle={19th IEEE International Parallel and Distributed Processing Symposium}, author={Rührup, Stefan and Schindelhauer, Christian}, year={2005}, pages={248} }' chicago: Rührup, Stefan, and Christian Schindelhauer. “Competitive Time and Traffic Analysis of Position-Based Routing Using a Cell Structure.” In 19th IEEE International Parallel and Distributed Processing Symposium, 248, 2005. https://doi.org/10.1109/ipdps.2005.147. ieee: 'S. Rührup and C. Schindelhauer, “Competitive Time and Traffic Analysis of Position-Based Routing using a Cell Structure,” in 19th IEEE International Parallel and Distributed Processing Symposium, 2005, p. 248, doi: 10.1109/ipdps.2005.147.' mla: Rührup, Stefan, and Christian Schindelhauer. “Competitive Time and Traffic Analysis of Position-Based Routing Using a Cell Structure.” 19th IEEE International Parallel and Distributed Processing Symposium, 2005, p. 248, doi:10.1109/ipdps.2005.147. short: 'S. Rührup, C. Schindelhauer, in: 19th IEEE International Parallel and Distributed Processing Symposium, 2005, p. 248.' date_created: 2020-10-01T11:27:14Z date_updated: 2022-01-06T06:54:13Z department: - _id: '63' doi: 10.1109/ipdps.2005.147 language: - iso: eng page: '248' publication: 19th IEEE International Parallel and Distributed Processing Symposium publication_identifier: isbn: - '0769523129' publication_status: published status: public title: Competitive Time and Traffic Analysis of Position-Based Routing using a Cell Structure type: conference user_id: '15415' year: '2005' ... --- _id: '19835' abstract: - lang: eng text: The Hierarchical Layer Graph (HL graph) is a promising network topology for wireless networks with
variable transmission ranges. It was introduced and analyzed by Meyer auf der Heide et al. 2004.
In this paper we present a distributed, localized and resource-efficient algorithm for constructing this graph. The qualtiy of the HL graph depends on the domination radius and the publication radius, which affect the amount of interference in the network. These parameters also determine whether the HL graph is a c-spanner, which implies an energy-efficient topology. We investigate the performance on randomly distributed node sets and show that the restrictions on these parameters derived from a worst case analysis are not so tight using realistic settings.

Here, we present the results of our extensive experimental evaluation, measuring congestion, dilation and energy. Congestion includes the load that is induced by interfering edges. We distinguish between congestion and realistic congestion where we also take the signal-to-interference ratio into account.
Our experiments show that the HL graph contains energy-efficient paths as well as paths with a few number of hops while preserving a low congestion. author: - first_name: Stefan full_name: Rührup, Stefan last_name: Rührup - first_name: Christian full_name: Schindelhauer, Christian last_name: Schindelhauer - first_name: Klaus full_name: Volbert, Klaus last_name: Volbert citation: ama: 'Rührup S, Schindelhauer C, Volbert K. Performance Analysis of the Hierarchical Layer Graph for Wireless Networks. In: Proc. of 4th International Conference on Ad-Hoc, Mobile & Wireless Networks (ADHOC-NOW 2005). Vol 3738. ; 2005:244-257. doi:10.1007/11561354_21' apa: Rührup, S., Schindelhauer, C., & Volbert, K. (2005). Performance Analysis of the Hierarchical Layer Graph for Wireless Networks. In Proc. of 4th International Conference on Ad-Hoc, Mobile & Wireless Networks (ADHOC-NOW 2005) (Vol. 3738, pp. 244–257). https://doi.org/10.1007/11561354_21 bibtex: '@inproceedings{Rührup_Schindelhauer_Volbert_2005, title={Performance Analysis of the Hierarchical Layer Graph for Wireless Networks}, volume={3738}, DOI={10.1007/11561354_21}, booktitle={Proc. of 4th International Conference on Ad-Hoc, Mobile & Wireless Networks (ADHOC-NOW 2005)}, author={Rührup, Stefan and Schindelhauer, Christian and Volbert, Klaus}, year={2005}, pages={244–257} }' chicago: Rührup, Stefan, Christian Schindelhauer, and Klaus Volbert. “Performance Analysis of the Hierarchical Layer Graph for Wireless Networks.” In Proc. of 4th International Conference on Ad-Hoc, Mobile & Wireless Networks (ADHOC-NOW 2005), 3738:244–57, 2005. https://doi.org/10.1007/11561354_21. ieee: S. Rührup, C. Schindelhauer, and K. Volbert, “Performance Analysis of the Hierarchical Layer Graph for Wireless Networks,” in Proc. of 4th International Conference on Ad-Hoc, Mobile & Wireless Networks (ADHOC-NOW 2005), 2005, vol. 3738, pp. 244–257. mla: Rührup, Stefan, et al. “Performance Analysis of the Hierarchical Layer Graph for Wireless Networks.” Proc. of 4th International Conference on Ad-Hoc, Mobile & Wireless Networks (ADHOC-NOW 2005), vol. 3738, 2005, pp. 244–57, doi:10.1007/11561354_21. short: 'S. Rührup, C. Schindelhauer, K. Volbert, in: Proc. of 4th International Conference on Ad-Hoc, Mobile & Wireless Networks (ADHOC-NOW 2005), 2005, pp. 244–257.' date_created: 2020-10-01T11:31:14Z date_updated: 2022-01-06T06:54:13Z department: - _id: '63' doi: 10.1007/11561354_21 intvolume: ' 3738' language: - iso: eng page: 244-257 publication: Proc. of 4th International Conference on Ad-Hoc, Mobile & Wireless Networks (ADHOC-NOW 2005) publication_identifier: isbn: - '9783540291329' - '9783540320869' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Performance Analysis of the Hierarchical Layer Graph for Wireless Networks type: conference user_id: '15415' volume: 3738 year: '2005' ... --- _id: '19836' author: - first_name: Christian full_name: Schindelhauer, Christian last_name: Schindelhauer - first_name: Kerstin full_name: Voß, Kerstin last_name: Voß citation: ama: 'Schindelhauer C, Voß K. Probability Distributions for Channel Utilisation. In: Proc. of 4th International Conference on Ad-Hoc Networks & Wireless (ADHOC-NOW 2005). 3738. ; 2005:271-284. doi:10.1007/11561354_23' apa: Schindelhauer, C., & Voß, K. (2005). Probability Distributions for Channel Utilisation. In Proc. of 4th International Conference on Ad-Hoc Networks & Wireless (ADHOC-NOW 2005) (pp. 271–284). https://doi.org/10.1007/11561354_23 bibtex: '@inbook{Schindelhauer_Voß_2005, series={3738}, title={Probability Distributions for Channel Utilisation}, DOI={10.1007/11561354_23}, booktitle={Proc. of 4th International Conference on Ad-Hoc Networks & Wireless (ADHOC-NOW 2005)}, author={Schindelhauer, Christian and Voß, Kerstin}, year={2005}, pages={271–284}, collection={3738} }' chicago: Schindelhauer, Christian, and Kerstin Voß. “Probability Distributions for Channel Utilisation.” In Proc. of 4th International Conference on Ad-Hoc Networks & Wireless (ADHOC-NOW 2005), 271–84. 3738, 2005. https://doi.org/10.1007/11561354_23. ieee: C. Schindelhauer and K. Voß, “Probability Distributions for Channel Utilisation,” in Proc. of 4th International Conference on Ad-Hoc Networks & Wireless (ADHOC-NOW 2005), 2005, pp. 271–284. mla: Schindelhauer, Christian, and Kerstin Voß. “Probability Distributions for Channel Utilisation.” Proc. of 4th International Conference on Ad-Hoc Networks & Wireless (ADHOC-NOW 2005), 2005, pp. 271–84, doi:10.1007/11561354_23. short: 'C. Schindelhauer, K. Voß, in: Proc. of 4th International Conference on Ad-Hoc Networks & Wireless (ADHOC-NOW 2005), 2005, pp. 271–284.' date_created: 2020-10-01T11:36:30Z date_updated: 2022-01-06T06:54:13Z department: - _id: '63' doi: 10.1007/11561354_23 language: - iso: eng page: 271-284 publication: Proc. of 4th International Conference on Ad-Hoc Networks & Wireless (ADHOC-NOW 2005) publication_identifier: isbn: - '9783540291329' - '9783540320869' issn: - 0302-9743 - 1611-3349 publication_status: published series_title: '3738' status: public title: Probability Distributions for Channel Utilisation type: book_chapter user_id: '15415' year: '2005' ... --- _id: '19837' author: - first_name: Christian full_name: Schindelhauer, Christian last_name: Schindelhauer - first_name: Gerhard full_name: Weikum, Gerhard last_name: Weikum - first_name: David full_name: Hales, David last_name: Hales - first_name: Peter full_name: Triantafillou, Peter last_name: Triantafillou citation: ama: 'Schindelhauer C, Weikum G, Hales D, Triantafillou P. Towards Self-Organizing Query Routing and Processing for Peer-to-Peer Web Search. In: European Conference on Complex Systems (ECCS 2005). ; 2005.' apa: Schindelhauer, C., Weikum, G., Hales, D., & Triantafillou, P. (2005). Towards Self-Organizing Query Routing and Processing for Peer-to-Peer Web Search. In European Conference on Complex Systems (ECCS 2005). bibtex: '@inproceedings{Schindelhauer_Weikum_Hales_Triantafillou_2005, title={Towards Self-Organizing Query Routing and Processing for Peer-to-Peer Web Search}, booktitle={European Conference on Complex Systems (ECCS 2005)}, author={Schindelhauer, Christian and Weikum, Gerhard and Hales, David and Triantafillou, Peter}, year={2005} }' chicago: Schindelhauer, Christian, Gerhard Weikum, David Hales, and Peter Triantafillou. “Towards Self-Organizing Query Routing and Processing for Peer-to-Peer Web Search.” In European Conference on Complex Systems (ECCS 2005), 2005. ieee: C. Schindelhauer, G. Weikum, D. Hales, and P. Triantafillou, “Towards Self-Organizing Query Routing and Processing for Peer-to-Peer Web Search,” in European Conference on Complex Systems (ECCS 2005), 2005. mla: Schindelhauer, Christian, et al. “Towards Self-Organizing Query Routing and Processing for Peer-to-Peer Web Search.” European Conference on Complex Systems (ECCS 2005), 2005. short: 'C. Schindelhauer, G. Weikum, D. Hales, P. Triantafillou, in: European Conference on Complex Systems (ECCS 2005), 2005.' date_created: 2020-10-01T11:45:28Z date_updated: 2022-01-06T06:54:13Z department: - _id: '63' language: - iso: eng publication: European Conference on Complex Systems (ECCS 2005) status: public title: Towards Self-Organizing Query Routing and Processing for Peer-to-Peer Web Search type: conference user_id: '15415' year: '2005' ... --- _id: '19871' abstract: - lang: eng text: Data has become the most valuable asset for many companies; loosing important data can cause companies to fail quite immediately. The protection of data inside storage systems is mostly achieved by using a RAID scheme that adds redundant data to user data, enabling recovery from single or multiple disk failures. This protection against data loss in case of a disk failure can be achieved either by dedicated hardware or a software RAID solution.

One major advantage of software RAID is that it comes for free as a built-in functionality in many operating systems like Linux or Microsoft Windows. The drawback of the built-in functionality is that it is not suited to run in multiple server environments; synchronization and recovery processes can be corrupted if more than a single server is allowed to access a software RAID volume.

In this paper, we present an enhancement for the Linux md-driver that enables a consistent usage of RAID in multiple server environments. Based on the V:DRIVE virtualization environment, RAID volumes can be consistently synchronized and recovered even in distributed environments. Besides the architectural concepts, we present measurements that indicate the viability of this enhanced, distributed version of md. author: - first_name: André full_name: Brinkmann, André last_name: Brinkmann - first_name: Sascha full_name: Effert, Sascha last_name: Effert - first_name: Michael full_name: Heidebuer, Michael last_name: Heidebuer - first_name: Mario full_name: Vodisek, Mario last_name: Vodisek citation: ama: 'Brinkmann A, Effert S, Heidebuer M, Vodisek M. Distributed MD. In: In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os. ; 2005:81-88.' apa: Brinkmann, A., Effert, S., Heidebuer, M., & Vodisek, M. (2005). Distributed MD. In In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os (pp. 81–88). bibtex: '@inproceedings{Brinkmann_Effert_Heidebuer_Vodisek_2005, title={Distributed MD}, booktitle={In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os}, author={Brinkmann, André and Effert, Sascha and Heidebuer, Michael and Vodisek, Mario}, year={2005}, pages={81–88} }' chicago: Brinkmann, André, Sascha Effert, Michael Heidebuer, and Mario Vodisek. “Distributed MD.” In In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os, 81–88, 2005. ieee: A. Brinkmann, S. Effert, M. Heidebuer, and M. Vodisek, “Distributed MD,” in In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os, 2005, pp. 81–88. mla: Brinkmann, André, et al. “Distributed MD.” In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os, 2005, pp. 81–88. short: 'A. Brinkmann, S. Effert, M. Heidebuer, M. Vodisek, in: In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os, 2005, pp. 81–88.' date_created: 2020-10-05T08:49:22Z date_updated: 2022-01-06T06:54:14Z department: - _id: '63' - _id: '58' language: - iso: eng page: 81 - 88 publication: In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os status: public title: Distributed MD type: conference user_id: '15415' year: '2005' ... --- _id: '19872' abstract: - lang: eng text: "Recent developments both in the business and the technological domain have led to a significant increase in demand for Business Intelligence (BI) infrastructures that can handle huge amounts of data in small time frames. BI applications are increasingly used by large user bases on all management levels; support tasks spanning the complete value chain are based on transactional data and are directly coupled with operational systems in \x94closed loop\x94 approaches.

To effectively handle the resulting data volume turns out to be an extremely challenging task which encompasses a variety of issues on different levels. We propose an integrated multi layer tool for monitoring, benchmarking, analyzing, and optimizing the performance of such BI infrastructures.

Inside this paper we give a coarse outline of the tool\x92s architecture and demonstrate the value of distinct measurement points at operating system layer. For that purpose we introduce a kernel based benchmark environment and present first measurement results. The gathered data clearly indicates that a meaningful analysis of performance benchmarks without kernel trace points is of limited value - which shows the necessity to consider a separate component within the tool\x92s architecture." author: - first_name: André full_name: Brinkmann, André last_name: Brinkmann - first_name: Sascha full_name: Effert, Sascha last_name: Effert - first_name: Michael full_name: Heidebuer, Michael last_name: Heidebuer - first_name: Mario full_name: Vodisek, Mario last_name: Vodisek - first_name: Henning full_name: Baars, Henning last_name: Baars citation: ama: 'Brinkmann A, Effert S, Heidebuer M, Vodisek M, Baars H. An integrated Architecture for Business Intelligence support from Application down to Storage. In: In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os. ; 2005:1-8.' apa: Brinkmann, A., Effert, S., Heidebuer, M., Vodisek, M., & Baars, H. (2005). An integrated Architecture for Business Intelligence support from Application down to Storage. In In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os (pp. 1–8). bibtex: '@inproceedings{Brinkmann_Effert_Heidebuer_Vodisek_Baars_2005, title={An integrated Architecture for Business Intelligence support from Application down to Storage}, booktitle={In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os}, author={Brinkmann, André and Effert, Sascha and Heidebuer, Michael and Vodisek, Mario and Baars, Henning}, year={2005}, pages={1–8} }' chicago: Brinkmann, André, Sascha Effert, Michael Heidebuer, Mario Vodisek, and Henning Baars. “An Integrated Architecture for Business Intelligence Support from Application down to Storage.” In In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os, 1–8, 2005. ieee: A. Brinkmann, S. Effert, M. Heidebuer, M. Vodisek, and H. Baars, “An integrated Architecture for Business Intelligence support from Application down to Storage,” in In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os, 2005, pp. 1–8. mla: Brinkmann, André, et al. “An Integrated Architecture for Business Intelligence Support from Application down to Storage.” In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os, 2005, pp. 1–8. short: 'A. Brinkmann, S. Effert, M. Heidebuer, M. Vodisek, H. Baars, in: In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os, 2005, pp. 1–8.' date_created: 2020-10-05T08:56:38Z date_updated: 2022-01-06T06:54:14Z department: - _id: '63' - _id: '58' language: - iso: eng page: 1-8 publication: In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os status: public title: An integrated Architecture for Business Intelligence support from Application down to Storage type: conference user_id: '15415' year: '2005' ... --- _id: '19888' author: - first_name: Jan full_name: Klein, Jan last_name: Klein - first_name: Gabriel full_name: Zachmann, Gabriel last_name: Zachmann citation: ama: 'Klein J, Zachmann G. The expected running time of hierarchical collision detection. In: ACM SIGGRAPH 2005 Posters on  - SIGGRAPH ’05. ; 2005. doi:10.1145/1186954.1187087' apa: Klein, J., & Zachmann, G. (2005). The expected running time of hierarchical collision detection. In ACM SIGGRAPH 2005 Posters on  - SIGGRAPH ’05. https://doi.org/10.1145/1186954.1187087 bibtex: '@inproceedings{Klein_Zachmann_2005, title={The expected running time of hierarchical collision detection}, DOI={10.1145/1186954.1187087}, booktitle={ACM SIGGRAPH 2005 Posters on  - SIGGRAPH ’05}, author={Klein, Jan and Zachmann, Gabriel}, year={2005} }' chicago: Klein, Jan, and Gabriel Zachmann. “The Expected Running Time of Hierarchical Collision Detection.” In ACM SIGGRAPH 2005 Posters on  - SIGGRAPH ’05, 2005. https://doi.org/10.1145/1186954.1187087. ieee: J. Klein and G. Zachmann, “The expected running time of hierarchical collision detection,” in ACM SIGGRAPH 2005 Posters on  - SIGGRAPH ’05, 2005. mla: Klein, Jan, and Gabriel Zachmann. “The Expected Running Time of Hierarchical Collision Detection.” ACM SIGGRAPH 2005 Posters on  - SIGGRAPH ’05, 2005, doi:10.1145/1186954.1187087. short: 'J. Klein, G. Zachmann, in: ACM SIGGRAPH 2005 Posters on  - SIGGRAPH ’05, 2005.' date_created: 2020-10-05T13:25:41Z date_updated: 2022-01-06T06:54:14Z department: - _id: '63' doi: 10.1145/1186954.1187087 language: - iso: eng publication: ACM SIGGRAPH 2005 Posters on - SIGGRAPH '05 publication_status: published status: public title: The expected running time of hierarchical collision detection type: conference user_id: '15415' year: '2005' ... --- _id: '19890' author: - first_name: Jan full_name: Klein, Jan last_name: Klein - first_name: Gabriel full_name: Zachmann, Gabriel last_name: Zachmann citation: ama: 'Klein J, Zachmann G. Interpolation Search for Point Cloud Intersection. In: Proceedings of the 13-Th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision’2005 (WSCG’2005). ; 2005:163-170. doi:10.1145/1186223.1186329' apa: Klein, J., & Zachmann, G. (2005). Interpolation Search for Point Cloud Intersection. In Proceedings of the 13-th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision’2005 (WSCG’2005) (pp. 163–170). https://doi.org/10.1145/1186223.1186329 bibtex: '@inproceedings{Klein_Zachmann_2005, title={Interpolation Search for Point Cloud Intersection}, DOI={10.1145/1186223.1186329}, booktitle={Proceedings of the 13-th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision’2005 (WSCG’2005)}, author={Klein, Jan and Zachmann, Gabriel}, year={2005}, pages={163–170} }' chicago: Klein, Jan, and Gabriel Zachmann. “Interpolation Search for Point Cloud Intersection.” In Proceedings of the 13-Th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision’2005 (WSCG’2005), 163–70, 2005. https://doi.org/10.1145/1186223.1186329. ieee: J. Klein and G. Zachmann, “Interpolation Search for Point Cloud Intersection,” in Proceedings of the 13-th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision’2005 (WSCG’2005), 2005, pp. 163–170. mla: Klein, Jan, and Gabriel Zachmann. “Interpolation Search for Point Cloud Intersection.” Proceedings of the 13-Th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision’2005 (WSCG’2005), 2005, pp. 163–70, doi:10.1145/1186223.1186329. short: 'J. Klein, G. Zachmann, in: Proceedings of the 13-Th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision’2005 (WSCG’2005), 2005, pp. 163–170.' date_created: 2020-10-05T13:38:33Z date_updated: 2022-01-06T06:54:14Z department: - _id: '63' doi: 10.1145/1186223.1186329 language: - iso: eng page: 163-170 publication: Proceedings of the 13-th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision'2005 (WSCG'2005) status: public title: Interpolation Search for Point Cloud Intersection type: conference user_id: '15415' year: '2005' ... --- _id: '1990' abstract: - lang: eng text: "Grid Computing promises an efficient sharing of world-wide distributed resources, ranging from hardware, software, expert knowledge to special I/O devices. However, although the main Grid mechanisms are already developed or are currently addressed by tremendous research effort, the Grid environment still suffers from a low acceptance in different user communities. Beside difficulties regarding an intuitive and comfortable resource access, various problems related to the reliability and the Quality-of-Service while using the Grid exist.\r\n\r\nUsers should be able to rely, that their jobs will have certain priority at the remote Grid site and that they will be finished upon the agreed time regardless of any provider problems. Therefore, QoS issues have to be considered in the Grid middleware but also in the local resource management systems at the Grid sites. However, most of the currently used resource management systems are not suitable for SLAs, as they do not support resource reservation and do not offer mechanisms for job checkpointing/migration respectively. The latter are mandatory for Grid providers as rescue anchor in case of system failures or system overload.\r\n\r\nThis paper focuses on SLA-aware job migration and presents a work, which is being performed in the EU supported project HPC4U." author: - first_name: Felix full_name: Heine, Felix last_name: Heine - first_name: Matthias full_name: Hovestadt, Matthias last_name: Hovestadt - first_name: Odej full_name: Kao, Odej last_name: Kao - first_name: Axel full_name: Keller, Axel id: '15274' last_name: Keller citation: ama: 'Heine F, Hovestadt M, Kao O, Keller A. SLA-aware Job Migration in Grid Environments. In: Grandinetti L, ed. Grid Computing: New Frontiers of High Performance Computing. Vol 14. Advances in Parallel Computing. ; 2005:185-201. doi:10.1016/S0927-5452(05)80011-5' apa: 'Heine, F., Hovestadt, M., Kao, O., & Keller, A. (2005). SLA-aware Job Migration in Grid Environments. In L. Grandinetti (Ed.), Grid Computing: New Frontiers of High Performance Computing (Vol. 14, pp. 185–201). https://doi.org/10.1016/S0927-5452(05)80011-5' bibtex: '@inbook{Heine_Hovestadt_Kao_Keller_2005, series={Advances in Parallel Computing}, title={SLA-aware Job Migration in Grid Environments}, volume={14}, DOI={10.1016/S0927-5452(05)80011-5}, booktitle={Grid Computing: New Frontiers of High Performance Computing}, author={Heine, Felix and Hovestadt, Matthias and Kao, Odej and Keller, Axel}, editor={Grandinetti, LucioEditor}, year={2005}, pages={185–201}, collection={Advances in Parallel Computing} }' chicago: 'Heine, Felix, Matthias Hovestadt, Odej Kao, and Axel Keller. “SLA-Aware Job Migration in Grid Environments.” In Grid Computing: New Frontiers of High Performance Computing, edited by Lucio Grandinetti, 14:185–201. Advances in Parallel Computing, 2005. https://doi.org/10.1016/S0927-5452(05)80011-5.' ieee: 'F. Heine, M. Hovestadt, O. Kao, and A. Keller, “SLA-aware Job Migration in Grid Environments,” in Grid Computing: New Frontiers of High Performance Computing, vol. 14, L. Grandinetti, Ed. 2005, pp. 185–201.' mla: 'Heine, Felix, et al. “SLA-Aware Job Migration in Grid Environments.” Grid Computing: New Frontiers of High Performance Computing, edited by Lucio Grandinetti, vol. 14, 2005, pp. 185–201, doi:10.1016/S0927-5452(05)80011-5.' short: 'F. Heine, M. Hovestadt, O. Kao, A. Keller, in: L. Grandinetti (Ed.), Grid Computing: New Frontiers of High Performance Computing, 2005, pp. 185–201.' date_created: 2018-03-29T11:32:25Z date_updated: 2022-01-06T06:54:14Z department: - _id: '27' doi: 10.1016/S0927-5452(05)80011-5 editor: - first_name: Lucio full_name: Grandinetti, Lucio last_name: Grandinetti intvolume: ' 14' language: - iso: eng page: 185-201 publication: 'Grid Computing: New Frontiers of High Performance Computing' publication_status: published series_title: Advances in Parallel Computing status: public title: SLA-aware Job Migration in Grid Environments type: book_chapter user_id: '15274' volume: 14 year: '2005' ... --- _id: '19912' author: - first_name: Chris full_name: Loeser, Chris last_name: Loeser - first_name: Gunnar full_name: Schomaker, Gunnar last_name: Schomaker - first_name: André full_name: Brinkmann, André last_name: Brinkmann - first_name: Mario full_name: Vodisek, Mario last_name: Vodisek - first_name: Michael full_name: Heidebuer, Michael last_name: Heidebuer citation: ama: 'Loeser C, Schomaker G, Brinkmann A, Vodisek M, Heidebuer M. Content Distribution in Heterogenous Video-on-Demand P2P Networks with ARIMA Forecasts. In: Proceedings of the 4th International Conference on Networking. Vol 3421. Berlin, Heidelberg; 2005:800-810. doi:10.1007/978-3-540-31957-3_90' apa: Loeser, C., Schomaker, G., Brinkmann, A., Vodisek, M., & Heidebuer, M. (2005). Content Distribution in Heterogenous Video-on-Demand P2P Networks with ARIMA Forecasts. In Proceedings of the 4th International Conference on Networking (Vol. 3421, pp. 800–810). Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31957-3_90 bibtex: '@inproceedings{Loeser_Schomaker_Brinkmann_Vodisek_Heidebuer_2005, place={Berlin, Heidelberg}, title={Content Distribution in Heterogenous Video-on-Demand P2P Networks with ARIMA Forecasts}, volume={3421}, DOI={10.1007/978-3-540-31957-3_90}, booktitle={Proceedings of the 4th International Conference on Networking}, author={Loeser, Chris and Schomaker, Gunnar and Brinkmann, André and Vodisek, Mario and Heidebuer, Michael}, year={2005}, pages={800–810} }' chicago: Loeser, Chris, Gunnar Schomaker, André Brinkmann, Mario Vodisek, and Michael Heidebuer. “Content Distribution in Heterogenous Video-on-Demand P2P Networks with ARIMA Forecasts.” In Proceedings of the 4th International Conference on Networking, 3421:800–810. Berlin, Heidelberg, 2005. https://doi.org/10.1007/978-3-540-31957-3_90. ieee: C. Loeser, G. Schomaker, A. Brinkmann, M. Vodisek, and M. Heidebuer, “Content Distribution in Heterogenous Video-on-Demand P2P Networks with ARIMA Forecasts,” in Proceedings of the 4th International Conference on Networking, 2005, vol. 3421, pp. 800–810. mla: Loeser, Chris, et al. “Content Distribution in Heterogenous Video-on-Demand P2P Networks with ARIMA Forecasts.” Proceedings of the 4th International Conference on Networking, vol. 3421, 2005, pp. 800–10, doi:10.1007/978-3-540-31957-3_90. short: 'C. Loeser, G. Schomaker, A. Brinkmann, M. Vodisek, M. Heidebuer, in: Proceedings of the 4th International Conference on Networking, Berlin, Heidelberg, 2005, pp. 800–810.' date_created: 2020-10-06T10:36:14Z date_updated: 2022-01-06T06:54:14Z department: - _id: '63' - _id: '58' doi: 10.1007/978-3-540-31957-3_90 intvolume: ' 3421' language: - iso: eng page: 800-810 place: Berlin, Heidelberg publication: Proceedings of the 4th International Conference on Networking publication_identifier: isbn: - '9783540253389' - '9783540319573' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Content Distribution in Heterogenous Video-on-Demand P2P Networks with ARIMA Forecasts type: conference user_id: '15415' volume: 3421 year: '2005' ... --- _id: '1992' abstract: - lang: eng text: The next generation grid applications demand grid middleware for a flexible negotiation mechanism supporting various ways of quality-of-service (QoS) guarantees. In this context, a QoS guarantee covers simultaneous allocations of various kinds of different resources, such as processor runtime, storage capacity, or network bandwidth, which are specified in the form of service level agreements (SLA). Currently, a gap exists between the capabilities of grid middleware and the underlying resource management systems concerning their support for QoS and SLA negotiation. In this paper we present an approach which closes this gap. Introducing the architecture of the virtual resource manager, we highlight its main QoS management features like run-time responsibility, co-allocation, and fault tolerance. author: - first_name: Lars-Olof full_name: Burchard, Lars-Olof last_name: Burchard - first_name: Felix full_name: Heine, Felix last_name: Heine - first_name: Matthias full_name: Hovestadt, Matthias last_name: Hovestadt - first_name: Odej full_name: Kao, Odej last_name: Kao - first_name: Axel full_name: Keller, Axel id: '15274' last_name: Keller - first_name: Barry full_name: Linnert, Barry last_name: Linnert citation: ama: 'Burchard L-O, Heine F, Hovestadt M, Kao O, Keller A, Linnert B. A Quality-of-Service Architecture for Future Grid Computing Applications. In: Proc. IEEE Int. Parallel & Distributed Processing Symposium (IPDPS). ; 2005:132a-132a. doi:10.1109/IPDPS.2005.62' apa: Burchard, L.-O., Heine, F., Hovestadt, M., Kao, O., Keller, A., & Linnert, B. (2005). A Quality-of-Service Architecture for Future Grid Computing Applications. In Proc. IEEE Int. Parallel & Distributed Processing Symposium (IPDPS) (pp. 132a-132a). https://doi.org/10.1109/IPDPS.2005.62 bibtex: '@inproceedings{Burchard_Heine_Hovestadt_Kao_Keller_Linnert_2005, title={A Quality-of-Service Architecture for Future Grid Computing Applications.}, DOI={10.1109/IPDPS.2005.62}, booktitle={Proc. IEEE Int. Parallel & Distributed Processing Symposium (IPDPS)}, author={Burchard, Lars-Olof and Heine, Felix and Hovestadt, Matthias and Kao, Odej and Keller, Axel and Linnert, Barry}, year={2005}, pages={132a-132a} }' chicago: Burchard, Lars-Olof, Felix Heine, Matthias Hovestadt, Odej Kao, Axel Keller, and Barry Linnert. “A Quality-of-Service Architecture for Future Grid Computing Applications.” In Proc. IEEE Int. Parallel & Distributed Processing Symposium (IPDPS), 132a-132a, 2005. https://doi.org/10.1109/IPDPS.2005.62. ieee: L.-O. Burchard, F. Heine, M. Hovestadt, O. Kao, A. Keller, and B. Linnert, “A Quality-of-Service Architecture for Future Grid Computing Applications.,” in Proc. IEEE Int. Parallel & Distributed Processing Symposium (IPDPS), 2005, pp. 132a-132a. mla: Burchard, Lars-Olof, et al. “A Quality-of-Service Architecture for Future Grid Computing Applications.” Proc. IEEE Int. Parallel & Distributed Processing Symposium (IPDPS), 2005, pp. 132a-132a, doi:10.1109/IPDPS.2005.62. short: 'L.-O. Burchard, F. Heine, M. Hovestadt, O. Kao, A. Keller, B. Linnert, in: Proc. IEEE Int. Parallel & Distributed Processing Symposium (IPDPS), 2005, pp. 132a-132a.' date_created: 2018-03-29T11:33:32Z date_updated: 2022-01-06T06:54:14Z department: - _id: '27' doi: 10.1109/IPDPS.2005.62 language: - iso: eng page: 132a-132a publication: Proc. IEEE Int. Parallel & Distributed Processing Symposium (IPDPS) publication_status: published status: public title: A Quality-of-Service Architecture for Future Grid Computing Applications. type: conference user_id: '15274' year: '2005' ... --- _id: '2411' abstract: - lang: eng text: ' This paper motivates the use of hardware virtualization on coarse-grained reconfigurable architectures. We introduce Zippy, a coarse-grained multi-context hybrid CPU with architectural support for efficient hardware virtualization. The architectural details and the corresponding tool flow are outlined. As a case study, we compare the non-virtualized and the virtualized execution of an ADPCM decoder. ' author: - first_name: Christian full_name: Plessl, Christian id: '16153' last_name: Plessl orcid: 0000-0001-5728-9982 - first_name: Marco full_name: Platzner, Marco id: '398' last_name: Platzner citation: ama: 'Plessl C, Platzner M. Zippy – A coarse-grained reconfigurable array with support for hardware virtualization. In: Proc. Int. Conf. on Application-Specific Systems, Architectures, and Processors (ASAP). IEEE Computer Society; 2005:213-218. doi:10.1109/ASAP.2005.69' apa: Plessl, C., & Platzner, M. (2005). Zippy – A coarse-grained reconfigurable array with support for hardware virtualization. In Proc. Int. Conf. on Application-Specific Systems, Architectures, and Processors (ASAP) (pp. 213–218). IEEE Computer Society. https://doi.org/10.1109/ASAP.2005.69 bibtex: '@inproceedings{Plessl_Platzner_2005, title={Zippy – A coarse-grained reconfigurable array with support for hardware virtualization}, DOI={10.1109/ASAP.2005.69}, booktitle={Proc. Int. Conf. on Application-Specific Systems, Architectures, and Processors (ASAP)}, publisher={IEEE Computer Society}, author={Plessl, Christian and Platzner, Marco}, year={2005}, pages={213–218} }' chicago: Plessl, Christian, and Marco Platzner. “Zippy – A Coarse-Grained Reconfigurable Array with Support for Hardware Virtualization.” In Proc. Int. Conf. on Application-Specific Systems, Architectures, and Processors (ASAP), 213–18. IEEE Computer Society, 2005. https://doi.org/10.1109/ASAP.2005.69. ieee: C. Plessl and M. Platzner, “Zippy – A coarse-grained reconfigurable array with support for hardware virtualization,” in Proc. Int. Conf. on Application-Specific Systems, Architectures, and Processors (ASAP), 2005, pp. 213–218. mla: Plessl, Christian, and Marco Platzner. “Zippy – A Coarse-Grained Reconfigurable Array with Support for Hardware Virtualization.” Proc. Int. Conf. on Application-Specific Systems, Architectures, and Processors (ASAP), IEEE Computer Society, 2005, pp. 213–18, doi:10.1109/ASAP.2005.69. short: 'C. Plessl, M. Platzner, in: Proc. Int. Conf. on Application-Specific Systems, Architectures, and Processors (ASAP), IEEE Computer Society, 2005, pp. 213–218.' date_created: 2018-04-17T14:34:03Z date_updated: 2022-01-06T06:56:07Z department: - _id: '518' - _id: '78' doi: 10.1109/ASAP.2005.69 keyword: - Zippy page: 213-218 publication: Proc. Int. Conf. on Application-Specific Systems, Architectures, and Processors (ASAP) publisher: IEEE Computer Society status: public title: Zippy – A coarse-grained reconfigurable array with support for hardware virtualization type: conference user_id: '24135' year: '2005' ... --- _id: '2412' abstract: - lang: eng text: ' Reconfigurable architectures that tightly integrate a standard CPU core with a field-programmable hardware structure have recently been receiving impact of these design decisions on the overall system performance is a challenging task. In this paper, we first present a framework for the cycle-accurate performance evaluation of hybrid reconfigurable processors on the system level. Then, we discuss a reconfigurable processor for data-streaming applications, which attaches a coarse-grained reconfigurable unit to the coprocessor interface of a standard embedded CPU core. By means of a case study we evaluate the system-level impact of certain design features for the reconfigurable unit, such as multiple contexts, register replication, and hardware context scheduling. The results illustrate that a system-level evaluation framework is of paramount importance for studying the architectural trade-offs and optimizing design parameters for reconfigurable processors.' author: - first_name: Rolf full_name: Enzler, Rolf last_name: Enzler - first_name: Christian full_name: Plessl, Christian id: '16153' last_name: Plessl orcid: 0000-0001-5728-9982 - first_name: Marco full_name: Platzner, Marco id: '398' last_name: Platzner citation: ama: Enzler R, Plessl C, Platzner M. System-level performance evaluation of reconfigurable processors. Microprocessors and Microsystems. 2005;29(2-3):63-73. doi:10.1016/j.micpro.2004.06.004 apa: Enzler, R., Plessl, C., & Platzner, M. (2005). System-level performance evaluation of reconfigurable processors. Microprocessors and Microsystems, 29(2–3), 63–73. https://doi.org/10.1016/j.micpro.2004.06.004 bibtex: '@article{Enzler_Plessl_Platzner_2005, title={System-level performance evaluation of reconfigurable processors}, volume={29}, DOI={10.1016/j.micpro.2004.06.004}, number={2–3}, journal={Microprocessors and Microsystems}, publisher={Elsevier}, author={Enzler, Rolf and Plessl, Christian and Platzner, Marco}, year={2005}, pages={63–73} }' chicago: 'Enzler, Rolf, Christian Plessl, and Marco Platzner. “System-Level Performance Evaluation of Reconfigurable Processors.” Microprocessors and Microsystems 29, no. 2–3 (2005): 63–73. https://doi.org/10.1016/j.micpro.2004.06.004.' ieee: R. Enzler, C. Plessl, and M. Platzner, “System-level performance evaluation of reconfigurable processors,” Microprocessors and Microsystems, vol. 29, no. 2–3, pp. 63–73, 2005. mla: Enzler, Rolf, et al. “System-Level Performance Evaluation of Reconfigurable Processors.” Microprocessors and Microsystems, vol. 29, no. 2–3, Elsevier, 2005, pp. 63–73, doi:10.1016/j.micpro.2004.06.004. short: R. Enzler, C. Plessl, M. Platzner, Microprocessors and Microsystems 29 (2005) 63–73. date_created: 2018-04-17T14:36:10Z date_updated: 2022-01-06T06:56:07Z department: - _id: '518' - _id: '78' doi: 10.1016/j.micpro.2004.06.004 intvolume: ' 29' issue: 2-3 keyword: - FPGA - reconfigurable computing - co-simulation - Zippy page: 63-73 publication: Microprocessors and Microsystems publisher: Elsevier status: public title: System-level performance evaluation of reconfigurable processors type: journal_article user_id: '24135' volume: 29 year: '2005' ... --- _id: '2413' author: - first_name: Stefan full_name: Lietsch, Stefan last_name: Lietsch - first_name: Odej full_name: Kao, Odej last_name: Kao citation: ama: 'Lietsch S, Kao O. CoLoS - A System for Device Unaware and Position Dependent Communication Based on the Session Initiation Protocol. In: Proc. Intelligence in Communication Systems (INTELLCOMM). Vol 190. IFIP — The International Federation for Information Processing (IFIPAICT). Boston, MA, USA: Springer; 2005:261-271. doi:10.1007/0-387-32015-6_24' apa: 'Lietsch, S., & Kao, O. (2005). CoLoS - A System for Device Unaware and Position Dependent Communication Based on the Session Initiation Protocol. In Proc. Intelligence in Communication Systems (INTELLCOMM) (Vol. 190, pp. 261–271). Boston, MA, USA: Springer. https://doi.org/10.1007/0-387-32015-6_24' bibtex: '@inproceedings{Lietsch_Kao_2005, place={Boston, MA, USA}, series={ IFIP — The International Federation for Information Processing (IFIPAICT)}, title={CoLoS - A System for Device Unaware and Position Dependent Communication Based on the Session Initiation Protocol}, volume={190}, DOI={10.1007/0-387-32015-6_24}, booktitle={Proc. Intelligence in Communication Systems (INTELLCOMM)}, publisher={Springer}, author={Lietsch, Stefan and Kao, Odej}, year={2005}, pages={261–271}, collection={ IFIP — The International Federation for Information Processing (IFIPAICT)} }' chicago: 'Lietsch, Stefan, and Odej Kao. “CoLoS - A System for Device Unaware and Position Dependent Communication Based on the Session Initiation Protocol.” In Proc. Intelligence in Communication Systems (INTELLCOMM), 190:261–71. IFIP — The International Federation for Information Processing (IFIPAICT). Boston, MA, USA: Springer, 2005. https://doi.org/10.1007/0-387-32015-6_24.' ieee: S. Lietsch and O. Kao, “CoLoS - A System for Device Unaware and Position Dependent Communication Based on the Session Initiation Protocol,” in Proc. Intelligence in Communication Systems (INTELLCOMM), 2005, vol. 190, pp. 261–271. mla: Lietsch, Stefan, and Odej Kao. “CoLoS - A System for Device Unaware and Position Dependent Communication Based on the Session Initiation Protocol.” Proc. Intelligence in Communication Systems (INTELLCOMM), vol. 190, Springer, 2005, pp. 261–71, doi:10.1007/0-387-32015-6_24. short: 'S. Lietsch, O. Kao, in: Proc. Intelligence in Communication Systems (INTELLCOMM), Springer, Boston, MA, USA, 2005, pp. 261–271.' date_created: 2018-04-17T14:39:41Z date_updated: 2022-01-06T06:56:07Z department: - _id: '27' doi: 10.1007/0-387-32015-6_24 intvolume: ' 190' page: 261-271 place: Boston, MA, USA publication: Proc. Intelligence in Communication Systems (INTELLCOMM) publisher: Springer series_title: ' IFIP — The International Federation for Information Processing (IFIPAICT)' status: public title: CoLoS - A System for Device Unaware and Position Dependent Communication Based on the Session Initiation Protocol type: conference user_id: '24135' volume: 190 year: '2005' ...