Optimising data layout for delay-line memory

Access Full Text

Optimising data layout for delay-line memory

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

All-optical programmable logic must use recirculating delay lines for storage. Two approaches to minimising the latency inherent in delay-line-based systems by treating the layout of code and data in memory as an integer linear programming (ILP) problem are presented. It is shown that, although this approach can generate optimal code for small routines, it will not scale enough to compile useful programs.

Inspec keywords: optical logic; logic programming; optical storage; optical delay lines; program compilers; integer programming; linear programming; programmable logic devices

Other keywords: ILP; all-optical programmable logic; data layout optimisation; recirculating delay lines; delay-line memory; optical logic gates; integer programming; integer linear programming

Subjects: Optical storage; Optical logic elements; Logic programming; Compilers, interpreters and other processors; Optical storage and retrieval; Optical logic devices and optical computing techniques

References

    1. 1)
      • D.E. Knuth . Minimizing drum latency time. J. ACM , 2 , 119 - 150
    2. 2)
      • D. Wedelin . An algorithm for large scale 0–1 integer programming with application to airline crew scheduling. Ann. Oper. Res. , 283 - 301
    3. 3)
      • Stoutchinin, A.: `An integer linear programming model of software pipelining for the MIPS R8000 processor', Proc. 4th PaCT, volume 1277 of LNCS, September 1997, Springer-Verlag, p. 121–135.
    4. 4)
      • B. Gordon . An optimizing program for the IBM 650. J. ACM , 1 , 3 - 5
    5. 5)
      • P. Wadler , M. Broy , C.B. Jones . (1990) Linear types can change the world!, Programming concepts and methods.
    6. 6)
    7. 7)
      • F. Yates , S. Lipton . An automatic programming routine for the Elliott 401. J. ACM , 2 , 151 - 156
http://iet.metastore.ingenta.com/content/journals/10.1049/el_20057462
Loading

Related content

content/journals/10.1049/el_20057462
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading