Abstract: Some implementations may include one or more servers to host multiple game instances of game modules. The one or more servers may determine whether a difference between a total rendering time to render output data for the multiple game instances and a rendering capacity of the one or more processors is less than a predetermined rendering threshold. In response to determining that the difference between the total rendering time and the rendering capacity of the one or more processors is less than the predetermined rendering threshold, the one or more servers may adjust a rendering complexity associated with one or more of the plurality of game instances.

Abstract: Some implementations may include one or more servers to host multiple game instances of game modules. The one or more servers may determine whether a difference between a total rendering time to render output data for the multiple game instances and a rendering capacity of the one or more processors is less than a predetermined rendering threshold. In response to determining that the difference between the total rendering time and the rendering capacity of the one or more processors is less than the predetermined rendering threshold, the one or more servers may adjust a rendering complexity associated with one or more of the plurality of game instances.

Abstract: File availability in distributed file storage systems is improved by initially placing replicas of a file or other object on different ones of multiple devices using a first process. Subsequently, the placement of the replicas is improved by evaluating whether any replicas of a first file can be swapped with any replicas of a second file without a reduction in the combined file availability of the first and second files, and swapping a replica of the first file with a replica of the second file if the swapping results in no reduction in the combined file availability of the first and second files.

Abstract: File availability in distributed file storage systems is improved by initially placing replicas of a file or other object on different ones of multiple devices using a first process. Subsequently, the placement of the replicas is improved by evaluating whether any replicas of a first file can be swapped with any replicas of a second file without a reduction in the combined file availability of the first and second files, and swapping a replica of the first file with a replica of the second file if the swapping results in no reduction in the combined file availability of the first and second files.

Abstract: A serverless distributed file system manages the storage of files and directories using one or more directory groups. The directories may be managed using Byzantine-fault-tolerant groups, whereas files are managed without using Byzantine-fault-tolerant groups. Additionally, the file system may employ a hierarchical namespace to store files. Furthermore, the directory group may employ a plurality of locks to control access to objects (e.g., files and directories) in each directory.

Abstract: A serverless distributed file system manages the storage of files and directories using one or more directory groups. The directories may be managed using Byzantine-fault-tolerant groups, whereas files are managed without using Byzantine-fault-tolerant groups. Additionally, the file system may employ a hierarchical namespace to store files. Furthermore, the directory group may employ a plurality of locks to control access to objects (e.g., files and directories) in each directory.