Connected Life Courses:Influences on and Experiences of 'Midlife' In-Migration to Rural Areas

This paper aims to contribute to the theorisation of midlife migration into rural areas. Although the factors influencing migration are known to be variable at different stages of a person's life, much less well understood is how migration decisions at different stages of the life course are connected and how post-migration experiences may be influenced by an earlier life course stage. We argue that midlife migration decisions are the product of the migrant's lifetime experiences and influences up until that stage in their life alongside their expectations and aspirations for future life course stages. Using a case study of the Glens of Antrim (Northern Ireland), this paper specifically demonstrates the role of childhood memories to explain midlife migration to a rural area. In doing so, it argues that some findings more commonly associated with second-generation transnational migration are also equally relevant to migration within the UK. Roots migration and place attachment alongside the midlife migrant's post-migration sense of belonging and permanency are found to be influenced by the migrant's earlier memories, behaviours, and experiences.

Instituting order: the limitations of Nasser’s post-colonial planning visions for Cairo in the case of the indigenous quarter of Bulaq (1952–1970)

This paper investigates the limitations of postcolonial planning practices that aimed to modernise Cairo’s urban spaces during Gamal Abdel Nasser rule (1952–70). Following the Free Officers revolution of 1952, ambition to display urban order through forceful change in the city’s built environment was in action. Nasser’s visions of modernity were explicit in a series of attempts to reshape several prime locations in central Cairo, which included the old traditional waterfront quarter, in Bulaq Abul Ela. An analysis of the Bulaq planning scheme drafted in 1966 reveals insights into how notions of order were spatialised to integrate with Cairo’s complex urban fabric. The official plans to regularise Bulaq also strongly demonstrates how this was a top-down, centralised process in terms of governance, with full utilisation of state resources, namely the military and the media. From a wider perspective, planning practices under Nasser demonstrated an evident break with the past to eliminate memories of colonisation and disorder. Drawing on original resources, archival material, meeting minutes and maps of this historical but dilapidated quarter of Cairo, this paper gives an insight into how Nasser’s government attempted to convey a sense of order in a revolutionary country without, however, having an understanding of order as a coherent, multilayered and sequential process of change.

Accelerating Multiple Sequence Alignment with the Cell BE Processor

The Cell Broadband Engine (BE) Architecture is a new heterogeneous multi-core architecture targeted at compute-intensive workloads. The architecture of the Cell BE has several features that are unique in high-performance general-purpose processors, most notably the extensive support for vectorization, scratch pad memories and explicit programming of direct memory accesses (DMAs) and mailbox communication. While these features strongly increase programming complexity, it is generally claimed that significant speedups can be obtained by using Cell BE processors. This paper presents our experiences with using the Cell BE architecture to accelerate Clustal W, a bio-informatics program for multiple sequence alignment. We report on how we apply the unique features of the Cell BE to Clustal W and how important each is in obtaining high performance. By making extensive use of vectorization and by parallelizing the application across all cores, we demonstrate a speedup of 24.4 times when using 16 synergistic processor units on a QS21 Cell Blade compared to single-thread execution on the power processing unit. As the Cell BE exploits a large number of slim cores, our highly optimized implementation is just 3.8 times faster than a 3-thread version running on an Intel Core2 Duo, as the latter processor exploits a small number of fat cores.

XOR-based hash functions

Bank conflicts can severely reduce the bandwidth of an interleaved multibank memory and conflict misses increase the miss rate of a cache or a predictor. Both occurrences are manifestations of the same problem: Objects which should be mapped to different indices are accidentally mapped to the same index. Suitable chosen hash functions can avoid conflicts in each of these situations by mapping the most frequently occurring patterns conflict-free. A particularly interesting class of hash functions are the XOR-based hash functions, which compute each set index bit as the exclusive-or of a subset of the address bits. When implementing an XOR-based hash function, it is extremely important to understand what patterns are mapped conflict-free and how a hash function can be constructed to map the most frequently occurring patterns without conflicts. Hereto, this paper presents two ways to reason about hash functions: by their null space and by their column space. The null space helps to quickly determine whether a pattern is mapped conflict-free. The column space is more useful for other purposes, e. g., to reduce the fan-in of the XOR-gates without introducing conflicts or to evaluate interbank dispersion in skewed-associative caches. Examples illustrate how these ideas can be applied to construct conflict-free hash functions.

On generating set index functions for randomized caches

Caches hide the growing latency of accesses to the main memory from the processor by storing the most recently used data on-chip. To limit the search time through the caches, they are organized in a direct mapped or set-associative way. Such an organization introduces many conflict misses that hamper performance. This paper studies randomizing set index functions, a technique to place the data in the cache in such a way that conflict misses are avoided. The performance of such a randomized cache strongly depends on the randomization function. This paper discusses a methodology to generate randomization functions that perform well over a broad range of benchmarks. The methodology uses profiling information to predict the conflict miss rate of randomization functions. Then, using this information, a search algorithm finds the best randomization function. Due to implementation issues, it is preferable to use a randomization function that is extremely simple and can be evaluated in little time. For these reasons, we use randomization functions where each randomized address bit is computed as the XOR of a subset of the original address bits. These functions are chosen such that they operate on as few address bits as possible and have few inputs to each XOR. This paper shows that to index a 2(m)-set cache, it suffices to randomize m+2 or m+3 address bits and to limit the number of inputs to each XOR to 2 bits to obtain the full potential of randomization. Furthermore, it is shown that the randomization function that we generate for one set of benchmarks also works well for an entirely different set of benchmarks. Using the described methodology, it is possible to reduce the implementation cost of randomization functions with only an insignificant loss in conflict reduction.

Randomized caches for power-efficiency

Embedded processors are used in numerous devices executing dedicated applications. This setting makes it worthwhile to optimize the processor to the application it executes, in order to increase its power-efficiency. This paper proposes to enhance direct mapped data caches with automatically tuned randomized set index functions to achieve that goal. We show how randomization functions can be automatically generated and compare them to traditional set-associative caches in terms of performance and energy consumption. A 16 kB randomized direct mapped cache consumes 22% less energy than a 2-way set-associative cache, while it is less than 3% slower. When the randomization function is made configurable (i.e., it can be adapted to the program), the additional reduction of conflicts outweighs the added complexity of the hardware, provided there is a sufficient amount of conflict misses.

Highly accurate and efficient evaluation of randomising set index functions

Randomising set index functions can reduce the number of conflict misses in data caches by spreading the cache blocks uniformly over all sets. Typically, the randomisation functions compute the exclusive ors of several address bits. Not all randomising set index functions perform equally well, which calls for the evaluation of many set index functions. This paper discusses and improves a technique that tackles this problem by predicting the miss rate incurred by a randomisation function, based on profiling information. A new way of looking at randomisation functions is used, namely the null space of the randomisation function. The members of the null space describe pairs of cache blocks that are mapped to the same set. This paper presents an analytical model of the error made by the technique and uses this to propose several optimisations to the technique. The technique is then applied to generate a conflict-free randomisation function for the SPEC benchmarks. (C) 2003 Elsevier Science B.V. All rights reserved.

Norberg-Schulz’ Elements of Space in Dark City

Alex Proyas' science fiction film Dark City (1998) puts forth questions about the building process of a city. The aliens in the film constantly alter each street, building and room to create the right environment for humans to dwell. The ‘strangers’ believe that they need to study humans in their spaces to understand human nature. They use bits and pieces of people's memories to reconstruct the city.

Christian Norberg-Schulz identifies four elements of space: physical, perceptual, existential and conceptual. Physical space is physical existence as it is. Perceptual space is the temporary space the user perceives. Existential space, for instance, the meaning of the concept of home, is abstract and permanent; it does not change with changing conditions. Finally, conceptual space, in his spatial philosophy, is the space concept of specialists like architects, economists and mathematicians.

This article analyses the future noir environment of Dark City from a spatial perspective. The notion of building is studied as to physical, perceptual, existential and conceptual spaces of Norberg-Schulz through concepts of home, identity, belonging, and alienation with reference to the architecture of the city.

Transformative Aesthetics: Between Remembrance and Reconciliation in Contemporary Northern Irish Theatre

This article explores the ways in which two recent plays by the Tinderbox Theatre Company in Belfast – Jimmy McAleavey's The Sign of the Whale and David Ireland's Everything Between Us – engage with current political debates in Northern Ireland about how to deal with the ‘legacy of the past’. Both plays dramatise the uneasy tension between the demands for remembrance and reconciliation. I suggest that they give rise to a ‘transformative aesthetics’ that proposes an un-remembering of the past to make way for a transformative re-remembering for the future. This process, however, does not imply an easy resolution or transcendence of the antagonisms, debates, and traumatic memories. Instead, it suggests an intense and complicated engagement that sits in vexed opposition to the restorative conception of reconciliation and both a politics and a political context of ameliorative forgetting that dominates the Northern Irish Peace Process.

Physiological correlates of memory recall in infancy:vagal tone, cortisol, and imitation in preterm and full-term infants at 6 months

We examined the role of physiological regulation (heart rate, vagal tone, and salivary cortisol) in short-term memory in preterm and full-term 6-month-old infants. Using a deferred imitation task to evaluate social learning and memory recall, an experimenter modeled three novel behaviors (removing, shaking, and replacing a glove) on a puppet. Infants were tested immediately after being shown the behaviors as well as following a 10-min delay. We found that greater suppression of vagal tone was related to better memory recall in full-term infants tested immediately after the demonstration as well as in preterm infants tested later after a 10-min delay. We also found that preterm infants showed greater coordination of physiology (i.e., tighter coupling of vagal tone, heart rate, and cortisol) at rest and during retrieval than full-term infants. These findings provide new evidence of the important links between changes in autonomic activity and memory recall in infancy. They also raise the intriguing possibility that social learning, imitation behavior, and the formation of new memories are modulated by autonomic activity that is coordinated differently in preterm and full-term infants.

An efficient unbounded lock-free queue for multi-core systems

The use of efficient synchronization mechanisms is crucial for implementing fine grained parallel programs on modern shared cache multi-core architectures. In this paper we study this problem by considering Single-Producer/Single- Consumer (SPSC) coordination using unbounded queues. A novel unbounded SPSC algorithm capable of reducing the row synchronization latency and speeding up Producer-Consumer coordination is presented. The algorithm has been extensively tested on a shared-cache multi-core platform and a sketch proof of correctness is presented. The queues proposed have been used as basic building blocks to implement the FastFlow parallel framework, which has been demonstrated to offer very good performance for fine-grain parallel applications. © 2012 Springer-Verlag.

Accelerating code on multi-cores with FastFlow

FastFlow is a programming framework specifically targeting cache-coherent shared-memory multi-cores. It is implemented as a stack of C++ template libraries built on top of lock-free (and memory fence free) synchronization mechanisms. Its philosophy is to combine programmability with performance. In this paper a new FastFlow programming methodology aimed at supporting parallelization of existing sequential code via offloading onto a dynamically created software accelerator is presented. The new methodology has been validated using a set of simple micro-benchmarks and some real applications. © 2011 Springer-Verlag.

A Comparison of Programming Models for Multiprocessors with Explicitly Managed Memory Hierarchies

On multiprocessors with explicitly managed memory hierarchies (EMM), software has the responsibility of moving data in and out of fast local memories. This task can be complex and error-prone even for expert programmers. Before we can allow compilers to handle the complexity for us, we must identify the abstractions that are general enough to allow us to write applications with reasonable effort, yet speci?c enough to exploit the vast on-chip memory bandwidth of EMM multi-processors. To this end, we compare two programming models against hand-tuned codes on the STI Cell, paying attention to programmability and performance. The ?rst programming model, Sequoia, abstracts the memory hierarchy as private address spaces, each corresponding to a parallel task. The second, Cellgen, is a new framework which provides OpenMP-like semantics and the abstraction of a shared address spaces divided into private and shared data. We compare three applications programmed using these models against their hand-optimized counterparts in terms of abstractions, programming complexity, and performance.

Accessibility and availability of smoking-related associations in smokers

A free association test was used in the present study to examine the availability and accessibility of positive vs negative smoking-related information in the long-term memories of smokers. Participants were asked to generate smoking-related associations across a 4-minute interval. Although smokers generated more positive smoking-associations than non-smokers, both groups produced a greater number of negative than positive associations per se. Of particular interest was the finding that whilst the ratio of positive/negative associations generated was constant across time in non-smokers, this ratio varied in smokers. Specifically, smokers generated proportionately more of their available positive associations and proportionately less of their negative associations in the early time interval. It is suggested that these results not only indicate a greater availability of positive smoking-associations in smokers compared to non-smokers, but also a greater accessibility too. It is proposed that positive smoking associations are more automatically activated than negative associations in smokers, even though they have generally more negative associations available.

Cinematic and Architectonic Space in Tarkovsky's Solaris

Architecture plays an important role in Andrei Tarkovsky’s films in defining the atmosphere of a space and memory of a place. This paper is a study of how the settings in Tarkovsky’s Solaris (1972) are used to provoke and convey feelings to the audience through architectonic space depicting the city, library, home and aspects of the home such as paintings and mirrors. The rooms depicted in Solaris (Fig. 1) are filled with symbolism and detail. They are imbued with a poetic quality rarely seen in cinema. The everyday places of city, library and home in Solaris are given an emotional depth not usually found in these spaces in reality. Solaris is an anomaly among Tarkovsky’s films in that the majority of the narrative takes place in an enclosed built set. Rarely do Tarkovsky spaces exert so much control over the actors’ movements within a meticulously designed and detailed set. This paper analyses how the director uses constructed sets in Solaris to confront our perception of memories, dreams and reality.
The intent of this study is to gain better understanding of the link between architecture and other art forms such as painting and cinema through spatial analysis. This study also relates to our imagination and how we perceive architectonic space portrayed through cinematic images. The architectural theory of Juhani Pallasmaa forms the basis of this paper.