LarKC’s WebPIE Inference Engine makes it to the final rounds of the SCALE 2010 Challenge
Image via Wikipedia
A team from the VU University Amsterdam, consisting of LarKC members and members of Prof. Henri Bal’s Distributed Computing Group, has succeeded in getting through to the final rounds of the SCALE 2010 Challenge, with their entry entitled ”
SCALE is the third IEEE International Scalable Computing Challenge, sponsored by theIEEE Computer Society Technical Committee on Scalable Computing. The objective of the SCALE Challenge is to highlight and showcase real-worldproblem solving using computing that scales. Participants in the challenge are expected to identify significant current real-world problems where scalable computing techniques can be effectively used, and design, implement, evaluate and demonstrate solutions. The SCALE Challenge is co-located with CCGRID, the 10th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing.
The VUA team submitted the work lead by Jacopo Urbani and Spyros Kotoulas on WebPIE, an inference engine that can perform at Webscale. This MapReduce-based inference engine performs OWL Horst inference on datasets up to 100billion triples, as earlier reported here and here.
This selection for SCALE shows that the results achieved by WebPIE are not only interesting from a Semantic Web perspective, but are also attracting interest from the distributed computing community. The final rounds of the SCALE competition will take place 17-20 May in Melbourne.
Tags: Distributed computing, mapreduce