868 resultados para Projects and Programs Management


Relevância:

100.00% 100.00%

Publicador:

Resumo:

A simula????o visa preparar gerentes e assessores para organizarem informa????es e diagn??sticos para tomada de decis??o. Apresenta diversos pontos de vista sobre um programa em andamento e estimula debates entre gestores e atores das ??reas envolvidas. A partir da aprecia????o dos pontos de vista desses atores, os participantes dever??o se preparar, em curto espa??o de tempo, para uma reuni??o com o dirigente rec??m-empossado respons??vel pelo programa em quest??o

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Presenta la organización y resumen de los debates de la reunión que tuvo como objetivo discutir los resultados de los estudios de casos sobre oferta y demanda de capacitación en materia de gestión de proyectos y sistemas de recursos hídricos en algunos países de la región.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

This is a survey of the procurement, organization and use of unpublished projects, theses, and Africana mateials in Hezekiah Oluwasanmi Library, Obafemi Awolowo University, Ile-Ife, Nigeria. The Africana section conserves knowledge, preserves cultural heritage, provides information, and supports education and research. This paper the location, mode of processing, circulation, and terms of availability of these materials. Recommendations are made on how to manage Africana materials in academic libraries where they constitute a vital component of collections.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

The interactions among three important issues involved in the implementation of logic programs in parallel (goal scheduling, precedence, and memory management) are discussed. A simplified, parallel memory management model and an efficient, load-balancing goal scheduling strategy are presented. It is shown how, for systems which support "don't know" non-determinism, special care has to be taken during goal scheduling if the space recovery characteristics of sequential systems are to be preserved. A solution based on selecting only "newer" goals for execution is described, and an algorithm is proposed for efficiently maintaining and determining precedence relationships and variable ages across parallel goals. It is argued that the proposed schemes and algorithms make it possible to extend the storage performance of sequential systems to parallel execution without the considerable overhead previously associated with it. The results are applicable to a wide class of parallel and coroutining systems, and they represent an efficient alternative to "all heap" or "spaghetti stack" allocation models.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

In this paper, we examine the issue of memory management in the parallel execution of logic programs. We concentrate on non-deterministic and-parallel schemes which we believe present a relatively general set of problems to be solved, including most of those encountered in the memory management of or-parallel systems. We present a distributed stack memory management model which allows flexible scheduling of goals. Previously proposed models (based on the "Marker model") are lacking in that they impose restrictions on the selection of goals to be executed or they may require consume a large amount of virtual memory. This paper first presents results which imply that the above mentioned shortcomings can have significant performance impacts. An extension of the Marker Model is then proposed which allows flexible scheduling of goals while keeping (virtual) memory consumption down. Measurements are presented which show the advantage of this solution. Methods for handling forward and backward execution, cut and roll back are discussed in the context of the proposed scheme. In addition, the paper shows how the same mechanism for flexible scheduling can be applied to allow the efficient handling of the very general form of suspension that can occur in systems which combine several types of and-parallelism and more sophisticated methods of executing logic programs. We believe that the results are applicable to many and- and or-parallel systems.