2 resultados para Consensus processes
em CentAUR: Central Archive University of Reading - UK
Resumo:
Aim: To develop a list of prescribing indicators specific for the hospital setting that would facilitate the prospective collection of high severity and/or high frequency prescribing errors, which are also amenable to electronic clinical decision support (CDS). Method: A three-stage consensus technique (electronic Delphi) was carried out with 20 expert pharmacists and physicians across England. Participants were asked to score prescribing errors using a 5-point Likert scale for their likelihood of occurrence and the severity of the most likely outcome. These were combined to produce risk scores, from which median scores were calculated for each indicator across the participants in the study. The degree of consensus between the participants was defined as the proportion that gave a risk score in the same category as the median. Indicators were included if a consensus of 80% or more was achieved. Results: A total of 80 prescribing errors were identified by consensus as being high or extreme risk. The most common drug classes named within the indicators were antibiotics (n=13), antidepressants (n=8), nonsteroidal anti-inflammatory drugs (n=6), and opioid analgesics (n=6).The most frequent error type identified as high or extreme risk were those classified as clinical contraindications (n=29/80). Conclusion: 80 high risk prescribing errors in the hospital setting have been identified by an expert panel. These indicators can serve as the basis for a standardised, validated tool for the collection of data in both paperbased and electronic prescribing processes, as well as to assess the impact of electronic decision support implementation or development.
Resumo:
Future extreme-scale high-performance computing systems will be required to work under frequent component failures. The MPI Forum's User Level Failure Mitigation proposal has introduced an operation, MPI_Comm_shrink, to synchronize the alive processes on the list of failed processes, so that applications can continue to execute even in the presence of failures by adopting algorithm-based fault tolerance techniques. This MPI_Comm_shrink operation requires a fault tolerant failure detection and consensus algorithm. This paper presents and compares two novel failure detection and consensus algorithms. The proposed algorithms are based on Gossip protocols and are inherently fault-tolerant and scalable. The proposed algorithms were implemented and tested using the Extreme-scale Simulator. The results show that in both algorithms the number of Gossip cycles to achieve global consensus scales logarithmically with system size. The second algorithm also shows better scalability in terms of memory and network bandwidth usage and a perfect synchronization in achieving global consensus.