Abstract
The working time is an important part in a workflow server. Clients always expect their requests could be responded in time. Calculating the working time according to the working calendar will result in the considerable delays in the requests. The more complex the calendar, the more obvious the delay. In recent years, many enterprise-scale workflows have been developed and many research works have been published. However, a workflow working time server which can support up to ten thousand of concurrent requests is still worth researching. In this paper, we define a working time calendar and design two algorithms for calculating the working time. One of the algorithms uses the method of feasible directions to calculate the next working time. Moreover, the paper proposes an optimizing calculating method for concurrent requests. The test results show that the algorithms are highly effective. The average executing time is 3.595 milliseconds, and the responding time of the concurrent request is independent of the number of request and timed tasks.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
