Abstract
A surge of web requests is common phenomena for a web server that handles popular contents. If the server has limited resources (I/O bandwidth, memory, CPU utilization, network bandwidth, etc.), the server may suffer a scalability problem. Optimization on the application side is the only option. This paper compares two techniques dealing on access scalability of a web service that handles popular contents, such as student admission results. This paper explains method how the PHP-FPM worker handle a lookup query between data array stored in a single file and data array split into multiple files. The empirical test results on a web server with 2 GB of RAM and 2 CPU cores show that the lookup process on multiple files can handle more than 63.3% requests, compares to 8.41% requests on a single file. The lookup query of data array split into multiple files outperforms the lookup query of data array stored in a single file.
Sign-in/Register to access full text options 
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.
