LISTSERV mailing list manager LISTSERV 16.0

Help for TEAM-ADA Archives


TEAM-ADA Archives

TEAM-ADA Archives


TEAM-ADA@LISTSERV.ACM.ORG


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

TEAM-ADA Home

TEAM-ADA Home

TEAM-ADA  May 1999

TEAM-ADA May 1999

Subject:

Concurrency in Modern Programming Languages: TCSIGAda, Thursday, May 20, 7p.m. at Univ.St.Thomas, St.Paul

From:

Paul D Stachour <[log in to unmask]>

Reply-To:

Paul D Stachour <[log in to unmask]>

Date:

Sun, 16 May 1999 16:20:52 -0500

Content-Type:

text/plain

Parts/Attachments:

Parts/Attachments

text/plain (87 lines)

Concurrent Programming using Modern Computer Languages

Twin Cities SIGAda presents:

E. Wayne Donaho and Paul Stachour

Concurrent Programming using Modern Computer Languages

Get a FREE Ada CDROM. See details following meeting announcement.

7:00 .. 9:00p.m., Thursday, May 20, 1999,
University of St. Thomas, Science Building Room 275,
St. Paul Campus, corner of Cretin and Grand Avenue.
(detailed directions below)

The topic is Concurency in Modern Programming Languages,
in particular C/C++, Java, and Ada.

Todays computer programs are no longer the simple sequential programs
that we learned in school.&nbsp; Programs are expected to perform
tasks (often more than one task) while waiting for input from the
user. The fact that concurrency must be handled in our programs
forces programers to use more complex tools to handle these programs.

Issues that must be dealt with include:

How to initiate a tasking system
How to syncronize multiple tasks
How two tasks communicate information
How a multiple task program shuts down in an orderly fashion
Is being thread-safe and exception-safe easy or hard?
Examples from the 3 languages.


To handle this problem modern languages give us tools which allow us
to deal with these problems in a cost effective manner.&nbsp; We will
review the tools that each of three modern computer languges ( C/C++,
Java and Ada ) give programmers to deal with the problems introduced
by concurrency.

About the Speakers:

Wayne Donaho is freelancing building Database Driven Web sites for
small businesses.  Wayne has used Ada since the mid 1980's, including
building large multi-task, multicomputer systems at Unisys (now
Lockheed-Martin).  Wayne is teaching about Ada95 features at a local
company which builds higly reliable software.

Paul Stachour is the Software Quality Manager at a local company
building software for the internet. Paul has been interested in
concurrency issues since he was introduced to BSAM IO in 1968.  He
has written concurrent programs in PL/I, C, and Ada.  He has observed
that doing concurrency "outside of the language" does not seem to
scale, while doing it "inside the language" makes it easy and
reliable.  Paul has been interested in what makes software "quality
software" ever since.  In particular, he is interested in what
languages, features, tools, and processes prevent defects. Paul is
the current president of TCSIGAda.

Directions to St. Thomas:

Take I94 to the Cretin Avenue exit in St.Paul.  Turn south off the
exit, towards the Mississippi River.  There are traffic lights at
Marshal and Summit Avenues.  The first street after Summit is Grand,
turn right on Grand, it becomes the road into the parking lot.  If
you do not have a St. Thomas parking sticker, you will need to park
at a parking meter.  OSS is the building immediately to the north and
east of the parking meters.  275 is on the second floor; take the
stairway in the SW corner of the building to the 2nd floor, then look
for posted directions to the room.  Please contact Paul Stachour if
you need additional directions.

Free Offer:

The first two individuals to respond to Mark Glewwe, publicity,
[log in to unmask] with their name and intention to attend this May
20th TCSIGAda meeting, and show up at the meeting, will win a free
Walnut Creek Ada 2-CDROM, with a listed value of $35.  This offer is
available to anyone who has *not* previously won a prize at a
TCSIGAda meeting.

For information about TCACMSIGAda, call (612)-884-5977 or visit
 www.tcsigada.org

A more nicely formatted version of this announcement is found at
   www.tcsigada.org/meeting/may99mtg.htm

Top of Message | Previous Page | Permalink

Advanced Options


Options

Log In

Log In

Get Password

Get Password


Search Archives

Search Archives


Subscribe or Unsubscribe

Subscribe or Unsubscribe


Archives

December 2017
November 2017
October 2017
September 2017
June 2017
May 2017
April 2017
January 2017
December 2016
November 2016
October 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
June 2015
May 2015
April 2015
March 2015
February 2015
January 2015
December 2014
November 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
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
February 2012
January 2012
December 2011
November 2011
October 2011
September 2011
August 2011
July 2011
June 2011
May 2011
April 2011
December 2010
November 2010
October 2010
September 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
February 2009
January 2009
December 2008
November 2008
October 2008
September 2008
August 2008
June 2008
May 2008
April 2008
March 2008
February 2008
January 2008
December 2007
November 2007
October 2007
September 2007
June 2007
May 2007
March 2007
February 2007
December 2006
November 2006
October 2006
September 2006
August 2006
July 2006
June 2006
May 2006
April 2006
March 2006
February 2006
January 2006
December 2005
November 2005
October 2005
August 2005
July 2005
June 2005
May 2005
April 2005
March 2005
February 2005
January 2005
December 2004
November 2004
October 2004
September 2004
August 2004
July 2004
June 2004
May 2004
March 2004
February 2004
January 2004
December 2003
November 2003
October 2003
September 2003
August 2003
July 2003
June 2003
May 2003
April 2003
March 2003
February 2003
January 2003
December 2002
November 2002
October 2002
September 2002
August 2002
July 2002
June 2002
May 2002
April 2002
March 2002
February 2002
December 2001
November 2001
October 2001
September 2001
August 2001
July 2001
June 2001
May 2001
April 2001
March 2001
February 2001
January 2001
December 2000
November 2000
October 2000
September 2000
August 2000
July 2000
June 2000
May 2000
April 2000
March 2000
February 2000
January 2000
December 1999
November 1999
October 1999
September 1999
August 1999
July 1999
June 1999
May 1999
April 1999
March 1999
February 1999
January 1999
December 1998
November 1998
October 1998
September 1998
August 1998
July 1998
June 1998
May 1998
April 1998
March 1998
February 1998
January 1998
December 1997
November 1997
October 1997
September 1997
August 1997
July 1997
June 1997
May 1997
April 1997
March 1997
February 1997
January 1997
December 1996
November 1996
October 1996

ATOM RSS1 RSS2



LISTSERV.ACM.ORG

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