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

Help for COMP-FORTRAN-90 Archives


COMP-FORTRAN-90 Archives

COMP-FORTRAN-90 Archives


COMP-FORTRAN-90@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

COMP-FORTRAN-90 Home

COMP-FORTRAN-90 Home

COMP-FORTRAN-90  June 2010

COMP-FORTRAN-90 June 2010

Options

Subscribe or Unsubscribe

Subscribe or Unsubscribe

Log In

Log In

Get Password

Get Password

Subject:

Re: Memory management question

From:

Ted Stern <[log in to unmask]>

Reply-To:

Fortran 90 List <[log in to unmask]>

Date:

Thu, 24 Jun 2010 11:49:11 -0700

Content-Type:

text/plain

Parts/Attachments:

Parts/Attachments

text/plain (89 lines)

On 24 Jun 2010 11:40:59 -0700, Vivek Rao wrote:
>
> Hello.                                                                         
>                                                                                
> If x(:) is your big array, in Fortran 90+ you can define a pointers x1(:), x2  
> (:) etc. that refer to sections of it, for example                             
>                                                                                
> allocate (x(1000000)                                                           
> x1 => x(1:300000)                                                              
> x2 => x(300001:1000000)                                                        
>                                                                                
> Vivek Rao                                                                      

Naomi was specifically asking how to avoid slowdowns due to use of
pointers.

There should be compiler directives you can use to tell the compiler
that pointer memory is contiguous.  However this is vendor-dependent
and isn't portable.

Another possibility is the use of Cray Pointers, which are just
another way of emulating equivalence.  But support for those is
sketchy and is not portable.

In short, I would recommend simply using equivalence.  It may be
obsolescent but there are plenty of codes that still use it and
support for it will probably continue for a long while.

However, I would recommend reexamining those memory allocation
assumptions when the compiler is upgraded.  At a minimum, she should
make up a benchmark to test with different allocation scenarios and
encapsulate the implementation so it can be upgraded centrally.

Ted

>                                                                                
> --- On Thu, 6/24/10, Greenberg, Naomi <[log in to unmask]> wrote:          
>
>     From: Greenberg, Naomi <[log in to unmask]>                            
>     Subject: Memory management question                                        
>     To: [log in to unmask]                                         
>     Date: Thursday, June 24, 2010, 10:03 AM                                    
>
>     I???m currently working on a very large application where
>     efficiency is a big issue.  Frequent allocate/deallocates of
>     large arrays is very inefficient.  To speed up the code, I am
>     writing a memory manager which will effectively do a single
>     allocate of a huge block of memory at the beginning of the run,
>     and will then parcel out blocks of it when needed to arrays that
>     come in and out of ???memory???.  This will eliminate system
>     interrupts and paging.  I have a scheme to deal with free and
>     used tables that doesn???t use dynamically allocated pointers or
>     arrays.  My memory manager will effectively return an address
>     into the large block that the caller can use for its array
>     processing.  My problem is how to declare the array in the
>     calling program such that it???s ???allocatable??? and then
>     associate it with the address in the memory buffer that the
>     manager gives it.  I don???t want to declare it as a fixed size.
>     Equivalence is obsolescent.  How do I cleverly associate an
>     array with this memory address, similar to the way the compiler
>     does it?  Any ideas are welcome!
>
>     Naomi Greenberg                                                            
>                                                                                
>     Member of the Reseearch Staff                                              
>
>     RIverside Research Institute                                               
>                                                                                
>     156 William Street                                                         
>                                                                                
>     New York, N.Y. 10038                                                       
>
>     (212) 502-1718 (phone)                                                     
>                                                                                
>     (212) 502-1729 (fax)                                                       
>                                                                                
>     [log in to unmask]                                                     
>
>     __________ Information from ESET NOD32 Antivirus, version of virus         
>     signature database 5225 (20100624) __________                              
>                                                                                
>     The message was checked by ESET NOD32 Antivirus.                           
>                                                                                
>     http://www.eset.com                                                        
>

-- 
 Frango ut patefaciam -- I break so that I may reveal

Top of Message | Previous Page | Permalink

JiscMail Tools


RSS Feeds and Sharing


Advanced Options


Archives

December 2023
February 2023
November 2022
September 2022
February 2022
January 2022
June 2021
November 2020
September 2020
June 2020
May 2020
April 2020
December 2019
October 2019
September 2019
March 2019
February 2019
January 2019
November 2018
October 2018
September 2018
August 2018
July 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
January 2017
December 2016
November 2016
October 2016
September 2016
August 2016
July 2016
June 2016
May 2016
April 2016
March 2016
February 2016
December 2015
November 2015
October 2015
September 2015
August 2015
June 2015
April 2015
March 2015
January 2015
December 2014
November 2014
October 2014
August 2014
July 2014
May 2014
April 2014
March 2014
February 2014
January 2014
December 2013
November 2013
July 2013
June 2013
May 2013
April 2013
February 2013
January 2013
December 2012
November 2012
October 2012
September 2012
August 2012
July 2012
June 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
August 2010
July 2010
June 2010
March 2010
February 2010
January 2010
December 2009
October 2009
August 2009
July 2009
June 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
December 2007
November 2007
October 2007
September 2007
August 2007
July 2007
June 2007
May 2007
April 2007
March 2007
January 2007
2006
2005
2004
2003
2002
2001
2000
1999
1998
1997


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