By using the PLATFORM FOR KNOWLEDGE EXCHANGE website of the JA-CHRODIS you agree our use of cookies as described in our cookie policy.

5.1. Practices Assignation

Once a practice is submitted the CHRODIS Platform will authomatically assign it to two reviewers and a referee based on the area of interest chosen by the submitter. Each area of interest has their own pool of reviewers and referees. The systema evaluates the workload of each reviewer and referee before assigning the practice and following a Round-Robin algorithm1 thus ensuring the assessment task is equally shared by all the reviewers in the same area of interest.

The assessment is a blind peer-review process, which involves a team of 3 people (two reviewers and a referee). Reviewers should assess the practice solely on the information provided by the user, both in tab with the description of the practice, as well as in the tab for the assessment. Once the evaluation process is completed by both corresponding reviewers, the referee will check if there are any discrepancies between the assessments and will determine the final score.

During the assessment process, the reviewers may include comments on the final text box regarding any detail of the evaluation needing further clarification. These comments will be only visible to the referee.

The referee may also include closing remarks on a Practice. These comments will be sent to the User together with the final score of their practice.

Once the assessment process is completed, the CHRODIS Platform will notify the result to the user submitting the Practice. This notification will include: the status of the practice ('Accepted' or 'Rejected'), the final global score (also a score for each criteria), the classification of the Practice as 'Best', 'Good' or 'Promising', and the closing remarks of the Referee.

 

BACK                                                                   NEXT

 

 


[1] This algorithm is employed by process and network schedulers in computing to schedule processes fairly. A round-robin scheduler generally employs time-sharing, giving each job a time slot or quantum, and interrupting the job if it is not completed by then. The job is resumed next time a time slot is assigned to that process. If the process terminates or changes its state to waiting during its attributed time quantum, the scheduler selects the first process in the ready queue to execute.