The historical perspective of schools in our democratic society provides a framework of tension between local parent and community control and professional and state control of public school decisions. Today, federal and state requirements demand increased student achievement. One school reform effort enlisted to help meet the challenges is the creation of site-based decision-making councils that involve school administrators, teachers and parents. The state of Utah requires each public school to have a School Community Council that is responsible for the development of plans for school improvement. Limited funds are provided to each School Community Council through the School LAND Trust Program. The funds are to be used to assist in the implementation of the developed plans for the purpose of increased student achievement. Three Utah Middle level SCCs participated in this qualitative strength-based process evaluation. Two of the SCCs were identified as exemplary, and the third SCC was just beginning to function as an SCC. Based on the three questions guiding the evaluation, the evaluation learned that SCCs identified as exemplary were compliant with the law, employed strategies identified in the literature for effective site-based decision-making, and implemented plans that were perceived to impact student achievement. In addition, themes emerged from the strength-based approach to learn what SCC processes influenced an effective balance between the professional expertise and the democratic involvement in decision-making. The emergent themes deal with processes related to membership and elections, sources of confidence, use of data to drive school improvement decision, and communication.

This thesis focuses on the survivable routing problem in WDM mesh networks where the objective is to minimize the total number of wavelengths used for establishing working and protection paths in the WDM networks. The past studies for survivable routing suffers from the scalability problem when the number of nodes/links or connection requests grow in the network. In this thesis, a novel path based shared protection framework namely Inter-Group Shared protection (I-GSP) is proposed where the traffic matrix can be divided into multiple protection groups (PGs) based on specific grouping policy. Optimization is performed on these PGs such that sharing of protection wavelengths is considered not only inside a PG, but between the PGs. Simulation results show that I-GSP based integer linear programming model, namely, ILP-II solves the networks in a reasonable amount of time for which a regular integer linear programming formulation, namely, ILP-I becomes computationally intractable. For most of the cases the gap between the optimal solution and the ILP-II ranges between (2-16)%. The proposed ILP-II model yields a scalable solution for the capacity planning in the survivable optical networks based on the proposed I-GSP protection architecture.

This thesis focuses on the survivable routing problem in WDM mesh networks where the objective is to minimize the total number of wavelengths used for establishing working and protection paths in the WDM networks. The past studies for survivable routing suffers from the scalability problem when the number of nodes/links or connection requests grow in the network. In this thesis, a novel path based shared protection framework namely Inter-Group Shared protection (I-GSP) is proposed where the traffic matrix can be divided into multiple protection groups (PGs) based on specific grouping policy. Optimization is performed on these PGs such that sharing of protection wavelengths is considered not only inside a PG, but between the PGs. Simulation results show that I-GSP based integer linear programming model, namely, ILP-II solves the networks in a reasonable amount of time for which a regular integer linear programming formulation, namely, ILP-I becomes computationally intractable. For most of the cases the gap between the optimal solution and the ILP-II ranges between (2-16)%. The proposed ILP-II model yields a scalable solution for the capacity planning in the survivable optical networks based on the proposed I-GSP protection architecture.

Mit dem Begriff des eLearnings verknüpfen sich viele sehr unterschiedliche Konzepte, die auf Grund ihrer spezifischen Ausprägung häufig Grenzen für ihre Benutzung errichten. Um diese zu überwinden, wurde ein Framework konzipiert und implementiert, welches den Anspruch der Universalität in Hinblick auf Anwendungs- und Inhaltsorganisation sowie Funktionalität erhebt. In der kollaborativen eLearning-Plattform BluES erfuhr das Framework eine Beispielimplementierung. Diese diente gleichzeitig als Grundlage für die Validierung unterschiedlicher Aspekte des Frameworks. Als Ergebnis der Arbeit konnte gezeigt werden, dass maximale Flexibilität der Anwendung durch die Systemarchitektur gewährleistet werden kann. Dadurch werden Restriktionen in der Gestaltung der Anwendungsumgebung vermieden und die Anwender bei der Detailkonzeption ihrer Arbeit flexibel unterstützt.

Οι συστάδες υπολογιστών αποτελούν μία σύγχρονη ευρέως χρησιμοποιούμενη και ιδιαίτερα ανταγωνιστική αρχιτεκτονική για την υλοποίηση υπολογιστικών συστημάτων υψηλών επιδόσεων με χαμηλό κόστος. Παράλληλα, η ευρεία εμπορική διάθεση πολυεπεξεργαστικών συστημάτων μικρής κλίμακας, επιτρέπει τον συνδυασμό τους σε υβριδικά σχήματα συστάδων πολυεπεξεργαστών. Παρά την ευελιξία που παρέχεται στη σχεδίαση τους, η απαίτηση για χρήση κατανεμημένων μοντέλων προγραμματισμού αυξάνει σημαντικά την πολυπλοκότητα της ανάπτυξης εφαρμογών. Μία εναλλακτική προσέγγιση αποτελούν τα συστήματα κοινής ιδεατής μνήμης. Τα συστήματα κοινής ιδεατής μνήμης παρέχουν στις εφαρμογές, που εκτελούνται σε διαφορετικούς κόμβους της συστάδας, πρόσβαση σε έναν διαμοιραζόμενο χώρο διευθύνσεων αποκρύπτοντας την υποκείμενη κατανεμημένη αρχιτεκτονική. Βασικότερο περιορισμό της πλειονότητας των υπαρχόντων υλοποιήσεων αποτελεί η απουσία υποστήριξης πολυνηματισμού. Το χαρακτηριστικό αυτό έχει ως άμεση συνέπεια τη χαμηλή χρησιμοποίηση των σύγχρονων πολυεπεξεργαστικών υπολογιστικών μονάδων, καθώς ούτε η εφαρμογή αλλά ούτε και οι μηχανισμοί που εξασφαλίζουν τη συνέπεια της κοινής μνήμης εκτελούνται παράλληλα. Στα πλαίσια της παρούσας μεταπτυχιακής εργασίας παρουσιάζεται η σχεδίαση και η υλοποίηση μίας πλατφόρμας κοινής ιδεατής μνήμης χρησιμοποιώντας μηχανισμούς υλοποιημένους αποκλειστικά σε λογισμικό. Το προτεινόμενο σύστημα στοχεύει στην αποδοτικότερη χρησιμοποίηση των πόρων των πολυεπεξεργαστικών μονάδων της συστάδας, υποστηρίζοντας την πολυνηματική εκτέλεση της εφαρμογής σε κάθε κόμβο. Τόσο το πρωτόκολλο συνέπειας της κατανεμημένης μνήμης, όσο και το υποσύστημα επικοινωνίας, επανασχεδιάστηκαν ώστε να χρησιμοποιούν πολλαπλά νήματα εκτέλεσης. Επιπλέον παρουσιάζονται και αξιολογούνται εναλλακτικοί ιεραρχικοί αλγόριθμοι συγχρονισμού που επιτρέπουν την αποδοτικότερη χρήση της υβριδικής οργάνωσης των συστάδων. / Software Distributed Shared Memory (SDSM) systems provide an abstraction layer of shared memory semantics on top of a distributed set of computational nodes. The use of small-scale Symmetric Multiprocessor (SMP) nodes has the potential for bridging the performance-cost gap between the low-end SMPs and high-end Distributed Shared Memory (DSM) systems, using a hybrid software and hardware coherency model presented in this thesis. We present the design and discuss the main architectural choices involved in our implementation of a multithreaded SDSM system. Our implementation was developed on top of Pthreads and the TCP/IP network protocol, employing a simple yet efficient design. Finally, we evaluate and analyze the performance of the multithreading SDSM platform, using a wide set of benchmark applications.

We are in the era of multicore machines, where we must exploit thread level parallelism for programs to run better, smarter, faster, and more efficiently. In order to increase instruction level parallelism, processors and compilers perform heavy dataflow analyses between instructions. However, there isn’t much work done in the area of inter-thread dataflow analysis. In order to pave the way and find new ways to conserve resources across a variety of domains (i.e., execution speed, chip die area, power efficiency, and computational throughput), we propose a novel framework, termed Contech, to facilitate the analysis of multithreaded program in terms of its communication and execution patterns. We focus the scope on shared memory programs rather than message passing programs, since it is more difficult to analyze the communication and execution patterns for these programs. Discovering patterns of shared memory programs has the potential to allow general purpose computing machines to turn on or off architectural tricks according to application-specific features. Our design of Contech is modular in nature, so we can glean a large variety of information from an architecturally independent representation of the program under examination.

While sustainability is a common trend in business, the practical challenges companies face when striving towards becoming more sustainable are not thoroughly researched. By applying Porter and Kramer's (2011) theory on Creating Shared Value (CSV) to Swedish SMEs in the fashion industry, the challenges of adopting sustainable practices were identified in the study. Semi-structured interviews were conducted with eight case companies with an ambition to be sustainable. This paper argues that even sustainably-aware companies face complex challenges with activities meant to benefit both society and the company itself. Despite many positive characteristics of SMEs, including more flexibility to adapt to new circumstances and innovative approaches to CSR development (Jenkins, 2009), our research display difficulties with leveraging these characteristics. The study shows that the seven challenges of shared value creation are: investment costs, functionality issues, supplier complexities, supplier control, supplier abilities, managing certifications and cluster control. Moreover, the study has also confirmed Crane et al., (2014) regarding the positioning of CSV as an umbrella construct for loosely related concepts within conscious capitalism.

Mit dem Begriff des eLearnings verknüpfen sich viele sehr unterschiedliche Konzepte, die auf Grund ihrer spezifischen Ausprägung häufig Grenzen für ihre Benutzung errichten. Um diese zu überwinden, wurde ein Framework konzipiert und implementiert, welches den Anspruch der Universalität in Hinblick auf Anwendungs- und Inhaltsorganisation sowie Funktionalität erhebt. In der kollaborativen eLearning-Plattform BluES erfuhr das Framework eine Beispielimplementierung. Diese diente gleichzeitig als Grundlage für die Validierung unterschiedlicher Aspekte des Frameworks. Als Ergebnis der Arbeit konnte gezeigt werden, dass maximale Flexibilität der Anwendung durch die Systemarchitektur gewährleistet werden kann. Dadurch werden Restriktionen in der Gestaltung der Anwendungsumgebung vermieden und die Anwender bei der Detailkonzeption ihrer Arbeit flexibel unterstützt.

The interest and demand of sustainable actions have alongside with societal development increased over time. It has become crucial for companies in today’s society to show responsibility for the footprints they leave behind as a consequence of operating. A possible course of action could be the implementation of Creating Shared Value – CSV, which encompasses undertakings that result in value creation for both the company itself, and the local environment in which the company operates. Even though companies are expected to contribute to societal issues, there are still no blueprints declaring how to satisfy societal needs, and the challenges accompanied with it. CSV aims to tackle the distances between societal and business goals, however, despite CSV’s acknowledgement in academia, the concept is often criticized for being insufficient in practice. This has led to businesses trying to apply a CSV approach while still undertaking Corporate Social Responsibility – CSR related activities. The mixture of these concepts has made it difficult to explore what factors that affect the process of capturing Shared Value opportunities. This research investigates what factors that influence the process of capturing Shared Value in the Swedish insurance industry. The findings derived from this single company case study suggests that depending on what managerial decision-making approach used in a company affects the rate of success in terms of Creating Shared Value. An unclear communication plan, combined with the continuous confusion between the concepts, seems to increase the uncertainness of why and how different decisions are taken, hindering the process of CSV as well as the understanding of how Shared Value is created. A variety of factors were identified, where three main factors were considered to play a key role in, not only the capturing of Shared Value opportunities but the entire implementation process of the concept. Based on these factors, a model was established, showing how these main factors obstructs the realization of Shared Value opportunities.

For decades researchers have studied the duality of hashing and sorting for the implementation of the relational operators, especially for efficient aggregation. Depending on the underlying hardware and software architecture, the specifically implemented algorithms, and the data sets used in the experiments, different authors came to different conclusions about which is the better approach. In this paper we argue that in terms of cache efficiency, the two paradigms are actually the same. We support our claim by showing that the complexity of hashing is the same as the complexity of sorting in the external memory model. Furthermore we make the similarity of the two approaches obvious by designing an algorithmic framework that allows to switch seamlessly between hashing and sorting during execution. The fact that we mix hashing and sorting routines in the same algorithmic framework allows us to leverage the advantages of both approaches and makes their similarity obvious. On a more practical note, we also show how to achieve very low constant factors by tuning both the hashing and the sorting routines to modern hardware. Since we observe a complementary dependency of the constant factors of the two routines to the locality of the input, we exploit our framework to switch to the faster routine where appropriate. The result is a novel relational aggregation algorithm that is cache-efficient---independently and without prior knowledge of input skew and output cardinality---, highly parallelizable on modern multi-core systems, and operating at a speed close to the memory bandwidth, thus outperforming the state-of-the-art by up to 3.7x.