The 1st ICT Programing Contest
Will be held The 1st Programing Contest Final Stage on May, 26(Sat) 2012 at UNIVERSITY of TOKYO campus.
This contest to watch free, please come.
The finalist is below.
The 1st ICT Programing Contest
Date：may, 26(Sat) 2012 14:30-17:30
Venue：UNIVERSITY of TOKYO Campus Engineering department Building2 4F 241room
Participation fee is free.
Pass the qualifier（describe the name representative）
1．UNIVERSITY of TOKYO 1year Master’s Miki Horiuchi
“DDDFS（Dynamically-Duplicate Distributed File System）”
2．KOGAKUIN UNIVERSITY Department of Information Design 3rd year Toshiaki Hishinuma
“High-speed data transmission by striping of communication”
3．The Graduate School for the Creation of New Photonics Industries Masaaki Hanashima
“Proposed distributed file system of using the reliable multicast”
Introduction
We will be hold The 1st Program Contest.
This programing contest purpose is the development of human resources who support to operate the internet of infrastructure of next generation. And compete the skill Not only Server and Network construction skills, but creativity, originality, and implementation skill. Exchange your skill and communications with same generation students.
Entry qualifications
・At the time of application, you are being a Lord of country academy and a higher vocational school, a Lord of country private university and a junior college, a special vocational school, a student registered at technical schools and a student.
・Documents making and presentation with Japanese, being possible.
・Applicants are requested by the team of more than 1 person.
・You can use, freeware, but, you must include in the program your own code.
Application theme
Distributed storage
We flotation a program about network distribution type or original file system, data store, KVS, DHT implementation, and so on.
Even if it is not a complete storage system, it is okay the module or API for network distribution.
The interpretation is free of “network distribution”.
Reference network distribution type storage.
Sheepdog http://www.osrg.net/sheepdog/
Swift http://swift.openstack.org/
VA Storage http://www.valinux.co.jp/products/vastorage/index.html
Ceph http://ceph.newdream.net/
EXAGE http://www.intec.co.jp/service/exage/index.html
GlusterFS http://www.gluster.org/
Lustre http://wiki.lustre.org/index.php/Main_Page
Cloudian http://www.geminimobile.jp/big-data-solutions/cloudian.html
Application Method
Send us the summary of the application system below.
Application form : describe the summary of program. (text, Microsoft Office, Open Office, pdf)
attention: There is some possibility of doing that, the program of pass the qualifier we handle it as OSS and post the Web.
Programing language
anything.
Platform
The program is able to movement reproduction by general machine(IA machine, Smartphone, Cellular phone, Tablet).
We supposes platform is Linux, Window, MacOS. If you use except these platform, you should contact us.
Point of qualifier
This contest examination is qualifier by paper screening. and final selection is examination by presentation and live demo.
Schedule
Entry Period:Oct, 19 2011 9:00 – Dec, 20 2011 17:00
Application presentation period:Mar, 1 2012 9:00 – Mar, 16 2012 17:00
Announce the qualifier passage:Mar, 30 2012
The final date: May, 26 2012
Examination Committee
Chairman
・Hiroshi Esaki(ICTEPC Chairman/Professor, The University of Tokyo）
Commissioner
・Toshiya Asaba( IIJ Innovation Institute Inc. / President and representative director)
・Koichi Ise（ICTEPC Network Education WG Chief examiner/ Corporate executive officer, DataHotel Co., Ltd.）
・Minoru Kawasawa(GMO CLOUD K.K. / Technical section unification CTO)
・Yasuo Tsutimoto(ICTEPC Network Education WG / Instructor, The University of Tokyo)
・Nobuharu Noto(DeNA Co.,Ltd. / The director of department of system unification headquarters technology strategy）
Suponsor
GMO CLOUD K.K.
DeNA Co.,Ltd.
Award
Prize of GMO Cloud 1team
Prize of DeNA 1team
Prize of ICTEPC 1team
※Will be granted the prize money 100,000yen.
Application to
ICTEPC Office Section of Contest.
