This paper describes the IBM Power8 system in comparison to the Intel Xeon processors, widely used in today’s solutions. The performance is not evaluated only on the whole system level but also on the level of threads, cores and a memory. Different metrics are demonstrated on typical optimized algorithms. The benchmarked Power8 processor provides extremely fast memory providing sustainable bandwidth up to 145 GB/s between main memory and processor, which Intel is unable to compete. Computation power is comparable (Matrix multiplication) or worse (N-body simulation, division, more complex algorithms) in comparison with current Intel Haswell-EP. The IBM Power8 is able to compete Intel processors these days and it will be interesting to observe the future generation of Power9 and its performance in comparison to current and future Intel processors.

In dieser Arbeit werden die Konzepte der Benutzerverwaltung und des Ressourcenschutzes unter z/OS mit RACF erläutert und anhand des Zusammenspiels mit TSO konkretisiert. Außerdem werden die Konzepte von RACF mit denen des UNIX-Ressourcenschutz verglichen. Dazu werden auch die UNIX System Services, die UNIX-konforme Schnittstelle von z/OS, analysiert. Mit Hilfe eines REXX-Scriptes werden, aufbauend auf RACF-Befehlen, komplexere Aufgaben der Benutzerverwaltung implementiert.

Der Vortrag stellt zwei Filesysteme aus der kommerziellen Welt vor die derzeit auf Linux portiert werden: JFS von IBM und XFS von SGI. Es wird ein Ueberblick ueber die beiden Dateissysteme, ihre Eigenschaften und ihre Portiertung gegeben.

Introduction: Nowadays, the data generated by global communication systems is enormously increasing.  There is a need by Telecommunication Industries to monitor and manage this data generation efficiently. Apache Cassandra is a NoSQL database that manages any formatted data and a massive amount of data flow efficiently.  Aim: This project is focused on developing a new random compaction strategy and evaluating this random compaction strategy's performance. In this study, limitations of generic compaction strategies Size Tiered Compaction Strategy and Leveled Compaction Strategy will be investigated. A new random compaction strategy will be developed to address the limitations of the generic Compaction Strategies. Important performance metrics required for the evaluation of the strategy will be studied. Method: In this study, a grey literature review is done to understand the working of Apache Cassandra, different compaction strategies' APIs. A random compaction strategy is developed in two phases of development. A testing environment is created consisting of a 4-node cluster and a simulator. Evaluated the performance by stress-testing the cluster using different workloads. Conclusions: A stable RCS artifact is developed. This artifact also includes the support of generating random threshold from any user-defined distribution. Currently, only Uniform, Geometric, and Poisson distributions are supported. The RCS-Uniform's performance is found to be better than both STCS and  LCS. The RCS-Poisson's performance is found to be not better than both STCS and LCS. The RCS-Geometric's performance is found to be better than STCS.

This master thesis analyses and investigates how to speed up the deployment of a suite of services to a Platform as a Service. The project use IBM’s Cloud Pak for Applications together with Red Hats OpenShift to provide insights on important factors that influences the deployment process. In this thesis, a modification was done on the installer such that the deployment instructions were sent in parallel instead of sequentially. Except for the parallel suggestion, this thesis also investigates different options on how constraints could be applied to the CPU and what the consequences are. At the end of this report, the reader will also see how the deployment times are affected by cluster scaling. An implementation of the parallel deployment showed that the installation time of Cloud Pak for Applications could be decreased. It was also shown that the CPU was not utilized fully and that there exists significant CPU saturation during the deployment. The evaluation of the scaling analysis showed that, in regards of this thesis, it is more beneficial both timewise and cost-wise to scale horizontally rather than vertically.

The implementation of chatbots and service services is becoming more common. The reason for this is that they are constantly available to answer questions, no matter what time it is. To make one chatbot is not just to write questions and specific answers. Communicating with one chatbot should, as much as possible, look like communicating with another human. The purpose of this report is to create a chatbot that will be used at Luleå university of technology and that will answer questions about system science. Furthermore, the goal is to investigate which design principles should be implemented, their possible concretization, when making chatbots, and possibly coming to new principles. The method used to make the chatbot is Design Science Research Methodology (DSRM). DSRM focuses on solving the problem by creating an IT artifact, which in this case is a chatbot. The result of this work is a created chatbot and design principles that were implemented during the development process.

No description available.

No description available.

Although mindfulness interventions with college students have yield positive results, many students are not continuing to engage after the interventions. This may be because very little research has been done to investigate the health behavior beliefs of college students in regard to mindfulness for stress reduction. The purpose of this investigation was to identify the most influential components of the Integrated Behavioral Model (IBM) that potentially assist with predicting college student participation in mindfulness activities for stress reduction. Interviews, informed by the IBM, were conducted with 20 current college students and 5 current mindfulness instructors working with college students. The attitudes and perceived control constructs were most prominent for both samples with less participant reference to perceived norms. The most common engagement barriers for the college students, mentioned by both samples, were the lack of time and demands of school. The college student participants most often focused on the benefits of the practice whereas the instructor participants focused on the discomfort the students experience when engaging in mindfulness. Inconsistencies emerged when comparing the mindfulness definitions from the college student participants. Overall, the college student participants displayed positive health beliefs towards mindfulness for stress reduction. These findings could support future mindfulness research utilizing the IBM to further investigate college student participation in mindfulness activities.

Automated trust negotiation is the process of establishing trust between entities with no prior relationship through the iterative disclosure of digital credentials. One approach to negotiating trust is for the participants to exchange access control policies to inform each other of the requirements for establishing trust. When a policy is received at runtime, a compliance checker determines which credentials satisfy the policy so they can be disclosed. In situations where several sets of credentials satisfy a policy and some of the credentials are sensitive, a compliance checker that generates all the sets is necessary to insure that the negotiation succeeds whenever possible. Compliance checkers designed for trust management do not usually generate all the satisfying sets. In this thesis, we present two practical algorithms for generating all satisfying sets given a compliance checker that generates only one set. The ability to generate all of the combinations provides greater flexibility in how the system or user establishes trust. For example, the least sensitive credential combination could be disclosed first. These ideas have been implemented in TrustBuilder, our prototype system for trust negotiation.