Group items tagged

In mathematics, computer science, and related subjects, an 'algorithm' is an effective method for solving a problem expressed as a finite sequence of instructions. Algorithms are used for calculation, data processing, and many other fields. (In more advanced or abstract settings, the instructions do not necessarily constitute a finite sequence, or even a sequence; see, for example, "nondeterministic algorithm".) Each algorithm is a list of well-defined instructions for completing a task. Starting from an initial state, the instructions describe a computation that proceeds through a well-defined series of successive states, eventually terminating in a final ending state. The transition from one state to the next is not necessarily deterministic; some algorithms, known as randomized algorithms, incorporate randomness. [source = Bing Reference]

Complex computer models can involve thousands of variables. But paradoxically, adding more variables can sometimes make them easier to work with.

In Stack Machines, Expression Evaluation, and the Magic of Reverse Polish, I showed how expressions can be evaluated by rewriting them in reverse Polish and translating this into machine-code instructions for a stack machine. I demonstrated with a stack-machine interpreter that I'd written as part of a working model of a Pascal compiler. But as well as expressions, the compiler needs to compile assignments and jumps, so — in my progress towards explaining the compiler — I'm going to extend the machine code so it can handle these. I'll demonstrate by interpreting a program that calculates five factorial.

In short, Joe argues, "Throughout, it became abundantly clear that TM, much like generics, was a systemic and platform-wide technology shift. It didn’t require type theory, but the road ahead sure wasn’t going to be easy." The whole blog post deals with how many implementation challenges platform-wide support for STM would be in .NET, including what options were considered. He does not mention Maurice Herlihy's SXM library approach, but refers to Tim Harris's work several times.

The first textbook of its kind, Programming Massively Parallel Processors: A Hands-on Approach launches today, authored by Dr. David B. Kirk, NVIDIA Fellow and former chief scientist, and Dr. Wen-mei Hwu, who serves at the University of Illinois at Urbana-Champaign as Chair of Electrical and Computer Engineering in the Coordinated Science Laboratory, co-director of the Universal Parallel Computing Research Center and principal investigator of the CUDA Center of Excellence. The textbook, which is 256 pages, is the first aimed at teaching advanced students and professionals the basic concepts of parallel programming and GPU architectures. Published by Morgan Kaufmann, it explores various techniques for constructing parallel programs and reviews numerous case studies. With conventional CPU-based computing no longer scaling in performance and the world’s computational challenges increasing in complexity, the need for massively parallel processing has never been greater. GPUs have hundreds of cores capable of delivering transformative performance increases across a wide range of computational challenges. The rise of these multi-core architectures has raised the need to teach advanced programmers a new and essential skill: how to program massively parallel processors.

Andrew Phillips holds the title of Scientist with Microsoft Research Cambridge, and he's working on a method of programming that compiles into DNA. Part of this involves a visual programming language called Stochastic Pi Machine, or SPiM. This system models biological processes to help give researchers feedback on how organisms will react to modifications. The hope is that this can be used to help scientists program for large biological systems using modular components compiled to DNA. Yes, I’m in way over my head here, but I do my best to ask Andrew about the role this will play in medical treatment going forward, what it means to DNA computing, and the ability of back-engineering the genetic code we don’t use now

With the GA release of Scala 2.8 getting very close, David Pollak, the creator of the Scala-based web framework: Lift, has announced a Scala community initiative that  will have an equally large impact on Scala developers.  The Fresh Scala Initiative aims to address the issue of version fragility in the ecosystem.  You may have heard that Scala 2.8 is not binary compatible with the 2.7 branch.  Therefore, some community members have banded together to maintain a repository and provide nightly builds of popular Scala library collections to build against Scala 2.8.  

In this demo we showcase efforts in MSR to collaborate with external researchers to explore the application of new technologies, specifically Dryad and DryadLINQ, to big data research problems in science. We also highlight our efforts to provide software and services to academics across the world, through the release of Dryad and DryadLINQ free of charge to the research community, along with associated programming guides, user documentation, and code libraries. Dryad is a general-purpose distributed computing engine, more flexible than MapReduce or Hadoop!, that was designed to simplify the task of implementing distributed applications on clusters of Windows computers. DryadLINQ is an abstraction layer which simplifies the process of implementing Dryad-based applications. Microsoft Research is acutely aware of the ubiquity of big data and the challenges this presents. We are offering researchers the tools, resources and collaboration to explore this new area.

Scala is a general purpose programming language principally targeting the Java Virtual Machine. Designed to express common programming patterns in a concise, elegant, and type-safe way, it fuses both imperative and functional programming styles. Its key features are: statically typed; advanced type-system with type inference; function types; pattern-matching; implicit parameters and conversions; operator overloading; full interop with Java

cala is a general purpose programming language principally targeting the Java Virtual Machine. Designed to express common programming patterns in a concise, elegant, and type-safe way, it fuses both imperative and functional programming styles. Its key features are: statically typed; advanced type-system with type inference; function types; pattern-matching; implicit parameters and conversions; operator overloading; full interop with Java

F# is ideal for data-rich, concurrent and algorithmic development: "simple code to solve complex problems". F# is a simple and pragmatic programming language combining functional, object-oriented and scripting programming, and supports cross-platform environments including PC, Mac, and Linux. We'll provide the tutorials, resources and tools you’ll need to begin working with F# right away.