Final manuscripts: Aug 23, 2010
Sep 3, 2010 (HARD DEADLINE)
Conference: Oct 26 - 28, 2010
SPONSORS:
MEDIA PARTNERS:
FURTHER INFORMATION:
Please send any questions or comments to
CALL FOR WORKSHOPS AND TUTORIALS
We invite proposals for workshops and tutorials. Workshops are
intended to provide a platform for presenting novel ideas in a less
formal and possibly more focused way than is possioble in the main
conference. Organisers are free to set the format for workshops in
order to best fit the theme. We will include full- or half-day
workshops in the programme.
Tutorials are intended to be more directed at learning, for graduate
and industrial audiences, of technologies and techniques appropriate
to the conference. We especially welcome tutorial proposals by
practitioners in significant fields, or tutorials that present
cross-disciplinary approaches to cloud computing. We expect tutorials
to be half-day only.
Please submit proposals to the CloudComp 2010 Workshop Chair,
Proposals should be by email
(PDF or plain text) with "CloudComp" in the subject header. The
deadlines for submissions are:
Workshops: 0700 UTC Wednesday 17th March 2010 Extended to: April 19, 2010
Tutorials: 0700 UTC Wednesday 21st July 2010
Notifications of acceptance will be sent out no more than two weeks
after the submission deadline. Both workshop and tutorial proposals
should include:
The name of the workshop or tutorial.
A statement of goals oals and/or learning outcomes.
The names and affiliations of the organisers.
The names of programme committee members, presenters or keynote speakers.
A draft call for participation.
The expected number of attendees and the planned length (full- or half-day).
A description of the plans for publicity.
An explanation of any plans for proceedings or learning materials.
A description of past versions of the event, including dates,
organisers, submission and acceptance counts, attendance, sites,
registration fees and summary budget information, if any.
The URL of the workshop or tutorial web site, if available.