11

While I'm not aware of research on productivity, there's been research on comprehension. Philip Wadler has been collecting links to papers on this topic: see this post and this one.


11

As a graduate student in computer science, who has exposure to research in fields other than computer science, and whose research group works in an area of computer science where statistics can be fruitfully applied, I can offer my experience; your mileage may vary. In general, even the most well-meaning scientific research can fail to rigorously apply ...


10

The graphs you want are printed in the book “CMOS VLSI Design” Weste/Harris (2005), on page 5 of the freely available introduction.


8

Bob Warfield wrote a blog post (A Picture of the MultiCore Crisis) that has the kind of graph you're looking for. Update It sounds like the Stanford CPU DB has what you're looking for. You can browse visualizations and download the raw data.


8

Specifically on productivity, Hanenberg has investigated the impact in development time when the same task was implemented in Java (static) vs Groovy (dynamic). Their results were described in the following paper: Static vs. dynamic type systems: an empirical study about the relationship between type casts and development time, 2011. There's also been ...


6

Like Häagen-Dazs ice-cream, Object Orientation comes in many flavor, though with more nuts and bananas. Hence it is hazardous to answer your question stated in very general terms. Specific OO languages could have unexpected features that might raise problems with virtual methods. I fear that trying to imagine what kind of features could make things go wrong ...


5

"Is there any scientific research or paper that suggests a certain number of evaluators for such a rather theoretical approach?" There is a statistical method to calculate the correct sample size for an experiment. This method is called a "power analysis" [1]. It calculates the minimum sample size needed to verify that an experiment's results are ...


5

Ad Question 1: Assuming that your assumptions on how the catalogue is used -- that is the choice of the next cell only depends on the current (or constantly many preceeding) cell(s), not the (full) history -- then yes, you can use a Markov Chain to model it. However, you do not seem to need the "Hidden" part; this is only useful if you have (probabilistic) ...


4

See Sutter, The Free Lunch is Over (2005): it has graphs, discusses how various processor characteristics relate to performance of actual programs, and makes some predictions that turned out true, as far as I can tell.


4

In the past I worked on usability of interfaces in the information retrieval area, so I give you some practical ideas on how to measure the usability. You didn't give details of what a "catalogue" is, so I will assume that a user has a problem (or need) and he is searching your catalogue (in paper or electronic format) for one or more solutions. Then you ...


4

There was a presentation on ICSE 2011, at the New Ideas and Emerging Results track, entitled "How do programmers ask and answer questions on the web?". They only had initial results, but they sounded very interesting and promising. Maybe you could contact the authors if you need more info (they're from the Dept. of Comput. Science, University of Victoria, ...


3

Two well-known books in this research area are: Jeffrey D. Ullman, Computational Aspects of VLSI, Computer Science Press, 1984 and F. Tom Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes, Morgan Kaufmann, 1991. The connection between space and time complexity is due to the finite speed of communicating across ...


3

The conference paper "StackOverflow and GitHub: associations between software development and crowdsourced knowledge" looked at the correlation between activity on StackOverflow and GitHub for users who have accounts on both. From the abstract: In this paper we investigate the interplay between StackOverflow activities and the development process, ...


3

Well, there is a lot of bibliography on whether one algorithm is better than the other. In particular, the main insight is: "in the presence of duplicates (e.g. grids), A$^*$ should be preferred, whereas in other cases IDA$^*$ should be in general preferred". For example, heuristic planners usually prefer best-first search strategies such as A$^*$ instead of ...


3

The 5th edition of Computer Architecture, A Quantitative Approach has several related graphs. The clock rate graphs is divided in 3 parts, from a 5MHz Vax in 78 to a Sun SPARC at 16 MHz in 86 (15% per year), to an Intel Pentium 4 Xeon in 2003 at 3200 MHz(40% per year) to an Intel Nehalem Xeon in 2010 at 3330 MHz (1% per year). The performance graph is also ...


2

Software engineering includes many features. Two of them are human factor and quality measure. Let’s say I want to do productivity analysis. The data collection would be hard comparing to algorithm analysis because the data is about human productivity. Also the objective measure of quality is not easy to achieve. 10 lines of code per day for an avionics ...


1

You can use the program ministat to get statistical information about runtime differences. This blog post gives an example for the usage. But in general, comparing runtimes is difficult and very machine dependent. Ideally you would find another performance measure that doesn't change so much between processors. You should also take care that your input ...


1

Statistics is hard, and often counter-intuitive. Besides, the urge to "do one more experiment" to see if there is an effect (and stop when it shows up) is strong, specially if the experiments are costly (time, work, not just money). Also remember that publishing a paper on how the carefully set up, long and costly experiment shows no statistically ...


Only top voted, non community-wiki answers of a minimum length are eligible