Abstract: Various embodiments include methods for data management in a computing device utilizing a plurality of processing units. Embodiment methods may include generating a data transfer heuristic model based on measurements from a plurality of sample data transfers between a plurality of data storage units. The generated data transfer heuristic model may be used to calculate data transfer costs for each of a plurality of tasks. The calculated data transfer costs may be used to schedule execution of the plurality of tasks in an execution order on selected ones of the plurality of processing units. The data transfer heuristic model may be updated based on measurements of data transfers occurring during the executions of the plurality of tasks (e.g., time, power consumption, etc.). Code executing on the processing units may indicate to a runtime when certain data blocks are no longer needed and thus may be evicted and/or pre-fetched for others.

Abstract: Mechanisms are provided for communicating with a patient. The mechanisms generate a patient registry comprising a plurality of patient registry records, each patient registry record being associated with a corresponding patient and comprising personal and medical information about the corresponding patient. The mechanisms collect, for each patient registry record, first data regarding treatment of the corresponding patient and second data regarding communications made with the corresponding patient. The mechanisms determine, based on analysis of the first data and second data associated with each of the patient registry records, a mode of communication that is most likely to result in a successful treatment of patients. The mechanisms initiate a communication with a patient of interest using the determined mode of communication based on the results of the determination.

Abstract: Mechanisms are provided for performing sequential multi-modal communication with patients. The mechanisms generate a patient registry comprising a plurality of patient registry records, each patient registry record being associated with a corresponding patient and comprising personal and medical information about the corresponding patient. The mechanisms collect, for each patient registry record, first data regarding treatment of the corresponding patient and second data regarding communications made with the corresponding patient. The mechanisms determine, based on analysis of the first data and second data associated with each of the patient registry records, a sequence of modes of communication that is most likely to result in a successful treatment of patients. The mechanisms initiate a plurality of communications with a patient of interest using the determined sequence of modes of communication based on the results of the determination.

Abstract: Mechanisms are provided for caching patient information in a variable list and using the variable list to evaluate patient rules. The mechanisms generate a patient registry comprising a plurality of patient registry records, each patient registry record being associated with a corresponding patient and comprising personal and medical information about the corresponding patient. The mechanisms compile at least one variable list for an input variable of one or more clinical rules. The variable list comprises a plurality of instances of personal and medical information from the plurality of sources that are associated with the variable. The mechanisms also process at least one clinical rule in the one or more clinical rules that references the variable as a criteria for evaluating the at least one clinical rule, based on the variable list associated with the variable to determine if the criteria is satisfied by one or more instances.

Abstract: Methods, devices, and non-transitory processor-readable storage media for a computing device to merge concurrent writes from a plurality of processing units to a buffer associated with an application. An embodiment method executed by a processor may include identifying a plurality of concurrent requests to access the buffer that are sparse, disjoint, and write-only, configuring a write-set for each of the plurality of processing units, executing the plurality of concurrent requests to access the buffer using the write-sets, determining whether each of the plurality of concurrent requests to access the buffer is complete, obtaining a buffer index and data via the write-set of each of the plurality of processing units, and writing to the buffer using the received buffer index and data via the write-set of each of the plurality of processing units in response to determining that each of the plurality of concurrent requests to access the buffer is complete.

Abstract: A computing device may be configured to generate and execute a task that includes one or more blocking constructs that each encapsulate a blocking activity and a notification handler corresponding to each blocking activity. The computing device may launch the task, execute one or more of the blocking constructs, register the corresponding notification handler for the blocking activity that will be executed next with the runtime system, perform the blocking activity encapsulated by the blocking construct to request information from an external resource, cause the task to enter a blocked state while it waits for a response from the external resource, receive an unblocking notification from an external entity, and invoke the registered notification handler to cause the task to exit the blocked state and/or perform clean up operations to exit/terminate the task gracefully.

Abstract: Embodiments include computing devices, apparatus, and methods implemented by a computing device for task scheduling in the presence of task conflict edges on a computing device. The computing device may determine whether a first task and a second task are related by a task conflict edge. In response to determining that the first task and the second task are related by the task conflict edge, the computing device may determine whether the second task acquires a resource required for execution of the first task and the second task. In response to determining that the second task fails to acquire the resource, the computing device may assign a dynamic task dependency edge from the first task to the second task.

Abstract: Embodiments include computing devices, apparatus, and methods implemented by a computing device for accelerating execution of a plurality of tasks belonging to a common property task graph. The computing device may identify a first successor task dependent upon a bundled task such that an available synchronization mechanism is a common property for the bundled task and the first successor task, and such that the first successor task only depends upon predecessor tasks for which the available synchronization mechanism is a common property. The computing device may add the first successor task to a common property task graph and add the plurality of tasks belonging to the common property task graph to a ready queue. The computing device may recursively identify successor tasks. The synchronization mechanism may include a synchronization mechanism for control logic flow or a synchronization mechanism for data access.

Abstract: Various embodiments proactively balance workloads between a plurality of processing units of a multi-processor computing device by making work-stealing determinations based on operating state data. An embodiment method includes obtaining static characteristics data associated with each of a victim processor and one or more of a plurality of processing units that are ready to steal work items from the victim processor (work-ready processors), obtaining dynamic characteristics data for each of the processors, calculating priority values for each of the processors based on the obtained data, and transferring a number of work items assigned to the victim processor to a winning work-ready processor based on the calculated priority values. In some embodiments, the method may include acquiring control over a probabilistic lock for a shared data structure and updating the shared data structure to indicate the number of work items transferred to the winning work-ready processor.

Abstract: Various embodiments include methods for data management in a computing device utilizing a plurality of processing units. Embodiment methods may include generating a data transfer heuristic model based on measurements from a plurality of sample data transfers between a plurality of data storage units. The generated data transfer heuristic model may be used to calculate data transfer costs for each of a plurality of tasks. The calculated data transfer costs may be used to schedule execution of the plurality of tasks in an execution order on selected ones of the plurality of processing units. The data transfer heuristic model may be updated based on measurements of data transfers occurring during the executions of the plurality of tasks (e.g., time, power consumption, etc.). Code executing on the processing units may indicate to a runtime when certain data blocks are no longer needed and thus may be evicted and/or pre-fetched for others.

Abstract: A computing device may be configured to generate and execute a task that includes one or more blocking constructs that each encapsulate a blocking activity and a notification handler corresponding to each blocking activity. The computing device may launch the task, execute one or more of the blocking constructs, register the corresponding notification handler for the blocking activity that will be executed next with the runtime system, perform the blocking activity encapsulated by the blocking construct to request information from an external resource, cause the task to enter a blocked state while it waits for a response from the external resource, receive an unblocking notification from an external entity, and invoke the registered notification handler to cause the task to exit the blocked state and/or perform clean up operations to exit/terminate the task gracefully.

Abstract: Present invention relates to an improved process for the preparation of Zopiclone and its enantiomerically enriched isomer (Eszopiclone). 6-(5-Chloropyridin-2-yl)-5-hydroxy-7-oxo-5,6-dihydropyrrolo[3,4-b]pyrazine is reacted with 1-chloro-carbonyl-4-methylpiperazine in the presence of alkali earth metal carbonates, hydroxides or oxides in a solvent medium to give Zopiclone. It is reacted with optically active acid in a mixture of water and water miscible organic solvent followed by work up to give Eszopiclone. The present invention also relates to process for the conversion of (R) or (S) Zopiclone to 6-(5-chloropyrid-2-yl)-5-hydroxy-7-oxo-5,6-dihydro-pyrrolo-[3,4-b]-pyrazine of the intermediate which can be converted to racemic Zopiclone.

Abstract: A novel method for preparing a compound of formula I which comprises of coupling the piperazine derivative of formula II with alkyl halide containing compound of the formula III by heating in solvent free conditions or, optionally, in a minimum quantity of non-aqueous suspending liquid, in presence of a catalyst and a neutralizing agent to neutralize the hydrohalic acid.

Abstract: Present invention relates to an improved process for the preparation of Zopiclone and its enantiomerically enriched isomer (Eszopiclone). 6-(5-Chloropyridin-2-yl)-5-hydroxy-7-oxo-5,6-dihydropyrrolo[3,4-b]pyrazine is reacted with 1-chloro-carbonyl-4-methylpiperazine in the presence of alkali earth metal carbonates, hydroxides or oxides in a solvent medium to give Zopiclone. It is reacted with optically active acid in a mixture of water and water miscible organic solvent followed by work up to give Eszopiclone. The present invention also relates to process for the conversion of (R) or (S) Zopiclone to 6-(5-chloropyrid-2-yl)-5-hydroxy-7-oxo-5,6-dihydro-pyrrolo-[3,4-b]-pyrazine of the intermediate which can be converted to racemic Zopiclone.

Abstract: A process for preparation of 7-[D-?-amino-?-(4-hydroxyphenyl)acetamido]-3-(1-propen-1-yl)-3-cephem-4-carboxylic acid viz. Cefprozil of formula (I) in high purity, substantially free of impurities, which comprises preparation of mixed acid anhydride by selecting the sequence and temperature of addition of the reagents and its subsequent condensation with a protected 7-APCA; followed by hydrolysis, isolation and purification to give Cefprozil of formula (I) in the form of a monohydrate.

Abstract: In a method of dynamically changing a computation performed by an application executing on a digital computer, the application is characterized in terms of slack and workloads of underlying components of the application and of interactions therebetween. The application is enhanced dynamically based on predictive models generated from the characterizing action and on the dynamic availability of computational resources. Strictness of data consistency constraints is adjusted dynamically between threads in the application, thereby providing runtime control mechanisms for dynamically enhancing the application.

Abstract: A process for preparation of 7-[D-?-amino-?-(4-hydroxyphenyl)acetamido]-3-(1-propen-1-yl)-3-cephem-4-carboxylic acid viz. Cefprozil of formula (I) in high purity, substantially free of impurities, which comprises preparation of mixed acid anhydride by selecting the sequence and temperature of addition of the reagents and its subsequent condensation with a protected 7-APCA; followed by hydrolysis, isolation and purification to give Cefprozil of formula (I) in the form of a monohydrate.