Response time analysis of COTS-Based multicores considering the contention on the shared memory bus

The current industry trend is towards using Commercially available Off-The-Shelf (COTS) based multicores for developing real time embedded systems, as opposed to the usage of custom-made hardware. In typical implementation of such COTS-based multicores, multiple cores access the main memory via a shared bus. This often leads to contention on this shared channel, which results in an increase of the response time of the tasks. Analyzing this increased response time, considering the contention on the shared bus, is challenging on COTS-based systems mainly because bus arbitration protocols are often undocumented and the exact instants at which the shared bus is accessed by tasks are not explicitly controlled by the operating system scheduler; they are instead a result of cache misses. This paper makes three contributions towards analyzing tasks scheduled on COTS-based multicores. Firstly, we describe a method to model the memory access patterns of a task. Secondly, we apply this model to analyze the worst case response time for a set of tasks. Although the required parameters to obtain the request profile can be obtained by static analysis, we provide an alternative method to experimentally obtain them by using performance monitoring counters (PMCs). We also compare our work against an existing approach and show that our approach outperforms it by providing tighter upper-bound on the number of bus requests generated by a task.

A 12*(1+|R|/(4m))-speed algorithm for scheduling constrained-deadline sporadic real-time tasks on a multiprocessor comprising m processors where a task may request one of |R| sequentially-reusable shared resources

We present a 12*(1+|R|/(4m))-speed algorithm for scheduling constrained-deadline sporadic real-time tasks on a multiprocessor comprising m processors where a task may request one of |R| sequentially-reusable shared resources.

Handling shared resources and precedence constraints in open systems

There is an increasing demand for highly dynamic realtime systems where several independently developed applications with different timing requirements can coexist. This paper proposes a protocol to integrate shared resources and precedence constraints among tasks in such systems assuming no precise information on critical sections and computation times is available. The concept of bandwidth inheritance is combined with a capacity sharing and stealing mechanism to efficiently exchange bandwidth among needed tasks, minimising the cost of blocking.

Shared resources and precedence constraints with capacity sharing and stealing

This paper proposes a new strategy to integrate shared resources and precedence constraints among real-time tasks, assuming no precise information on critical sections and computation times is available. The concept of bandwidth inheritance is combined with a greedy capacity sharing and stealing policy to efficiently exchange bandwidth among tasks, minimising the degree of deviation from the ideal system's behaviour caused by inter-application blocking. The proposed capacity exchange protocol (CXP) focus on exchanging extra capacities as early, and not necessarily as fairly, as possible. This loss of optimality is worth the reduced complexity as the protocol's behaviour nevertheless tends to be fair in the long run and outperforms other solutions in highly dynamic scenarios, as demonstrated by extensive simulations.

A shared-disk parallel cluster file system

Dissertação apresentada para obtenção do Grau de Doutor em Informática Pela Universidade Nova de Lisboa, Faculdade de Ciências e Tecnologia

New evidence of shared dinosaur across upper jurassic proto-North Atlantic: stegosaurus from Portugal

Naturwissenschaften 94,367–374

Proposal for shared services performance management model applied to portugueses public administration

Comunicação apresentada no 8º Congresso Nacional de Administração Pública - Desafios e Soluções, em Carcavelos de 21 a 22 de Novembro de 2011.

Implementation for spatial data of the shared nearest neighbour with metric data structures

Dissertação para obtenção do Grau de Mestre em Engenharia Informática

Business development in Siemens global shared services delivery center Portugal

A Work Project, presented as part of the requirements for the Award of a Masters Degree in Management from the NOVA – School of Business and Economics

Rely-guarantee protocols for safe interference over shared memory

Mutable state can be useful in certain algorithms, to structure programs, or for efficiency purposes. However, when shared mutable state is used in non-local or nonobvious ways, the interactions that can occur via aliases to that shared memory can be a source of program errors. Undisciplined uses of shared state may unsafely interfere with local reasoning as other aliases may interleave their changes to the shared state in unexpected ways. We propose a novel technique, rely-guarantee protocols, that structures the interactions between aliases and ensures that only safe interference is possible. We present a linear type system outfitted with our novel sharing mechanism that enables controlled interference over shared mutable resources. Each alias is assigned separate, local roles encoded in a protocol abstraction that constrains how an alias can legally use that shared state. By following the spirit of rely-guarantee reasoning, our rely-guarantee protocols ensure that only safe interference can occur but still allow many interesting uses of shared state, such as going beyond invariant and monotonic usages. This thesis describes the three core mechanisms that enable our type-based technique to work: 1) we show how a protocol models an alias’s perspective on how the shared state evolves and constrains that alias’s interactions with the shared state; 2) we show how protocols can be used while enforcing the agreed interference contract; and finally, 3) we show how to check that all local protocols to some shared state can be safely composed to ensure globally safe interference over that shared memory. The interference caused by shared state is rooted at how the uses of di↵erent aliases to that state may be interleaved (perhaps even in non-deterministic ways) at run-time. Therefore, our technique is mostly agnostic as to whether this interference was the result of alias interleaving caused by sequential or concurrent semantics. We show implementations of our technique in both settings, and highlight their di↵erences. Because sharing is “first-class” (and not tied to a module), we show a polymorphic procedure that enables abstract compositions of protocols. Thus, protocols can be specialized or extended without requiring specific knowledge of the interference produce by other protocols to that state. We show that protocol composition can ensure safety even when considering abstracted protocols. We show that this core composition mechanism is sound, decidable (without the need for manual intervention), and provide an algorithm implementation.

Shared lives social impact bond feasibility study

Loneliness and isolation among the elderly is an enormous problem in Portugal. Interventions to tackle loneliness worldwide have had limited success, and new approaches are needed. Shared Lives is an adult foster placement service in the UK that shows significant promise in tackling both loneliness, isolation and other societal challenges linked with ageing. This feasibility study suggests that replicating a Shared Lives service in Portugal, using a Social Impact Bond (SIB), is viable and likely to create both social and financial value for all stakeholders involved. This study provides recommendations for how a Shared Lives SIB could be designed and implemented.

Basic components of cortical processing are shared in visual and auditory modality

Magdeburg, Univ., Fak. für Naturwiss., Diss., 2009

Caregiver's interpret infants' early gestures based on shared knowledge about referents

Gestures are the first forms of conventional communication that young children develop in order to intentionally convey a specific message. However, at first, infants rarely communicate successfully with their gestures, prompting caregivers to interpret them. Although the role of caregivers in early communication development has been examined, little is known about how caregivers attribute a specific communicative function to infants' gestures. In this study, we argue that caregivers rely on the knowledge about the referent that is shared with infants in order to interpret what communicative function infants wish to convey with their gestures. We videotaped interactions from six caregiver-infant dyads playing with toys when infants were 8, 10, 12, 14, and 16 months old. We coded infants' gesture production and we determined whether caregivers interpreted those gestures as conveying a clear communicative function or not; we also coded whether infants used objects according to their conventions of use as a measure of shared knowledge about the referent. Results revealed an association between infants' increasing knowledge of object use and maternal interpretations of infants' gestures as conveying a clear communicative function. Our findings emphasize the importance of shared knowledge in shaping infants' emergent communicative skills.

Hispanic population in the USA: the opportunity to create a shared brand

El tema d’aquest treball de recerca ha nascut gràcies a l’experiència viscuda a Carolina del Sud (EEUU) com estudiant i treballador. És un fet que la població hispana als Estats Units és cada cop mes important, el que ha provocat un canvi en la mentalitat de les empreses del lloc. S’han adonat que no és suficient amb seguir l’estratègia de comunicació que tenien anteriorment, i ara han de fer mes cas a un nou públic objectiu. Saber com han de fer-ho es la fita d’aquest treball.

GP38, P28-I and P28-II: candidates for a vaccine against Schistosomiasis

Three antigens protective against Schistosoma mansoni have been extensively characterized. The schistosomulum surface antigen GP38 possesses an immunodominant carbohydrate epitope of which the structure has been defined. Protection can be achieved via the transfer of monoclonal antibodies recognizing the epitope or by immunization with anti-idiotype monoclonal antibodies. The glycan epitope is shared with the intermediate host, Biomphalaria glabrata as well as being present on other molluscs, including the Keyhole Limpet. A group of molecules at 28 kDa were initially characterized in adult worms and shown to protect rats and mice against a challenge infection. One of these molecules, P28-I, was cloned and expressed in E. coli, yeast and vaccinia virus. The recombinant antigen significantly protected rats, hamsters and baboons against a challenge infection. P28-I is a glutathione-S-transferase and the recombinant antigen produced in yeast exhibits the enzyme activity and has been purified to homogeneity by affinity chromatography. A second P28 antigen, P28-II, has also been cloned, fully sequenced and expressed. This recombinant antigen also protects against S. mansoni infection.