Resource allocation

This report discusses the problem of the allocation of resources: how should an organisation (such as MOD) invest bearing in mind the long term delay for the realization of investment strategies, and how might this apply in times of increasing budgetary constraints? After making certain simplifying assumptions, the Study Group constructed a prototype model based on the method of Optimal Control. This allows the decision maker to investigate the impact of particular investment strategies over a period of years, the impact being measured in terms of “quality” or “capability”. Interventions can be designed so that “quality” (Q) is maximized at a particular time, or so that the average quality over a given time interval is maximized. Both of these approaches are explored. This model shows reasonable behaviour when tested over a parameter set. It could be used as part of a systems approach to the defence budget as a whole, but the method itself is scalable to smaller (or larger) resourcing conundrums

Context-Aware Resource Allocation in Cellular Networks

We define and propose a resource allocation architecture for cellular networks. The architecture combines content-aware, time-aware and location-aware resource allocation for next generation broadband wireless systems. The architecture ensures content-aware resource allocation by prioritizing real-time applications users over delay-tolerant applications users when allocating resources. It enables time-aware resource allocation via traffic-dependent pricing that varies during different hours of day (e.g. peak and off-peak traffic hours). Additionally, location-aware resource allocation is integrable in this architecture by including carrier aggregation of various frequency bands. The context-aware resource allocation is an optimal and flexible architecture that can be easily implemented in practical cellular networks. We highlight the advantages of the proposed network architecture with a discussion on the future research directions for context-aware resource allocation architecture. We also provide experimental results to illustrate a general proof of concept for this new architecture.Comment: (c) 2015 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other work

Dynamic resource allocation in a hierarchical multiprocessor system: A preliminary study

An integrated system approach to dynamic resource allocation is proposed. Some of the problems in dynamic resource allocation and the relationship of these problems to system structures are examined. A general dynamic resource allocation scheme is presented. A hierarchial system architecture which dynamically maps between processor structure and programs at multiple levels of instantiations is described. Simulation experiments were conducted to study dynamic resource allocation on the proposed system. Preliminary evaluation based on simple dynamic resource allocation algorithms indicates that with the proposed system approach, the complexity of dynamic resource management could be significantly reduced while achieving reasonable effective dynamic resource allocation

Mining Event Logs to Support Workflow Resource Allocation

Workflow technology is widely used to facilitate the business process in enterprise information systems (EIS), and it has the potential to reduce design time, enhance product quality and decrease product cost. However, significant limitations still exist: as an important task in the context of workflow, many present resource allocation operations are still performed manually, which are time-consuming. This paper presents a data mining approach to address the resource allocation problem (RAP) and improve the productivity of workflow resource management. Specifically, an Apriori-like algorithm is used to find the frequent patterns from the event log, and association rules are generated according to predefined resource allocation constraints. Subsequently, a correlation measure named lift is utilized to annotate the negatively correlated resource allocation rules for resource reservation. Finally, the rules are ranked using the confidence measures as resource allocation rules. Comparative experiments are performed using C4.5, SVM, ID3, Na\"ive Bayes and the presented approach, and the results show that the presented approach is effective in both accuracy and candidate resource recommendations.Comment: T. Liu et al., Mining event logs to support workflow resource allocation, Knowl. Based Syst. (2012), http://dx.doi.org/ 10.1016/j.knosys.2012.05.01

Review of the Resource Allocation Process

Final report of the task force appointed by the TAC Chairman and the CGIAR Executive Secretary who transmitted the document to the CGIAR Chairman for Group consideration. The task force assessed experience with the resource allocation process put in place by the CGIAR in 1987. It suggested a number of changes and guidelines for implementing them.Presented by task force chairman Jim McWilliam at CGIAR International Centers Week, October-November 1990. The review was previously discussed at TAC 51 and TAC 52, and a progress report made at the CGIAR meeting in May 1990

Taxation and the Household

Previous analyses of demand systems and the welfare effects of taxing male and female labour supplies suppress the analysis of household resource allocation by assuming a household utility function. To analyse the implications of assuming this is not the case, we construct a simple but fairly general model of household resource allocation and use the properties of the equilibrium of this model to characterise the effects of tax policy on individual utilities, as determined by the household resource allocation proces

Rethinking Resource Allocation in Science

US funding agencies alone distribute a yearly total of roughly $65B dollars largely through the process of proposal peer review: scientists compete for project funding by submitting grant proposals which are evaluated by selected panels of peer reviewers. Similar funding systems are in place in most advanced democracies. However, in spite of its venerable history, proposal peer review is increasingly struggling to deal with the increasing mismatch between demand and supply of research funding.Comment: This working paper formed the basis of J. Bollen, Who would you share your funding with. Nature 560, 143 (2018