Real-Time Application Mapping for Many-Cores Using a Limited Migrative Model

Many-core platforms are an emerging technology in the real-time embedded domain. These devices offer various options for power savings, cost reductions and contribute to the overall system flexibility, however, issues such as unpredictability, scalability and analysis pessimism are serious challenges to their integration into the aforementioned area. The focus of this work is on many-core platforms using a limited migrative model (LMM). LMM is an approach based on the fundamental concepts of the multi-kernel paradigm, which is a promising step towards scalable and predictable many-cores. In this work, we formulate the problem of real-time application mapping on a many-core platform using LMM, and propose a three-stage method to solve it. An extended version of the existing analysis is used to assure that derived mappings (i) guarantee the fulfilment of timing constraints posed on worst-case communication delays of individual applications, and (ii) provide an environment to perform load balancing for e.g. energy/thermal management, fault tolerance and/or performance reasons.

Scalable and Efficient Configuration of TimeDivision Multiplexed Resources

Consumer-electronics systems are becoming increasingly complex as the number of integrated applications is growing. Some of these applications have real-time requirements, while other non-real-time applications only require good average performance. For cost-efficient design, contemporary platforms feature an increasing number of cores that share resources, such as memories and interconnects. However, resource sharing causes contention that must be resolved by a resource arbiter, such as Time-Division Multiplexing. A key challenge is to configure this arbiter to satisfy the bandwidth and latency requirements of the real-time applications, while maximizing the slack capacity to improve performance of their non-real-time counterparts. As this configuration problem is NP-hard, a sophisticated automated configuration method is required to avoid negatively impacting design time. The main contributions of this article are: 1) An optimal approach that takes an existing integer linear programming (ILP) model addressing the problem and wraps it in a branch-and-price framework to improve scalability. 2) A faster heuristic algorithm that typically provides near-optimal solutions. 3) An experimental evaluation that quantitatively compares the branch-and-price approach to the previously formulated ILP model and the proposed heuristic. 4) A case study of an HD video and graphics processing system that demonstrates the practical applicability of the approach.

An autonomic approach in swarm-array computing

Can autonomic computing concepts be applied to traditional multi-core systems found in high performance computing environments? In this paper, we propose a novel synergy between parallel computing and swarm robotics to offer a new computing paradigm, `Swarm-Array Computing' that can harness and apply autonomic computing for parallel computing systems. One approach among three proposed approaches in swarm-array computing based on landscapes of intelligent cores, in which the cores of a parallel computing system are abstracted to swarm agents, is investigated. A task gets executed and transferred seamlessly between cores in the proposed approach thereby achieving self-ware properties that characterize autonomic computing. FPGAs are considered as an experimental platform taking into account its application in space robotics. The feasibility of the proposed approach is validated on the SeSAm multi-agent simulator.

PDM 2006: Proceedings of the International Workshop on Data Mining

Recently major processor manufacturers have announced a dramatic shift in their paradigm to increase computing power over the coming years. Instead of focusing on faster clock speeds and more powerful single core CPUs, the trend clearly goes towards multi core systems. This will also result in a paradigm shift for the development of algorithms for computationally expensive tasks, such as data mining applications. Obviously, work on parallel algorithms is not new per se but concentrated efforts in the many application domains are still missing. Multi-core systems, but also clusters of workstations and even large-scale distributed computing infrastructures provide new opportunities and pose new challenges for the design of parallel and distributed algorithms. Since data mining and machine learning systems rely on high performance computing systems, research on the corresponding algorithms must be on the forefront of parallel algorithm research in order to keep pushing data mining and machine learning applications to be more powerful and, especially for the former, interactive. To bring together researchers and practitioners working in this exciting field, a workshop on parallel data mining was organized as part of PKDD/ECML 2006 (Berlin, Germany). The six contributions selected for the program describe various aspects of data mining and machine learning approaches featuring low to high degrees of parallelism: The first contribution focuses the classic problem of distributed association rule mining and focuses on communication efficiency to improve the state of the art. After this a parallelization technique for speeding up decision tree construction by means of thread-level parallelism for shared memory systems is presented. The next paper discusses the design of a parallel approach for dis- tributed memory systems of the frequent subgraphs mining problem. This approach is based on a hierarchical communication topology to solve issues related to multi-domain computational envi- ronments. The forth paper describes the combined use and the customization of software packages to facilitate a top down parallelism in the tuning of Support Vector Machines (SVM) and the next contribution presents an interesting idea concerning parallel training of Conditional Random Fields (CRFs) and motivates their use in labeling sequential data. The last contribution finally focuses on very efficient feature selection. It describes a parallel algorithm for feature selection from random subsets. Selecting the papers included in this volume would not have been possible without the help of an international Program Committee that has provided detailed reviews for each paper. We would like to also thank Matthew Otey who helped with publicity for the workshop.

Distributed parallelization of greedy Mobile Network Optimization algorithms

The Mobile Network Optimization (MNO) technologies have advanced at a tremendous pace in recent years. And the Dynamic Network Optimization (DNO) concept emerged years ago, aimed to continuously optimize the network in response to variations in network traffic and conditions. Yet, DNO development is still at its infancy, mainly hindered by a significant bottleneck of the lengthy optimization runtime. This paper identifies parallelism in greedy MNO algorithms and presents an advanced distributed parallel solution. The solution is designed, implemented and applied to real-life projects whose results yield a significant, highly scalable and nearly linear speedup up to 6.9 and 14.5 on distributed 8-core and 16-core systems respectively. Meanwhile, optimization outputs exhibit self-consistency and high precision compared to their sequential counterpart. This is a milestone in realizing the DNO. Further, the techniques may be applied to similar greedy optimization algorithm based applications.

Influence of Post and Resin Cement on Stress Distribution of Maxillary Central Incisors Restored with Direct Resin Composite

The current study evaluated the influence of two endodontic post systems and the elastic modulus and film thickness of resin cement on stress distribution in a maxillary central incisor (MCI) restored with direct resin composite using finite element analysis (FEA). A three-dimensional model of an MCI with a coronary fracture and supporting structures was performed. A static chewing pressure of 2.16 N/mm(2) was applied to two areas on the palatal surface of the composite restoration. Zirconia ceramic (ZC) and glass fiber (GF) posts were considered. The stress distribution was analyzed in the post, dentin and cement layer when ZC and GF posts were fixed to the root canals using resin cements of different elastic moduli (7.0 and 18.6 GPa) and different layer thicknesses (70 and 200 mu m). The different post materials presented a significant influence on stress distribution with lesser stress concentration when using the GF post. The higher elastic modulus cement created higher stress levels within itself. The cement thicknesses did not present significant changes.

Customized fiber glass posts. Fatigue and fracture resistance

Purpose: To evaluate the root fracture strength of human single-rooted premolars restored with customized fiberglass post-core systems after fatigue simulation. Methods: 40 human premolars had their crowns cut and the root length was standardized to 13 mm. The teeth were endodontically treated and embedded in acrylic resin. The specimens were distributed into four groups (n=10) according to the restorative material used: prefabricated fiber post (PFP), PFP+accessory fiber posts (PFPa), PFP+unidirectional fiberglass (PFPf), and unidirectional fiberglass customized post (CP). All posts were luted using resin cement and the cores were built up with a resin composite. The samples were stored for 24 hours at 37 degrees C and 100% relative humidity and then submitted to mechanical cycling. The specimens were then compressive-loaded in a universal testing machine at a crosshead speed of 0.5 mm/minute until fracture. The failure patterns were analyzed and classified. Data was submitted to one-way ANOVA and Tukey's test (alpha= 0.05). Results: The mean values of maximum load (N) were: PFP - 811.4 +/- 124.3; PFPa - 729.2 +/- 157.2; PFPf - 747.5 +/- 204.7; CP - 762.4 +/- 110. Statistical differences were not observed among the groups. All groups showed favorable restorable failures. Fiberglass customized post did not show improved fracture resistance or differences in failure patterns when compared to prefabricated glass fiber posts. (Am J Dent 2012;25:35-38).

Virtual states of light non-Borromean halo nuclei

It is shown that three-body non-Borromean halo nuclei like 12Be, 18C, 20C, considered as neutron-neutron-core systems, have p-wave virtual states with energy of about 1.7 times the corresponding neutron-core binding energy. We use a renormalizable model that guarantees the general validity of our results in the context of short range interactions.

Aesthetic posts and cores for metal-free restoration of endodontically treated teeth.

Utilization of contemporary post and core systems has facilitated the aesthetic restoration of endodontically treated teeth. Light transmission and biocompatibility have been enhanced by the introduction of metal-free post systems. The periodontal and endodontic status, root length, and histological structure of the devitalized teeth must be considered in order to achieve successful restoration following endodontic treatment. This article presents various restorative criteria for the aesthetic placement and buildup of post and core materials, as well as the preservation of maximum coronal and root structure.

The state of the nations:current and future developments in technology enhanced learning

Right across Europe technology is playing a vital part in enhancing learning for an increasingly diverse population of learners. Learning is increasingly flexible, social and mobile and supported by high quality multi-media resources. Institutional VLEs are seeing a shift towards open source products and these core systems are supplemented by a range of social and collaborative learning tools based on web 2.0 technologies. Learners undertaking field studies and those in the workplace are coming to expect that these off-campus experiences will also be technology-rich whether supported by institutional or user-owned devices. As well as keeping European businesses competitive, learning is seen as a means of increasing social mobility and supporting an agenda of social justice. For a number of years the EUNIS E-Learning Task Force (ELTF) has conducted snapshot surveys of e-learning across member institutions, collected case studies of good practice in e-learning see (Hayes, et al., 2009) in references, supported a group looking at the future of e-learning, and showcased the best of innovation in its e-learning Award. Now for the first time the ELTF membership has come together to undertake an analysis of developments in the member states and to assess what this might mean for the future. The group applied the techniques of World Café conversation and Scenario Thinking to develop its thoughts. The analysis is unashamedly qualitative and draws on expertise from leading universities across eight of the EUNIS member states. What emerges is interesting in terms of the common trends in developments in all of the nations and similarities in hopes and concerns about the future development of learning.

Distributed parallelization of greedy Mobile Network Optimization algorithms

The Mobile Network Optimization (MNO) technologies have advanced at a tremendous pace in recent years. And the Dynamic Network Optimization (DNO) concept emerged years ago, aimed to continuously optimize the network in response to variations in network traffic and conditions. Yet, DNO development is still at its infancy, mainly hindered by a significant bottleneck of the lengthy optimization runtime. This paper identifies parallelism in greedy MNO algorithms and presents an advanced distributed parallel solution. The solution is designed, implemented and applied to real-life projects whose results yield a significant, highly scalable and nearly linear speedup up to 6.9 and 14.5 on distributed 8-core and 16-core systems respectively. Meanwhile, optimization outputs exhibit self-consistency and high precision compared to their sequential counterpart. This is a milestone in realizing the DNO. Further, the techniques may be applied to similar greedy optimization algorithm based applications.

Dynamic Workload Parallelization and System Calibration on Single-Chip Cloud Computer

Many-core systems are emerging from the need of more computational power and power efficiency. However there are many issues which still revolve around the many-core systems. These systems need specialized software before they can be fully utilized and the hardware itself may differ from the conventional computational systems. To gain efficiency from many-core system, programs need to be parallelized. In many-core systems the cores are small and less powerful than cores used in traditional computing, so running a conventional program is not an efficient option. Also in Network-on-Chip based processors the network might get congested and the cores might work at different speeds. In this thesis is, a dynamic load balancing method is proposed and tested on Intel 48-core Single-Chip Cloud Computer by parallelizing a fault simulator. The maximum speedup is difficult to obtain due to severe bottlenecks in the system. In order to exploit all the available parallelism of the Single-Chip Cloud Computer, a runtime approach capable of dynamically balancing the load during the fault simulation process is used. The proposed dynamic fault simulation approach on the Single-Chip Cloud Computer shows up to 45X speedup compared to a serial fault simulation approach. Many-core systems can draw enormous amounts of power, and if this power is not controlled properly, the system might get damaged. One way to manage power is to set power budget for the system. But if this power is drawn by just few cores of the many, these few cores get extremely hot and might get damaged. Due to increase in power density multiple thermal sensors are deployed on the chip area to provide realtime temperature feedback for thermal management techniques. Thermal sensor accuracy is extremely prone to intra-die process variation and aging phenomena. These factors lead to a situation where thermal sensor values drift from the nominal values. This necessitates efficient calibration techniques to be applied before the sensor values are used. In addition, in modern many-core systems cores have support for dynamic voltage and frequency scaling. Thermal sensors located on cores are sensitive to the core's current voltage level, meaning that dedicated calibration is needed for each voltage level. In this thesis a general-purpose software-based auto-calibration approach is also proposed for thermal sensors to calibrate thermal sensors on different range of voltages.

Design science research and the core of information systems

Design Science Research (DSR) has emerged as an important approach in Information Systems (IS) research, evidenced by the plethora of recent related articles in recognized IS outlets. Nonetheless, discussion continues on the value of DSR for IS and how to conduct strong DSR, with further discussion necessary to better position DSR as a mature and stable research paradigm appropriate for IS. This paper contributes to address this need, by providing a comprehensive conceptual and argumentative positioning of DSR relative to the core of IS. This paper seeks to argue the relevance of DSR as a paradigm that addresses the core of IS discipline well. Here we use the framework defined by Wand and Weber, to position what the core of IS is.

Diruthenium(III) compounds, Ru2O(O2CAr)2(MeCN)4(PPh3)2(ClO4)2.cntdot.H2O and Ru2O(O2CAr)4(PPh3)2, with an (Ru2(.mu.-O)(.mu.-O2CAr)22+) core as model systems for the diiron centers in hemerythrin

Diruthenium(II1) compounds, Ru20(02CAr)2(MeCN)4(PPh3)2(C104)(z1~) Hazn0d R U ~ O ( O ~ C A ~ ) ~(2() P(PA~r ~= )P~h,C6H4-p-OMe), were prepared by reacting R U ~ C I ( O ~ CaAnd~ P)P~h 3 in MeCN and characterized by analytical and spectral data. The molecular structures of 1 with Ar = Ph and of 2 with Ar = C&p-OMe were determined by X-ray crystallography. Crystal data for Ru~~(~~CP~)~(M~CN),(PP~(~la)):~ m(oCnIoc~lin,ic), n~/~cH, ~a O= 27.722 (3) A, b = 10.793 (2) A, c = 23.445 ( 2 )A , fi = 124.18 (l)', V = 5803 A3, and 2 = 4. Cr stal data for Ru~O(O~CC~H~-~-O(M2b~): )o~rth(orPhoPm~bi~c, )Pn~n a, a = 22.767 (5) A, b = 22.084 (7) A, c = 12.904 (3) 1, V = 6488 AS; and 2 = 4. Both 1 and 2 have an (Ruz0(02CAr)z2t1 core that is analogous to the diiron core present in the oxidized form of the nonheme respiratory protein hemerythrin. The Ru-Ru distances of 3.237 (1) and 3.199 ( I ) A observed in 1 and 2, respectively, are similar to the M-M distances known in other model systems. The essentially diamagnetic nature of 1 and 2 is due to the presence of two strongly interacting t22 Ru"' centers. The intense colors of 1 (blue) and 2 (purple) are due to the charge-transfer transition involving an ( R ~ ~ ( f i - 0m)o~ie~ty.) The presence of labile MeCN and carboxylato ancillary ligands in I and 2, respectively, makes these systems reactive toward amine and heterocyclic bases.

Covalent attachment of two important dicopper(II) systems in a one-dimensional polymeric chain: An x-ray structure of [Cu2(en)2(OH)2·Cu2(O2CMe)4](PF6)2·0.5EtOH]α showing the shortest Cucdots, three dots, centeredCu Distance in the tetraacetato core

Reaction of Cu2(O2CMe)4(H2O)2 with 1,2-diaminoethane(en) in ethanol, followed by the addition of NH4PF6, led to the formation of a covalently linked 1D polymeric copper(II) title complex showing alternating [Cu2(en)2(OH)22+] and [Cu2(O2CMe)4] units in the chain and the shortest Cucdots, three dots, centeredCu separation of 2.558(2) Å in the tetraacetato core.