分散コンピューティングシステム上のオンラインゲーム開発環境pfmの設計
8
0
0
全文
(2) 情報処理学会研究報告 IPSJ SIG Technical Report. Vol.2010-OS-115 No.16 2010/8/4. (2) PaaS. 2 3 pfm 4. pfm. PaaS. 5. PaaS. 6 PaaS. yue. pfm. 7. 6 8. pfm. pfm. pfm yue pfm. 9 KVS pfm. KVS. 2.. KVS. pfm KVS. [b ]. pfm batched RPC[a] pfm RPC. pfm. (1) 100. 200ms. [c ] (2). pfm. 3-10qps/client. (3) (1). b) c). 100ms 100ms. a. 200ms. )RPC. 2. ⓒ 2010 Information Processing Society of Japan.
(3) 情報処理学会研究報告 IPSJ SIG Technical Report. Vol.2010-OS-115 No.16 2010/8/4. byte . (4) 50ms ms. 100ms. 3. Pfm. 1ms. (5). 3.1. (1) (2). (2) PaaS. http. PaaS. http. ms. (1) keepalive. http (2). lazy keepalive. (3). KVS [d ] http. pfm consistent hash. http. lazy PaaS. (4),(5) MySQL. persistent. http. RDBMS. IO DB. sharding pfm. persistent pfm. d). KVS. memcached. 3. ⓒ 2010 Information Processing Society of Japan.
(4) 情報処理学会研究報告 IPSJ SIG Technical Report. Vol.2010-OS-115 No.16 2010/8/4. KVS 3.3. pfm RPC. RPC OS. 3.3 RPC. persistent. RPC. pfm RPC. KVS. pfm RPC 2. RPC RPC (2). PaaS. (1). (1). KVS (2). 3.2. RPC (3). (4). (5). RPC. 4. ⓒ 2010 Information Processing Society of Japan.
(5) 情報処理学会研究報告 IPSJ SIG Technical Report. (6) pfm. Vol.2010-OS-115 No.16 2010/8/4. consistent hash. KVS consistent hash. RPC Player Team Team Node2 consistent hash RPC Node1. Player:create_team() Team:new(self) Team RPC belong_to. self.belong_to self.belong_to.vote_kick(...) vote_kick belong_to consistent hash. 1. pfm. 4. pfm. RPC. Team Team belong_to vote_kick. RPC. PaaS. 4.1. pfm. UDP. = RPC. KVS. 2. pfm. RPC 3.2. 5. ⓒ 2010 Information Processing Society of Japan.
(6) 情報処理学会研究報告 IPSJ SIG Technical Report. Vol.2010-OS-115 No.16 2010/8/4. 1. 4.2 RPC. pfm. batched RPC. pfm UDP (2) DBM Barkley Db. persistent PaaS. tokyocabinet. DBM. (3) Connector Nio 6. pfm RPC. RPC. (4) Serializer BISON MessagePack. RPC. RPC lua[1]. lua (5) UUID 4.3. KVS. 4.3. 3.1. pfm. mac address. KVS pfm. KVS (6) Fiber 3.1. mac address KVS pfm. pfm. RPC. Fiber 3.3 RPC. pfm. pfm. RPC RPC. RPC pfm. (7) LL. Nio, Connector, Serializer, DBM, UUID, Fiber,. Lua, ruby, (8) Object LL. 5. pfm pfm LL, Object, World, (1) Nio libev nbr. 3. squirrel LL DBM. Linux Nio. Windows. (9) World pfm. OS pfm. IO RPC. consistent hash. 6. ⓒ 2010 Information Processing Society of Japan.
(7) 情報処理学会研究報告 IPSJ SIG Technical Report. Vol.2010-OS-115 No.16 2010/8/4. 6. pfm. 7.. pfm tokyocabinet[3], yue. LL. Serializer Msgpack[2], DBM libnbr.a yue linux yuem, yues, yuec. lua,. libyuec.a. 7.1. Nio. yuem pfm yues. KVS. 6.1 libnbr.a. 7.2 yue. libnbr.a. 4.1. yuem yues yuem. UDP. yuem. yues yuem. . epoll persistent. batched RPC. 7.3. . (1) (2). RPC RPC. yuem (3). 1000. TCP. 32byte. (4) (3) yuem yues yues. 100000 6.2 yue. KVS RPC. yuem pfm yues. https. yues pfm. (4) yuem. yues (1). RPC libyuec.a C++ yue yuec libyuec.a. 8. yue. PaaS. 8.1. Amazon EC2(TM). 7. 10. 5. ⓒ 2010 Information Processing Society of Japan.
(8) 情報処理学会研究報告 IPSJ SIG Technical Report. Vol.2010-OS-115 No.16 2010/8/4. 5. 5. yuem. 1ms. yues,. 20ms pfm. yues 5. yuec. 8.2. Amazon EC2(TM). pfm. 2. A B. A. UI. 1000 1000. TCP lua. 128byte. yue. 100 B. 1. A. B. 1) 2) DBM 3). 8.3. B. A. 1. B. msgpack ,http://msgpck.org tokyocabinet, http://1978th.net/tokyocabinet/ lua, http://www.lua.org. 6.23qps 22.79ms 3000. 5000 yue. 9. KVS. RPC yue. pfm PaaS. RPC. 8. ⓒ 2010 Information Processing Society of Japan.
(9)
関連したドキュメント
In this paper, we we have illustrated how the modified recursive schemes 2.15 and 2.27 can be used to solve a class of doubly singular two-point boundary value problems 1.1 with Types
In this paper we derive Green’s formulas for the system of differential equations of stationary oscillations in the theory of elastic mixtures, which enable us to prove the
Keywords: continuous time random walk, Brownian motion, collision time, skew Young tableaux, tandem queue.. AMS 2000 Subject Classification: Primary:
In this work, we have applied Feng’s first-integral method to the two-component generalization of the reduced Ostrovsky equation, and found some new traveling wave solutions,
Thus, we use the results both to prove existence and uniqueness of exponentially asymptotically stable periodic orbits and to determine a part of their basin of attraction.. Let
Section 3 is first devoted to the study of a-priori bounds for positive solutions to problem (D) and then to prove our main theorem by using Leray Schauder degree arguments.. To show
This paper presents an investigation into the mechanics of this specific problem and develops an analytical approach that accounts for the effects of geometrical and material data on
In order to solve this problem we in- troduce generalized uniformly continuous solution operators and use them to obtain the unique solution on a certain Colombeau space1. In
