JiscMail Logo
Email discussion lists for the UK Education and Research communities

Help for CPHC-CONF Archives


CPHC-CONF Archives

CPHC-CONF Archives


cphc-conf@JISCMAIL.AC.UK


View:

Message:

[

First

|

Previous

|

Next

|

Last

]

By Topic:

[

First

|

Previous

|

Next

|

Last

]

By Author:

[

First

|

Previous

|

Next

|

Last

]

Font:

Proportional Font

LISTSERV Archives

LISTSERV Archives

CPHC-CONF Home

CPHC-CONF Home

CPHC-CONF  2001

CPHC-CONF 2001

Options

Subscribe or Unsubscribe

Subscribe or Unsubscribe

Log In

Log In

Get Password

Get Password

Subject:

Call For Papers: Special Session on Communicating Process Architectures

From:

Hamid Arabnia <[log in to unmask]>

Reply-To:

Hamid Arabnia <[log in to unmask]>

Date:

Tue, 2 Jan 2001 16:39:18 -0500

Content-Type:

text/plain

Parts/Attachments:

Parts/Attachments

text/plain (175 lines)

Dear Colleagues:

I would be most grateful if you would share the appended Call For Papers
with your contacts.

Happy New Year!
Regards,
Hamid
-------------------------------CUT HERE-----------------------------------

Call for Papers
===============

Note: The deadline for submission of papers is February 28, 2001.

Special Session on Communicating Process Architectures

in conjunction with the
International Conference on
Parallel and Distributed Processing Technologies and Applications
PDPTA 2001


About the Session:

Communicating Process Architectures addresses many of the key issues in modern
computer science and its applications.  In broad terms, the session themes will
concern concurrency - at all levels of software and hardware granularity. The
goal of the conference is to stimulate discussion and ideas as to the role
concurrency will play in the future generation of scaleable computer
infrastructure and applications - where scaling means the ability to ramp up
functionality (i.e. stay in control as complexity increases) as well as physical
metrics (such as performance).

Traditionally, concurrency has been taught and considered and experienced as an
advanced and difficult topic. The thesis underlying this session is that this
tradition is wrong. The natural world operates through the continuous
interaction of massive numbers of autonomous agents at all levels of granularity
(astronomic, human, sub-atomic). If modern computer science finds concurrency
hard, then it is not doing it right! It is time for concurrency to mature into a
simple discipline that can be used everyday.

The accepted papers address the session themes and goals as discussed above.
Specific areas include, but are not limited to:

theory - getting the underlying model right (CSP, pi-calculus, channels,
monitors, semaphores, BSP, barriers, buckets...);

concurrent design patterns and tools (built upon the above);

safety and security issues (race-hazards, deadlock, livelock, process
starvation, ...);

language issues (Java(TM), CSP libraries for Java/C/C++, occam(TM),
Handel-C(TM), Limbo(TM),...);

system issues (lightweight multithreading kernels, lightweight external
communications/interrupts, ...);

processor issues (instruction sets for zero-cost multithreading, VLIW,
multiprocessor chips, software cache control, ...)

specialised hardware issues (link and router technologies, FPGAs, ...);

shared-memory -v- message-passing paradigms (unification?), SMP and virtual SMP
architectures;

supercomputing from commodity components (cluster computing, internet grids,
...);

applications: scientific (including graphics and GUIs), engineering (including
embedded, real-time and safety-critical), business (including mobile and
e-commerce) and home (including entertainment);

global architectural issues (vertical integration of all the above);

etc...

Submission Guidelines

Two classes of papers will be considered:

1. Mature work: papers must present work, which is well along, novel, and has
not previously been published. Final papers will be about 7 single-spaced pages,
and the actual presentations are estimated to be 20 to 30 minutes. The initial
submission for review should be at least four pages.

2. Work in progress: short talks (15 minutes or so) of new work underway - but
still original and unpublished. Abstracts of one page will be included in the
proceedings. The initial submission for review should be an abstract of 250 to
500 words.

Authors are requested to due thorough literature (& web) searches on their
topics to make certain that the work is novel.

Title pages should include title, author's names, addresses, phone numbers, and
email addresses. Please include appropriate keywords.

Each submission will be reviewed by (at least) three members of the program
committee; written reviews will be returned to authors.

IMPORTANT DATES:

     February 28, 2001 (Wednesday): Draft papers or abstracts due

     April 2, 2001 (Monday): Notification of acceptance

     May 1, 2001 (Tuesday): Camera-Ready papers & registration fee due

     June 25 - June 28, 2001: PDPTA 2001 Conference

Electronic Submission is Preferred!

We prefer all submissions to be done electronically in PostScript or PDF format.
If for some reason you cannot provide PostScript/PDF, please mail five copies to
one of the Session Chairs at the addresses provided.

If your paper is accepted, the final version of your paper must be
available in PostScript, PDF, or source form. We strongly encourage you to use
LaTeX, Microsoft Word, or FrameMaker for the preparation of your paper. Other
formats are likely to be troublesome.

All accepted papers must be presented by one of the authors at PDPTA 2001 during
the special session to be included in the final proceedings.


LOCATION OF CONFERENCE:

The PDPTA 2001 conference will be held in the Monte Carlo Resort hotel, Las
Vegas, Nevada, USA. This is a mega-hotel with excellent conference
facilities and over 3000 rooms. The hotel is minutes from the Las Vegas
airport with free shuttles to and from the airport. This hotel has many
vacation and recreational attractions, including: waterfalls, casino, spa, pools
& kiddie pools, sunning decks, Easy River water ride, wave pool with cascades,
lighted tennis courts, health spa (with workout equipment, whirlpool, sauna,
...), arcade virtual reality game rooms, nightly shows, snack bars, a number of
restaurants, shopping area, bars, ... Many of these attractions are open 24
hours a day and most are suitable for families and children. The negotiated
hotel's room rate for conference attendees is very reasonable ($79 + tax) per
night (no extra charge for double occupancy) for the duration of the conference.
The hotel is within walking distance from most other Las Vegas attractions
(major shopping areas, recreational destinations, fine dining and night clubs,
free street shows, ...). For the benefit of our international colleagues: the
state of Nevada neighbors with
the states of California, Oregon, Idaho, Utah, and Arizona. Las Vegas is only a
few driving hours away from other major cities, including: Los Angeles, San
Diego, Phoenix, Grand Canyon, ...

Details on PDPTA can be found at
http://www.ashland.edu/~iajwa/conferences

All submissions, questions, or comments should be mailed or e-mailed to one of
the Session Chairs:

Dyke Stiles
Department of Electrical and Computer Engineering
4120 Old Main Hill
Utah State University
Logan, UT 84322-4120

E-Mail: [log in to unmask]

Voice: 801-797-2806
Fax: 801-797-3054

Professor Peter Welch
Computing Laboratory
The University
Canterbury
Kent
CT2 7NF
UK
Tel: +44 (0)1227 823629
Email: [log in to unmask]

Top of Message | Previous Page | Permalink

JiscMail Tools


RSS Feeds and Sharing


Advanced Options


Archives

April 2024
March 2024
February 2024
January 2024
December 2023
November 2023
October 2023
September 2023
August 2023
July 2023
June 2023
May 2023
April 2023
March 2023
February 2023
January 2023
December 2022
November 2022
October 2022
September 2022
August 2022
July 2022
June 2022
May 2022
April 2022
March 2022
February 2022
January 2022
December 2021
November 2021
October 2021
September 2021
August 2021
July 2021
June 2021
May 2021
April 2021
March 2021
February 2021
January 2021
December 2020
November 2020
October 2020
September 2020
August 2020
July 2020
June 2020
May 2020
April 2020
March 2020
February 2020
January 2020
December 2019
November 2019
October 2019
September 2019
August 2019
July 2019
June 2019
May 2019
April 2019
March 2019
February 2019
January 2019
December 2018
November 2018
October 2018
September 2018
August 2018
July 2018
June 2018
May 2018
April 2018
March 2018
February 2018
January 2018
December 2017
November 2017
October 2017
September 2017
August 2017
July 2017
June 2017
May 2017
April 2017
March 2017
February 2017
January 2017
December 2016
November 2016
October 2016
September 2016
August 2016
July 2016
June 2016
May 2016
April 2016
March 2016
February 2016
January 2016
December 2015
November 2015
October 2015
September 2015
August 2015
July 2015
June 2015
May 2015
April 2015
March 2015
February 2015
January 2015
December 2014
November 2014
October 2014
September 2014
August 2014
July 2014
June 2014
May 2014
April 2014
March 2014
February 2014
January 2014
December 2013
November 2013
October 2013
September 2013
August 2013
July 2013
June 2013
May 2013
April 2013
March 2013
February 2013
January 2013
December 2012
November 2012
October 2012
September 2012
August 2012
July 2012
June 2012
May 2012
April 2012
March 2012
February 2012
January 2012
December 2011
November 2011
October 2011
September 2011
August 2011
July 2011
June 2011
May 2011
April 2011
March 2011
February 2011
January 2011
December 2010
November 2010
October 2010
September 2010
August 2010
July 2010
June 2010
May 2010
April 2010
March 2010
February 2010
January 2010
December 2009
November 2009
October 2009
September 2009
August 2009
July 2009
June 2009
May 2009
April 2009
March 2009
February 2009
January 2009
December 2008
November 2008
October 2008
September 2008
August 2008
July 2008
June 2008
May 2008
April 2008
March 2008
February 2008
January 2008
December 2007
November 2007
October 2007
September 2007
August 2007
July 2007
June 2007
May 2007
April 2007
March 2007
February 2007
January 2007
2006
2005
2004
2003
2002
2001
2000
1999
1998


JiscMail is a Jisc service.

View our service policies at https://www.jiscmail.ac.uk/policyandsecurity/ and Jisc's privacy policy at https://www.jisc.ac.uk/website/privacy-notice

For help and support help@jisc.ac.uk

Secured by F-Secure Anti-Virus CataList Email List Search Powered by the LISTSERV Email List Manager