Brazil is a high middle income country where health inequities persist across two systems of health care financing and delivery. The publicly financed system (SUS) is one of the world’s largest health organizations, which is charged with the constitutional mandate to provide comprehensive health care coverage to over 190 million citizens. National Health Conferences (CNS), the core forum for societal participation in health policy making for the SUS, occur every four years. Yet, managers and councillors struggle to decide on how to allocate resources to meet competing populational health needs and demands, and to comply with the directives of the SUS. The purpose of my research is to describe the three most recent CNS, based on a scoping literature review, to evaluate the ethical account of these decision making processes, and to provide recommendations for improving priority setting for health resource allocation for the SUS according to the ethical analysis.

No description available.

No description available.

The focus of this thesis is on end-to-end (e2e) queueing performance evaluation and resource allocation in order to improve the performance of the relay-enhanced cellular networks. It is crucial to study both the performance of the data link layer and the physical layer issues. Therefore, we first consider end-to-end queueing performance evaluation and after that to consider physical layer issues, we present power allocation schemes, relay load balancing and relay assignment. First, we presented a framework for the link-level end-to-end queueing performance evaluation. Our system model consists of a base station, a relay, and multiple users. The e2e system is modeled as a probabilistic tandem of two finite queues. Using the decomposed model, radio link-level performance measures such as e2e packet loss rate, e2e delay and throughput are obtained analytically and compared with simulation results. A framework for power allocation for downlink transmissions in decode-and-forward relay networks is investigated. We consider a system with a single base station communicating with multiple users assisted by multiple relays. The relays have limited power which must be divided among the users they support in order to maximize the data rate of the whole network. Based on knapsack problem, the optimal power allocation is proposed. To consider fairness, weighted-based scheme is presented. Moreover, to utilize the power wisely, an efficient power reallocation scheme is proposed. Simulation results demonstrate the efficacy of the proposed schemes. By applying the relay selection scheme, it may happen that some relays have more users connected to them than other relays, which results in having unbalanced load among the relays. In order to address this issue, a game theoretic approach is presented. Coalition formation game is proposed based on merge-and-split rule to form the optimal structure. The simulation results demonstrate the effect of applying game in proposed problem. Finally, the relay assignment procedure is studied. The optimal solution is found using Lagrangian Relaxation. Then, a lighter algorithm is proposed to efficiently carry out the relay assignment. Simulation results show that the proposed algorithm can achieve near optimal data rate, while it decreases the processing time significantly.

The increasingly diverse nature of modern applications makes it critical for future systems to have dynamic resource scaling capabilities which enable them to adapt their resource usage to meet user requirements. Such mechanisms should be both fine-grained in nature for resource-efficient operation and also provide a high scaling range to support a variety of applications with diverse needs. To this end, heterogeneous platforms, consisting of components with varying characteristics, have been proposed to provide improved performance/efficiency than homogeneous configurations, by making it possible to execute applications on the most suitable component. However, introduction of such heterogeneous architectural components requires system software to embrace complexity associated with heterogeneity for managing them efficiently. Diversity across vendors and rapidly changing hardware make it difficult to incorporate heterogeneity-aware resource management mechanisms into mainstream systems, affecting the widespread adoption of these platforms. Addressing these issues, this dissertation presents novel abstractions and mechanisms for heterogeneous platforms which decouple heterogeneity from management operations by masking the differences due to heterogeneity from applications. By exporting a homogeneous interface over heterogeneous components, it proposes the scalable 'resource state' abstraction, allowing applications to express their resource requirements which then are dynamically and transparently mapped to heterogeneous resources underneath. The proposed approach is explored for both modern mobile devices where power is a key resource and for cloud computing environments where platform resource usage has monetary implications, resulting in HeteroMates and HeteroVisor solutions. In addition, it also highlights the need for hardware and system software to consider multiple resources together to obtain desirable gains from such scaling mechanisms. The solutions presented in this dissertation open ways for utilizing future heterogeneous platforms to provide on-demand performance, as well as resource-efficient operation, without disrupting the existing software stack.

Infrastructure wireless mesh networks (IWMNs) provide inexpensive deployment, flexible extension of wireless infrastructure, and easy access to the Internet. With multiple radios at each node, a capacity per node improves by transmitting over these radios simultaneously using orthogonal channels. However, without properly addressing the problem of channel assignment and routing for those nodes that form wireless infrastructures, the resulting network throughput and reliability are unlikely to meet the requirements of those highly demanding, media distribution applications. On a particular channel, poor resource allocation at a given access point/gateway of the underlying IWMN can amplify the problem even further. Motivated by these problems, we develop, based on the theory of network coding, a set of alternative solutions that addresses the above issues. We first introduce a sub-optimal solution to the joint problem of network coding, channel assignment and link scheduling for throughput optimization in the multi-channel multi-radio IWMN. We mathematically formulate the problem as a linear program, taking into account opportunistic overhearing, among other constraints. Based on this formulation, we develop a sub-optimal, auction-based algorithm for network throughput optimization. Simulation results reveal the effectiveness of our algorithm in exploiting multiple radios and channels while coping with fairness issues arising from auctions. The proposed solution also shows promising gains over traditional routing solutions. Our experimental results on an 802.11 testbed further confirm these results. The second part of this thesis then presents three AP/gateway-oriented solutions that address the link-level issues related to radio resource allocation at a particular AP/gateway node of the underlying IWMN, which operates on a given channel serving a set of wireless clients. Since the last-hop wireless link is normally a bottleneck of the IWMN, the key idea underlying all the proposed solutions is to use a version of network coding at the bottlenecked AP/gateway. We use Markov chains and the probability theory to derive several performance measures related to media distribution for both uplink and downlink applications. Via extensive simulations, we show the promising delay and reliability gains of the network-coding based schemes over the traditional schemes without network coding.

In Ontario, access to publicly funded home care services is managed by Community Care Access Centres (CCACs). CCAC case managers are responsible for assessing all potential clients and prioritizing the allocation of services. The objectives of this thesis were to: 1) describe the types of decisions made by CCAC organizations and by individual case managers concerning the allocation of nursing, personal support and homemaking services to long-term adult clients with no mental health issues; and 2) to describe and assess the factors and values that influence these decisions. We conducted two case studies in which qualitative data were collected through 39 semi-structured interviews and a review of relevant documents from an urban and a rural area CCAC. A modified thematic analysis was used to identify themes related to the types of priority setting decisions and the associated factors and values. An internet-based survey was then designed based on these results and answered by 177 case managers from 8 of the 14 CCACs. The survey contained discrete choice experiments to examine the relative importance of client attributes and values to prioritization choices related to personal support and homemaking services, as well as questions that examined case managers’ attitudes towards priority setting. We found that both the rural and the urban CCACs utilized similar forms of priority setting and that case managers made the majority of these decisions during their daily interactions with clients. Numerous client, CCAC, and external factors related to the values of safety, independence and client-focused care were considered by case managers during needs assessment and service plan development. The relative importance of the selected client attributes in defining need for personal support and homemaking services was tested and found to be significantly affected by the location of the case manager (rural or urban area), years of experience in home care, and recent experience providing informal care. Case managers allocated services in the spirit of equal service for equal need and in consideration of operational efficiency. We also identified a number of case manager-related, client-related and external factors that interfered with the achievement of horizontal equity.

Workflow is a collection of tasks organized to accomplish some business process. It also defines the order of task invocation or conditions under which task must be invoked, task synchronization, and information flow. Before the execution of the workflow, a correct execution schema, in other words, the schedule of the workflow, must be determined. Workflow scheduling is finding an execution sequence of tasks that obeys the business logic of workflow. Research on specification and scheduling of workflows has concentrated on temporal and causality constraints, which specify existence and order dependencies among tasks. However, another set of constraints that specify resource allocation is also equally important. The resources in a workflow environment are agents such as person, machine, software, etc. that execute the task. Execution of a task has a cost and this may vary depending on the resources allocated in order to execute that task. Resource allocation constraints define restrictions on how to allocate resources, and scheduling under resource allocation constraints provide proper resource allocation to tasks. In this thesis, we present two approaches to specify and schedule workflows under resource allocation constraints as well as temporal and causality constraints. In the first approach, we present an architecture whose core and novel parts are a specifi- cation language with the ability to express resources and resource allocation constraints and a scheduler module that contains a constraint solver in order to find correct resource assignments. In the second approach, we developed a new logical formalism, called Concurrent Constraint Transaction Logic (CCTR) which integrates constraint logic programming (CLP) and Concurrent Transaction Logic, and a logic-based work- flow scheduler that is based on this new formalism. CCTR has the constructs to specify resource allocation constraints as well as workflows and it provides semantics for these specifications so that validity of a schedule can be checked.

A fair and optimal mechanism is required for allocating bandwidth to virtual machine migration in a WAN environment. In this thesis, we propose a dynamic resource allocation algorithm running in either centralized or distributed environments. The centralized version of our algorithm collects information from individual users and dynamically allocates bandwidth according to their demands. The distributed version of our algorithm is running on the internal nodes (e.g. routers) in the network. In the distributed case, we show that even when the routers and the users do not exchange allocation information, the allocation is still stable and optimal if the users are elastic users. Another interesting problem we solved is emergency handling, which is also critical in virtual machine live migration.

Regarding the problems of resource allocation in OFDMA-based wireless communication systems, much of the research effort mainly focuses on finding efficient power control and subcarrier assignment policies. With systems employing multicast transmission, the available schemes in literature are not always applicable. Moreover, the existing approaches are particularly inaccessible in practical systems in which there are a large number of OFDM subcarriers being utilized, as the required computational burden is prohibitively high. The ultimate goal of this research is therefore to propose affordable mechanisms to flexibly and effectively share out the available resources in multicast wireless systems deploying OFDMA technology. Specifically, we study the resource distribution problems in both conventional and cognitive radio network settings, formulating the design problems as mathematical optimization programs, and then offering the solution methods. Suboptimal and optimal schemes with high performance and yet of acceptable complexity are devised through the application of various mathematical optimization tools such as genetic algorithm and Lagrangian dual optimization. The novelties of the proposed approaches are confirmed, and their performances are verified by computer simulation with the presentation of numerical examples to support the findings. / Communications