41. Citation Keith H. Randall, The implementation of the cilk5 multithreaded language, Proceedingsof the ACM SIGPLAN '98 conference on programming language design and http://portal.acm.org/citation.cfm?id=277696&dl=ACM&coll=portal&CFID=11111111&CF

42. Programming Language Semantics Seminar 1998-99 Keith H. Randall, The Implementation of the cilk5 Multithreaded Language. Proceedingsof the ACM SIGPLAN '98 Conference on programming Language Design and http://www.ccs.neu.edu/home/wand/pl-seminar/98-99.html

Programming Language Semantics Seminar, 1998-99 Mitchell Wand College of Computer Science, Northeastern University 360 Huntington Avenue #161CN, Boston, MA 02115 Internet: wand@ccs.neu.edu Phone: (617) 373-2072 / Fax: (617) 373-5121 Semantics at NU College of Computer Science Northeastern University Current schedule Wednesday, 7 June 1999 (10 o'clock until noon, in 206 Egan) Galen Williamson will continue his presentation of Jonathan Sobel, Erik Hilsdale, R. Kent Dybvig, and Daniel P. Friedman, Abstraction and Performance from Explicit Monadic Reflection. Wednesday, 26 May 1999 (10 o'clock until noon, in 206 Egan) Galen Williamson will present Jonathan Sobel, Erik Hilsdale, R. Kent Dybvig, and Daniel P. Friedman, Abstraction and Performance from Explicit Monadic Reflection. Abstract: Much of the monadic programming literature gets the types right but the abstraction wrong. Using monadic parsing as the motivating example, we demonstrate standard monadic programs in Scheme, recognize how they violate abstraction boundaries, and recover clean abstraction crossings through monadic reflection. Once monadic reflection is made explicit, it is possible to construct a grammar for monadic programming. This grammar, in turn, enables the redefinition of the monadic operators as macros that eliminate at expansion time the overhead imposed by functional representations. The result is very efficient monadic programs; for parsing, the output code is competitive with good handcrafted parsers.

43. OpenMP Parallel programming in OpenMP Rohit Chandra, Ramesh Menon, Leo Dagum, David Kohr,Dror Maydan, Jeff McDonald Morgan KAI Nested Parallelism examples cilk. http://nereida.deioc.ull.es/html/openmpindex.html

Shared Memory and OpenMP Institutions OpenMP Consortium cOMPunity The OpenMP Community UK OpenMP web site OpenMP Simple, Portable, Scalable SMP Programming Specifications OpenMP C API summary The OpenMP C Specification (postscript format, local, beowulf) OpenMP Specifications Draft C/C++ 2.0 (November 2001) The OpenMP Fortran Specification (postscript format) The OpenMP FORTRAN Specification (html format, local) Odin OpenMP Odin OpenMP How to use Odin OpenMP in the Linux ULPGC GAC multiprocessor How to use Odin OpenMP in the Digital alpha Server at CCTI How to use Odin OpenMP in the linux9-pr machine at San Luis Omni OpenMP Omni: Local pages at nereida A local copy of Omni-1.3 is available click! StackThreads/MP ps local copy of the StackThreads/MP man Sato, Satoh, Kusano and Tanaka Design of an OpenMP compiler for an SMP Cluster Tanaka, Taura, Sato, and Yonezawa. Performance Evaluation of OpenMP Applications with Nested Parallelism LCR 2000. Omni: RWCP OpenMP Japanese Compiler Project. Local Omni/ST Nested Irregular Parallelism Omni/ST: StackThreads/MP Nested Irregular Parallelism Conferences First European Workshop on OpenMP -EWOP'99 cOMPunity list of events.

44. Thor.cs.yale.edu/ymp-workshop/schedule.text Monday June 8 Session 1 Teaching (1) 830 Teaching Parallel AlgorithmsUsing the cilk Multithreaded programming Language. CE Leiserson. http://thor.cs.yale.edu/ymp-workshop/schedule.text

Schedule (Note that the papers appear in your packets sorted alphabetically by the first author.) The format of the sessions will be a twenty-minute talk including only one or two minutes of questions. At the end of each session we will have a half hour for discussion. Monday June 8: Session 1: Teaching (1) 8:30 Teaching Parallel Algorithms Using the Cilk Multithreaded Programming Language. C.E. Leiserson. (Only 10 minutes for discussion) Session 2: Implementation I (2) 9:00 The Implementation of the Cilk-5 Multithreaded Language. K. Randall. (3) 9:20 Thread Scheduling for Multiprogrammed Multiprocessors. R.D. Blumofe. (4) 9:40 A Nonblocking Cilk Implementation. P. Lisiecki. 10:00 Discussion 10:30 Break Session 3: Performance (5) 11:00 Predicting Price/Performance Trade-offs for Whitney: A Commodity Computing Cluster. J.C. Becker, B. Nitzberg, R.F. Van Der Wijngaart, M. Yarrow, C. Kuszmaul. (6) 11:20 A Comparison of Multithreading Implementations. S.R. Taylor. (7) 11:40 Exploitation of Multithreading to Improve Program Performance. W.E. Cohen, N. Yalamanchilli, R. Tewari, C. Patel, and T. Kazi. 12:00 Discussion 12:30-2:00 Lunch (provided at the Peabody) Session 4: Applications (8) 2:00 Construction of a Multithreaded Chess Program. D. Dailey. (9) 2:20 Nops: A Conservative Parallel Simulation Engine for TeD. Poplawski, and Nicol. (10) 2:40 Using Multithreading for the Automatic Load Balancing of 2D Adaptive Finite Element Meshes. G. Heber, R. Biswas, P. Thulasiraman, and G.R. Gao. (11) 3:00 Applying Multi-threaded Programming to the Simulation of Virus Shell Self-Assembly. R. Schwartz, and B. Berger. 3:20 Discussion 3:50 Break Session 5: Memory (12) 4:20 Computation-Centric Memory Models. M. Frigo. (13) 4:40 Space Efficient Execution of Deterministic Parallel Programs. D.J. Simpson, and F.W. Burton. 5:00 Discussion 6:00-10:00 Dinner (provided at the peabody) Tuesday June 9: Session 6: Implementation II (1) 8:30 Communications-Efficient Multithreading on Limited-Bandwidth Networks. M.S. Bernstein, and B.C. Kuszmaul. (2) 8:50 Indolent Closure Creation. V. Strumpen. (3) 9:10 Scheduling Adaptively Parallel Jobs. B. Song. 9:30 Discussion 10:00 Break Session 7: Multithreaded Programming Systems (4) 10:30 Space-Efficient scheduling of Nested Parallelism. Narlikar. (5) 10:50 A Compiler for pH An Implicitly Parallel, Multithreaded Haskell. A. Caro, and J.W. Maessen. (6) 11:10 Speculative Processing Using Active Objects. C.-K. Yuen, and M. Feng. (7) 11:30 Athapascan-1: Parallel Programming with Asynchronous Tasks. G.G.H. Cavalheiro, F. Galilee, and J.-L. Roch. (8) 11:50 Stampede - A Programming System for Emerging Scalable Interactive Multimedia Applications. R.S. Nikhil, U. Ramachandran, J. Rehg, R.H. Halstead, C.F. Joerg, and L. Kontothanassis. 12:10 Discussion 12:40-2:10 Lunch Session 8: Debugging (9) 2:10 Efficient Detection of Determinacy Races in Cilk Programs. M. Feng, and C.E. Leiserson. (10) 2:30 Detecting Data Races in Cilk Programs that Use Locks. G.-I. Cheng, C. E. Leiserson, K. Randall, A. Stark, and M. Feng. 2:50 Discussion 3:20 Break Session 9: Compilers (11) 3:50 Design of a Restructuring Compiler for Contemporary Languages and Architectures. L. Harrison. (12) 4:10 A Compiler Technique for Speculative Execution for Alternative Program Paths Targeting Multithreaded Architectures. A. Unger, T. Ungerer, and E. Zehendner. (13) 4:30 Compiling for Multithreaded Architectures. X. Tang. 4:50 Discussion 5:20 EOW (End of Workshop)

45. Bradley C. Kuszmaul chess programs (StarTech and *Socrates.) I participated at MIT in the cilk developmentproject, which provides an algorithmic multithreaded programming system. http://thor.cs.yale.edu/~bradley/

Bradley C. Kuszmaul As of August 2002, I am a Research Scientist in the Supercomputing Technologies Group at the MIT Laboratory for Computer Science. My new home page can be found at http://bradley.lcs.mit.edu Before that I was currently Senior Research Scientist at Akamai Technologies . I was also affiliated with the the Computer Architecture and Engineering Group at the Yale University Department of Computer Science and the Yale University Department of Electrical Engineering My research applies algorithm design to solve systems problems in high-performance computing. I was one of the principal architects of the Connection Machine CM-5, and am the co-author of two world-class computer chess programs (StarTech and *Socrates .) I participated at MIT in the Cilk development project, which provides an algorithmic multithreaded programming system. As an assistant professor at Yale I worked on the Ultrascalar Project , in which we improved the theoretical bounds for how fast a superscalar processor's clock can run, as a function of the window size or the issue width. We also had an 8-issue out-of-order processor fabricated in a 0.18 micron copper/low-K VLSI process. Recently we have been working on developing the mechanisms for a speculative dataflow processor. Teaching: I taught CS 422, Operating Systems

46. Clemens Grelck's Virtual Bookshelf oriented C++ Java Smalltalk Parallel BSP C* Cid cilk Erlang FortranD Packages TheoryArray Theory Category Theory Data Parallel programming LAMBDACalculus http://www.informatik.uni-kiel.de/~cg/bib/bookshelf.html

Clemens Grelck's Virtual Bookshelf 510 entries, 177 available online (Tue Jul 11 12:07:38 MET DST 2000) Application Programs Benchmarks Compilers Compilation Schemes Compiler Optimization Array Data Layout Array/Loop Partitioning Avoiding Temporaries Cache Utilization ... Implementation of Arrays Integration of I/O Frames Fudgets Gadgets I/O Surveys Linear Types ... Fast Functional Programming Evaluation Strategies FP Surveys Graph Reduction Lazy Evaluation ... Skeletons Hardware CM Cache Cluster Cray ... Profiling Programming Environments Array A++ APL J K Lapack Matlab Nial Coordination Caliban Eden Linda PCN ... PROMOTER Functional Clean Erlang Haskell Id ... pH Imperative ADA C Fortran Jade Object-oriented C++ Java Smalltalk Parallel BSP C* Cid Cilk ... Software Packages Theory Array Theory Category Theory Data Parallel Programming LAMBDA-Calculus ... on SAC generated by bookshelf , Tue Jul 11 12:07:38 MET DST 2000 cg@informatik.uni-kiel.de

47. Computer Chess / Chess Engines (Winboard) & Chess Programming Info [Chessopolis 45 links to information on computer chess programming (bottom section of this web page)Category Games Board Games Chess Software programming...... for learning chess programming. Bestia Betsy Blikskottel Chenard Older programwith own interface. Chessterfield - Neural-network based. Cilian cilk Project http://www.chessopolis.com/cchess.htm

Computer Chess Amateur Chess Engines Chess Programming Info / Misc / Tutorials ... Variants whole site Links Books CBC ChessFiles Advanced Search Computer Chess Amateur / Freeware Chess Engines Note: Many of these are Winboard compatible. You will find commercial programs on the Software page. WBEC-Ridderkerk - Maintains a list of Winboard-compatible engines with download links. Aldebaran Amyan Arasan - Also has Windows interface. Armageddon Chess - Windows interface. No Winboard support. Averno Awesome BabyChess BACE (Source only - you must compile) Beowulf - Chess engine project with a goal of producing readable source code useful for learning chess programming. Bestia Betsy Blikskottel Chenard - Older program with own interface. Chessterfield - Neural-network based. Cilian Cilk Project - Cilk is a strong program for multi-processor machines. Has source code and info on parallel computing. Not a Winboard engine. ColChess - Engine for Linux/Unix. - Experimental object-oriented chess engine. Does not use brute force.

48. Dr. Clemens Grelck's Virtual Bookshelf C++ Java Smalltalk Parallel BSP C* Cid cilk Erlang FortranD Array Theory CategoryTheory Data Parallel programmingObject Oriented programming LAMBDACalculus http://www.isp.mu-luebeck.de/~grelck/bookshelf/bookshelf.html

Dr. Clemens Grelck's Virtual Bookshelf 710 entries altogether, 256 available online (Tue Oct 8 12:46:55 MEST 2002) Application Programs Avoiding Synchronization Benchmarks Compilation Data Parallelism Dense Arrays Distributed Memory Mixed Parallelism ... Task Parallelism Compiler Optimization Array Data Layout Array/Loop Partitioning Avoiding Temporaries Cache Utilization ... Fusion Hardware CM Cache Cluster Cray ... nCUBE Implementing Functional Languages Compilation Schemes Evaluation Strategies Exploiting Concurrency FP Surveys ... Implementation of Arrays Integration of I/O Frames Fudgets Gadgets I/O Surveys Linear Types ... Language Manuals Local Publications Miscellaneous NAS Operating Systems Parallel Function Programming ... Profiling Programming Environments Array A++ APL J Lapack ... Skil Coordination Caliban Eden Linda PCN ... PROMOTER Functional Clean Erlang Haskell Id ... pH Imperative ADA C C Fortran ... Jade Object-oriented C++ Java Smalltalk Parallel BSP C* Cid Cilk ... Standards Theory Array Theory Category Theory Data Parallel ProgrammingObject Oriented Programming LAMBDA-Calculus Threads Tupling Types and Type Systems ... Dr. Clemens Grelck Last modified: Tue Oct 8 12:46:55 MEST 2002

49. 4.4 Parallel Decomposition The FJTask framework internally relies on a workstealing task schedulerbased on the one in cilk, a C-based parallel programming framework. http://gee.cs.oswego.edu/dl/cpj/s4.4.html

50. Cilk: A Multithreaded Programming Language cilk A Multithreaded programming Language. Overview. So here we introducea language which is designed for multithreaded programmingcilk. http://www.comp.nus.edu.sg/~cs1305/solve/Project/chenhuaf/example.htm

Cilk: A Multithreaded Programming Language Overview To do multithreaded programming, first of all, we need a language. So here we introduce a language which is designed for multithreaded programming-Cilk. Cilk is algorithmic multithreaded language. The philosophy behind Cilk is that a programmer s hould concentrate on structuring the program to expose parallelism and exploit locality, leaving the runtime system with the responsibility of scheduling the computation to run efficiently on a given platform. Thus the Cilk runtime system takes care of th e details like load balancing, paging and communication protocols. Unlike other multithreaded languages, however, Cilk is algorithmic in that the runtime system guarantees the efficient and predictable performance. The Cilk Language The basic Cilk language is extremely simple. It consists of C with the addition of 3 keywords to indicate the parallelism and synchronization. A Cilk program, when run on one processor, has the same semantics as the C program results when th e Cilk keywords are deleted. We call this C program the serial elison or C elison of the Cilk program. Cilk extends the semantics C in a natural way for parallel execution. In the following part, we will assume that our readers know C already. One of the simplest examples of Cilk program is a recursive program to compute the nth Fibonacci number. A C program to do this is shown in Figure 1(a) and Figure 1(b) shows

51. SourceForge.net: Project Info - Cilk Operating System POSIX; programming Language C; Topic Software Development, SymmetricMultiprocessing. Project UNIX name cilk Registered 2000-05-27 0626 http://sourceforge.net/projects/cilk

OSDN: Our Network DevChannel Newsletters ... Shop SEARCH: Slashdot All OSDN Sites freshmeat DevChannel Linux.com LinuxGram NewsForge OSDN.com OSDN PriceCompare Slashcode SourceForge.net My Favorites SF.net Home Foundries Clustering Distributed Computing Linux on Large Systems my sf.net software map foundries about sf.net ... New User via SSL Search Software/Group People Freshmeat.net SF.net Resources Site Docs Site Status Site Map Compile Farm ... Contact SF.net Support Most Active Gaim Compiere ERP + CRM Business Solution Tiki Hibernate ... More Activity Top Downloads eMule jEdit Plugin Central JBoss.org BitTorrent ... More Statistics Sponsored Content Project: Cilk: Summary Summary Admin Home Page Tracker ... Files Parallel multithreaded programming language based on ANSI C. Easy to use, comes with a compiler and a runtime system. of Foundry Linux on Large Systems Foundry Development Status: 5 - Production/Stable Environment: Console (Text Based) Intended Audience: Developers Other Audience License: GNU General Public License (GPL) Operating System: POSIX Programming Language: C Topic: Software Development Symmetric Multi-processing Project UNIX name: cilk Registered: 2000-05-27 06:26 Activity Percentile (last week): 0% View project activity statistics View list of RSS feeds available for this project Developer Info Project Admins: bradleykuszmaul jng matley Developers: [View Members] Latest File Releases Package Version Date Notes / Monitor Download cilk December 25, 2002

52. Evaluation Of The Performance Of Multithreaded Cilk Runtime System On SMP Cluste the distributed cilk was evaluated using three problems, which were parallelizedwith different strategies to represent various parallel programming paradigms. http://www.computer.org/proceedings/iwcc/0343/03430043abs.htm

1st IEEE Computer Society International Workshop on Cluster Computing December 02 - 03, 1999 Melbourne, Australia p. 43 Evaluation of the Performance of Multithreaded Cilk Runtime System on SMP Clusters Liang Peng, Mingdong Feng, Chung-Kwong Yuen National University of Singapore ... cluster computing, multithreading, performance evaluation. The full text of iwcc is available to members of the IEEE Computer Society who have an online subscription and an web account

53. Performance Analysis Of A Multithreaded Pricing Algorithm On Cilk we develop a multithreaded algorithm for pricing simple options and implement iton a 8 node SMP machine using MIT’s supercomputer programming language cilk. http://www.computer.org/proceedings/hpcs/1626/16260251abs.htm

16th Annual International Symposium on High Performance Computing Systems and Applications June 16 - 19, 2002 Moncton, NB, Canada p. 251 Performance Analysis of a Multithreaded Pricing Algorithm on Cilk Ruppa K. Thulasiram, Parimala Thulasiraman, Chima Adiele, Dmitri Bondarenko ... In this paper, we develop a multithreaded algorithm for pricing simple options and implement it on a 8 node SMP machine using MIT’s supercomputer programming language Cilk. The algorithm dynamically creates lots of threads to exploit parallelism and relies on the Cilk runtime system to distribute the computation load. We present both analytical and experimental results and our results explain how Cilk could be used effectively to exploit parallelism in the given problem. The analytical results show that our algorithm has a very high average parallelism and hence Cilk is the target paradigm to implement the algorithm. We conclude from our implementation results that the size of the threads, the number of threads created, the load balancer, the cost of spawning a thread are parameters that must be considered while designing the algorithm on the Cilk platform. The full text of hpcs is available to members of the IEEE Computer Society who have an online subscription and an web account

54. Cilk FAQ - Section 1 cilk is a language for multithreaded parallel programming based on ANSI C. cilkis designed for generalpurpose parallel programming, but it is especially http://www.math.cmu.edu/Parallel_Cluster/cilk/FAQ/section1.html

Cilk FAQ - Section 1 Introduction and General Information Q1.1. What is Cilk? Q1.2. How do I obtain Cilk? Q1.3. Are there Cilk-related mailing lists? Q1.4. Is Cilk free software? ... Q1.8. What is Cilkchess? Question 1.1. What is Cilk? Cilk is a language for multithreaded parallel programming based on ANSI C. Cilk is designed for general-purpose parallel programming, but it is especially effective for exploiting dynamic, highly asynchronous parallelism, which can be difficult to write in data-parallel or message-passing style. Cilk has been developed since 1994 by the Supercomputing Technologies Group at the MIT Laboratory for Computer Science. Cilk has been used for research, teaching, and for coding applications such as a virus shell assembly simulator and three chess programs. Question 1.2. How do I obtain Cilk? Official versions of Cilk can be found at the Cilk web page . To access the latest development versions of Cilk, as well as mailing lists and discussion forums, look for Cilk at SourceForge (www.sourceforge.net)

55. ¿ÀǼҽº ÄÚ¸®¾Æ(OpenSource Korea) 6. cilk cilk is a language for multithreaded parallel programming based on ANSIC. It contains the cilk compiler, the cilk runtime system, and example http://www.opensource.co.kr/opensource/dir.php3?code=3302

56. Special Computer Science Colloquium Announcement cilk is a parallel programming language that allows programmers to write resourceobliviousparallel programs that nevertheless use resources predictably and http://www.cs.nyu.edu/csweb/Calendar/colloquium/fall96/091396.html

Coming Talk: September 13, 1996, 11:30AM Professor Charles Leiserson MIT Laboratory for Computer Science Cambridge, Massachusetts Title: Algorithmic Multithreaded Programming ABSTRACT: Cilk is a parallel programming language that allows programmers to write resource-oblivious parallel programs that nevertheless use resources predictably and efficiently. The Cilk language allows programmers to specify the interactions among computational threads in a high-level fashion, and then Cilk's runtime system maps the computation onto available physical resources dynamically in a provably efficient fashion. Specifically, the performance of a Cilk program is guaranteed to scale up linearly with the number of processors, as long as the application has sufficient parallelism. Moreover, a Cilk program can ``scale down'' to run on a single processor with nearly the same performance as ordinary serial C code, thereby removing a major barrier between parallel and serial programming. HOST: Chee Yap Back to: Colloquium Homepage

57. Lectures: 290i final modifier, programming assignment 2 due (Friday at 6 pm) programming assignment3 given Linda Piranha. 4, Potential projects discussed cilk-NOW Algorithmic http://www.cs.ucsb.edu/~cappello/290i/lectures/

Lectures Week Monday Wednesday Course Introduction RMI: Overview examples checklist Programming assignment 1 given RMI: Essentials RMI: HelloWorld improved RMI: Chat Overview code RMI: ComputeEngine code CX: paper presentation Programming assignment 1 due: 11:59 p.m Programming assignment 2 given Jicos: Overview Jicos: Application programming Jicos: system source Java tip: the final modifier Programming assignment 2 due (Friday at 6 p.m.) Programming assignment 3 given Linda - Piranha Programming assignment 2 solution Cilk Atlas Potential projects discussed Cilk-NOW Algorithmic aspects Piecework: Monte Carlo experiments SOR (Successive Over-relaxation) Programming assignment 3 due Globus anatomy Algorithmic aspects Minimax game tree searching Alpha-Beta pruning Advanced work Parallel alpha-beta Cilk Massively Parallel Chess The StarTech Massively Parallel Chess Program Jini: Overview (an extreme condensation of Core Jini, Ch. 3) General security issues Jini Read Core Jini, Ch. 2: Distributed Systems Jan Newmarch's Jini Tutorial: Ch. 12: Security In-class examination Group project meetings Jini: Deployment Scenarios Further reading: http://www.havi.org

58. Untitled on Principles and Practice of Parallel programming, July 1921, 1995, Santa Barbara,California, pp. 207-216 (PPOPP '95). http//theory.lcs.mit.edu/ cilk/. http://www.cs.ucsb.edu/~tyang/class/290I/plan/plan.html

Spring 1996, CMPSC-290I (240B) , 4 units, Code 47183 Parallel Computing and Program Parallelization Instructor: Prof. Tao Yang, Department of Computer Science (tyang@cs.ucsb.edu, office Eng I 2151, phone 4384.) Office hours: Monday 9-11:00. Location and time: MW 11:00-12:15, Engr. 1132. HTTP: //www.cs.ucsb.edu/ tyang/class/290I/ Topics: Introduction to parallel computing. Parallel programming on the Meiko CS-2 and networked workstations. Dependence analysis and program transformation. Memory hierarchies and data locality. Program and data partitioning. Applications (parallel numerical linear algebra such as dense and sparse matrix computations, WWW servers). Task scheduling, load balancing. Graph partitioning. Parallel programming tools, libraries and languages Course materials: 1) Selected papers on parallel computing and program parallelization will be available in the Alternative copy shop on campus under name CS290I-Yang (6556 Pardall Road, Isla Vista, Phone 968-1055). 2) On-line references: James Demmel, Numerical Linear Algebra on Parallel Processors, 1995. An on-line reference book on parallel scientific computing and applications. (http://www.cs.berkeley.edu/

59. DEVSEEK: Programming : Languages : Other Languages http//www.caslsoft.com/index.html (Added 19Jan-1999 ). cilk - A language for multithreadedparallel programming based on ANSI C. Designed for general-purpose http://www.devseek.com/Programming/Languages/Other_Languages/

: Programming : Languages : Other Languages Options HOME WHAT'S COOL TECH NEWS Links: CASL - CASL is a language for use on PDAs. It allows you to describe the program in terms of graphical elements bound together by your code. http://www.caslsoft.com/index.html (Added: 19-Jan-1999 ) Cilk - A language for multithreaded parallel programming based on ANSI C. Designed for general-purpose parallel programming, but it is especially effective for exploiting dynamic, highly asynchronous parallelism, which can be difficult to write in data-parallel or message-passing style. http://supertech.lcs.mit.edu/cilk/ (Added: 19-Jan-1999 ) CuPit-2 - a programming language specifically designed to express neural network learning algorithms http://wwwipd.ira.uka.de/~hopp/cupit.html (Added: 19-Jan-1999 ) Esterel - It is one of a family of synchronous languages which are particularly well-suited to programming reactive systems, including real-time systems and control automata http://www.inria.fr/meije/esterel/esterel-eng.html (Added: 19-Jan-1999 ) MCPL - a simple typeless language which is based on BCPL. It makes extensive use of pattern matching somewhat related to that used in ML and Prolog. Some other features come from C.

60. MIT LCS Timeline Decade Overview programming Systems, Replicating Garbage Collection. Supercomputing Technologies,*Socrates parallel chessplaying program. Supercomputing Technologies, cilk-NOW http://timeline.lcs.mit.edu/tldecade.adp?ll=1990&hh=2000

A  B  C  D  E  F  G  H  I  J  K  L  M  N  O  P  Q  R  S  T  U  V  W  X  Y  Z

Page 3     41-60 of 84    Back | 1  | 2  | 3  | 4  | 5  | Next 20