Skip to search formSkip to main contentSkip to account menu

Berkeley algorithm

The Berkeley algorithm is a method of clock synchronisation in distributed computing which assumes no machine has an accurate time source. It was… 
Wikipedia (opens in a new tab)

Related topics

Related topics

7 relations
Chang and Roberts algorithmClock synchronizationCristian's algorithmDistributed computing

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
BERKELEY SYNCHRONIZED ALGORITHM BASED FAULT TOLERANT MECHANISM FOR COMPUTATIONAL DATA GRID IN CLOUD ENVIRONMENT
Computational Data Grid provides massive resource sharing and aggregated computing resources in a dynamic manner. Due to the… 
2014
2014
Highly Available Hadoop Name Node Architecture-Using Replicas of Name Node with Time Synchronization among Replicas
Hadoop is a Java software framework that supports data - intensive distributed applications and is developed under open source… 
2007
2007
Determining a Central Controlling Processor with Fault Tolerant Method in Distributed System
Central controlling processor is applied in many scientific fields such as computer network, centralized mutual exclusion… 
2005
2005
Two novel algorithms for electing coordinator in distributed systems basedon bully algorithm
Leader election is an important problem in distributed computing, and it is applied in many scientific fields such as… 
1999
1999
98 PC-417 Development of a Collision Avoidance System
The analysis of a rear-end collision warning/ avoidance (CW/CA) system algorithm will be presented. The system is designed to… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)