Assessing the Oral Health Needs of Public Housing Residents

Objectives: “Tooth Smart Healthy Start” is a randomized clinical trial which aims to reduce the incidence of early childhood caries (ECC) in Boston public housing residents as part of the NIH funded Northeast Center for Research to Evaluate and Eliminate Dental Disparities. The purpose of this project was to assess public housing stakeholders' perception of the oral health needs of public housing residents and their interest in replicating “Tooth Smart Healthy Start” in other public housing sites across the nation. Methods: The target population was the 180 attendees of the 2010 meeting of the Health Care for Residents of Public Housing National Conference. A ten question survey which assessed conference attendees' beliefs about oral health and its importance to public housing residents was distributed. Data was analyzed using SAS 9.1. Descriptive statistics were calculated for each variable and results were stratified by participants' roles. Results: Thirty percent of conference attendees completed the survey. The participants consisted of residents, agency representatives, and housing authority personnel. When asked to rank health issues facing public housing residents, oral health was rated as most important (42%) or top three (16%) by residents. The agency representatives and housing authority personnel rated oral health among the top three (33% and 58% respectively) and top five (36% and 25% respectively). When participants ranked the three greatest resident health needs out of eight choices, oral health was the most common response. Majority of the participants expressed interest in replicating the “Tooth Smart Healthy Start” program at their sites. Conclusion: All stakeholder groups identified oral health as one of the greatest health needs of residents in public housing. Furthermore, if shown to reduce ECC, there is significant interest in implementing the program amongst key public housing stakeholders across the nation.

An Implementation of Mermera: A Shared Memory System that Mixes Coherence with Non-coherence

Coherent shared memory is a convenient, but inefficient, method of inter-process communication for parallel programs. By contrast, message passing can be less convenient, but more efficient. To get the benefits of both models, several non-coherent memory behaviors have recently been proposed in the literature. We present an implementation of Mermera, a shared memory system that supports both coherent and non-coherent behaviors in a manner that enables programmers to mix multiple behaviors in the same program[HS93]. A programmer can debug a Mermera program using coherent memory, and then improve its performance by selectively reducing the level of coherence in the parts that are critical to performance. Mermera permits a trade-off of coherence for performance. We analyze this trade-off through measurements of our implementation, and by an example that illustrates the style of programming needed to exploit non-coherence. We find that, even on a small network of workstations, the performance advantage of non-coherence is compelling. Raw non-coherent memory operations perform 20-40~times better than non-coherent memory operations. An example application program is shown to run 5-11~times faster when permitted to exploit non-coherence. We conclude by commenting on our use of the Isis Toolkit of multicast protocols in implementing Mermera.

Design and Implementation of Statistical Rate Monotonic Scheduling in KURT Linux

Statistical Rate Monotonic Scheduling (SRMS) is a generalization of the classical RMS results of Liu and Layland [LL73] for periodic tasks with highly variable execution times and statistical QoS requirements. The main tenet of SRMS is that the variability in task resource requirements could be smoothed through aggregation to yield guaranteed QoS. This aggregation is done over time for a given task and across multiple tasks for a given period of time. Similar to RMS, SRMS has two components: a feasibility test and a scheduling algorithm. SRMS feasibility test ensures that it is possible for a given periodic task set to share a given resource without violating any of the statistical QoS constraints imposed on each task in the set. The SRMS scheduling algorithm consists of two parts: a job admission controller and a scheduler. The SRMS scheduler is a simple, preemptive, fixed-priority scheduler. The SRMS job admission controller manages the QoS delivered to the various tasks through admit/reject and priority assignment decisions. In particular, it ensures the important property of task isolation, whereby tasks do not infringe on each other. In this paper we present the design and implementation of SRMS within the KURT Linux Operating System [HSPN98, SPH 98, Sri98]. KURT Linux supports conventional tasks as well as real-time tasks. It provides a mechanism for transitioning from normal Linux scheduling to a mixed scheduling of conventional and real-time tasks, and to a focused mode where only real-time tasks are scheduled. We overview the technical issues that we had to overcome in order to integrate SRMS into KURT Linux and present the API we have developed for scheduling periodic real-time tasks using SRMS.