A NEW FINE-GRAINED MULTITHREADED GAME ENGINE APPROACH

Hassan Najadat, Yasser M. Jaffal, Basel A. Mahafzah, and Safwan S. Al-Omari

References

  1. [1] B. Goetz. Java concurrency in practice (Upper Saddle River,NJ: Addison-Wesley, 2006).
  2. [2] B. Mahafzah, Performance assessment of multithreaded quick-sort algorithm on simultaneous multithreaded architecture,Journal of Supercomputing, 66 (1), 2013, 339–363.
  3. [3] B. Mahafzah, Parallel multithreaded IDA heuristic search:Algorithm design and performance evaluation, InternationalJournal of Parallel Emergent and Distributed Systems, 26 (1),2011, 61–82.21
  4. [4] A. Hyari, A comparative study on heterogeneous and homoge-neous multiprocessors, Report Research, University of Jordan,December 2009.
  5. [5] T. Chen, H. Dai, and Y. Huang. A location-based mobile gameengine on the heterogeneous multi-core processor architecture,Journal of Computational Information Systems, 1(2), 2005,203–213.
  6. [6] J. Gregory, Game engine architecture (Boca Raton, FL, USA:A K Peters Ltd., 2009).
  7. [7] E. Lengyel, Game engine gems, Vol. 1 (Sudbury, MA: Jones& Bartlett Learning, 2010).
  8. [8] A. El Rhalibi, D. England, and S. Costa, Game engineeringfor a multiprocessor architecture, Digital Games ResearchAssociation (DiGRA) Conf., Vancouver, Canada, 2005.
  9. [9] J. Andrews, Designing the framework of a parallel game en-gine, http://software.intel.com/en-us/articles/designing-the-framework-of-a-parallel-game-engine/ (2009).
  10. [10] J. Tulip, J. Bekkema, and K. Nesbitt. Multi-threaded gameengine design, Proc. 3rd Australasian Conf. on InteractiveEntertainment, Perth, Australia, 2006.
  11. [11] M.J. Best, A. Fedorova, R. Dickie, A. Tagliasacchi, et al.,Searching for concurrent design patterns in video games, Lec-ture Notes in Computer Science, 5704, 2009, 912–923.
  12. [12] M. Joselli, M. Zamith, E. Clua, A. Montenegro, et al., Anadaptative game loop architecture with automatic distributionof tasks between CPU and GPU, Computers in Entertainment,7 (4), 2009, 1–15.
  13. [13] M. Kulkarni, K. Pingali, B. Walter, G. Ramanarayanan, et al.,Optimistic parallelism requires abstractions, Communicationsof the ACM, 52 (9), 2007, 89–97.
  14. [14] H. Finnsson and Y. Bj¨ornsson, Simulation-based approach togeneral game playing, Proc. 23rd AAAI Conf. on ArtificialIntelligence, Chicago, Illinois, USA, 2008.
  15. [15] F. Petrini, G. Fossum, J. Fern´andez, A.L. Varbanescu, et al.,Multicore surprises: Lessons learned from optimizing Sweep3Don the cell broadband engine, IEEE Int’l Symposium onParallel and Distributed Processing, Long Beach, California,USA, 2007, 1–10.
  16. [16] T. Lin, S. Wang, Cloudlet-screen computing: A multi-core-based, cloud-computing-oriented, traditional-computing-compatible parallel computing paradigm for the masses, Proc.2009 IEEE Int’l Conf. on Multimedia and Expo, New York,NY, USA, 2009, 1805–1808.
  17. [17] G. D’Angelo, Parallel and distributed simulation from manycores to the public cloud, Proc. 2011 Int’l Conf. on HighPerformance Computing and Simulation (HPCS 2011), 14 (23),Istanbul, Turkey, 2011, 4–8.
  18. [18] E.L. Lafferty, M.C. Michaud, M.J. Prelle, and J.B. Goethert,Parallel computing: An introduction, (Park Ridge, NJ: NoyesData Corporation, 1993).
  19. [19] D. Helmbold, and C. McDowell, Modeling Speedup(n) Greaterthan n, IEEE Transactions on Parallel and Distributed Systems,1 (2), 1990, 250–256.

Important Links:

Go Back