@misc{RottaTrauePrescheretal., author = {Rotta, Randolf and Traue, Jana and Prescher, Thomas and Nolte, J{\"o}rg}, title = {Interrupt-Driven Cross-Core Invocation Mechanisms on the Intel SCC}, series = {Proceedings of the Many-core Applications Research Community (MARC) Symposium at RWTH Aachen University 2012}, journal = {Proceedings of the Many-core Applications Research Community (MARC) Symposium at RWTH Aachen University 2012}, publisher = {Technische Hochschule}, address = {Aachen}, isbn = {978-3-00-039545-1}, pages = {1 -- 6}, abstract = {On many-core processors, both operating system kernels and bare metal applications need efficient cross-core coordination and communication. Although explicit shared- memory programming and message passing might provide the best performance, they also limit the system's control over scheduling. In contrast, interrupt-driven cross-core invocations provide universal coordination mechanisms that also enable preemptive operations across cores. This paper surveys cross- core invocation mechanisms and their usability with respect to prevalent coordination scenarios. We integrated some of these mechanisms into a bare-metal environment for the Intel SCC pro- cessor and will discuss implementation aspects of the interrupt- driven invocations. In conclusion, such invocation mechanisms provide an expressive platform for future operating systems kernels and bare-metal applications.}, language = {en} } @misc{SieberNolteKarnapke, author = {Sieber, Andr{\´e} and Nolte, J{\"o}rg and Karnapke, Reinhardt}, title = {Using Energy Budgets to Reach Lifetime Goals while Compensating Dynamic Effects}, series = {SENSORCOMM 2015, The Ninth International Conference on Sensor Technologies and Applications, August 23-28, 2015 Venice, Italy}, journal = {SENSORCOMM 2015, The Ninth International Conference on Sensor Technologies and Applications, August 23-28, 2015 Venice, Italy}, publisher = {IARIA}, isbn = {978-1-61208-425-1}, pages = {7 -- 13}, abstract = {Nodes within sensor networks often have tight bound goals for the lifetime while running from a non-renewable energy source. Variations within the hardware or induced by the software complicate the prediction of the energy consumption. Additionally, batteries are vulnerable to temperature and non-linear effects. To reach certain lifetime goals under these influences without sacrificing energy due to pessimistic estimations, online energy management is necessary. In this paper, we present policies to control the behavior of applications and devices using energy budgets. First experiments yield promising results, with nodes reaching their lifetime goals while maintaining a high application quality.}, language = {en} } @misc{SieberNolte, author = {Sieber, Andr{\´e} and Nolte, J{\"o}rg}, title = {Online device-level energy accounting for wireless sensor nodes}, series = {Wireless Sensor Networks, Proceedings of the 10th European conference on Wireless Sensor Networks, Ghent, Belgien, 2013}, journal = {Wireless Sensor Networks, Proceedings of the 10th European conference on Wireless Sensor Networks, Ghent, Belgien, 2013}, publisher = {Springer}, address = {Berlin [u.a]}, isbn = {978-3-642-36672-7}, pages = {149 -- 164}, abstract = {Energy is the crucial factor for the lifetime of wireless sensor networks. Nonlinear battery effects and nonuniform workload distribution can lead to early node failures. This makes it necessary to manage energy consumption. But to manage energy it is essential to know how much energy is spent by the system. Additionally, for a more fine-grained management it is necessary, to know where the energy is spent. This can be a complicated task, since nodes are not identical due to device variations and the consumption can change over time. In this paper we present an online energy accounting approach which focuses on simplicity instead on fine granularity and timing accuracy. We argue that the efficacy of an energy accounting model depends more on the input consumption data than on exact timing, especially when the real consumption varies between nodes and in time. Results show that this approach is capable of correctly accounting the energy that nodes spend in scenarios with deviating environment conditions.}, language = {en} } @misc{SieberNolte, author = {Sieber, Andr{\´e} and Nolte, J{\"o}rg}, title = {Datasheet vs. Real World: A Look on Sensor Node Energy Consumption}, series = {2012 IEEE International Conference on Green Computing and Communications (GreenCom), Besancon, France, 20 - 23 November 2012}, journal = {2012 IEEE International Conference on Green Computing and Communications (GreenCom), Besancon, France, 20 - 23 November 2012}, publisher = {IEEE}, address = {Piscataway, NJ}, isbn = {978-1-4673-5146-1}, pages = {641 -- 643}, abstract = {Energy and run time are mayor concerns in wireless sensor networks. Reliable information about the energy consumption is needed to be able to build a network and tune its application. In this paper we take a look on the energy consumption of the Texas Instruments eZ430-Chronos, an MSP430 based wireless sensor node, and compare it to the manufacturers datasheet. The measurements show how reliable these specifications are and which consequences should be taken.}, language = {en} } @inproceedings{SieberKarnapkeNolte, author = {Sieber, Andr{\´e} and Karnapke, Reinhardt and Nolte, J{\"o}rg}, title = {From Energy Accounting to Energy Management}, series = {13. GI/ITG Fachgespr{\"a}ch Sensornetze, 25. und 26. September 2014 an der Universit{\"a}t Potsdam}, booktitle = {13. GI/ITG Fachgespr{\"a}ch Sensornetze, 25. und 26. September 2014 an der Universit{\"a}t Potsdam}, publisher = {Universit{\"a}t}, address = {Potsdam}, pages = {25 -- 28}, abstract = {Embedded systems, e.g. nodes within sensor networks, often have tight bound goals for lifetime while running from a not renewable energy source. Mostly batteries are used, which are vulnerable to temperature and non-linear effects. Additionally, variations within the hardware or induced by the software make the prediction of the available and consumed energy a complicated task. To reach certain lifetime goals under these influences, online energy management is necessary. For a fine-grained management on the level of individual sub-tasks, it is necessary to know where in the system the energy is consumed. In this work, we extend our online energy accounting approach to enable online energy management. We present ways to control application and device behavior, and, thus, energy using energy budgets. First experiments yield promising results, reaching their lifetime goals while maintaining a high application quality.}, language = {en} } @misc{SieberNolteKarnapke, author = {Sieber, Andr{\´e} and Nolte, J{\"o}rg and Karnapke, Reinhardt}, title = {Compensating Dynamic Effects with Budget-based Energy Management to Reach Lifetime Goals}, series = {Sensors \& Transducers}, volume = {194}, journal = {Sensors \& Transducers}, number = {11}, issn = {2306-8515}, pages = {22 -- 34}, abstract = {Nodes within sensor networks often have tight bound goals for the lifetime while running from a non-renewable energy source. Variations within the hardware or induced by the software complicate the prediction of the energy consumption. Additionally, batteries are vulnerable to temperature and non-linear effects. To reach certain lifetime goals under these influences without sacrificing energy due to pessimistic estimations, online energy management is necessary. At Sensorcomm 2015 we presented policies to control the behavior of applications and devices using energy budgets. This paper is an extended version which adds further details and the evaluation of the proposed dynamic energy management in a real-world scenario.}, language = {en} } @inproceedings{BeyerLohsKarnapkeetal., author = {Beyer, Sandra and Lohs, Stefan and Karnapke, Reinhardt and Nolte, J{\"o}rg}, title = {Self-Stabilizing Aggregation- and Reduction-Structures for Wireless Sensor Networks}, series = {13. GI/ITG Fachgespr{\"a}ch Sensornetze, 25. und 26. September 2014 an der Universit{\"a}t Potsdam}, booktitle = {13. GI/ITG Fachgespr{\"a}ch Sensornetze, 25. und 26. September 2014 an der Universit{\"a}t Potsdam}, publisher = {Universit{\"a}t}, address = {Potsdam}, pages = {13 -- 16}, language = {en} } @misc{NuernbergerRottaDrescheretal., author = {N{\"u}rnberger, Stefan and Rotta, Randolf and Drescher, Gabor and Danner, Daniel and Nolte, J{\"o}rg}, title = {Diamond Rings: Acknowledged Event Propagation in Many-Core Processors}, series = {Euro-Par 2015: Parallel Processing Workshops, Vienna, 2015}, journal = {Euro-Par 2015: Parallel Processing Workshops, Vienna, 2015}, publisher = {Springer International Publishing}, address = {Cham}, isbn = {978-3-319-27308-2}, doi = {10.1007/978-3-319-27308-2_58}, pages = {722 -- 733}, abstract = {Hardware and software consistency protocols rely on global observability of consistency events. Acknowledged broadcast is an obvious choice to propagate these events. This paper presents a generalized ring topology for parallel event propagation with acknowledged delivery. Implementations for various many-core architectures show increased performance over conventional approaches. Therefore, diamond rings are a prime candidate for implementations of distributed memory models.}, language = {en} } @misc{NuernbergerDrescherRottaetal., author = {N{\"u}rnberger, Stefan and Drescher, Gabor and Rotta, Randolf and Nolte, J{\"o}rg and Schr{\"o}der-Preikschat, Wolfgang}, title = {Shared Memory in the Many-Core Age}, series = {Euro-Par 2014: Parallel Processing Workshops, Porto, 2014}, journal = {Euro-Par 2014: Parallel Processing Workshops, Porto, 2014}, publisher = {Springer International Publishing}, address = {Cham}, isbn = {978-3-319-14312-5}, doi = {10.1007/978-3-319-14313-2_30}, pages = {351 -- 362}, abstract = {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 evolution and derives a set of reusable elementary operations for future software DSMs. These elementary operations will help in exploring and evaluating new memory models and consistency protocols.}, language = {en} } @misc{LopacinskiBrzozowskiKraemeretal., author = {Lopacinski, Lukasz and Brzozowski, Marcin and Kraemer, Rolf and Nolte, J{\"o}rg}, title = {100 Gbps Wireless - Challenges to the Data Link Layer}, series = {IEICE Information and Communication Technology Forum, Poznan/Poland, 2014}, journal = {IEICE Information and Communication Technology Forum, Poznan/Poland, 2014}, pages = {6}, language = {en} } @misc{LopacinskiNolteBuechneretal., author = {Lopacinski, Lukasz and Nolte, J{\"o}rg and B{\"u}chner, Steffen and Brzozowski, Marcin and Kraemer, Rolf}, title = {A 100 Gbps data link layer with an adaptive algorithm for forward error correction}, series = {Proceedings of 2015 IEICE ICTF, Manchester/United Kingdom, 2015}, journal = {Proceedings of 2015 IEICE ICTF, Manchester/United Kingdom, 2015}, pages = {6}, language = {en} } @misc{LopacinskiBrzozowskiKraemeretal., author = {Lopacinski, Lukasz and Brzozowski, Marcin and Kraemer, Rolf and B{\"u}chner, Steffen and Nolte, J{\"o}rg}, title = {100 Gbps data link layer - from simulation to FPGA implementation}, series = {Journal of Telecommunications and Information Technology (JTIT)}, journal = {Journal of Telecommunications and Information Technology (JTIT)}, number = {1}, issn = {1509-4553}, pages = {90 -- 100}, language = {en} } @misc{LopacinskiNolteBuechneretal., author = {Lopacinski, Lukasz and Nolte, J{\"o}rg and B{\"u}chner, Steffen and Brzozowski, Marcin and Kraemer, Rolf}, title = {Improved Turbo Product Coding dedicated for 100 Gbps Wireless Terahertz Communication}, series = {27th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC), Valencia/Spain, 2016}, journal = {27th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC), Valencia/Spain, 2016}, publisher = {IEEE}, address = {Piscataway, NJ}, isbn = {978-1-5090-3254-9}, doi = {10.1109/PIMRC.2016.7794685}, pages = {6}, language = {en} } @misc{LopacinskiBuechnerNolteetal., author = {Lopacinski, Lukasz and B{\"u}chner, Steffen and Nolte, J{\"o}rg and Brzozowski, Marcin and Kraemer, Rolf}, title = {Towards 100 Gbps wireless communication: energy efficiency of ARQ, FEC, and RF-frontends}, series = {International Symposium on Wireless Communication Systems (ISWCS), Poznan/Poland, 2016}, journal = {International Symposium on Wireless Communication Systems (ISWCS), Poznan/Poland, 2016}, publisher = {IEEE}, address = {Piscataway, NJ}, isbn = {978-1-5090-2061-4}, doi = {10.1109/ISWCS.2016.7600922}, pages = {320 -- 324}, language = {en} } @misc{LohsSiegemundNolteetal., author = {Lohs, Stefan and Siegemund, Gerry and Nolte, J{\"o}rg and Turau, Volker}, title = {Self-Stabilization - A Mechanism to Make Networked Embedded Systems More Reliable?}, series = {35th Symposium on Reliable Distributed Systems (SRDS), Budapest, Hungary, September 26-29, 2016}, journal = {35th Symposium on Reliable Distributed Systems (SRDS), Budapest, Hungary, September 26-29, 2016}, publisher = {IEEE}, address = {Piscataway, NJ}, isbn = {978-1-5090-3513-7}, doi = {10.1109/SRDS.2016.049}, pages = {317 -- 326}, abstract = {The erratic behavior of wireless channels is still a major hurdle in the implementation of robust applications in wireless networks. In the past it has been argued that self-stabilization is a remedy to provide the needed robustness. This assumption has not been verified to the extent necessary to convince engineers implementing such applications. A major reason is that the time in which a self-stabilizing system returns to a valid state is unpredictable and potentially unbound. Failure rates typically depend on physical phenomena and in self-stabilizing systems each node tries to react to failures in an inherently adaptive fashion by the cyclic observation of its neighbors' states. When the frequency of state changes is too high, the system may never reach a state sufficiently stable for a specific task. In this paper we substantiate the conditions under which self-stabilization leads to fault tolerance in wireless networks and look at the myths about the power of self-stabilization as a particular instance of self-organization. We investigate the influences of the error rate and the neighbor state exchange rate on the stability and the convergence time on topology information acquired in real network experiments.}, language = {en} } @misc{LohsSiegemundNolteetal., author = {Lohs, Stefan and Siegemund, Gerry and Nolte, J{\"o}rg and Turau, Volker}, title = {Influence of Topology-Fluctuations on Self-Stabilizing Algorithms}, series = {International Conference on Distributed Computing in Sensor Systems (DCOSS)}, journal = {International Conference on Distributed Computing in Sensor Systems (DCOSS)}, publisher = {IEEE}, address = {Piscataway, NJ}, isbn = {978-1-5090-1460-6}, pages = {122 -- 124}, abstract = {Self-stabilizing systems have in theory the unique and provable ability, to always return to a valid system state even in the face of failures. These properties are certainly desirable for domains like wireless ad-hoc networks with numerous unpredictable faults. Unfortunately, the time in which the system returns to a valid state is not predictable and potentially unbound. The failure rate typically depends on physical phenomena and in self-stabilizing systems each node tries to react to failures in an inherently adaptive fashion by the cyclic observation of the states of its neighbors. When state changes are either too quick or too slow the system might never reach a state that is sufficiently stable for a specific task. In this paper, we investigate the influences of the error rate on the (stability) convergence time on the basis of topology information acquired in real network experiments. This allows us to asses the asymptotic behavior of relevant self-stabilizing algorithms in typical wireless networks.}, language = {en} } @misc{BuechnerLopacinskiNolteetal., author = {B{\"u}chner, Steffen and Lopacinski, Lukasz and Nolte, J{\"o}rg and Kraemer, Rolf}, title = {100 Gbit/s End-to-End Communication: Designing Scalable Protocols with Soft Real-Time Stream Processing}, series = {2016 IEEE 41st Conference on Local Computer Networks, 7-10 Nov. 2016}, journal = {2016 IEEE 41st Conference on Local Computer Networks, 7-10 Nov. 2016}, publisher = {IEEE}, address = {Piscataway, NJ}, isbn = {978-1-5090-2054-6}, doi = {10.1109/LCN.2016.25}, language = {en} } @misc{RottaNolteNikolovetal., author = {Rotta, Randolf and Nolte, J{\"o}rg and Nikolov, Vladimir and Schubert, Lutz and Bonfert, Stefan and Wesner, Stefan}, title = {MyThOS — Scalable OS Design for Extremely Parallel Applications}, series = {2016 Intl IEEE Conferences on Ubiquitous Intelligence Computing, Advanced and Trusted Computing, Scalable Computing and Communications, Cloud and Big Data Computing, Internet of People, and Smart World Congress, 18-21 July 2016}, journal = {2016 Intl IEEE Conferences on Ubiquitous Intelligence Computing, Advanced and Trusted Computing, Scalable Computing and Communications, Cloud and Big Data Computing, Internet of People, and Smart World Congress, 18-21 July 2016}, publisher = {IEEE}, address = {Piscataway, NJ}, isbn = {978-1-5090-2771-2}, doi = {10.1109/UIC-ATC-ScalCom-CBDCom-IoP-SmartWorld.2016.0179}, pages = {1165 -- 1172}, abstract = {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 particular challenge for highly dynamic applications, for example invasive HPC applications, elastic compute clouds, is the management of short-living application threads, processes. This paper discusses OS architecture choices based on microkernel, multikernel, distributed systems designs, our development experience in the context of the MyThOS project. Initial experiments show a much faster thread creation, activation compared to monolithic systems like Linux while providing a more flexible protection, threading model that is better suited for dynamic scenarios. However, despite significant progress in the overall domain of operating systems, the design space for scalable many-core operating systems is yet to be fully explored.}, language = {en} } @misc{RottaKubanSchoepsetal., author = {Rotta, Randolf and Kuban, Robert and Sch{\"o}ps, Mark Simon and Nolte, J{\"o}rg}, title = {Dealing with Layers of Obfuscation in pseudo-Uniform Memory Architectures}, series = {Euro-Par 2016: Parallel Processing Workshops, Euro-Par 2016 International Workshops, Grenoble, France, August 24-26, 2016}, journal = {Euro-Par 2016: Parallel Processing Workshops, Euro-Par 2016 International Workshops, Grenoble, France, August 24-26, 2016}, publisher = {Springer International Publishing}, address = {Cham}, isbn = {978-3-319-58942-8}, doi = {10.1007/978-3-319-58943-5_55}, pages = {685 -- 696}, abstract = {Pseudo-Uniform Memory Architectures hide the memory's throughput bottlenecks and the network's latency differences in order to provide near-peak average throughput for computations on large datasets. This obviates the need for application-level partitioning and load balancing between NUMA domains but the performance of cross-core communication still depends on the actual placement of the involved variables and cores, which can result in significant variation within applications and between application runs. This paper analyses the pseudo-uniform memory latency on the Intel Xeon Phi Knights Corner processor, derives strategies for the optimised placement of important variables, and discusses the role of localised coordination in pUMA systems. For example, a basic cache line ping-pong benchmark showed a 3x speedup between adjacent cores. Therefore, pUMA systems combined with support for controlled placement of small datasets are an interesting option when processor-wide load balancing is difficult while localised coordination is feasible.}, language = {en} } @misc{LopacinskiBrzozowskiKraemeretal., author = {Lopacinski, Lukasz and Brzozowski, Marcin and Kraemer, Rolf and B{\"u}chner, Steffen and Nolte, J{\"o}rg}, title = {Improving Energy Efficiency using a Link Adaptation Algorithm Dedicated for 100 Gbps Wireless Communication}, series = {AE{\"U} - International Journal of Electronics and Communications}, volume = {81}, journal = {AE{\"U} - International Journal of Electronics and Communications}, issn = {1434-8411}, pages = {67 -- 73}, language = {en} } @inproceedings{LopacinskiBrzozowskiKraemeretal., author = {Lopacinski, Lukasz and Brzozowski, Marcin and Kraemer, Rolf and KrishneGowda, Karthik and B{\"u}chner, Steffen and Nolte, J{\"o}rg}, title = {Towards 100 Gbps Wireless Communication: Investigation of FEC Interleavers for PSSS-15 Spreading}, series = {IEEE EUROCON 2017, 17th International Conference on Smart Technologies, Ohrid, Macedonia, 6-8 July 2017}, booktitle = {IEEE EUROCON 2017, 17th International Conference on Smart Technologies, Ohrid, Macedonia, 6-8 July 2017}, publisher = {IEEE}, address = {Piscataway, NJ}, isbn = {978-1-5090-3843-5}, pages = {619 -- 623}, language = {en} }