Energy-Efficient In-Memory Data Stores on Hybrid Memory Hierarchies

Increasingly large amounts of data are stored in main memory of data center servers. However, DRAM-based memory is an important consumer of energy and is unlikely to scale in the future. Various byte-addressable non-volatile memory (NVM) technologies promise high density and near-zero static energy, however they suffer from increased latency and increased dynamic energy consumption.

This paper proposes to leverage a hybrid memory architecture, consisting of both DRAM and NVM, by novel, application-level data management policies that decide to place data on DRAM vs. NVM. We analyze modern column-oriented and key-value data stores and demonstrate the feasibility of application-level data management. Cycle-accurate simulation confirms that our methodology reduces the energy with least performance degradation as compared to the current state-of-the-art hardware or OS approaches. Moreover, we utilize our techniques to apportion DRAM and NVM memory sizes for these workloads.

Historical Dialogue and Memory in Organisational Transition: the case of the Police in Northern Ireland

During Northern Ireland’s transition towards peace the role of the police as an actor in the conflict has been a key point of contention. As such, the reform of policing has been central to conflict transformation. Within this process, the role of dialogue about what policing had been and could be in the future has been vital. Such institutional post violence change processes have been hugely significant in illustrating both organisational resistance to change and the need for transitions to be powerfully manoeuvred through complex, political, organisational and cultural processes (Buchanan and Badham 1999; Pettigrew 2012). The radical and reforming nature of policing transition (Murphy 2013) has been both organisationally challenging (requiring significant transformational leadership, resourcing and external engagement from wider civic society) and politically unusual. Indeed, in a society emerging from violence the NI police are the only public sector organisation to have engaged structurally and culturally in understanding the point at which their core roles intersected with the ‘management’ of the conflict in NI generally. This paper presents an analysis of the role of historical dialogue in organisational change process, using the RUC / PSNI case. It proposes that historical dialogue is not just an external, societal process but also an internal organisational process and as such, has implications for managing institutional change in societies emerging from conflict. In doing so, it builds theoretical links between literature on conflict transformation and that on organisational memory and empirically explores messaging internal to the RUC before and during the four main periods of organisational change (Murphy 2013), with dialogue aimed at an external audience. It offers an analysis of how historical dialogue itself impacts on and is impacted by the organisational realities of change itself.

Solution Methods for Service Network Design with Resource Management Consideration

La gestion des ressources, équipements, équipes de travail, et autres, devrait être prise en compte lors de la conception de tout plan réalisable pour le problème de conception de réseaux de services. Cependant, les travaux de recherche portant sur la gestion des ressources et la conception de réseaux de services restent limités. La présente thèse a pour objectif de combler cette lacune en faisant l’examen de problèmes de conception de réseaux de services prenant en compte la gestion des ressources. Pour ce faire, cette thèse se décline en trois études portant sur la conception de réseaux. La première étude considère le problème de capacitated multi-commodity fixed cost network design with design-balance constraints(DBCMND). La structure multi-produits avec capacité sur les arcs du DBCMND, de même que ses contraintes design-balance, font qu’il apparaît comme sous-problème dans de nombreux problèmes reliés à la conception de réseaux de services, d’où l’intérêt d’étudier le DBCMND dans le contexte de cette thèse. Nous proposons une nouvelle approche pour résoudre ce problème combinant la recherche tabou, la recomposition de chemin, et une procédure d’intensification de la recherche dans une région particulière de l’espace de solutions. Dans un premier temps la recherche tabou identifie de bonnes solutions réalisables. Ensuite la recomposition de chemin est utilisée pour augmenter le nombre de solutions réalisables. Les solutions trouvées par ces deux méta-heuristiques permettent d’identifier un sous-ensemble d’arcs qui ont de bonnes chances d’avoir un statut ouvert ou fermé dans une solution optimale. Le statut de ces arcs est alors fixé selon la valeur qui prédomine dans les solutions trouvées préalablement. Enfin, nous utilisons la puissance d’un solveur de programmation mixte en nombres entiers pour intensifier la recherche sur le problème restreint par le statut fixé ouvert/fermé de certains arcs. Les tests montrent que cette approche est capable de trouver de bonnes solutions aux problèmes de grandes tailles dans des temps raisonnables. Cette recherche est publiée dans la revue scientifique Journal of heuristics. La deuxième étude introduit la gestion des ressources au niveau de la conception de réseaux de services en prenant en compte explicitement le nombre fini de véhicules utilisés à chaque terminal pour le transport de produits. Une approche de solution faisant appel au slope-scaling, la génération de colonnes et des heuristiques basées sur une formulation en cycles est ainsi proposée. La génération de colonnes résout une relaxation linéaire du problème de conception de réseaux, générant des colonnes qui sont ensuite utilisées par le slope-scaling. Le slope-scaling résout une approximation linéaire du problème de conception de réseaux, d’où l’utilisation d’une heuristique pour convertir les solutions obtenues par le slope-scaling en solutions réalisables pour le problème original. L’algorithme se termine avec une procédure de perturbation qui améliore les solutions réalisables. Les tests montrent que l’algorithme proposé est capable de trouver de bonnes solutions au problème de conception de réseaux de services avec un nombre fixe des ressources à chaque terminal. Les résultats de cette recherche seront publiés dans la revue scientifique Transportation Science. La troisième étude élargie nos considérations sur la gestion des ressources en prenant en compte l’achat ou la location de nouvelles ressources de même que le repositionnement de ressources existantes. Nous faisons les hypothèses suivantes: une unité de ressource est nécessaire pour faire fonctionner un service, chaque ressource doit retourner à son terminal d’origine, il existe un nombre fixe de ressources à chaque terminal, et la longueur du circuit des ressources est limitée. Nous considérons les alternatives suivantes dans la gestion des ressources: 1) repositionnement de ressources entre les terminaux pour tenir compte des changements de la demande, 2) achat et/ou location de nouvelles ressources et leur distribution à différents terminaux, 3) externalisation de certains services. Nous présentons une formulation intégrée combinant les décisions reliées à la gestion des ressources avec les décisions reliées à la conception des réseaux de services. Nous présentons également une méthode de résolution matheuristique combinant le slope-scaling et la génération de colonnes. Nous discutons des performances de cette méthode de résolution, et nous faisons une analyse de l’impact de différentes décisions de gestion des ressources dans le contexte de la conception de réseaux de services. Cette étude sera présentée au XII International Symposium On Locational Decision, en conjonction avec XXI Meeting of EURO Working Group on Locational Analysis, Naples/Capri (Italy), 2014. En résumé, trois études différentes sont considérées dans la présente thèse. La première porte sur une nouvelle méthode de solution pour le "capacitated multi-commodity fixed cost network design with design-balance constraints". Nous y proposons une matheuristique comprenant la recherche tabou, la recomposition de chemin, et l’optimisation exacte. Dans la deuxième étude, nous présentons un nouveau modèle de conception de réseaux de services prenant en compte un nombre fini de ressources à chaque terminal. Nous y proposons une matheuristique avancée basée sur la formulation en cycles comprenant le slope-scaling, la génération de colonnes, des heuristiques et l’optimisation exacte. Enfin, nous étudions l’allocation des ressources dans la conception de réseaux de services en introduisant des formulations qui modèlent le repositionnement, l’acquisition et la location de ressources, et l’externalisation de certains services. À cet égard, un cadre de solution slope-scaling développé à partir d’une formulation en cycles est proposé. Ce dernier comporte la génération de colonnes et une heuristique. Les méthodes proposées dans ces trois études ont montré leur capacité à trouver de bonnes solutions.

Energy Management in Wireless Sensor Networks: A Crosslayer,Channel Adaptive Approach Towards Performance Optimization

The proliferation of wireless sensor networks in a large spectrum of applications had been spurered by the rapid advances in MEMS(micro-electro mechanical systems )based sensor technology coupled with low power,Low cost digital signal processors and radio frequency circuits.A sensor network is composed of thousands of low cost and portable devices bearing large sensing computing and wireless communication capabilities. This large collection of tiny sensors can form a robust data computing and communication distributed system for automated information gathering and distributed sensing.The main attractive feature is that such a sensor network can be deployed in remote areas.Since the sensor node is battery powered,all the sensor nodes should collaborate together to form a fault tolerant network so as toprovide an efficient utilization of precious network resources like wireless channel,memory and battery capacity.The most crucial constraint is the energy consumption which has become the prime challenge for the design of long lived sensor nodes.

Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization

Augmented Lagrangian methods for large-scale optimization usually require efficient algorithms for minimization with box constraints. On the other hand, active-set box-constraint methods employ unconstrained optimization algorithms for minimization inside the faces of the box. Several approaches may be employed for computing internal search directions in the large-scale case. In this paper a minimal-memory quasi-Newton approach with secant preconditioners is proposed, taking into account the structure of Augmented Lagrangians that come from the popular Powell-Hestenes-Rockafellar scheme. A combined algorithm, that uses the quasi-Newton formula or a truncated-Newton procedure, depending on the presence of active constraints in the penalty-Lagrangian function, is also suggested. Numerical experiments using the Cute collection are presented.

Management of SPMD based parallel processing on clusters of workstations

Current attempts to manage parallel applications on Clusters of Workstations (COWs) have either generally followed the parallel execution environment approach or been extensions to existing network operating systems, both of which do not provide complete or satisfactory solutions. The efficient and transparent management of parallelism within the COW environment requires enhanced methods of process instantiation, mapping of parallel process to workstations, maintenance of process relationships, process communication facilities, and process coordination mechanisms. The aim of this research is to synthesise, design, develop and experimentally study a system capable of efficiently and transparently managing SPMD parallelism on a COW. This system should both improve the performance of SPMD based parallel programs and relieve the programmer from the involvement into parallelism management in order to allow them to concentrate on application programming. It is also the aim of this research to show that such a system, to achieve these objectives, is best achieved by adding new special services and exploiting the existing services of a client/server and microkernel based distributed operating system. To achieve these goals the research methods of the experimental computer science should be employed. In order to specify the scope of this project, this work investigated the issues related to parallel processing on COWs and surveyed a number of relevant systems including PVM, NOW and MOSIX. It was shown that although the MOSIX system provide a number of good services related to parallelism management, none of the system forms a complete solution. The problems identified with these systems include: instantiation services that are not suited to parallel processing; duplication of services between the parallelism management environment and the operating system; and poor levels of transparency. A high performance and transparent system capable of managing the execution of SPMD parallel applications was synthesised and the specific services of process instantiation, process mapping and process interaction detailed. The process instantiation service designed here provides the capability to instantiate parallel processes using either creation or duplication methods and also supports multiple and group based instantiation which is specifically design for SPMD parallel processing. The process mapping service provides the combination of process allocation and dynamic load balancing to ensure the load of a COW remains balanced not only at the time a parallel program is initialised but also during the execution of the program. The process interaction service guarantees to maintain transparently process relationships, communications and coordination services between parallel processes regardless of their location within the COW. The combination of these services provides an original architecture and organisation of a system that is capable of fully managing the execution of SPMD parallel applications on a COW. A logical design of a parallelism management system was developed derived from the synthesised system and was shown that it should ideally be based on a distributed operating system employing the client server model. The client/server based distributed operating system provides the level of transparency, modularity and flexibility necessary for a complete parallelism management system. The services identified in the synthesised system have been mapped to a set of server processes including: Process Instantiation Server providing advanced multiple and group based process creation and duplication; Process Mapping Server combining load collection, process allocation and dynamic load balancing services; and Process Interaction Server providing transparent interprocess communication and coordination. A Process Migration Server was also identified as vital to support both the instantiation and mapping servers. The RHODOS client/server and microkernel based distributed operating system was selected to carry out research into the detailed design and to be used for the implementation this parallelism management system. RHODOS was enhanced to provide the required servers and resulted in the development of the REX Manager, Global Scheduler and Process Migration Manager to provide the services of process instantiation, mapping and migration, respectively. The process interaction services were already provided within RHODOS and only required some extensions to the existing Process Manager and IPC Managers. Through a variety of experiments it was shown that when this system was used to support the execution of SPMD parallel applications the overall execution times were improved, especially when multiple and group based instantiation services are employed. The RHODOS PMS was also shown to greatly reduce the programming burden experienced by users when writing SPMD parallel applications by providing a small set of powerful primitives specially designed to support parallel processing. The system was also shown to be applicable and has been used in a variety of other research areas such as Distributed Shared Memory, Parallelising Compilers and assisting the port of PVM to the RHODOS system. The RHODOS Parallelism Management System (PMS) provides a unique and creative solution to the problem of transparently and efficiently controlling the execution of SPMD parallel applications on COWs. Combining advanced services such as multiple and group based process creation and duplication; combined process allocation and dynamic load balancing; and complete COW wide transparency produces a totally new system that addresses many of the problems not addressed in other systems.

Mentoring and the transfer of organizational memory within the context of an aging workforce : cultural implications for competitive advantage

Organizational memory, the knowledge gained from organizational experience, has significant potential for competitive advantage. Many authors in the knowledge management and human resource management literatures consider mentoring to be a particularly effective method of transferring organizational memory. In addition, older workers are often considered ideal mentors in organizations because of their experience and alleged willingness to pass on their knowledge to less experienced employees. There is an associated assumption that these workers also anticipate and experience positive outcomes when mentoring others. This chapter considers whether these assumptions hold up in the workplaces of the 21st century, particularly within Western countries. Individualistic cultural norms and some discriminatory practices towards older workers, along with a changing career contract that no longer guarantees employment in one organization for life, may discourage knowledge sharing in organizations. This chapter discusses the constraints and motivations that may operate when older experienced workers consider mentoring others. It considers relevant global and organizational cultural characteristics that may influence mentoring to transfer knowledge, and accordingly suggests strategies for those eager to capitalise on the knowledge experienced employees possess.

Organisational memory and the propensity to mentor

In many countries, people are retiring earlier than ever before and the retirement of the baby boom generation over the next two decades further intensifies this trend. Accompanying this phenomenon is the potential loss of organisational knowledge and memory and with it, potential loss of the organisation's competitive advantage. Organisations, while recognising that older workers possess valuable organisational memory, seem to assume these same workers will readily divest themselves of their knowledge, if given the opportunity. Furthermore, offering experienced workers the opportunity to act as a mentor to pass on their knowledge is often mentioned in the management and related literature as a way of attracting and retaining these workers. While the relationships between age and the possession of organisational memory has been supported through age's positive relationship with organisational tenure and rank, past research on mentoring reveals a negative relationship between age and willingness to mentor. Employees, especially older workers in the possession of considerable organisational memory may, or may not be willing to divulge that information to others for a number of reasons. Their willingness to act as a mentor may be constrained by awareness of possible costs involved in the mentoring relationship. This paper investigates the relationship between an individual's estimated level of organisational knowledge and memory, and their inclination to mentor others. In doing so, it considers the expected costs and benefits of mentoring. It also investigates the role of mentoring in the psychological adjustment to retirement for older individuals, and discusses the rationale for a research agenda to address these issues and the likely variables of interest. The proposed research aims to go beyond the prescription of "mentoring others" as a general panacea for utilising the skills and experience of workers while ensuring the transfer of potentially threatened knowledge within organisations, by suggesting other motivations that may be operating when employees are invited to share or volunteer their prized knowledge.

Organizational memory and empowerment

Purpose – The aim of this paper is to test a model of the relationship between organizational memory and empowerment. The model posited that organizational memory would be related to requests to share knowledge, psychological empowerment in the workplace (meaning, competence, self-determination and impact), and organization-based self-esteem. Design/methodology/approach – The model was tested with 134 employees representing six companies using hierarchical regression analysis. Findings – Significant relationships were found between organizational memory and requests to share knowledge, empowerment, and organization-based self-esteem. Findings indicated that a positive stereotype may exist towards older workers and the frequency they are requested to share knowledge, and that a halo-type effect may operate, where knowledge of an organization's history is generalized to other knowledge domains. Research limitations/implications – Causal implications cannot be made as this was correlational research. Some of the research measures while achieving acceptable to good reliability were in an early development stage. The study utilized a convenience sample that may limit how the results can be generalized. Practical implications – The paper indicates that organizations can emphasize positive outcomes for those who are knowledge repositories and mentors. It is also important to consider possible “positive stereotypes” which may be operating when organizational members evaluate older workers as knowledge repositories and mentors. Originality/value – The paper addresses the assumptions in the human resources literature concerning the role of older workers as repositories of organizational memory and suitable mentors. The study introduces the “requests to share knowledge scale”.

Reservoir Management For Flood And Drought Protection Using Infinite Horizon Model Predictive Control

Model Predictive Control (MPC) is a control method that solves in real time an optimal control problem over a finite horizon. The finiteness of the horizon is both the reason of MPC's success and its main limitation. In operational water resources management, MPC has been in fact successfully employed for controlling systems with a relatively short memory, such as canals, where the horizon length is not an issue. For reservoirs, which have generally a longer memory, MPC applications are presently limited to short term management only. Short term reservoir management can be effectively used to deal with fast process, such as floods, but it is not capable of looking sufficiently ahead to handle long term issues, such as drought. To overcome this limitation, we propose an Infinite Horizon MPC (IH-MPC) solution that is particularly suitable for reservoir management. We propose to structure the input signal by use of orthogonal basis functions, therefore reducing the optimization argument to a finite number of variables, and making the control problem solvable in a reasonable time. We applied this solution for the management of the Manantali Reservoir. Manantali is a yearly reservoir located in Mali, on the Senegal river, affecting water systems of Mali, Senegal, and Mauritania. The long term horizon offered by IH-MPC is necessary to deal with the strongly seasonal climate of the region.

An aproach for implementing knowledge management in small and medium companies in Brazil: A case study

The search for competitive advantage in a global environment must consider the use of tacit and explicit knowledge circulating inside companies. Differential factors can be easily replicated nowadays. Due to the great volume of knowledge and information, it is necessary to create a system that allows the management of important knowledge. Existing models for Knowledge Management are based on the reality at large companies. In Brazil, most of the companies are smaller ones. This work presents a simplified model to implement Knowledge Management in Small and Medium Companies in Brazil, based on a unique case study with limited scope. Despite some human and financial restrictions, Knowledge Management can help smaller companies, preserving organizational memory and increasing process efficiency. Observing a unique case prevented any generalization of the model. But the recommendations can be references to other companies, because projects like this must address the specific issues of each organization. The objective of this study is to introduce a simplified model for planning Knowledge Management at small companies in Brazil, considering their restrictions and also seeking to create a competitive advantage. Human aspects are very important in Knowledge Management, but that is not the focus of this study. The model was conceived presuming the participation of all people involved.

Determining spatial and temporal scales for management: lessons from whaling

Selection of the appropriate management unit is critical to the conservation of animal populations. Defining such units depends upon knowledge of population structure and upon the timescale being considered. Here, we examine the trajectory of eleven subpopulations of five species of baleen whales to investigate temporal and spatial scales in management. These subpopulations were all extirpated by commercial whaling, and no recovery or repopulation has occurred since. In these cases, time elapsed since commercial extinction ranges from four decades to almost four centuries. We propose that these subpopulations did not recover either because cultural memory of the habitat has been lost, because widespread whaling among adjacent stocks eliminated these as sources for repopulation, and/or because segregation following exploitation produced the abandonment of certain areas. Spatial scales associated with the extirpated subpopulations are frequently smaller than those typically employed in management. Overall, the evidence indicates that: (1) the time frame for management should be at most decadal in scope (i.e., <100 yr) and based on both genetic and nongenetic evidence of population substructure, and (2) at least some stocks should be defined on a smaller spatial scale than they currently are.

Assessing Needs for Computer Pest Management Software in Nebraska Agriculture

A mail survey was conducted to assess current computer hardware use and perceived needs of potential users for software related to crop pest management in Nebraska. Surveys were sent to University of Nebraska-Lincoln agricultural extension agents, agribusiness personnel (including independent crop consultants), and crop producers identified by extension agents as computer users. There were no differences between the groups in several aspects of computer hardware use (percentage computer use, percentage IBM-compatible computer, amount of RAM memory, percentage with hard drive, hard drive size, or monitor graphics capability). Responses were similar among the three groups in several areas that are important to crop pest management (pest identification, pest biology, treatment decision making, control options, and pesticide selection), and a majority of each group expressed the need for additional sources of such information about insects, diseases, and weeds. However, agents mentioned vertebrate pest management information as a need more often than the other two groups. Also, majorities of each group expressed an interest in using computer software, if available, to obtain information in these areas. Appropriate software to address these needs should find an audience among all three groups.

Non-invasive brain stimulation for the management of arterial hypertension

The neural control of the cardiovascular system is a complex process that involves many structures at different levels of nervous system. Several cortical areas are involved in the control of systemic blood pressure, such as the sensorimotor cortex, the medial prefrontal cortex and the insular cortex. Non-invasive brain stimulation techniques - repetitive transcranial magnetic stimulation (rTMS) and transcranial direct current stimulation (tDCS) - induce sustained and prolonged functional changes of the human cerebral cortex. rTMS and tDCS has led to positive results in the treatment of some neurological and psychiatric disorders. Because experiments in animals show that cortical modulation can be an effective method to regulate the cardiovascular system, non-invasive brain stimulation might be a novel tool in the therapeutics of human arterial hypertension. We here review the experimental evidence that non-invasive brain stimulation can influence the autonomic nervous system and discuss the hypothesis that focal modulation of cortical excitability by rTMS or tDCS can influence sympathetic outflow and, eventually, blood pressure, thus providing a novel therapeutic tool for human arterial hypertension. (C) 2009 Published by Elsevier Ltd.

Management and routing algorithms for ad-hoc and sensor networks

Large scale wireless adhoc networks of computers, sensors, PDAs etc. (i.e. nodes) are revolutionizing connectivity and leading to a paradigm shift from centralized systems to highly distributed and dynamic environments. An example of adhoc networks are sensor networks, which are usually composed by small units able to sense and transmit to a sink elementary data which are successively processed by an external machine. Recent improvements in the memory and computational power of sensors, together with the reduction of energy consumptions, are rapidly changing the potential of such systems, moving the attention towards datacentric sensor networks. A plethora of routing and data management algorithms have been proposed for the network path discovery ranging from broadcasting/floodingbased approaches to those using global positioning systems (GPS). We studied WGrid, a novel decentralized infrastructure that organizes wireless devices in an adhoc manner, where each node has one or more virtual coordinates through which both message routing and data management occur without reliance on either flooding/broadcasting operations or GPS. The resulting adhoc network does not suffer from the deadend problem, which happens in geographicbased routing when a node is unable to locate a neighbor closer to the destination than itself. WGrid allow multidimensional data management capability since nodes' virtual coordinates can act as a distributed database without needing neither special implementation or reorganization. Any kind of data (both single and multidimensional) can be distributed, stored and managed. We will show how a location service can be easily implemented so that any search is reduced to a simple query, like for any other data type. WGrid has then been extended by adopting a replication methodology. We called the resulting algorithm WRGrid. Just like WGrid, WRGrid acts as a distributed database without needing neither special implementation nor reorganization and any kind of data can be distributed, stored and managed. We have evaluated the benefits of replication on data management, finding out, from experimental results, that it can halve the average number of hops in the network. The direct consequence of this fact are a significant improvement on energy consumption and a workload balancing among sensors (number of messages routed by each node). Finally, thanks to the replications, whose number can be arbitrarily chosen, the resulting sensor network can face sensors disconnections/connections, due to failures of sensors, without data loss. Another extension to {WGrid} is {W*Grid} which extends it by strongly improving network recovery performance from link and/or device failures that may happen due to crashes or battery exhaustion of devices or to temporary obstacles. W*Grid guarantees, by construction, at least two disjoint paths between each couple of nodes. This implies that the recovery in W*Grid occurs without broadcasting transmissions and guaranteeing robustness while drastically reducing the energy consumption. An extensive number of simulations shows the efficiency, robustness and traffic road of resulting networks under several scenarios of device density and of number of coordinates. Performance analysis have been compared to existent algorithms in order to validate the results.