Engineering Large-Scale Distributed Systems.
ELSDS Track at the
Track Program (tentative)
The track will take place on Tuesday March 18, from 8:20 to 10:00. Each author will have 20 minutes to present his paper.
For the past twentytwo years the ACM Symposium on Applied Computing (SAC) has been a primary forum for applied computer scientists, computer engineers and application developers to gather, interact, and present their research. SAC is sponsored by the ACM Special Interest Group on Applied Computing ( SIGAPP ); its proceedings are published by ACM in both printed form and CD-ROM; they are also available on the web through the ACM Digital Library. More information about SIGAPP and past editions of SAC can be found at http://www.acm.org/sigapp.
Call For Papers
Social phenomena like YouTube and Flickr are incontrovertible evidence of users' migration to a new Web overwhelmed by multimedia. In fact, images, videos, music, and other kinds of multimedia objects today constitute about 99% of the Web. Nonetheless, users' chances of a successful search in such a large portion of information are not proportionally supported. Web search is dominated by giants like Google, Yahoo! and Microsoft that exploit centralized text-only indices enriched by an endless toolbox of smart ranking algorithms. Their interest in riding this new tide is witnessed by the acquisition of both Flickr and YouTube. On the other hand, content-based search for image, music and videos has been deeply studied in the last years but it is not yet adopted by the industry because of its cost.
At the same time users are becoming more and more active. There is no doubt that the so called “Web 2.0” marked a new approach of generating and distributing Web content itself, characterized by communities, decentralization of authority, freedom to share and re-use. It is fascinating the oppurtunity to develop distributed search engines taking advantage of distributed resources controlled by communities, interest groups, single users or providers.
In the last few years Peer-to-Peer systems have been widely used to overcome scalability issues of centralized solutions. P2P algorithms offer robust, scalable and highly available ways of exploiting large pools of storage and computational resources. The approach has been shown to be effective for tasks such as file sharing. In addition, academic research started contributing new insights and paving new promising outlooks for P2P networks. P2P seems the solution that can make a large multimedia information retrieval system able to scale to repositories as large as the Web is. Also, P2P is supposed to lead users to freedom from advertisement-generating, commercial and centralized web search engines. Users interests are not the same of web search engines.
Topics of Interest
Authors are invited to submit papers dealing with the following topics:
Fabrizio Falchi, fabrizio.falchi *at* isti.cnr.it, NMIS lab, ISTI-CNR, Pisa, Italy
Claudio Lucchese, clucches *at* dsi.unive.it, Ca' Foscari University of Venice, Italy